Loading...
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * linux/mm/memory.c
4 *
5 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
6 */
7
8/*
9 * demand-loading started 01.12.91 - seems it is high on the list of
10 * things wanted, and it should be easy to implement. - Linus
11 */
12
13/*
14 * Ok, demand-loading was easy, shared pages a little bit tricker. Shared
15 * pages started 02.12.91, seems to work. - Linus.
16 *
17 * Tested sharing by executing about 30 /bin/sh: under the old kernel it
18 * would have taken more than the 6M I have free, but it worked well as
19 * far as I could see.
20 *
21 * Also corrected some "invalidate()"s - I wasn't doing enough of them.
22 */
23
24/*
25 * Real VM (paging to/from disk) started 18.12.91. Much more work and
26 * thought has to go into this. Oh, well..
27 * 19.12.91 - works, somewhat. Sometimes I get faults, don't know why.
28 * Found it. Everything seems to work now.
29 * 20.12.91 - Ok, making the swap-device changeable like the root.
30 */
31
32/*
33 * 05.04.94 - Multi-page memory management added for v1.1.
34 * Idea by Alex Bligh (alex@cconcepts.co.uk)
35 *
36 * 16.07.99 - Support of BIGMEM added by Gerhard Wichert, Siemens AG
37 * (Gerhard.Wichert@pdb.siemens.de)
38 *
39 * Aug/Sep 2004 Changed to four level page tables (Andi Kleen)
40 */
41
42#include <linux/kernel_stat.h>
43#include <linux/mm.h>
44#include <linux/sched/mm.h>
45#include <linux/sched/coredump.h>
46#include <linux/sched/numa_balancing.h>
47#include <linux/sched/task.h>
48#include <linux/hugetlb.h>
49#include <linux/mman.h>
50#include <linux/swap.h>
51#include <linux/highmem.h>
52#include <linux/pagemap.h>
53#include <linux/memremap.h>
54#include <linux/ksm.h>
55#include <linux/rmap.h>
56#include <linux/export.h>
57#include <linux/delayacct.h>
58#include <linux/init.h>
59#include <linux/pfn_t.h>
60#include <linux/writeback.h>
61#include <linux/memcontrol.h>
62#include <linux/mmu_notifier.h>
63#include <linux/swapops.h>
64#include <linux/elf.h>
65#include <linux/gfp.h>
66#include <linux/migrate.h>
67#include <linux/string.h>
68#include <linux/dma-debug.h>
69#include <linux/debugfs.h>
70#include <linux/userfaultfd_k.h>
71#include <linux/dax.h>
72#include <linux/oom.h>
73#include <linux/numa.h>
74#include <linux/perf_event.h>
75#include <linux/ptrace.h>
76#include <linux/vmalloc.h>
77
78#include <trace/events/kmem.h>
79
80#include <asm/io.h>
81#include <asm/mmu_context.h>
82#include <asm/pgalloc.h>
83#include <linux/uaccess.h>
84#include <asm/tlb.h>
85#include <asm/tlbflush.h>
86
87#include "pgalloc-track.h"
88#include "internal.h"
89
90#if defined(LAST_CPUPID_NOT_IN_PAGE_FLAGS) && !defined(CONFIG_COMPILE_TEST)
91#warning Unfortunate NUMA and NUMA Balancing config, growing page-frame for last_cpupid.
92#endif
93
94#ifndef CONFIG_NEED_MULTIPLE_NODES
95/* use the per-pgdat data instead for discontigmem - mbligh */
96unsigned long max_mapnr;
97EXPORT_SYMBOL(max_mapnr);
98
99struct page *mem_map;
100EXPORT_SYMBOL(mem_map);
101#endif
102
103/*
104 * A number of key systems in x86 including ioremap() rely on the assumption
105 * that high_memory defines the upper bound on direct map memory, then end
106 * of ZONE_NORMAL. Under CONFIG_DISCONTIG this means that max_low_pfn and
107 * highstart_pfn must be the same; there must be no gap between ZONE_NORMAL
108 * and ZONE_HIGHMEM.
109 */
110void *high_memory;
111EXPORT_SYMBOL(high_memory);
112
113/*
114 * Randomize the address space (stacks, mmaps, brk, etc.).
115 *
116 * ( When CONFIG_COMPAT_BRK=y we exclude brk from randomization,
117 * as ancient (libc5 based) binaries can segfault. )
118 */
119int randomize_va_space __read_mostly =
120#ifdef CONFIG_COMPAT_BRK
121 1;
122#else
123 2;
124#endif
125
126#ifndef arch_faults_on_old_pte
127static inline bool arch_faults_on_old_pte(void)
128{
129 /*
130 * Those arches which don't have hw access flag feature need to
131 * implement their own helper. By default, "true" means pagefault
132 * will be hit on old pte.
133 */
134 return true;
135}
136#endif
137
138static int __init disable_randmaps(char *s)
139{
140 randomize_va_space = 0;
141 return 1;
142}
143__setup("norandmaps", disable_randmaps);
144
145unsigned long zero_pfn __read_mostly;
146EXPORT_SYMBOL(zero_pfn);
147
148unsigned long highest_memmap_pfn __read_mostly;
149
150/*
151 * CONFIG_MMU architectures set up ZERO_PAGE in their paging_init()
152 */
153static int __init init_zero_pfn(void)
154{
155 zero_pfn = page_to_pfn(ZERO_PAGE(0));
156 return 0;
157}
158core_initcall(init_zero_pfn);
159
160void mm_trace_rss_stat(struct mm_struct *mm, int member, long count)
161{
162 trace_rss_stat(mm, member, count);
163}
164
165#if defined(SPLIT_RSS_COUNTING)
166
167void sync_mm_rss(struct mm_struct *mm)
168{
169 int i;
170
171 for (i = 0; i < NR_MM_COUNTERS; i++) {
172 if (current->rss_stat.count[i]) {
173 add_mm_counter(mm, i, current->rss_stat.count[i]);
174 current->rss_stat.count[i] = 0;
175 }
176 }
177 current->rss_stat.events = 0;
178}
179
180static void add_mm_counter_fast(struct mm_struct *mm, int member, int val)
181{
182 struct task_struct *task = current;
183
184 if (likely(task->mm == mm))
185 task->rss_stat.count[member] += val;
186 else
187 add_mm_counter(mm, member, val);
188}
189#define inc_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, 1)
190#define dec_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, -1)
191
192/* sync counter once per 64 page faults */
193#define TASK_RSS_EVENTS_THRESH (64)
194static void check_sync_rss_stat(struct task_struct *task)
195{
196 if (unlikely(task != current))
197 return;
198 if (unlikely(task->rss_stat.events++ > TASK_RSS_EVENTS_THRESH))
199 sync_mm_rss(task->mm);
200}
201#else /* SPLIT_RSS_COUNTING */
202
203#define inc_mm_counter_fast(mm, member) inc_mm_counter(mm, member)
204#define dec_mm_counter_fast(mm, member) dec_mm_counter(mm, member)
205
206static void check_sync_rss_stat(struct task_struct *task)
207{
208}
209
210#endif /* SPLIT_RSS_COUNTING */
211
212/*
213 * Note: this doesn't free the actual pages themselves. That
214 * has been handled earlier when unmapping all the memory regions.
215 */
216static void free_pte_range(struct mmu_gather *tlb, pmd_t *pmd,
217 unsigned long addr)
218{
219 pgtable_t token = pmd_pgtable(*pmd);
220 pmd_clear(pmd);
221 pte_free_tlb(tlb, token, addr);
222 mm_dec_nr_ptes(tlb->mm);
223}
224
225static inline void free_pmd_range(struct mmu_gather *tlb, pud_t *pud,
226 unsigned long addr, unsigned long end,
227 unsigned long floor, unsigned long ceiling)
228{
229 pmd_t *pmd;
230 unsigned long next;
231 unsigned long start;
232
233 start = addr;
234 pmd = pmd_offset(pud, addr);
235 do {
236 next = pmd_addr_end(addr, end);
237 if (pmd_none_or_clear_bad(pmd))
238 continue;
239 free_pte_range(tlb, pmd, addr);
240 } while (pmd++, addr = next, addr != end);
241
242 start &= PUD_MASK;
243 if (start < floor)
244 return;
245 if (ceiling) {
246 ceiling &= PUD_MASK;
247 if (!ceiling)
248 return;
249 }
250 if (end - 1 > ceiling - 1)
251 return;
252
253 pmd = pmd_offset(pud, start);
254 pud_clear(pud);
255 pmd_free_tlb(tlb, pmd, start);
256 mm_dec_nr_pmds(tlb->mm);
257}
258
259static inline void free_pud_range(struct mmu_gather *tlb, p4d_t *p4d,
260 unsigned long addr, unsigned long end,
261 unsigned long floor, unsigned long ceiling)
262{
263 pud_t *pud;
264 unsigned long next;
265 unsigned long start;
266
267 start = addr;
268 pud = pud_offset(p4d, addr);
269 do {
270 next = pud_addr_end(addr, end);
271 if (pud_none_or_clear_bad(pud))
272 continue;
273 free_pmd_range(tlb, pud, addr, next, floor, ceiling);
274 } while (pud++, addr = next, addr != end);
275
276 start &= P4D_MASK;
277 if (start < floor)
278 return;
279 if (ceiling) {
280 ceiling &= P4D_MASK;
281 if (!ceiling)
282 return;
283 }
284 if (end - 1 > ceiling - 1)
285 return;
286
287 pud = pud_offset(p4d, start);
288 p4d_clear(p4d);
289 pud_free_tlb(tlb, pud, start);
290 mm_dec_nr_puds(tlb->mm);
291}
292
293static inline void free_p4d_range(struct mmu_gather *tlb, pgd_t *pgd,
294 unsigned long addr, unsigned long end,
295 unsigned long floor, unsigned long ceiling)
296{
297 p4d_t *p4d;
298 unsigned long next;
299 unsigned long start;
300
301 start = addr;
302 p4d = p4d_offset(pgd, addr);
303 do {
304 next = p4d_addr_end(addr, end);
305 if (p4d_none_or_clear_bad(p4d))
306 continue;
307 free_pud_range(tlb, p4d, addr, next, floor, ceiling);
308 } while (p4d++, addr = next, addr != end);
309
310 start &= PGDIR_MASK;
311 if (start < floor)
312 return;
313 if (ceiling) {
314 ceiling &= PGDIR_MASK;
315 if (!ceiling)
316 return;
317 }
318 if (end - 1 > ceiling - 1)
319 return;
320
321 p4d = p4d_offset(pgd, start);
322 pgd_clear(pgd);
323 p4d_free_tlb(tlb, p4d, start);
324}
325
326/*
327 * This function frees user-level page tables of a process.
328 */
329void free_pgd_range(struct mmu_gather *tlb,
330 unsigned long addr, unsigned long end,
331 unsigned long floor, unsigned long ceiling)
332{
333 pgd_t *pgd;
334 unsigned long next;
335
336 /*
337 * The next few lines have given us lots of grief...
338 *
339 * Why are we testing PMD* at this top level? Because often
340 * there will be no work to do at all, and we'd prefer not to
341 * go all the way down to the bottom just to discover that.
342 *
343 * Why all these "- 1"s? Because 0 represents both the bottom
344 * of the address space and the top of it (using -1 for the
345 * top wouldn't help much: the masks would do the wrong thing).
346 * The rule is that addr 0 and floor 0 refer to the bottom of
347 * the address space, but end 0 and ceiling 0 refer to the top
348 * Comparisons need to use "end - 1" and "ceiling - 1" (though
349 * that end 0 case should be mythical).
350 *
351 * Wherever addr is brought up or ceiling brought down, we must
352 * be careful to reject "the opposite 0" before it confuses the
353 * subsequent tests. But what about where end is brought down
354 * by PMD_SIZE below? no, end can't go down to 0 there.
355 *
356 * Whereas we round start (addr) and ceiling down, by different
357 * masks at different levels, in order to test whether a table
358 * now has no other vmas using it, so can be freed, we don't
359 * bother to round floor or end up - the tests don't need that.
360 */
361
362 addr &= PMD_MASK;
363 if (addr < floor) {
364 addr += PMD_SIZE;
365 if (!addr)
366 return;
367 }
368 if (ceiling) {
369 ceiling &= PMD_MASK;
370 if (!ceiling)
371 return;
372 }
373 if (end - 1 > ceiling - 1)
374 end -= PMD_SIZE;
375 if (addr > end - 1)
376 return;
377 /*
378 * We add page table cache pages with PAGE_SIZE,
379 * (see pte_free_tlb()), flush the tlb if we need
380 */
381 tlb_change_page_size(tlb, PAGE_SIZE);
382 pgd = pgd_offset(tlb->mm, addr);
383 do {
384 next = pgd_addr_end(addr, end);
385 if (pgd_none_or_clear_bad(pgd))
386 continue;
387 free_p4d_range(tlb, pgd, addr, next, floor, ceiling);
388 } while (pgd++, addr = next, addr != end);
389}
390
391void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *vma,
392 unsigned long floor, unsigned long ceiling)
393{
394 while (vma) {
395 struct vm_area_struct *next = vma->vm_next;
396 unsigned long addr = vma->vm_start;
397
398 /*
399 * Hide vma from rmap and truncate_pagecache before freeing
400 * pgtables
401 */
402 unlink_anon_vmas(vma);
403 unlink_file_vma(vma);
404
405 if (is_vm_hugetlb_page(vma)) {
406 hugetlb_free_pgd_range(tlb, addr, vma->vm_end,
407 floor, next ? next->vm_start : ceiling);
408 } else {
409 /*
410 * Optimization: gather nearby vmas into one call down
411 */
412 while (next && next->vm_start <= vma->vm_end + PMD_SIZE
413 && !is_vm_hugetlb_page(next)) {
414 vma = next;
415 next = vma->vm_next;
416 unlink_anon_vmas(vma);
417 unlink_file_vma(vma);
418 }
419 free_pgd_range(tlb, addr, vma->vm_end,
420 floor, next ? next->vm_start : ceiling);
421 }
422 vma = next;
423 }
424}
425
426int __pte_alloc(struct mm_struct *mm, pmd_t *pmd)
427{
428 spinlock_t *ptl;
429 pgtable_t new = pte_alloc_one(mm);
430 if (!new)
431 return -ENOMEM;
432
433 /*
434 * Ensure all pte setup (eg. pte page lock and page clearing) are
435 * visible before the pte is made visible to other CPUs by being
436 * put into page tables.
437 *
438 * The other side of the story is the pointer chasing in the page
439 * table walking code (when walking the page table without locking;
440 * ie. most of the time). Fortunately, these data accesses consist
441 * of a chain of data-dependent loads, meaning most CPUs (alpha
442 * being the notable exception) will already guarantee loads are
443 * seen in-order. See the alpha page table accessors for the
444 * smp_rmb() barriers in page table walking code.
445 */
446 smp_wmb(); /* Could be smp_wmb__xxx(before|after)_spin_lock */
447
448 ptl = pmd_lock(mm, pmd);
449 if (likely(pmd_none(*pmd))) { /* Has another populated it ? */
450 mm_inc_nr_ptes(mm);
451 pmd_populate(mm, pmd, new);
452 new = NULL;
453 }
454 spin_unlock(ptl);
455 if (new)
456 pte_free(mm, new);
457 return 0;
458}
459
460int __pte_alloc_kernel(pmd_t *pmd)
461{
462 pte_t *new = pte_alloc_one_kernel(&init_mm);
463 if (!new)
464 return -ENOMEM;
465
466 smp_wmb(); /* See comment in __pte_alloc */
467
468 spin_lock(&init_mm.page_table_lock);
469 if (likely(pmd_none(*pmd))) { /* Has another populated it ? */
470 pmd_populate_kernel(&init_mm, pmd, new);
471 new = NULL;
472 }
473 spin_unlock(&init_mm.page_table_lock);
474 if (new)
475 pte_free_kernel(&init_mm, new);
476 return 0;
477}
478
479static inline void init_rss_vec(int *rss)
480{
481 memset(rss, 0, sizeof(int) * NR_MM_COUNTERS);
482}
483
484static inline void add_mm_rss_vec(struct mm_struct *mm, int *rss)
485{
486 int i;
487
488 if (current->mm == mm)
489 sync_mm_rss(mm);
490 for (i = 0; i < NR_MM_COUNTERS; i++)
491 if (rss[i])
492 add_mm_counter(mm, i, rss[i]);
493}
494
495/*
496 * This function is called to print an error when a bad pte
497 * is found. For example, we might have a PFN-mapped pte in
498 * a region that doesn't allow it.
499 *
500 * The calling function must still handle the error.
501 */
502static void print_bad_pte(struct vm_area_struct *vma, unsigned long addr,
503 pte_t pte, struct page *page)
504{
505 pgd_t *pgd = pgd_offset(vma->vm_mm, addr);
506 p4d_t *p4d = p4d_offset(pgd, addr);
507 pud_t *pud = pud_offset(p4d, addr);
508 pmd_t *pmd = pmd_offset(pud, addr);
509 struct address_space *mapping;
510 pgoff_t index;
511 static unsigned long resume;
512 static unsigned long nr_shown;
513 static unsigned long nr_unshown;
514
515 /*
516 * Allow a burst of 60 reports, then keep quiet for that minute;
517 * or allow a steady drip of one report per second.
518 */
519 if (nr_shown == 60) {
520 if (time_before(jiffies, resume)) {
521 nr_unshown++;
522 return;
523 }
524 if (nr_unshown) {
525 pr_alert("BUG: Bad page map: %lu messages suppressed\n",
526 nr_unshown);
527 nr_unshown = 0;
528 }
529 nr_shown = 0;
530 }
531 if (nr_shown++ == 0)
532 resume = jiffies + 60 * HZ;
533
534 mapping = vma->vm_file ? vma->vm_file->f_mapping : NULL;
535 index = linear_page_index(vma, addr);
536
537 pr_alert("BUG: Bad page map in process %s pte:%08llx pmd:%08llx\n",
538 current->comm,
539 (long long)pte_val(pte), (long long)pmd_val(*pmd));
540 if (page)
541 dump_page(page, "bad pte");
542 pr_alert("addr:%px vm_flags:%08lx anon_vma:%px mapping:%px index:%lx\n",
543 (void *)addr, vma->vm_flags, vma->anon_vma, mapping, index);
544 pr_alert("file:%pD fault:%ps mmap:%ps readpage:%ps\n",
545 vma->vm_file,
546 vma->vm_ops ? vma->vm_ops->fault : NULL,
547 vma->vm_file ? vma->vm_file->f_op->mmap : NULL,
548 mapping ? mapping->a_ops->readpage : NULL);
549 dump_stack();
550 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
551}
552
553/*
554 * vm_normal_page -- This function gets the "struct page" associated with a pte.
555 *
556 * "Special" mappings do not wish to be associated with a "struct page" (either
557 * it doesn't exist, or it exists but they don't want to touch it). In this
558 * case, NULL is returned here. "Normal" mappings do have a struct page.
559 *
560 * There are 2 broad cases. Firstly, an architecture may define a pte_special()
561 * pte bit, in which case this function is trivial. Secondly, an architecture
562 * may not have a spare pte bit, which requires a more complicated scheme,
563 * described below.
564 *
565 * A raw VM_PFNMAP mapping (ie. one that is not COWed) is always considered a
566 * special mapping (even if there are underlying and valid "struct pages").
567 * COWed pages of a VM_PFNMAP are always normal.
568 *
569 * The way we recognize COWed pages within VM_PFNMAP mappings is through the
570 * rules set up by "remap_pfn_range()": the vma will have the VM_PFNMAP bit
571 * set, and the vm_pgoff will point to the first PFN mapped: thus every special
572 * mapping will always honor the rule
573 *
574 * pfn_of_page == vma->vm_pgoff + ((addr - vma->vm_start) >> PAGE_SHIFT)
575 *
576 * And for normal mappings this is false.
577 *
578 * This restricts such mappings to be a linear translation from virtual address
579 * to pfn. To get around this restriction, we allow arbitrary mappings so long
580 * as the vma is not a COW mapping; in that case, we know that all ptes are
581 * special (because none can have been COWed).
582 *
583 *
584 * In order to support COW of arbitrary special mappings, we have VM_MIXEDMAP.
585 *
586 * VM_MIXEDMAP mappings can likewise contain memory with or without "struct
587 * page" backing, however the difference is that _all_ pages with a struct
588 * page (that is, those where pfn_valid is true) are refcounted and considered
589 * normal pages by the VM. The disadvantage is that pages are refcounted
590 * (which can be slower and simply not an option for some PFNMAP users). The
591 * advantage is that we don't have to follow the strict linearity rule of
592 * PFNMAP mappings in order to support COWable mappings.
593 *
594 */
595struct page *vm_normal_page(struct vm_area_struct *vma, unsigned long addr,
596 pte_t pte)
597{
598 unsigned long pfn = pte_pfn(pte);
599
600 if (IS_ENABLED(CONFIG_ARCH_HAS_PTE_SPECIAL)) {
601 if (likely(!pte_special(pte)))
602 goto check_pfn;
603 if (vma->vm_ops && vma->vm_ops->find_special_page)
604 return vma->vm_ops->find_special_page(vma, addr);
605 if (vma->vm_flags & (VM_PFNMAP | VM_MIXEDMAP))
606 return NULL;
607 if (is_zero_pfn(pfn))
608 return NULL;
609 if (pte_devmap(pte))
610 return NULL;
611
612 print_bad_pte(vma, addr, pte, NULL);
613 return NULL;
614 }
615
616 /* !CONFIG_ARCH_HAS_PTE_SPECIAL case follows: */
617
618 if (unlikely(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))) {
619 if (vma->vm_flags & VM_MIXEDMAP) {
620 if (!pfn_valid(pfn))
621 return NULL;
622 goto out;
623 } else {
624 unsigned long off;
625 off = (addr - vma->vm_start) >> PAGE_SHIFT;
626 if (pfn == vma->vm_pgoff + off)
627 return NULL;
628 if (!is_cow_mapping(vma->vm_flags))
629 return NULL;
630 }
631 }
632
633 if (is_zero_pfn(pfn))
634 return NULL;
635
636check_pfn:
637 if (unlikely(pfn > highest_memmap_pfn)) {
638 print_bad_pte(vma, addr, pte, NULL);
639 return NULL;
640 }
641
642 /*
643 * NOTE! We still have PageReserved() pages in the page tables.
644 * eg. VDSO mappings can cause them to exist.
645 */
646out:
647 return pfn_to_page(pfn);
648}
649
650#ifdef CONFIG_TRANSPARENT_HUGEPAGE
651struct page *vm_normal_page_pmd(struct vm_area_struct *vma, unsigned long addr,
652 pmd_t pmd)
653{
654 unsigned long pfn = pmd_pfn(pmd);
655
656 /*
657 * There is no pmd_special() but there may be special pmds, e.g.
658 * in a direct-access (dax) mapping, so let's just replicate the
659 * !CONFIG_ARCH_HAS_PTE_SPECIAL case from vm_normal_page() here.
660 */
661 if (unlikely(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))) {
662 if (vma->vm_flags & VM_MIXEDMAP) {
663 if (!pfn_valid(pfn))
664 return NULL;
665 goto out;
666 } else {
667 unsigned long off;
668 off = (addr - vma->vm_start) >> PAGE_SHIFT;
669 if (pfn == vma->vm_pgoff + off)
670 return NULL;
671 if (!is_cow_mapping(vma->vm_flags))
672 return NULL;
673 }
674 }
675
676 if (pmd_devmap(pmd))
677 return NULL;
678 if (is_huge_zero_pmd(pmd))
679 return NULL;
680 if (unlikely(pfn > highest_memmap_pfn))
681 return NULL;
682
683 /*
684 * NOTE! We still have PageReserved() pages in the page tables.
685 * eg. VDSO mappings can cause them to exist.
686 */
687out:
688 return pfn_to_page(pfn);
689}
690#endif
691
692/*
693 * copy one vm_area from one task to the other. Assumes the page tables
694 * already present in the new task to be cleared in the whole range
695 * covered by this vma.
696 */
697
698static unsigned long
699copy_nonpresent_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm,
700 pte_t *dst_pte, pte_t *src_pte, struct vm_area_struct *vma,
701 unsigned long addr, int *rss)
702{
703 unsigned long vm_flags = vma->vm_flags;
704 pte_t pte = *src_pte;
705 struct page *page;
706 swp_entry_t entry = pte_to_swp_entry(pte);
707
708 if (likely(!non_swap_entry(entry))) {
709 if (swap_duplicate(entry) < 0)
710 return entry.val;
711
712 /* make sure dst_mm is on swapoff's mmlist. */
713 if (unlikely(list_empty(&dst_mm->mmlist))) {
714 spin_lock(&mmlist_lock);
715 if (list_empty(&dst_mm->mmlist))
716 list_add(&dst_mm->mmlist,
717 &src_mm->mmlist);
718 spin_unlock(&mmlist_lock);
719 }
720 rss[MM_SWAPENTS]++;
721 } else if (is_migration_entry(entry)) {
722 page = migration_entry_to_page(entry);
723
724 rss[mm_counter(page)]++;
725
726 if (is_write_migration_entry(entry) &&
727 is_cow_mapping(vm_flags)) {
728 /*
729 * COW mappings require pages in both
730 * parent and child to be set to read.
731 */
732 make_migration_entry_read(&entry);
733 pte = swp_entry_to_pte(entry);
734 if (pte_swp_soft_dirty(*src_pte))
735 pte = pte_swp_mksoft_dirty(pte);
736 if (pte_swp_uffd_wp(*src_pte))
737 pte = pte_swp_mkuffd_wp(pte);
738 set_pte_at(src_mm, addr, src_pte, pte);
739 }
740 } else if (is_device_private_entry(entry)) {
741 page = device_private_entry_to_page(entry);
742
743 /*
744 * Update rss count even for unaddressable pages, as
745 * they should treated just like normal pages in this
746 * respect.
747 *
748 * We will likely want to have some new rss counters
749 * for unaddressable pages, at some point. But for now
750 * keep things as they are.
751 */
752 get_page(page);
753 rss[mm_counter(page)]++;
754 page_dup_rmap(page, false);
755
756 /*
757 * We do not preserve soft-dirty information, because so
758 * far, checkpoint/restore is the only feature that
759 * requires that. And checkpoint/restore does not work
760 * when a device driver is involved (you cannot easily
761 * save and restore device driver state).
762 */
763 if (is_write_device_private_entry(entry) &&
764 is_cow_mapping(vm_flags)) {
765 make_device_private_entry_read(&entry);
766 pte = swp_entry_to_pte(entry);
767 if (pte_swp_uffd_wp(*src_pte))
768 pte = pte_swp_mkuffd_wp(pte);
769 set_pte_at(src_mm, addr, src_pte, pte);
770 }
771 }
772 set_pte_at(dst_mm, addr, dst_pte, pte);
773 return 0;
774}
775
776/*
777 * Copy a present and normal page if necessary.
778 *
779 * NOTE! The usual case is that this doesn't need to do
780 * anything, and can just return a positive value. That
781 * will let the caller know that it can just increase
782 * the page refcount and re-use the pte the traditional
783 * way.
784 *
785 * But _if_ we need to copy it because it needs to be
786 * pinned in the parent (and the child should get its own
787 * copy rather than just a reference to the same page),
788 * we'll do that here and return zero to let the caller
789 * know we're done.
790 *
791 * And if we need a pre-allocated page but don't yet have
792 * one, return a negative error to let the preallocation
793 * code know so that it can do so outside the page table
794 * lock.
795 */
796static inline int
797copy_present_page(struct mm_struct *dst_mm, struct mm_struct *src_mm,
798 pte_t *dst_pte, pte_t *src_pte,
799 struct vm_area_struct *vma, struct vm_area_struct *new,
800 unsigned long addr, int *rss, struct page **prealloc,
801 pte_t pte, struct page *page)
802{
803 struct page *new_page;
804
805 if (!is_cow_mapping(vma->vm_flags))
806 return 1;
807
808 /*
809 * What we want to do is to check whether this page may
810 * have been pinned by the parent process. If so,
811 * instead of wrprotect the pte on both sides, we copy
812 * the page immediately so that we'll always guarantee
813 * the pinned page won't be randomly replaced in the
814 * future.
815 *
816 * The page pinning checks are just "has this mm ever
817 * seen pinning", along with the (inexact) check of
818 * the page count. That might give false positives for
819 * for pinning, but it will work correctly.
820 */
821 if (likely(!atomic_read(&src_mm->has_pinned)))
822 return 1;
823 if (likely(!page_maybe_dma_pinned(page)))
824 return 1;
825
826 new_page = *prealloc;
827 if (!new_page)
828 return -EAGAIN;
829
830 /*
831 * We have a prealloc page, all good! Take it
832 * over and copy the page & arm it.
833 */
834 *prealloc = NULL;
835 copy_user_highpage(new_page, page, addr, vma);
836 __SetPageUptodate(new_page);
837 page_add_new_anon_rmap(new_page, new, addr, false);
838 lru_cache_add_inactive_or_unevictable(new_page, new);
839 rss[mm_counter(new_page)]++;
840
841 /* All done, just insert the new page copy in the child */
842 pte = mk_pte(new_page, new->vm_page_prot);
843 pte = maybe_mkwrite(pte_mkdirty(pte), new);
844 set_pte_at(dst_mm, addr, dst_pte, pte);
845 return 0;
846}
847
848/*
849 * Copy one pte. Returns 0 if succeeded, or -EAGAIN if one preallocated page
850 * is required to copy this pte.
851 */
852static inline int
853copy_present_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm,
854 pte_t *dst_pte, pte_t *src_pte, struct vm_area_struct *vma,
855 struct vm_area_struct *new,
856 unsigned long addr, int *rss, struct page **prealloc)
857{
858 unsigned long vm_flags = vma->vm_flags;
859 pte_t pte = *src_pte;
860 struct page *page;
861
862 page = vm_normal_page(vma, addr, pte);
863 if (page) {
864 int retval;
865
866 retval = copy_present_page(dst_mm, src_mm,
867 dst_pte, src_pte,
868 vma, new,
869 addr, rss, prealloc,
870 pte, page);
871 if (retval <= 0)
872 return retval;
873
874 get_page(page);
875 page_dup_rmap(page, false);
876 rss[mm_counter(page)]++;
877 }
878
879 /*
880 * If it's a COW mapping, write protect it both
881 * in the parent and the child
882 */
883 if (is_cow_mapping(vm_flags) && pte_write(pte)) {
884 ptep_set_wrprotect(src_mm, addr, src_pte);
885 pte = pte_wrprotect(pte);
886 }
887
888 /*
889 * If it's a shared mapping, mark it clean in
890 * the child
891 */
892 if (vm_flags & VM_SHARED)
893 pte = pte_mkclean(pte);
894 pte = pte_mkold(pte);
895
896 /*
897 * Make sure the _PAGE_UFFD_WP bit is cleared if the new VMA
898 * does not have the VM_UFFD_WP, which means that the uffd
899 * fork event is not enabled.
900 */
901 if (!(vm_flags & VM_UFFD_WP))
902 pte = pte_clear_uffd_wp(pte);
903
904 set_pte_at(dst_mm, addr, dst_pte, pte);
905 return 0;
906}
907
908static inline struct page *
909page_copy_prealloc(struct mm_struct *src_mm, struct vm_area_struct *vma,
910 unsigned long addr)
911{
912 struct page *new_page;
913
914 new_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, addr);
915 if (!new_page)
916 return NULL;
917
918 if (mem_cgroup_charge(new_page, src_mm, GFP_KERNEL)) {
919 put_page(new_page);
920 return NULL;
921 }
922 cgroup_throttle_swaprate(new_page, GFP_KERNEL);
923
924 return new_page;
925}
926
927static int copy_pte_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
928 pmd_t *dst_pmd, pmd_t *src_pmd, struct vm_area_struct *vma,
929 struct vm_area_struct *new,
930 unsigned long addr, unsigned long end)
931{
932 pte_t *orig_src_pte, *orig_dst_pte;
933 pte_t *src_pte, *dst_pte;
934 spinlock_t *src_ptl, *dst_ptl;
935 int progress, ret = 0;
936 int rss[NR_MM_COUNTERS];
937 swp_entry_t entry = (swp_entry_t){0};
938 struct page *prealloc = NULL;
939
940again:
941 progress = 0;
942 init_rss_vec(rss);
943
944 dst_pte = pte_alloc_map_lock(dst_mm, dst_pmd, addr, &dst_ptl);
945 if (!dst_pte) {
946 ret = -ENOMEM;
947 goto out;
948 }
949 src_pte = pte_offset_map(src_pmd, addr);
950 src_ptl = pte_lockptr(src_mm, src_pmd);
951 spin_lock_nested(src_ptl, SINGLE_DEPTH_NESTING);
952 orig_src_pte = src_pte;
953 orig_dst_pte = dst_pte;
954 arch_enter_lazy_mmu_mode();
955
956 do {
957 /*
958 * We are holding two locks at this point - either of them
959 * could generate latencies in another task on another CPU.
960 */
961 if (progress >= 32) {
962 progress = 0;
963 if (need_resched() ||
964 spin_needbreak(src_ptl) || spin_needbreak(dst_ptl))
965 break;
966 }
967 if (pte_none(*src_pte)) {
968 progress++;
969 continue;
970 }
971 if (unlikely(!pte_present(*src_pte))) {
972 entry.val = copy_nonpresent_pte(dst_mm, src_mm,
973 dst_pte, src_pte,
974 vma, addr, rss);
975 if (entry.val)
976 break;
977 progress += 8;
978 continue;
979 }
980 /* copy_present_pte() will clear `*prealloc' if consumed */
981 ret = copy_present_pte(dst_mm, src_mm, dst_pte, src_pte,
982 vma, new, addr, rss, &prealloc);
983 /*
984 * If we need a pre-allocated page for this pte, drop the
985 * locks, allocate, and try again.
986 */
987 if (unlikely(ret == -EAGAIN))
988 break;
989 if (unlikely(prealloc)) {
990 /*
991 * pre-alloc page cannot be reused by next time so as
992 * to strictly follow mempolicy (e.g., alloc_page_vma()
993 * will allocate page according to address). This
994 * could only happen if one pinned pte changed.
995 */
996 put_page(prealloc);
997 prealloc = NULL;
998 }
999 progress += 8;
1000 } while (dst_pte++, src_pte++, addr += PAGE_SIZE, addr != end);
1001
1002 arch_leave_lazy_mmu_mode();
1003 spin_unlock(src_ptl);
1004 pte_unmap(orig_src_pte);
1005 add_mm_rss_vec(dst_mm, rss);
1006 pte_unmap_unlock(orig_dst_pte, dst_ptl);
1007 cond_resched();
1008
1009 if (entry.val) {
1010 if (add_swap_count_continuation(entry, GFP_KERNEL) < 0) {
1011 ret = -ENOMEM;
1012 goto out;
1013 }
1014 entry.val = 0;
1015 } else if (ret) {
1016 WARN_ON_ONCE(ret != -EAGAIN);
1017 prealloc = page_copy_prealloc(src_mm, vma, addr);
1018 if (!prealloc)
1019 return -ENOMEM;
1020 /* We've captured and resolved the error. Reset, try again. */
1021 ret = 0;
1022 }
1023 if (addr != end)
1024 goto again;
1025out:
1026 if (unlikely(prealloc))
1027 put_page(prealloc);
1028 return ret;
1029}
1030
1031static inline int copy_pmd_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
1032 pud_t *dst_pud, pud_t *src_pud, struct vm_area_struct *vma,
1033 struct vm_area_struct *new,
1034 unsigned long addr, unsigned long end)
1035{
1036 pmd_t *src_pmd, *dst_pmd;
1037 unsigned long next;
1038
1039 dst_pmd = pmd_alloc(dst_mm, dst_pud, addr);
1040 if (!dst_pmd)
1041 return -ENOMEM;
1042 src_pmd = pmd_offset(src_pud, addr);
1043 do {
1044 next = pmd_addr_end(addr, end);
1045 if (is_swap_pmd(*src_pmd) || pmd_trans_huge(*src_pmd)
1046 || pmd_devmap(*src_pmd)) {
1047 int err;
1048 VM_BUG_ON_VMA(next-addr != HPAGE_PMD_SIZE, vma);
1049 err = copy_huge_pmd(dst_mm, src_mm,
1050 dst_pmd, src_pmd, addr, vma);
1051 if (err == -ENOMEM)
1052 return -ENOMEM;
1053 if (!err)
1054 continue;
1055 /* fall through */
1056 }
1057 if (pmd_none_or_clear_bad(src_pmd))
1058 continue;
1059 if (copy_pte_range(dst_mm, src_mm, dst_pmd, src_pmd,
1060 vma, new, addr, next))
1061 return -ENOMEM;
1062 } while (dst_pmd++, src_pmd++, addr = next, addr != end);
1063 return 0;
1064}
1065
1066static inline int copy_pud_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
1067 p4d_t *dst_p4d, p4d_t *src_p4d, struct vm_area_struct *vma,
1068 struct vm_area_struct *new,
1069 unsigned long addr, unsigned long end)
1070{
1071 pud_t *src_pud, *dst_pud;
1072 unsigned long next;
1073
1074 dst_pud = pud_alloc(dst_mm, dst_p4d, addr);
1075 if (!dst_pud)
1076 return -ENOMEM;
1077 src_pud = pud_offset(src_p4d, addr);
1078 do {
1079 next = pud_addr_end(addr, end);
1080 if (pud_trans_huge(*src_pud) || pud_devmap(*src_pud)) {
1081 int err;
1082
1083 VM_BUG_ON_VMA(next-addr != HPAGE_PUD_SIZE, vma);
1084 err = copy_huge_pud(dst_mm, src_mm,
1085 dst_pud, src_pud, addr, vma);
1086 if (err == -ENOMEM)
1087 return -ENOMEM;
1088 if (!err)
1089 continue;
1090 /* fall through */
1091 }
1092 if (pud_none_or_clear_bad(src_pud))
1093 continue;
1094 if (copy_pmd_range(dst_mm, src_mm, dst_pud, src_pud,
1095 vma, new, addr, next))
1096 return -ENOMEM;
1097 } while (dst_pud++, src_pud++, addr = next, addr != end);
1098 return 0;
1099}
1100
1101static inline int copy_p4d_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
1102 pgd_t *dst_pgd, pgd_t *src_pgd, struct vm_area_struct *vma,
1103 struct vm_area_struct *new,
1104 unsigned long addr, unsigned long end)
1105{
1106 p4d_t *src_p4d, *dst_p4d;
1107 unsigned long next;
1108
1109 dst_p4d = p4d_alloc(dst_mm, dst_pgd, addr);
1110 if (!dst_p4d)
1111 return -ENOMEM;
1112 src_p4d = p4d_offset(src_pgd, addr);
1113 do {
1114 next = p4d_addr_end(addr, end);
1115 if (p4d_none_or_clear_bad(src_p4d))
1116 continue;
1117 if (copy_pud_range(dst_mm, src_mm, dst_p4d, src_p4d,
1118 vma, new, addr, next))
1119 return -ENOMEM;
1120 } while (dst_p4d++, src_p4d++, addr = next, addr != end);
1121 return 0;
1122}
1123
1124int copy_page_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
1125 struct vm_area_struct *vma, struct vm_area_struct *new)
1126{
1127 pgd_t *src_pgd, *dst_pgd;
1128 unsigned long next;
1129 unsigned long addr = vma->vm_start;
1130 unsigned long end = vma->vm_end;
1131 struct mmu_notifier_range range;
1132 bool is_cow;
1133 int ret;
1134
1135 /*
1136 * Don't copy ptes where a page fault will fill them correctly.
1137 * Fork becomes much lighter when there are big shared or private
1138 * readonly mappings. The tradeoff is that copy_page_range is more
1139 * efficient than faulting.
1140 */
1141 if (!(vma->vm_flags & (VM_HUGETLB | VM_PFNMAP | VM_MIXEDMAP)) &&
1142 !vma->anon_vma)
1143 return 0;
1144
1145 if (is_vm_hugetlb_page(vma))
1146 return copy_hugetlb_page_range(dst_mm, src_mm, vma);
1147
1148 if (unlikely(vma->vm_flags & VM_PFNMAP)) {
1149 /*
1150 * We do not free on error cases below as remove_vma
1151 * gets called on error from higher level routine
1152 */
1153 ret = track_pfn_copy(vma);
1154 if (ret)
1155 return ret;
1156 }
1157
1158 /*
1159 * We need to invalidate the secondary MMU mappings only when
1160 * there could be a permission downgrade on the ptes of the
1161 * parent mm. And a permission downgrade will only happen if
1162 * is_cow_mapping() returns true.
1163 */
1164 is_cow = is_cow_mapping(vma->vm_flags);
1165
1166 if (is_cow) {
1167 mmu_notifier_range_init(&range, MMU_NOTIFY_PROTECTION_PAGE,
1168 0, vma, src_mm, addr, end);
1169 mmu_notifier_invalidate_range_start(&range);
1170 }
1171
1172 ret = 0;
1173 dst_pgd = pgd_offset(dst_mm, addr);
1174 src_pgd = pgd_offset(src_mm, addr);
1175 do {
1176 next = pgd_addr_end(addr, end);
1177 if (pgd_none_or_clear_bad(src_pgd))
1178 continue;
1179 if (unlikely(copy_p4d_range(dst_mm, src_mm, dst_pgd, src_pgd,
1180 vma, new, addr, next))) {
1181 ret = -ENOMEM;
1182 break;
1183 }
1184 } while (dst_pgd++, src_pgd++, addr = next, addr != end);
1185
1186 if (is_cow)
1187 mmu_notifier_invalidate_range_end(&range);
1188 return ret;
1189}
1190
1191static unsigned long zap_pte_range(struct mmu_gather *tlb,
1192 struct vm_area_struct *vma, pmd_t *pmd,
1193 unsigned long addr, unsigned long end,
1194 struct zap_details *details)
1195{
1196 struct mm_struct *mm = tlb->mm;
1197 int force_flush = 0;
1198 int rss[NR_MM_COUNTERS];
1199 spinlock_t *ptl;
1200 pte_t *start_pte;
1201 pte_t *pte;
1202 swp_entry_t entry;
1203
1204 tlb_change_page_size(tlb, PAGE_SIZE);
1205again:
1206 init_rss_vec(rss);
1207 start_pte = pte_offset_map_lock(mm, pmd, addr, &ptl);
1208 pte = start_pte;
1209 flush_tlb_batched_pending(mm);
1210 arch_enter_lazy_mmu_mode();
1211 do {
1212 pte_t ptent = *pte;
1213 if (pte_none(ptent))
1214 continue;
1215
1216 if (need_resched())
1217 break;
1218
1219 if (pte_present(ptent)) {
1220 struct page *page;
1221
1222 page = vm_normal_page(vma, addr, ptent);
1223 if (unlikely(details) && page) {
1224 /*
1225 * unmap_shared_mapping_pages() wants to
1226 * invalidate cache without truncating:
1227 * unmap shared but keep private pages.
1228 */
1229 if (details->check_mapping &&
1230 details->check_mapping != page_rmapping(page))
1231 continue;
1232 }
1233 ptent = ptep_get_and_clear_full(mm, addr, pte,
1234 tlb->fullmm);
1235 tlb_remove_tlb_entry(tlb, pte, addr);
1236 if (unlikely(!page))
1237 continue;
1238
1239 if (!PageAnon(page)) {
1240 if (pte_dirty(ptent)) {
1241 force_flush = 1;
1242 set_page_dirty(page);
1243 }
1244 if (pte_young(ptent) &&
1245 likely(!(vma->vm_flags & VM_SEQ_READ)))
1246 mark_page_accessed(page);
1247 }
1248 rss[mm_counter(page)]--;
1249 page_remove_rmap(page, false);
1250 if (unlikely(page_mapcount(page) < 0))
1251 print_bad_pte(vma, addr, ptent, page);
1252 if (unlikely(__tlb_remove_page(tlb, page))) {
1253 force_flush = 1;
1254 addr += PAGE_SIZE;
1255 break;
1256 }
1257 continue;
1258 }
1259
1260 entry = pte_to_swp_entry(ptent);
1261 if (is_device_private_entry(entry)) {
1262 struct page *page = device_private_entry_to_page(entry);
1263
1264 if (unlikely(details && details->check_mapping)) {
1265 /*
1266 * unmap_shared_mapping_pages() wants to
1267 * invalidate cache without truncating:
1268 * unmap shared but keep private pages.
1269 */
1270 if (details->check_mapping !=
1271 page_rmapping(page))
1272 continue;
1273 }
1274
1275 pte_clear_not_present_full(mm, addr, pte, tlb->fullmm);
1276 rss[mm_counter(page)]--;
1277 page_remove_rmap(page, false);
1278 put_page(page);
1279 continue;
1280 }
1281
1282 /* If details->check_mapping, we leave swap entries. */
1283 if (unlikely(details))
1284 continue;
1285
1286 if (!non_swap_entry(entry))
1287 rss[MM_SWAPENTS]--;
1288 else if (is_migration_entry(entry)) {
1289 struct page *page;
1290
1291 page = migration_entry_to_page(entry);
1292 rss[mm_counter(page)]--;
1293 }
1294 if (unlikely(!free_swap_and_cache(entry)))
1295 print_bad_pte(vma, addr, ptent, NULL);
1296 pte_clear_not_present_full(mm, addr, pte, tlb->fullmm);
1297 } while (pte++, addr += PAGE_SIZE, addr != end);
1298
1299 add_mm_rss_vec(mm, rss);
1300 arch_leave_lazy_mmu_mode();
1301
1302 /* Do the actual TLB flush before dropping ptl */
1303 if (force_flush)
1304 tlb_flush_mmu_tlbonly(tlb);
1305 pte_unmap_unlock(start_pte, ptl);
1306
1307 /*
1308 * If we forced a TLB flush (either due to running out of
1309 * batch buffers or because we needed to flush dirty TLB
1310 * entries before releasing the ptl), free the batched
1311 * memory too. Restart if we didn't do everything.
1312 */
1313 if (force_flush) {
1314 force_flush = 0;
1315 tlb_flush_mmu(tlb);
1316 }
1317
1318 if (addr != end) {
1319 cond_resched();
1320 goto again;
1321 }
1322
1323 return addr;
1324}
1325
1326static inline unsigned long zap_pmd_range(struct mmu_gather *tlb,
1327 struct vm_area_struct *vma, pud_t *pud,
1328 unsigned long addr, unsigned long end,
1329 struct zap_details *details)
1330{
1331 pmd_t *pmd;
1332 unsigned long next;
1333
1334 pmd = pmd_offset(pud, addr);
1335 do {
1336 next = pmd_addr_end(addr, end);
1337 if (is_swap_pmd(*pmd) || pmd_trans_huge(*pmd) || pmd_devmap(*pmd)) {
1338 if (next - addr != HPAGE_PMD_SIZE)
1339 __split_huge_pmd(vma, pmd, addr, false, NULL);
1340 else if (zap_huge_pmd(tlb, vma, pmd, addr))
1341 goto next;
1342 /* fall through */
1343 }
1344 /*
1345 * Here there can be other concurrent MADV_DONTNEED or
1346 * trans huge page faults running, and if the pmd is
1347 * none or trans huge it can change under us. This is
1348 * because MADV_DONTNEED holds the mmap_lock in read
1349 * mode.
1350 */
1351 if (pmd_none_or_trans_huge_or_clear_bad(pmd))
1352 goto next;
1353 next = zap_pte_range(tlb, vma, pmd, addr, next, details);
1354next:
1355 cond_resched();
1356 } while (pmd++, addr = next, addr != end);
1357
1358 return addr;
1359}
1360
1361static inline unsigned long zap_pud_range(struct mmu_gather *tlb,
1362 struct vm_area_struct *vma, p4d_t *p4d,
1363 unsigned long addr, unsigned long end,
1364 struct zap_details *details)
1365{
1366 pud_t *pud;
1367 unsigned long next;
1368
1369 pud = pud_offset(p4d, addr);
1370 do {
1371 next = pud_addr_end(addr, end);
1372 if (pud_trans_huge(*pud) || pud_devmap(*pud)) {
1373 if (next - addr != HPAGE_PUD_SIZE) {
1374 mmap_assert_locked(tlb->mm);
1375 split_huge_pud(vma, pud, addr);
1376 } else if (zap_huge_pud(tlb, vma, pud, addr))
1377 goto next;
1378 /* fall through */
1379 }
1380 if (pud_none_or_clear_bad(pud))
1381 continue;
1382 next = zap_pmd_range(tlb, vma, pud, addr, next, details);
1383next:
1384 cond_resched();
1385 } while (pud++, addr = next, addr != end);
1386
1387 return addr;
1388}
1389
1390static inline unsigned long zap_p4d_range(struct mmu_gather *tlb,
1391 struct vm_area_struct *vma, pgd_t *pgd,
1392 unsigned long addr, unsigned long end,
1393 struct zap_details *details)
1394{
1395 p4d_t *p4d;
1396 unsigned long next;
1397
1398 p4d = p4d_offset(pgd, addr);
1399 do {
1400 next = p4d_addr_end(addr, end);
1401 if (p4d_none_or_clear_bad(p4d))
1402 continue;
1403 next = zap_pud_range(tlb, vma, p4d, addr, next, details);
1404 } while (p4d++, addr = next, addr != end);
1405
1406 return addr;
1407}
1408
1409void unmap_page_range(struct mmu_gather *tlb,
1410 struct vm_area_struct *vma,
1411 unsigned long addr, unsigned long end,
1412 struct zap_details *details)
1413{
1414 pgd_t *pgd;
1415 unsigned long next;
1416
1417 BUG_ON(addr >= end);
1418 tlb_start_vma(tlb, vma);
1419 pgd = pgd_offset(vma->vm_mm, addr);
1420 do {
1421 next = pgd_addr_end(addr, end);
1422 if (pgd_none_or_clear_bad(pgd))
1423 continue;
1424 next = zap_p4d_range(tlb, vma, pgd, addr, next, details);
1425 } while (pgd++, addr = next, addr != end);
1426 tlb_end_vma(tlb, vma);
1427}
1428
1429
1430static void unmap_single_vma(struct mmu_gather *tlb,
1431 struct vm_area_struct *vma, unsigned long start_addr,
1432 unsigned long end_addr,
1433 struct zap_details *details)
1434{
1435 unsigned long start = max(vma->vm_start, start_addr);
1436 unsigned long end;
1437
1438 if (start >= vma->vm_end)
1439 return;
1440 end = min(vma->vm_end, end_addr);
1441 if (end <= vma->vm_start)
1442 return;
1443
1444 if (vma->vm_file)
1445 uprobe_munmap(vma, start, end);
1446
1447 if (unlikely(vma->vm_flags & VM_PFNMAP))
1448 untrack_pfn(vma, 0, 0);
1449
1450 if (start != end) {
1451 if (unlikely(is_vm_hugetlb_page(vma))) {
1452 /*
1453 * It is undesirable to test vma->vm_file as it
1454 * should be non-null for valid hugetlb area.
1455 * However, vm_file will be NULL in the error
1456 * cleanup path of mmap_region. When
1457 * hugetlbfs ->mmap method fails,
1458 * mmap_region() nullifies vma->vm_file
1459 * before calling this function to clean up.
1460 * Since no pte has actually been setup, it is
1461 * safe to do nothing in this case.
1462 */
1463 if (vma->vm_file) {
1464 i_mmap_lock_write(vma->vm_file->f_mapping);
1465 __unmap_hugepage_range_final(tlb, vma, start, end, NULL);
1466 i_mmap_unlock_write(vma->vm_file->f_mapping);
1467 }
1468 } else
1469 unmap_page_range(tlb, vma, start, end, details);
1470 }
1471}
1472
1473/**
1474 * unmap_vmas - unmap a range of memory covered by a list of vma's
1475 * @tlb: address of the caller's struct mmu_gather
1476 * @vma: the starting vma
1477 * @start_addr: virtual address at which to start unmapping
1478 * @end_addr: virtual address at which to end unmapping
1479 *
1480 * Unmap all pages in the vma list.
1481 *
1482 * Only addresses between `start' and `end' will be unmapped.
1483 *
1484 * The VMA list must be sorted in ascending virtual address order.
1485 *
1486 * unmap_vmas() assumes that the caller will flush the whole unmapped address
1487 * range after unmap_vmas() returns. So the only responsibility here is to
1488 * ensure that any thus-far unmapped pages are flushed before unmap_vmas()
1489 * drops the lock and schedules.
1490 */
1491void unmap_vmas(struct mmu_gather *tlb,
1492 struct vm_area_struct *vma, unsigned long start_addr,
1493 unsigned long end_addr)
1494{
1495 struct mmu_notifier_range range;
1496
1497 mmu_notifier_range_init(&range, MMU_NOTIFY_UNMAP, 0, vma, vma->vm_mm,
1498 start_addr, end_addr);
1499 mmu_notifier_invalidate_range_start(&range);
1500 for ( ; vma && vma->vm_start < end_addr; vma = vma->vm_next)
1501 unmap_single_vma(tlb, vma, start_addr, end_addr, NULL);
1502 mmu_notifier_invalidate_range_end(&range);
1503}
1504
1505/**
1506 * zap_page_range - remove user pages in a given range
1507 * @vma: vm_area_struct holding the applicable pages
1508 * @start: starting address of pages to zap
1509 * @size: number of bytes to zap
1510 *
1511 * Caller must protect the VMA list
1512 */
1513void zap_page_range(struct vm_area_struct *vma, unsigned long start,
1514 unsigned long size)
1515{
1516 struct mmu_notifier_range range;
1517 struct mmu_gather tlb;
1518
1519 lru_add_drain();
1520 mmu_notifier_range_init(&range, MMU_NOTIFY_CLEAR, 0, vma, vma->vm_mm,
1521 start, start + size);
1522 tlb_gather_mmu(&tlb, vma->vm_mm, start, range.end);
1523 update_hiwater_rss(vma->vm_mm);
1524 mmu_notifier_invalidate_range_start(&range);
1525 for ( ; vma && vma->vm_start < range.end; vma = vma->vm_next)
1526 unmap_single_vma(&tlb, vma, start, range.end, NULL);
1527 mmu_notifier_invalidate_range_end(&range);
1528 tlb_finish_mmu(&tlb, start, range.end);
1529}
1530
1531/**
1532 * zap_page_range_single - remove user pages in a given range
1533 * @vma: vm_area_struct holding the applicable pages
1534 * @address: starting address of pages to zap
1535 * @size: number of bytes to zap
1536 * @details: details of shared cache invalidation
1537 *
1538 * The range must fit into one VMA.
1539 */
1540static void zap_page_range_single(struct vm_area_struct *vma, unsigned long address,
1541 unsigned long size, struct zap_details *details)
1542{
1543 struct mmu_notifier_range range;
1544 struct mmu_gather tlb;
1545
1546 lru_add_drain();
1547 mmu_notifier_range_init(&range, MMU_NOTIFY_CLEAR, 0, vma, vma->vm_mm,
1548 address, address + size);
1549 tlb_gather_mmu(&tlb, vma->vm_mm, address, range.end);
1550 update_hiwater_rss(vma->vm_mm);
1551 mmu_notifier_invalidate_range_start(&range);
1552 unmap_single_vma(&tlb, vma, address, range.end, details);
1553 mmu_notifier_invalidate_range_end(&range);
1554 tlb_finish_mmu(&tlb, address, range.end);
1555}
1556
1557/**
1558 * zap_vma_ptes - remove ptes mapping the vma
1559 * @vma: vm_area_struct holding ptes to be zapped
1560 * @address: starting address of pages to zap
1561 * @size: number of bytes to zap
1562 *
1563 * This function only unmaps ptes assigned to VM_PFNMAP vmas.
1564 *
1565 * The entire address range must be fully contained within the vma.
1566 *
1567 */
1568void zap_vma_ptes(struct vm_area_struct *vma, unsigned long address,
1569 unsigned long size)
1570{
1571 if (address < vma->vm_start || address + size > vma->vm_end ||
1572 !(vma->vm_flags & VM_PFNMAP))
1573 return;
1574
1575 zap_page_range_single(vma, address, size, NULL);
1576}
1577EXPORT_SYMBOL_GPL(zap_vma_ptes);
1578
1579static pmd_t *walk_to_pmd(struct mm_struct *mm, unsigned long addr)
1580{
1581 pgd_t *pgd;
1582 p4d_t *p4d;
1583 pud_t *pud;
1584 pmd_t *pmd;
1585
1586 pgd = pgd_offset(mm, addr);
1587 p4d = p4d_alloc(mm, pgd, addr);
1588 if (!p4d)
1589 return NULL;
1590 pud = pud_alloc(mm, p4d, addr);
1591 if (!pud)
1592 return NULL;
1593 pmd = pmd_alloc(mm, pud, addr);
1594 if (!pmd)
1595 return NULL;
1596
1597 VM_BUG_ON(pmd_trans_huge(*pmd));
1598 return pmd;
1599}
1600
1601pte_t *__get_locked_pte(struct mm_struct *mm, unsigned long addr,
1602 spinlock_t **ptl)
1603{
1604 pmd_t *pmd = walk_to_pmd(mm, addr);
1605
1606 if (!pmd)
1607 return NULL;
1608 return pte_alloc_map_lock(mm, pmd, addr, ptl);
1609}
1610
1611static int validate_page_before_insert(struct page *page)
1612{
1613 if (PageAnon(page) || PageSlab(page) || page_has_type(page))
1614 return -EINVAL;
1615 flush_dcache_page(page);
1616 return 0;
1617}
1618
1619static int insert_page_into_pte_locked(struct mm_struct *mm, pte_t *pte,
1620 unsigned long addr, struct page *page, pgprot_t prot)
1621{
1622 if (!pte_none(*pte))
1623 return -EBUSY;
1624 /* Ok, finally just insert the thing.. */
1625 get_page(page);
1626 inc_mm_counter_fast(mm, mm_counter_file(page));
1627 page_add_file_rmap(page, false);
1628 set_pte_at(mm, addr, pte, mk_pte(page, prot));
1629 return 0;
1630}
1631
1632/*
1633 * This is the old fallback for page remapping.
1634 *
1635 * For historical reasons, it only allows reserved pages. Only
1636 * old drivers should use this, and they needed to mark their
1637 * pages reserved for the old functions anyway.
1638 */
1639static int insert_page(struct vm_area_struct *vma, unsigned long addr,
1640 struct page *page, pgprot_t prot)
1641{
1642 struct mm_struct *mm = vma->vm_mm;
1643 int retval;
1644 pte_t *pte;
1645 spinlock_t *ptl;
1646
1647 retval = validate_page_before_insert(page);
1648 if (retval)
1649 goto out;
1650 retval = -ENOMEM;
1651 pte = get_locked_pte(mm, addr, &ptl);
1652 if (!pte)
1653 goto out;
1654 retval = insert_page_into_pte_locked(mm, pte, addr, page, prot);
1655 pte_unmap_unlock(pte, ptl);
1656out:
1657 return retval;
1658}
1659
1660#ifdef pte_index
1661static int insert_page_in_batch_locked(struct mm_struct *mm, pte_t *pte,
1662 unsigned long addr, struct page *page, pgprot_t prot)
1663{
1664 int err;
1665
1666 if (!page_count(page))
1667 return -EINVAL;
1668 err = validate_page_before_insert(page);
1669 if (err)
1670 return err;
1671 return insert_page_into_pte_locked(mm, pte, addr, page, prot);
1672}
1673
1674/* insert_pages() amortizes the cost of spinlock operations
1675 * when inserting pages in a loop. Arch *must* define pte_index.
1676 */
1677static int insert_pages(struct vm_area_struct *vma, unsigned long addr,
1678 struct page **pages, unsigned long *num, pgprot_t prot)
1679{
1680 pmd_t *pmd = NULL;
1681 pte_t *start_pte, *pte;
1682 spinlock_t *pte_lock;
1683 struct mm_struct *const mm = vma->vm_mm;
1684 unsigned long curr_page_idx = 0;
1685 unsigned long remaining_pages_total = *num;
1686 unsigned long pages_to_write_in_pmd;
1687 int ret;
1688more:
1689 ret = -EFAULT;
1690 pmd = walk_to_pmd(mm, addr);
1691 if (!pmd)
1692 goto out;
1693
1694 pages_to_write_in_pmd = min_t(unsigned long,
1695 remaining_pages_total, PTRS_PER_PTE - pte_index(addr));
1696
1697 /* Allocate the PTE if necessary; takes PMD lock once only. */
1698 ret = -ENOMEM;
1699 if (pte_alloc(mm, pmd))
1700 goto out;
1701
1702 while (pages_to_write_in_pmd) {
1703 int pte_idx = 0;
1704 const int batch_size = min_t(int, pages_to_write_in_pmd, 8);
1705
1706 start_pte = pte_offset_map_lock(mm, pmd, addr, &pte_lock);
1707 for (pte = start_pte; pte_idx < batch_size; ++pte, ++pte_idx) {
1708 int err = insert_page_in_batch_locked(mm, pte,
1709 addr, pages[curr_page_idx], prot);
1710 if (unlikely(err)) {
1711 pte_unmap_unlock(start_pte, pte_lock);
1712 ret = err;
1713 remaining_pages_total -= pte_idx;
1714 goto out;
1715 }
1716 addr += PAGE_SIZE;
1717 ++curr_page_idx;
1718 }
1719 pte_unmap_unlock(start_pte, pte_lock);
1720 pages_to_write_in_pmd -= batch_size;
1721 remaining_pages_total -= batch_size;
1722 }
1723 if (remaining_pages_total)
1724 goto more;
1725 ret = 0;
1726out:
1727 *num = remaining_pages_total;
1728 return ret;
1729}
1730#endif /* ifdef pte_index */
1731
1732/**
1733 * vm_insert_pages - insert multiple pages into user vma, batching the pmd lock.
1734 * @vma: user vma to map to
1735 * @addr: target start user address of these pages
1736 * @pages: source kernel pages
1737 * @num: in: number of pages to map. out: number of pages that were *not*
1738 * mapped. (0 means all pages were successfully mapped).
1739 *
1740 * Preferred over vm_insert_page() when inserting multiple pages.
1741 *
1742 * In case of error, we may have mapped a subset of the provided
1743 * pages. It is the caller's responsibility to account for this case.
1744 *
1745 * The same restrictions apply as in vm_insert_page().
1746 */
1747int vm_insert_pages(struct vm_area_struct *vma, unsigned long addr,
1748 struct page **pages, unsigned long *num)
1749{
1750#ifdef pte_index
1751 const unsigned long end_addr = addr + (*num * PAGE_SIZE) - 1;
1752
1753 if (addr < vma->vm_start || end_addr >= vma->vm_end)
1754 return -EFAULT;
1755 if (!(vma->vm_flags & VM_MIXEDMAP)) {
1756 BUG_ON(mmap_read_trylock(vma->vm_mm));
1757 BUG_ON(vma->vm_flags & VM_PFNMAP);
1758 vma->vm_flags |= VM_MIXEDMAP;
1759 }
1760 /* Defer page refcount checking till we're about to map that page. */
1761 return insert_pages(vma, addr, pages, num, vma->vm_page_prot);
1762#else
1763 unsigned long idx = 0, pgcount = *num;
1764 int err = -EINVAL;
1765
1766 for (; idx < pgcount; ++idx) {
1767 err = vm_insert_page(vma, addr + (PAGE_SIZE * idx), pages[idx]);
1768 if (err)
1769 break;
1770 }
1771 *num = pgcount - idx;
1772 return err;
1773#endif /* ifdef pte_index */
1774}
1775EXPORT_SYMBOL(vm_insert_pages);
1776
1777/**
1778 * vm_insert_page - insert single page into user vma
1779 * @vma: user vma to map to
1780 * @addr: target user address of this page
1781 * @page: source kernel page
1782 *
1783 * This allows drivers to insert individual pages they've allocated
1784 * into a user vma.
1785 *
1786 * The page has to be a nice clean _individual_ kernel allocation.
1787 * If you allocate a compound page, you need to have marked it as
1788 * such (__GFP_COMP), or manually just split the page up yourself
1789 * (see split_page()).
1790 *
1791 * NOTE! Traditionally this was done with "remap_pfn_range()" which
1792 * took an arbitrary page protection parameter. This doesn't allow
1793 * that. Your vma protection will have to be set up correctly, which
1794 * means that if you want a shared writable mapping, you'd better
1795 * ask for a shared writable mapping!
1796 *
1797 * The page does not need to be reserved.
1798 *
1799 * Usually this function is called from f_op->mmap() handler
1800 * under mm->mmap_lock write-lock, so it can change vma->vm_flags.
1801 * Caller must set VM_MIXEDMAP on vma if it wants to call this
1802 * function from other places, for example from page-fault handler.
1803 *
1804 * Return: %0 on success, negative error code otherwise.
1805 */
1806int vm_insert_page(struct vm_area_struct *vma, unsigned long addr,
1807 struct page *page)
1808{
1809 if (addr < vma->vm_start || addr >= vma->vm_end)
1810 return -EFAULT;
1811 if (!page_count(page))
1812 return -EINVAL;
1813 if (!(vma->vm_flags & VM_MIXEDMAP)) {
1814 BUG_ON(mmap_read_trylock(vma->vm_mm));
1815 BUG_ON(vma->vm_flags & VM_PFNMAP);
1816 vma->vm_flags |= VM_MIXEDMAP;
1817 }
1818 return insert_page(vma, addr, page, vma->vm_page_prot);
1819}
1820EXPORT_SYMBOL(vm_insert_page);
1821
1822/*
1823 * __vm_map_pages - maps range of kernel pages into user vma
1824 * @vma: user vma to map to
1825 * @pages: pointer to array of source kernel pages
1826 * @num: number of pages in page array
1827 * @offset: user's requested vm_pgoff
1828 *
1829 * This allows drivers to map range of kernel pages into a user vma.
1830 *
1831 * Return: 0 on success and error code otherwise.
1832 */
1833static int __vm_map_pages(struct vm_area_struct *vma, struct page **pages,
1834 unsigned long num, unsigned long offset)
1835{
1836 unsigned long count = vma_pages(vma);
1837 unsigned long uaddr = vma->vm_start;
1838 int ret, i;
1839
1840 /* Fail if the user requested offset is beyond the end of the object */
1841 if (offset >= num)
1842 return -ENXIO;
1843
1844 /* Fail if the user requested size exceeds available object size */
1845 if (count > num - offset)
1846 return -ENXIO;
1847
1848 for (i = 0; i < count; i++) {
1849 ret = vm_insert_page(vma, uaddr, pages[offset + i]);
1850 if (ret < 0)
1851 return ret;
1852 uaddr += PAGE_SIZE;
1853 }
1854
1855 return 0;
1856}
1857
1858/**
1859 * vm_map_pages - maps range of kernel pages starts with non zero offset
1860 * @vma: user vma to map to
1861 * @pages: pointer to array of source kernel pages
1862 * @num: number of pages in page array
1863 *
1864 * Maps an object consisting of @num pages, catering for the user's
1865 * requested vm_pgoff
1866 *
1867 * If we fail to insert any page into the vma, the function will return
1868 * immediately leaving any previously inserted pages present. Callers
1869 * from the mmap handler may immediately return the error as their caller
1870 * will destroy the vma, removing any successfully inserted pages. Other
1871 * callers should make their own arrangements for calling unmap_region().
1872 *
1873 * Context: Process context. Called by mmap handlers.
1874 * Return: 0 on success and error code otherwise.
1875 */
1876int vm_map_pages(struct vm_area_struct *vma, struct page **pages,
1877 unsigned long num)
1878{
1879 return __vm_map_pages(vma, pages, num, vma->vm_pgoff);
1880}
1881EXPORT_SYMBOL(vm_map_pages);
1882
1883/**
1884 * vm_map_pages_zero - map range of kernel pages starts with zero offset
1885 * @vma: user vma to map to
1886 * @pages: pointer to array of source kernel pages
1887 * @num: number of pages in page array
1888 *
1889 * Similar to vm_map_pages(), except that it explicitly sets the offset
1890 * to 0. This function is intended for the drivers that did not consider
1891 * vm_pgoff.
1892 *
1893 * Context: Process context. Called by mmap handlers.
1894 * Return: 0 on success and error code otherwise.
1895 */
1896int vm_map_pages_zero(struct vm_area_struct *vma, struct page **pages,
1897 unsigned long num)
1898{
1899 return __vm_map_pages(vma, pages, num, 0);
1900}
1901EXPORT_SYMBOL(vm_map_pages_zero);
1902
1903static vm_fault_t insert_pfn(struct vm_area_struct *vma, unsigned long addr,
1904 pfn_t pfn, pgprot_t prot, bool mkwrite)
1905{
1906 struct mm_struct *mm = vma->vm_mm;
1907 pte_t *pte, entry;
1908 spinlock_t *ptl;
1909
1910 pte = get_locked_pte(mm, addr, &ptl);
1911 if (!pte)
1912 return VM_FAULT_OOM;
1913 if (!pte_none(*pte)) {
1914 if (mkwrite) {
1915 /*
1916 * For read faults on private mappings the PFN passed
1917 * in may not match the PFN we have mapped if the
1918 * mapped PFN is a writeable COW page. In the mkwrite
1919 * case we are creating a writable PTE for a shared
1920 * mapping and we expect the PFNs to match. If they
1921 * don't match, we are likely racing with block
1922 * allocation and mapping invalidation so just skip the
1923 * update.
1924 */
1925 if (pte_pfn(*pte) != pfn_t_to_pfn(pfn)) {
1926 WARN_ON_ONCE(!is_zero_pfn(pte_pfn(*pte)));
1927 goto out_unlock;
1928 }
1929 entry = pte_mkyoung(*pte);
1930 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
1931 if (ptep_set_access_flags(vma, addr, pte, entry, 1))
1932 update_mmu_cache(vma, addr, pte);
1933 }
1934 goto out_unlock;
1935 }
1936
1937 /* Ok, finally just insert the thing.. */
1938 if (pfn_t_devmap(pfn))
1939 entry = pte_mkdevmap(pfn_t_pte(pfn, prot));
1940 else
1941 entry = pte_mkspecial(pfn_t_pte(pfn, prot));
1942
1943 if (mkwrite) {
1944 entry = pte_mkyoung(entry);
1945 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
1946 }
1947
1948 set_pte_at(mm, addr, pte, entry);
1949 update_mmu_cache(vma, addr, pte); /* XXX: why not for insert_page? */
1950
1951out_unlock:
1952 pte_unmap_unlock(pte, ptl);
1953 return VM_FAULT_NOPAGE;
1954}
1955
1956/**
1957 * vmf_insert_pfn_prot - insert single pfn into user vma with specified pgprot
1958 * @vma: user vma to map to
1959 * @addr: target user address of this page
1960 * @pfn: source kernel pfn
1961 * @pgprot: pgprot flags for the inserted page
1962 *
1963 * This is exactly like vmf_insert_pfn(), except that it allows drivers
1964 * to override pgprot on a per-page basis.
1965 *
1966 * This only makes sense for IO mappings, and it makes no sense for
1967 * COW mappings. In general, using multiple vmas is preferable;
1968 * vmf_insert_pfn_prot should only be used if using multiple VMAs is
1969 * impractical.
1970 *
1971 * See vmf_insert_mixed_prot() for a discussion of the implication of using
1972 * a value of @pgprot different from that of @vma->vm_page_prot.
1973 *
1974 * Context: Process context. May allocate using %GFP_KERNEL.
1975 * Return: vm_fault_t value.
1976 */
1977vm_fault_t vmf_insert_pfn_prot(struct vm_area_struct *vma, unsigned long addr,
1978 unsigned long pfn, pgprot_t pgprot)
1979{
1980 /*
1981 * Technically, architectures with pte_special can avoid all these
1982 * restrictions (same for remap_pfn_range). However we would like
1983 * consistency in testing and feature parity among all, so we should
1984 * try to keep these invariants in place for everybody.
1985 */
1986 BUG_ON(!(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP)));
1987 BUG_ON((vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP)) ==
1988 (VM_PFNMAP|VM_MIXEDMAP));
1989 BUG_ON((vma->vm_flags & VM_PFNMAP) && is_cow_mapping(vma->vm_flags));
1990 BUG_ON((vma->vm_flags & VM_MIXEDMAP) && pfn_valid(pfn));
1991
1992 if (addr < vma->vm_start || addr >= vma->vm_end)
1993 return VM_FAULT_SIGBUS;
1994
1995 if (!pfn_modify_allowed(pfn, pgprot))
1996 return VM_FAULT_SIGBUS;
1997
1998 track_pfn_insert(vma, &pgprot, __pfn_to_pfn_t(pfn, PFN_DEV));
1999
2000 return insert_pfn(vma, addr, __pfn_to_pfn_t(pfn, PFN_DEV), pgprot,
2001 false);
2002}
2003EXPORT_SYMBOL(vmf_insert_pfn_prot);
2004
2005/**
2006 * vmf_insert_pfn - insert single pfn into user vma
2007 * @vma: user vma to map to
2008 * @addr: target user address of this page
2009 * @pfn: source kernel pfn
2010 *
2011 * Similar to vm_insert_page, this allows drivers to insert individual pages
2012 * they've allocated into a user vma. Same comments apply.
2013 *
2014 * This function should only be called from a vm_ops->fault handler, and
2015 * in that case the handler should return the result of this function.
2016 *
2017 * vma cannot be a COW mapping.
2018 *
2019 * As this is called only for pages that do not currently exist, we
2020 * do not need to flush old virtual caches or the TLB.
2021 *
2022 * Context: Process context. May allocate using %GFP_KERNEL.
2023 * Return: vm_fault_t value.
2024 */
2025vm_fault_t vmf_insert_pfn(struct vm_area_struct *vma, unsigned long addr,
2026 unsigned long pfn)
2027{
2028 return vmf_insert_pfn_prot(vma, addr, pfn, vma->vm_page_prot);
2029}
2030EXPORT_SYMBOL(vmf_insert_pfn);
2031
2032static bool vm_mixed_ok(struct vm_area_struct *vma, pfn_t pfn)
2033{
2034 /* these checks mirror the abort conditions in vm_normal_page */
2035 if (vma->vm_flags & VM_MIXEDMAP)
2036 return true;
2037 if (pfn_t_devmap(pfn))
2038 return true;
2039 if (pfn_t_special(pfn))
2040 return true;
2041 if (is_zero_pfn(pfn_t_to_pfn(pfn)))
2042 return true;
2043 return false;
2044}
2045
2046static vm_fault_t __vm_insert_mixed(struct vm_area_struct *vma,
2047 unsigned long addr, pfn_t pfn, pgprot_t pgprot,
2048 bool mkwrite)
2049{
2050 int err;
2051
2052 BUG_ON(!vm_mixed_ok(vma, pfn));
2053
2054 if (addr < vma->vm_start || addr >= vma->vm_end)
2055 return VM_FAULT_SIGBUS;
2056
2057 track_pfn_insert(vma, &pgprot, pfn);
2058
2059 if (!pfn_modify_allowed(pfn_t_to_pfn(pfn), pgprot))
2060 return VM_FAULT_SIGBUS;
2061
2062 /*
2063 * If we don't have pte special, then we have to use the pfn_valid()
2064 * based VM_MIXEDMAP scheme (see vm_normal_page), and thus we *must*
2065 * refcount the page if pfn_valid is true (hence insert_page rather
2066 * than insert_pfn). If a zero_pfn were inserted into a VM_MIXEDMAP
2067 * without pte special, it would there be refcounted as a normal page.
2068 */
2069 if (!IS_ENABLED(CONFIG_ARCH_HAS_PTE_SPECIAL) &&
2070 !pfn_t_devmap(pfn) && pfn_t_valid(pfn)) {
2071 struct page *page;
2072
2073 /*
2074 * At this point we are committed to insert_page()
2075 * regardless of whether the caller specified flags that
2076 * result in pfn_t_has_page() == false.
2077 */
2078 page = pfn_to_page(pfn_t_to_pfn(pfn));
2079 err = insert_page(vma, addr, page, pgprot);
2080 } else {
2081 return insert_pfn(vma, addr, pfn, pgprot, mkwrite);
2082 }
2083
2084 if (err == -ENOMEM)
2085 return VM_FAULT_OOM;
2086 if (err < 0 && err != -EBUSY)
2087 return VM_FAULT_SIGBUS;
2088
2089 return VM_FAULT_NOPAGE;
2090}
2091
2092/**
2093 * vmf_insert_mixed_prot - insert single pfn into user vma with specified pgprot
2094 * @vma: user vma to map to
2095 * @addr: target user address of this page
2096 * @pfn: source kernel pfn
2097 * @pgprot: pgprot flags for the inserted page
2098 *
2099 * This is exactly like vmf_insert_mixed(), except that it allows drivers
2100 * to override pgprot on a per-page basis.
2101 *
2102 * Typically this function should be used by drivers to set caching- and
2103 * encryption bits different than those of @vma->vm_page_prot, because
2104 * the caching- or encryption mode may not be known at mmap() time.
2105 * This is ok as long as @vma->vm_page_prot is not used by the core vm
2106 * to set caching and encryption bits for those vmas (except for COW pages).
2107 * This is ensured by core vm only modifying these page table entries using
2108 * functions that don't touch caching- or encryption bits, using pte_modify()
2109 * if needed. (See for example mprotect()).
2110 * Also when new page-table entries are created, this is only done using the
2111 * fault() callback, and never using the value of vma->vm_page_prot,
2112 * except for page-table entries that point to anonymous pages as the result
2113 * of COW.
2114 *
2115 * Context: Process context. May allocate using %GFP_KERNEL.
2116 * Return: vm_fault_t value.
2117 */
2118vm_fault_t vmf_insert_mixed_prot(struct vm_area_struct *vma, unsigned long addr,
2119 pfn_t pfn, pgprot_t pgprot)
2120{
2121 return __vm_insert_mixed(vma, addr, pfn, pgprot, false);
2122}
2123EXPORT_SYMBOL(vmf_insert_mixed_prot);
2124
2125vm_fault_t vmf_insert_mixed(struct vm_area_struct *vma, unsigned long addr,
2126 pfn_t pfn)
2127{
2128 return __vm_insert_mixed(vma, addr, pfn, vma->vm_page_prot, false);
2129}
2130EXPORT_SYMBOL(vmf_insert_mixed);
2131
2132/*
2133 * If the insertion of PTE failed because someone else already added a
2134 * different entry in the mean time, we treat that as success as we assume
2135 * the same entry was actually inserted.
2136 */
2137vm_fault_t vmf_insert_mixed_mkwrite(struct vm_area_struct *vma,
2138 unsigned long addr, pfn_t pfn)
2139{
2140 return __vm_insert_mixed(vma, addr, pfn, vma->vm_page_prot, true);
2141}
2142EXPORT_SYMBOL(vmf_insert_mixed_mkwrite);
2143
2144/*
2145 * maps a range of physical memory into the requested pages. the old
2146 * mappings are removed. any references to nonexistent pages results
2147 * in null mappings (currently treated as "copy-on-access")
2148 */
2149static int remap_pte_range(struct mm_struct *mm, pmd_t *pmd,
2150 unsigned long addr, unsigned long end,
2151 unsigned long pfn, pgprot_t prot)
2152{
2153 pte_t *pte;
2154 spinlock_t *ptl;
2155 int err = 0;
2156
2157 pte = pte_alloc_map_lock(mm, pmd, addr, &ptl);
2158 if (!pte)
2159 return -ENOMEM;
2160 arch_enter_lazy_mmu_mode();
2161 do {
2162 BUG_ON(!pte_none(*pte));
2163 if (!pfn_modify_allowed(pfn, prot)) {
2164 err = -EACCES;
2165 break;
2166 }
2167 set_pte_at(mm, addr, pte, pte_mkspecial(pfn_pte(pfn, prot)));
2168 pfn++;
2169 } while (pte++, addr += PAGE_SIZE, addr != end);
2170 arch_leave_lazy_mmu_mode();
2171 pte_unmap_unlock(pte - 1, ptl);
2172 return err;
2173}
2174
2175static inline int remap_pmd_range(struct mm_struct *mm, pud_t *pud,
2176 unsigned long addr, unsigned long end,
2177 unsigned long pfn, pgprot_t prot)
2178{
2179 pmd_t *pmd;
2180 unsigned long next;
2181 int err;
2182
2183 pfn -= addr >> PAGE_SHIFT;
2184 pmd = pmd_alloc(mm, pud, addr);
2185 if (!pmd)
2186 return -ENOMEM;
2187 VM_BUG_ON(pmd_trans_huge(*pmd));
2188 do {
2189 next = pmd_addr_end(addr, end);
2190 err = remap_pte_range(mm, pmd, addr, next,
2191 pfn + (addr >> PAGE_SHIFT), prot);
2192 if (err)
2193 return err;
2194 } while (pmd++, addr = next, addr != end);
2195 return 0;
2196}
2197
2198static inline int remap_pud_range(struct mm_struct *mm, p4d_t *p4d,
2199 unsigned long addr, unsigned long end,
2200 unsigned long pfn, pgprot_t prot)
2201{
2202 pud_t *pud;
2203 unsigned long next;
2204 int err;
2205
2206 pfn -= addr >> PAGE_SHIFT;
2207 pud = pud_alloc(mm, p4d, addr);
2208 if (!pud)
2209 return -ENOMEM;
2210 do {
2211 next = pud_addr_end(addr, end);
2212 err = remap_pmd_range(mm, pud, addr, next,
2213 pfn + (addr >> PAGE_SHIFT), prot);
2214 if (err)
2215 return err;
2216 } while (pud++, addr = next, addr != end);
2217 return 0;
2218}
2219
2220static inline int remap_p4d_range(struct mm_struct *mm, pgd_t *pgd,
2221 unsigned long addr, unsigned long end,
2222 unsigned long pfn, pgprot_t prot)
2223{
2224 p4d_t *p4d;
2225 unsigned long next;
2226 int err;
2227
2228 pfn -= addr >> PAGE_SHIFT;
2229 p4d = p4d_alloc(mm, pgd, addr);
2230 if (!p4d)
2231 return -ENOMEM;
2232 do {
2233 next = p4d_addr_end(addr, end);
2234 err = remap_pud_range(mm, p4d, addr, next,
2235 pfn + (addr >> PAGE_SHIFT), prot);
2236 if (err)
2237 return err;
2238 } while (p4d++, addr = next, addr != end);
2239 return 0;
2240}
2241
2242/**
2243 * remap_pfn_range - remap kernel memory to userspace
2244 * @vma: user vma to map to
2245 * @addr: target page aligned user address to start at
2246 * @pfn: page frame number of kernel physical memory address
2247 * @size: size of mapping area
2248 * @prot: page protection flags for this mapping
2249 *
2250 * Note: this is only safe if the mm semaphore is held when called.
2251 *
2252 * Return: %0 on success, negative error code otherwise.
2253 */
2254int remap_pfn_range(struct vm_area_struct *vma, unsigned long addr,
2255 unsigned long pfn, unsigned long size, pgprot_t prot)
2256{
2257 pgd_t *pgd;
2258 unsigned long next;
2259 unsigned long end = addr + PAGE_ALIGN(size);
2260 struct mm_struct *mm = vma->vm_mm;
2261 unsigned long remap_pfn = pfn;
2262 int err;
2263
2264 if (WARN_ON_ONCE(!PAGE_ALIGNED(addr)))
2265 return -EINVAL;
2266
2267 /*
2268 * Physically remapped pages are special. Tell the
2269 * rest of the world about it:
2270 * VM_IO tells people not to look at these pages
2271 * (accesses can have side effects).
2272 * VM_PFNMAP tells the core MM that the base pages are just
2273 * raw PFN mappings, and do not have a "struct page" associated
2274 * with them.
2275 * VM_DONTEXPAND
2276 * Disable vma merging and expanding with mremap().
2277 * VM_DONTDUMP
2278 * Omit vma from core dump, even when VM_IO turned off.
2279 *
2280 * There's a horrible special case to handle copy-on-write
2281 * behaviour that some programs depend on. We mark the "original"
2282 * un-COW'ed pages by matching them up with "vma->vm_pgoff".
2283 * See vm_normal_page() for details.
2284 */
2285 if (is_cow_mapping(vma->vm_flags)) {
2286 if (addr != vma->vm_start || end != vma->vm_end)
2287 return -EINVAL;
2288 vma->vm_pgoff = pfn;
2289 }
2290
2291 err = track_pfn_remap(vma, &prot, remap_pfn, addr, PAGE_ALIGN(size));
2292 if (err)
2293 return -EINVAL;
2294
2295 vma->vm_flags |= VM_IO | VM_PFNMAP | VM_DONTEXPAND | VM_DONTDUMP;
2296
2297 BUG_ON(addr >= end);
2298 pfn -= addr >> PAGE_SHIFT;
2299 pgd = pgd_offset(mm, addr);
2300 flush_cache_range(vma, addr, end);
2301 do {
2302 next = pgd_addr_end(addr, end);
2303 err = remap_p4d_range(mm, pgd, addr, next,
2304 pfn + (addr >> PAGE_SHIFT), prot);
2305 if (err)
2306 break;
2307 } while (pgd++, addr = next, addr != end);
2308
2309 if (err)
2310 untrack_pfn(vma, remap_pfn, PAGE_ALIGN(size));
2311
2312 return err;
2313}
2314EXPORT_SYMBOL(remap_pfn_range);
2315
2316/**
2317 * vm_iomap_memory - remap memory to userspace
2318 * @vma: user vma to map to
2319 * @start: start of the physical memory to be mapped
2320 * @len: size of area
2321 *
2322 * This is a simplified io_remap_pfn_range() for common driver use. The
2323 * driver just needs to give us the physical memory range to be mapped,
2324 * we'll figure out the rest from the vma information.
2325 *
2326 * NOTE! Some drivers might want to tweak vma->vm_page_prot first to get
2327 * whatever write-combining details or similar.
2328 *
2329 * Return: %0 on success, negative error code otherwise.
2330 */
2331int vm_iomap_memory(struct vm_area_struct *vma, phys_addr_t start, unsigned long len)
2332{
2333 unsigned long vm_len, pfn, pages;
2334
2335 /* Check that the physical memory area passed in looks valid */
2336 if (start + len < start)
2337 return -EINVAL;
2338 /*
2339 * You *really* shouldn't map things that aren't page-aligned,
2340 * but we've historically allowed it because IO memory might
2341 * just have smaller alignment.
2342 */
2343 len += start & ~PAGE_MASK;
2344 pfn = start >> PAGE_SHIFT;
2345 pages = (len + ~PAGE_MASK) >> PAGE_SHIFT;
2346 if (pfn + pages < pfn)
2347 return -EINVAL;
2348
2349 /* We start the mapping 'vm_pgoff' pages into the area */
2350 if (vma->vm_pgoff > pages)
2351 return -EINVAL;
2352 pfn += vma->vm_pgoff;
2353 pages -= vma->vm_pgoff;
2354
2355 /* Can we fit all of the mapping? */
2356 vm_len = vma->vm_end - vma->vm_start;
2357 if (vm_len >> PAGE_SHIFT > pages)
2358 return -EINVAL;
2359
2360 /* Ok, let it rip */
2361 return io_remap_pfn_range(vma, vma->vm_start, pfn, vm_len, vma->vm_page_prot);
2362}
2363EXPORT_SYMBOL(vm_iomap_memory);
2364
2365static int apply_to_pte_range(struct mm_struct *mm, pmd_t *pmd,
2366 unsigned long addr, unsigned long end,
2367 pte_fn_t fn, void *data, bool create,
2368 pgtbl_mod_mask *mask)
2369{
2370 pte_t *pte;
2371 int err = 0;
2372 spinlock_t *ptl;
2373
2374 if (create) {
2375 pte = (mm == &init_mm) ?
2376 pte_alloc_kernel_track(pmd, addr, mask) :
2377 pte_alloc_map_lock(mm, pmd, addr, &ptl);
2378 if (!pte)
2379 return -ENOMEM;
2380 } else {
2381 pte = (mm == &init_mm) ?
2382 pte_offset_kernel(pmd, addr) :
2383 pte_offset_map_lock(mm, pmd, addr, &ptl);
2384 }
2385
2386 BUG_ON(pmd_huge(*pmd));
2387
2388 arch_enter_lazy_mmu_mode();
2389
2390 do {
2391 if (create || !pte_none(*pte)) {
2392 err = fn(pte++, addr, data);
2393 if (err)
2394 break;
2395 }
2396 } while (addr += PAGE_SIZE, addr != end);
2397 *mask |= PGTBL_PTE_MODIFIED;
2398
2399 arch_leave_lazy_mmu_mode();
2400
2401 if (mm != &init_mm)
2402 pte_unmap_unlock(pte-1, ptl);
2403 return err;
2404}
2405
2406static int apply_to_pmd_range(struct mm_struct *mm, pud_t *pud,
2407 unsigned long addr, unsigned long end,
2408 pte_fn_t fn, void *data, bool create,
2409 pgtbl_mod_mask *mask)
2410{
2411 pmd_t *pmd;
2412 unsigned long next;
2413 int err = 0;
2414
2415 BUG_ON(pud_huge(*pud));
2416
2417 if (create) {
2418 pmd = pmd_alloc_track(mm, pud, addr, mask);
2419 if (!pmd)
2420 return -ENOMEM;
2421 } else {
2422 pmd = pmd_offset(pud, addr);
2423 }
2424 do {
2425 next = pmd_addr_end(addr, end);
2426 if (create || !pmd_none_or_clear_bad(pmd)) {
2427 err = apply_to_pte_range(mm, pmd, addr, next, fn, data,
2428 create, mask);
2429 if (err)
2430 break;
2431 }
2432 } while (pmd++, addr = next, addr != end);
2433 return err;
2434}
2435
2436static int apply_to_pud_range(struct mm_struct *mm, p4d_t *p4d,
2437 unsigned long addr, unsigned long end,
2438 pte_fn_t fn, void *data, bool create,
2439 pgtbl_mod_mask *mask)
2440{
2441 pud_t *pud;
2442 unsigned long next;
2443 int err = 0;
2444
2445 if (create) {
2446 pud = pud_alloc_track(mm, p4d, addr, mask);
2447 if (!pud)
2448 return -ENOMEM;
2449 } else {
2450 pud = pud_offset(p4d, addr);
2451 }
2452 do {
2453 next = pud_addr_end(addr, end);
2454 if (create || !pud_none_or_clear_bad(pud)) {
2455 err = apply_to_pmd_range(mm, pud, addr, next, fn, data,
2456 create, mask);
2457 if (err)
2458 break;
2459 }
2460 } while (pud++, addr = next, addr != end);
2461 return err;
2462}
2463
2464static int apply_to_p4d_range(struct mm_struct *mm, pgd_t *pgd,
2465 unsigned long addr, unsigned long end,
2466 pte_fn_t fn, void *data, bool create,
2467 pgtbl_mod_mask *mask)
2468{
2469 p4d_t *p4d;
2470 unsigned long next;
2471 int err = 0;
2472
2473 if (create) {
2474 p4d = p4d_alloc_track(mm, pgd, addr, mask);
2475 if (!p4d)
2476 return -ENOMEM;
2477 } else {
2478 p4d = p4d_offset(pgd, addr);
2479 }
2480 do {
2481 next = p4d_addr_end(addr, end);
2482 if (create || !p4d_none_or_clear_bad(p4d)) {
2483 err = apply_to_pud_range(mm, p4d, addr, next, fn, data,
2484 create, mask);
2485 if (err)
2486 break;
2487 }
2488 } while (p4d++, addr = next, addr != end);
2489 return err;
2490}
2491
2492static int __apply_to_page_range(struct mm_struct *mm, unsigned long addr,
2493 unsigned long size, pte_fn_t fn,
2494 void *data, bool create)
2495{
2496 pgd_t *pgd;
2497 unsigned long start = addr, next;
2498 unsigned long end = addr + size;
2499 pgtbl_mod_mask mask = 0;
2500 int err = 0;
2501
2502 if (WARN_ON(addr >= end))
2503 return -EINVAL;
2504
2505 pgd = pgd_offset(mm, addr);
2506 do {
2507 next = pgd_addr_end(addr, end);
2508 if (!create && pgd_none_or_clear_bad(pgd))
2509 continue;
2510 err = apply_to_p4d_range(mm, pgd, addr, next, fn, data, create, &mask);
2511 if (err)
2512 break;
2513 } while (pgd++, addr = next, addr != end);
2514
2515 if (mask & ARCH_PAGE_TABLE_SYNC_MASK)
2516 arch_sync_kernel_mappings(start, start + size);
2517
2518 return err;
2519}
2520
2521/*
2522 * Scan a region of virtual memory, filling in page tables as necessary
2523 * and calling a provided function on each leaf page table.
2524 */
2525int apply_to_page_range(struct mm_struct *mm, unsigned long addr,
2526 unsigned long size, pte_fn_t fn, void *data)
2527{
2528 return __apply_to_page_range(mm, addr, size, fn, data, true);
2529}
2530EXPORT_SYMBOL_GPL(apply_to_page_range);
2531
2532/*
2533 * Scan a region of virtual memory, calling a provided function on
2534 * each leaf page table where it exists.
2535 *
2536 * Unlike apply_to_page_range, this does _not_ fill in page tables
2537 * where they are absent.
2538 */
2539int apply_to_existing_page_range(struct mm_struct *mm, unsigned long addr,
2540 unsigned long size, pte_fn_t fn, void *data)
2541{
2542 return __apply_to_page_range(mm, addr, size, fn, data, false);
2543}
2544EXPORT_SYMBOL_GPL(apply_to_existing_page_range);
2545
2546/*
2547 * handle_pte_fault chooses page fault handler according to an entry which was
2548 * read non-atomically. Before making any commitment, on those architectures
2549 * or configurations (e.g. i386 with PAE) which might give a mix of unmatched
2550 * parts, do_swap_page must check under lock before unmapping the pte and
2551 * proceeding (but do_wp_page is only called after already making such a check;
2552 * and do_anonymous_page can safely check later on).
2553 */
2554static inline int pte_unmap_same(struct mm_struct *mm, pmd_t *pmd,
2555 pte_t *page_table, pte_t orig_pte)
2556{
2557 int same = 1;
2558#if defined(CONFIG_SMP) || defined(CONFIG_PREEMPTION)
2559 if (sizeof(pte_t) > sizeof(unsigned long)) {
2560 spinlock_t *ptl = pte_lockptr(mm, pmd);
2561 spin_lock(ptl);
2562 same = pte_same(*page_table, orig_pte);
2563 spin_unlock(ptl);
2564 }
2565#endif
2566 pte_unmap(page_table);
2567 return same;
2568}
2569
2570static inline bool cow_user_page(struct page *dst, struct page *src,
2571 struct vm_fault *vmf)
2572{
2573 bool ret;
2574 void *kaddr;
2575 void __user *uaddr;
2576 bool locked = false;
2577 struct vm_area_struct *vma = vmf->vma;
2578 struct mm_struct *mm = vma->vm_mm;
2579 unsigned long addr = vmf->address;
2580
2581 if (likely(src)) {
2582 copy_user_highpage(dst, src, addr, vma);
2583 return true;
2584 }
2585
2586 /*
2587 * If the source page was a PFN mapping, we don't have
2588 * a "struct page" for it. We do a best-effort copy by
2589 * just copying from the original user address. If that
2590 * fails, we just zero-fill it. Live with it.
2591 */
2592 kaddr = kmap_atomic(dst);
2593 uaddr = (void __user *)(addr & PAGE_MASK);
2594
2595 /*
2596 * On architectures with software "accessed" bits, we would
2597 * take a double page fault, so mark it accessed here.
2598 */
2599 if (arch_faults_on_old_pte() && !pte_young(vmf->orig_pte)) {
2600 pte_t entry;
2601
2602 vmf->pte = pte_offset_map_lock(mm, vmf->pmd, addr, &vmf->ptl);
2603 locked = true;
2604 if (!likely(pte_same(*vmf->pte, vmf->orig_pte))) {
2605 /*
2606 * Other thread has already handled the fault
2607 * and update local tlb only
2608 */
2609 update_mmu_tlb(vma, addr, vmf->pte);
2610 ret = false;
2611 goto pte_unlock;
2612 }
2613
2614 entry = pte_mkyoung(vmf->orig_pte);
2615 if (ptep_set_access_flags(vma, addr, vmf->pte, entry, 0))
2616 update_mmu_cache(vma, addr, vmf->pte);
2617 }
2618
2619 /*
2620 * This really shouldn't fail, because the page is there
2621 * in the page tables. But it might just be unreadable,
2622 * in which case we just give up and fill the result with
2623 * zeroes.
2624 */
2625 if (__copy_from_user_inatomic(kaddr, uaddr, PAGE_SIZE)) {
2626 if (locked)
2627 goto warn;
2628
2629 /* Re-validate under PTL if the page is still mapped */
2630 vmf->pte = pte_offset_map_lock(mm, vmf->pmd, addr, &vmf->ptl);
2631 locked = true;
2632 if (!likely(pte_same(*vmf->pte, vmf->orig_pte))) {
2633 /* The PTE changed under us, update local tlb */
2634 update_mmu_tlb(vma, addr, vmf->pte);
2635 ret = false;
2636 goto pte_unlock;
2637 }
2638
2639 /*
2640 * The same page can be mapped back since last copy attempt.
2641 * Try to copy again under PTL.
2642 */
2643 if (__copy_from_user_inatomic(kaddr, uaddr, PAGE_SIZE)) {
2644 /*
2645 * Give a warn in case there can be some obscure
2646 * use-case
2647 */
2648warn:
2649 WARN_ON_ONCE(1);
2650 clear_page(kaddr);
2651 }
2652 }
2653
2654 ret = true;
2655
2656pte_unlock:
2657 if (locked)
2658 pte_unmap_unlock(vmf->pte, vmf->ptl);
2659 kunmap_atomic(kaddr);
2660 flush_dcache_page(dst);
2661
2662 return ret;
2663}
2664
2665static gfp_t __get_fault_gfp_mask(struct vm_area_struct *vma)
2666{
2667 struct file *vm_file = vma->vm_file;
2668
2669 if (vm_file)
2670 return mapping_gfp_mask(vm_file->f_mapping) | __GFP_FS | __GFP_IO;
2671
2672 /*
2673 * Special mappings (e.g. VDSO) do not have any file so fake
2674 * a default GFP_KERNEL for them.
2675 */
2676 return GFP_KERNEL;
2677}
2678
2679/*
2680 * Notify the address space that the page is about to become writable so that
2681 * it can prohibit this or wait for the page to get into an appropriate state.
2682 *
2683 * We do this without the lock held, so that it can sleep if it needs to.
2684 */
2685static vm_fault_t do_page_mkwrite(struct vm_fault *vmf)
2686{
2687 vm_fault_t ret;
2688 struct page *page = vmf->page;
2689 unsigned int old_flags = vmf->flags;
2690
2691 vmf->flags = FAULT_FLAG_WRITE|FAULT_FLAG_MKWRITE;
2692
2693 if (vmf->vma->vm_file &&
2694 IS_SWAPFILE(vmf->vma->vm_file->f_mapping->host))
2695 return VM_FAULT_SIGBUS;
2696
2697 ret = vmf->vma->vm_ops->page_mkwrite(vmf);
2698 /* Restore original flags so that caller is not surprised */
2699 vmf->flags = old_flags;
2700 if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE)))
2701 return ret;
2702 if (unlikely(!(ret & VM_FAULT_LOCKED))) {
2703 lock_page(page);
2704 if (!page->mapping) {
2705 unlock_page(page);
2706 return 0; /* retry */
2707 }
2708 ret |= VM_FAULT_LOCKED;
2709 } else
2710 VM_BUG_ON_PAGE(!PageLocked(page), page);
2711 return ret;
2712}
2713
2714/*
2715 * Handle dirtying of a page in shared file mapping on a write fault.
2716 *
2717 * The function expects the page to be locked and unlocks it.
2718 */
2719static vm_fault_t fault_dirty_shared_page(struct vm_fault *vmf)
2720{
2721 struct vm_area_struct *vma = vmf->vma;
2722 struct address_space *mapping;
2723 struct page *page = vmf->page;
2724 bool dirtied;
2725 bool page_mkwrite = vma->vm_ops && vma->vm_ops->page_mkwrite;
2726
2727 dirtied = set_page_dirty(page);
2728 VM_BUG_ON_PAGE(PageAnon(page), page);
2729 /*
2730 * Take a local copy of the address_space - page.mapping may be zeroed
2731 * by truncate after unlock_page(). The address_space itself remains
2732 * pinned by vma->vm_file's reference. We rely on unlock_page()'s
2733 * release semantics to prevent the compiler from undoing this copying.
2734 */
2735 mapping = page_rmapping(page);
2736 unlock_page(page);
2737
2738 if (!page_mkwrite)
2739 file_update_time(vma->vm_file);
2740
2741 /*
2742 * Throttle page dirtying rate down to writeback speed.
2743 *
2744 * mapping may be NULL here because some device drivers do not
2745 * set page.mapping but still dirty their pages
2746 *
2747 * Drop the mmap_lock before waiting on IO, if we can. The file
2748 * is pinning the mapping, as per above.
2749 */
2750 if ((dirtied || page_mkwrite) && mapping) {
2751 struct file *fpin;
2752
2753 fpin = maybe_unlock_mmap_for_io(vmf, NULL);
2754 balance_dirty_pages_ratelimited(mapping);
2755 if (fpin) {
2756 fput(fpin);
2757 return VM_FAULT_RETRY;
2758 }
2759 }
2760
2761 return 0;
2762}
2763
2764/*
2765 * Handle write page faults for pages that can be reused in the current vma
2766 *
2767 * This can happen either due to the mapping being with the VM_SHARED flag,
2768 * or due to us being the last reference standing to the page. In either
2769 * case, all we need to do here is to mark the page as writable and update
2770 * any related book-keeping.
2771 */
2772static inline void wp_page_reuse(struct vm_fault *vmf)
2773 __releases(vmf->ptl)
2774{
2775 struct vm_area_struct *vma = vmf->vma;
2776 struct page *page = vmf->page;
2777 pte_t entry;
2778 /*
2779 * Clear the pages cpupid information as the existing
2780 * information potentially belongs to a now completely
2781 * unrelated process.
2782 */
2783 if (page)
2784 page_cpupid_xchg_last(page, (1 << LAST_CPUPID_SHIFT) - 1);
2785
2786 flush_cache_page(vma, vmf->address, pte_pfn(vmf->orig_pte));
2787 entry = pte_mkyoung(vmf->orig_pte);
2788 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
2789 if (ptep_set_access_flags(vma, vmf->address, vmf->pte, entry, 1))
2790 update_mmu_cache(vma, vmf->address, vmf->pte);
2791 pte_unmap_unlock(vmf->pte, vmf->ptl);
2792 count_vm_event(PGREUSE);
2793}
2794
2795/*
2796 * Handle the case of a page which we actually need to copy to a new page.
2797 *
2798 * Called with mmap_lock locked and the old page referenced, but
2799 * without the ptl held.
2800 *
2801 * High level logic flow:
2802 *
2803 * - Allocate a page, copy the content of the old page to the new one.
2804 * - Handle book keeping and accounting - cgroups, mmu-notifiers, etc.
2805 * - Take the PTL. If the pte changed, bail out and release the allocated page
2806 * - If the pte is still the way we remember it, update the page table and all
2807 * relevant references. This includes dropping the reference the page-table
2808 * held to the old page, as well as updating the rmap.
2809 * - In any case, unlock the PTL and drop the reference we took to the old page.
2810 */
2811static vm_fault_t wp_page_copy(struct vm_fault *vmf)
2812{
2813 struct vm_area_struct *vma = vmf->vma;
2814 struct mm_struct *mm = vma->vm_mm;
2815 struct page *old_page = vmf->page;
2816 struct page *new_page = NULL;
2817 pte_t entry;
2818 int page_copied = 0;
2819 struct mmu_notifier_range range;
2820
2821 if (unlikely(anon_vma_prepare(vma)))
2822 goto oom;
2823
2824 if (is_zero_pfn(pte_pfn(vmf->orig_pte))) {
2825 new_page = alloc_zeroed_user_highpage_movable(vma,
2826 vmf->address);
2827 if (!new_page)
2828 goto oom;
2829 } else {
2830 new_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma,
2831 vmf->address);
2832 if (!new_page)
2833 goto oom;
2834
2835 if (!cow_user_page(new_page, old_page, vmf)) {
2836 /*
2837 * COW failed, if the fault was solved by other,
2838 * it's fine. If not, userspace would re-fault on
2839 * the same address and we will handle the fault
2840 * from the second attempt.
2841 */
2842 put_page(new_page);
2843 if (old_page)
2844 put_page(old_page);
2845 return 0;
2846 }
2847 }
2848
2849 if (mem_cgroup_charge(new_page, mm, GFP_KERNEL))
2850 goto oom_free_new;
2851 cgroup_throttle_swaprate(new_page, GFP_KERNEL);
2852
2853 __SetPageUptodate(new_page);
2854
2855 mmu_notifier_range_init(&range, MMU_NOTIFY_CLEAR, 0, vma, mm,
2856 vmf->address & PAGE_MASK,
2857 (vmf->address & PAGE_MASK) + PAGE_SIZE);
2858 mmu_notifier_invalidate_range_start(&range);
2859
2860 /*
2861 * Re-check the pte - we dropped the lock
2862 */
2863 vmf->pte = pte_offset_map_lock(mm, vmf->pmd, vmf->address, &vmf->ptl);
2864 if (likely(pte_same(*vmf->pte, vmf->orig_pte))) {
2865 if (old_page) {
2866 if (!PageAnon(old_page)) {
2867 dec_mm_counter_fast(mm,
2868 mm_counter_file(old_page));
2869 inc_mm_counter_fast(mm, MM_ANONPAGES);
2870 }
2871 } else {
2872 inc_mm_counter_fast(mm, MM_ANONPAGES);
2873 }
2874 flush_cache_page(vma, vmf->address, pte_pfn(vmf->orig_pte));
2875 entry = mk_pte(new_page, vma->vm_page_prot);
2876 entry = pte_sw_mkyoung(entry);
2877 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
2878 /*
2879 * Clear the pte entry and flush it first, before updating the
2880 * pte with the new entry. This will avoid a race condition
2881 * seen in the presence of one thread doing SMC and another
2882 * thread doing COW.
2883 */
2884 ptep_clear_flush_notify(vma, vmf->address, vmf->pte);
2885 page_add_new_anon_rmap(new_page, vma, vmf->address, false);
2886 lru_cache_add_inactive_or_unevictable(new_page, vma);
2887 /*
2888 * We call the notify macro here because, when using secondary
2889 * mmu page tables (such as kvm shadow page tables), we want the
2890 * new page to be mapped directly into the secondary page table.
2891 */
2892 set_pte_at_notify(mm, vmf->address, vmf->pte, entry);
2893 update_mmu_cache(vma, vmf->address, vmf->pte);
2894 if (old_page) {
2895 /*
2896 * Only after switching the pte to the new page may
2897 * we remove the mapcount here. Otherwise another
2898 * process may come and find the rmap count decremented
2899 * before the pte is switched to the new page, and
2900 * "reuse" the old page writing into it while our pte
2901 * here still points into it and can be read by other
2902 * threads.
2903 *
2904 * The critical issue is to order this
2905 * page_remove_rmap with the ptp_clear_flush above.
2906 * Those stores are ordered by (if nothing else,)
2907 * the barrier present in the atomic_add_negative
2908 * in page_remove_rmap.
2909 *
2910 * Then the TLB flush in ptep_clear_flush ensures that
2911 * no process can access the old page before the
2912 * decremented mapcount is visible. And the old page
2913 * cannot be reused until after the decremented
2914 * mapcount is visible. So transitively, TLBs to
2915 * old page will be flushed before it can be reused.
2916 */
2917 page_remove_rmap(old_page, false);
2918 }
2919
2920 /* Free the old page.. */
2921 new_page = old_page;
2922 page_copied = 1;
2923 } else {
2924 update_mmu_tlb(vma, vmf->address, vmf->pte);
2925 }
2926
2927 if (new_page)
2928 put_page(new_page);
2929
2930 pte_unmap_unlock(vmf->pte, vmf->ptl);
2931 /*
2932 * No need to double call mmu_notifier->invalidate_range() callback as
2933 * the above ptep_clear_flush_notify() did already call it.
2934 */
2935 mmu_notifier_invalidate_range_only_end(&range);
2936 if (old_page) {
2937 /*
2938 * Don't let another task, with possibly unlocked vma,
2939 * keep the mlocked page.
2940 */
2941 if (page_copied && (vma->vm_flags & VM_LOCKED)) {
2942 lock_page(old_page); /* LRU manipulation */
2943 if (PageMlocked(old_page))
2944 munlock_vma_page(old_page);
2945 unlock_page(old_page);
2946 }
2947 put_page(old_page);
2948 }
2949 return page_copied ? VM_FAULT_WRITE : 0;
2950oom_free_new:
2951 put_page(new_page);
2952oom:
2953 if (old_page)
2954 put_page(old_page);
2955 return VM_FAULT_OOM;
2956}
2957
2958/**
2959 * finish_mkwrite_fault - finish page fault for a shared mapping, making PTE
2960 * writeable once the page is prepared
2961 *
2962 * @vmf: structure describing the fault
2963 *
2964 * This function handles all that is needed to finish a write page fault in a
2965 * shared mapping due to PTE being read-only once the mapped page is prepared.
2966 * It handles locking of PTE and modifying it.
2967 *
2968 * The function expects the page to be locked or other protection against
2969 * concurrent faults / writeback (such as DAX radix tree locks).
2970 *
2971 * Return: %VM_FAULT_WRITE on success, %0 when PTE got changed before
2972 * we acquired PTE lock.
2973 */
2974vm_fault_t finish_mkwrite_fault(struct vm_fault *vmf)
2975{
2976 WARN_ON_ONCE(!(vmf->vma->vm_flags & VM_SHARED));
2977 vmf->pte = pte_offset_map_lock(vmf->vma->vm_mm, vmf->pmd, vmf->address,
2978 &vmf->ptl);
2979 /*
2980 * We might have raced with another page fault while we released the
2981 * pte_offset_map_lock.
2982 */
2983 if (!pte_same(*vmf->pte, vmf->orig_pte)) {
2984 update_mmu_tlb(vmf->vma, vmf->address, vmf->pte);
2985 pte_unmap_unlock(vmf->pte, vmf->ptl);
2986 return VM_FAULT_NOPAGE;
2987 }
2988 wp_page_reuse(vmf);
2989 return 0;
2990}
2991
2992/*
2993 * Handle write page faults for VM_MIXEDMAP or VM_PFNMAP for a VM_SHARED
2994 * mapping
2995 */
2996static vm_fault_t wp_pfn_shared(struct vm_fault *vmf)
2997{
2998 struct vm_area_struct *vma = vmf->vma;
2999
3000 if (vma->vm_ops && vma->vm_ops->pfn_mkwrite) {
3001 vm_fault_t ret;
3002
3003 pte_unmap_unlock(vmf->pte, vmf->ptl);
3004 vmf->flags |= FAULT_FLAG_MKWRITE;
3005 ret = vma->vm_ops->pfn_mkwrite(vmf);
3006 if (ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE))
3007 return ret;
3008 return finish_mkwrite_fault(vmf);
3009 }
3010 wp_page_reuse(vmf);
3011 return VM_FAULT_WRITE;
3012}
3013
3014static vm_fault_t wp_page_shared(struct vm_fault *vmf)
3015 __releases(vmf->ptl)
3016{
3017 struct vm_area_struct *vma = vmf->vma;
3018 vm_fault_t ret = VM_FAULT_WRITE;
3019
3020 get_page(vmf->page);
3021
3022 if (vma->vm_ops && vma->vm_ops->page_mkwrite) {
3023 vm_fault_t tmp;
3024
3025 pte_unmap_unlock(vmf->pte, vmf->ptl);
3026 tmp = do_page_mkwrite(vmf);
3027 if (unlikely(!tmp || (tmp &
3028 (VM_FAULT_ERROR | VM_FAULT_NOPAGE)))) {
3029 put_page(vmf->page);
3030 return tmp;
3031 }
3032 tmp = finish_mkwrite_fault(vmf);
3033 if (unlikely(tmp & (VM_FAULT_ERROR | VM_FAULT_NOPAGE))) {
3034 unlock_page(vmf->page);
3035 put_page(vmf->page);
3036 return tmp;
3037 }
3038 } else {
3039 wp_page_reuse(vmf);
3040 lock_page(vmf->page);
3041 }
3042 ret |= fault_dirty_shared_page(vmf);
3043 put_page(vmf->page);
3044
3045 return ret;
3046}
3047
3048/*
3049 * This routine handles present pages, when users try to write
3050 * to a shared page. It is done by copying the page to a new address
3051 * and decrementing the shared-page counter for the old page.
3052 *
3053 * Note that this routine assumes that the protection checks have been
3054 * done by the caller (the low-level page fault routine in most cases).
3055 * Thus we can safely just mark it writable once we've done any necessary
3056 * COW.
3057 *
3058 * We also mark the page dirty at this point even though the page will
3059 * change only once the write actually happens. This avoids a few races,
3060 * and potentially makes it more efficient.
3061 *
3062 * We enter with non-exclusive mmap_lock (to exclude vma changes,
3063 * but allow concurrent faults), with pte both mapped and locked.
3064 * We return with mmap_lock still held, but pte unmapped and unlocked.
3065 */
3066static vm_fault_t do_wp_page(struct vm_fault *vmf)
3067 __releases(vmf->ptl)
3068{
3069 struct vm_area_struct *vma = vmf->vma;
3070
3071 if (userfaultfd_pte_wp(vma, *vmf->pte)) {
3072 pte_unmap_unlock(vmf->pte, vmf->ptl);
3073 return handle_userfault(vmf, VM_UFFD_WP);
3074 }
3075
3076 vmf->page = vm_normal_page(vma, vmf->address, vmf->orig_pte);
3077 if (!vmf->page) {
3078 /*
3079 * VM_MIXEDMAP !pfn_valid() case, or VM_SOFTDIRTY clear on a
3080 * VM_PFNMAP VMA.
3081 *
3082 * We should not cow pages in a shared writeable mapping.
3083 * Just mark the pages writable and/or call ops->pfn_mkwrite.
3084 */
3085 if ((vma->vm_flags & (VM_WRITE|VM_SHARED)) ==
3086 (VM_WRITE|VM_SHARED))
3087 return wp_pfn_shared(vmf);
3088
3089 pte_unmap_unlock(vmf->pte, vmf->ptl);
3090 return wp_page_copy(vmf);
3091 }
3092
3093 /*
3094 * Take out anonymous pages first, anonymous shared vmas are
3095 * not dirty accountable.
3096 */
3097 if (PageAnon(vmf->page)) {
3098 struct page *page = vmf->page;
3099
3100 /* PageKsm() doesn't necessarily raise the page refcount */
3101 if (PageKsm(page) || page_count(page) != 1)
3102 goto copy;
3103 if (!trylock_page(page))
3104 goto copy;
3105 if (PageKsm(page) || page_mapcount(page) != 1 || page_count(page) != 1) {
3106 unlock_page(page);
3107 goto copy;
3108 }
3109 /*
3110 * Ok, we've got the only map reference, and the only
3111 * page count reference, and the page is locked,
3112 * it's dark out, and we're wearing sunglasses. Hit it.
3113 */
3114 unlock_page(page);
3115 wp_page_reuse(vmf);
3116 return VM_FAULT_WRITE;
3117 } else if (unlikely((vma->vm_flags & (VM_WRITE|VM_SHARED)) ==
3118 (VM_WRITE|VM_SHARED))) {
3119 return wp_page_shared(vmf);
3120 }
3121copy:
3122 /*
3123 * Ok, we need to copy. Oh, well..
3124 */
3125 get_page(vmf->page);
3126
3127 pte_unmap_unlock(vmf->pte, vmf->ptl);
3128 return wp_page_copy(vmf);
3129}
3130
3131static void unmap_mapping_range_vma(struct vm_area_struct *vma,
3132 unsigned long start_addr, unsigned long end_addr,
3133 struct zap_details *details)
3134{
3135 zap_page_range_single(vma, start_addr, end_addr - start_addr, details);
3136}
3137
3138static inline void unmap_mapping_range_tree(struct rb_root_cached *root,
3139 struct zap_details *details)
3140{
3141 struct vm_area_struct *vma;
3142 pgoff_t vba, vea, zba, zea;
3143
3144 vma_interval_tree_foreach(vma, root,
3145 details->first_index, details->last_index) {
3146
3147 vba = vma->vm_pgoff;
3148 vea = vba + vma_pages(vma) - 1;
3149 zba = details->first_index;
3150 if (zba < vba)
3151 zba = vba;
3152 zea = details->last_index;
3153 if (zea > vea)
3154 zea = vea;
3155
3156 unmap_mapping_range_vma(vma,
3157 ((zba - vba) << PAGE_SHIFT) + vma->vm_start,
3158 ((zea - vba + 1) << PAGE_SHIFT) + vma->vm_start,
3159 details);
3160 }
3161}
3162
3163/**
3164 * unmap_mapping_pages() - Unmap pages from processes.
3165 * @mapping: The address space containing pages to be unmapped.
3166 * @start: Index of first page to be unmapped.
3167 * @nr: Number of pages to be unmapped. 0 to unmap to end of file.
3168 * @even_cows: Whether to unmap even private COWed pages.
3169 *
3170 * Unmap the pages in this address space from any userspace process which
3171 * has them mmaped. Generally, you want to remove COWed pages as well when
3172 * a file is being truncated, but not when invalidating pages from the page
3173 * cache.
3174 */
3175void unmap_mapping_pages(struct address_space *mapping, pgoff_t start,
3176 pgoff_t nr, bool even_cows)
3177{
3178 struct zap_details details = { };
3179
3180 details.check_mapping = even_cows ? NULL : mapping;
3181 details.first_index = start;
3182 details.last_index = start + nr - 1;
3183 if (details.last_index < details.first_index)
3184 details.last_index = ULONG_MAX;
3185
3186 i_mmap_lock_write(mapping);
3187 if (unlikely(!RB_EMPTY_ROOT(&mapping->i_mmap.rb_root)))
3188 unmap_mapping_range_tree(&mapping->i_mmap, &details);
3189 i_mmap_unlock_write(mapping);
3190}
3191
3192/**
3193 * unmap_mapping_range - unmap the portion of all mmaps in the specified
3194 * address_space corresponding to the specified byte range in the underlying
3195 * file.
3196 *
3197 * @mapping: the address space containing mmaps to be unmapped.
3198 * @holebegin: byte in first page to unmap, relative to the start of
3199 * the underlying file. This will be rounded down to a PAGE_SIZE
3200 * boundary. Note that this is different from truncate_pagecache(), which
3201 * must keep the partial page. In contrast, we must get rid of
3202 * partial pages.
3203 * @holelen: size of prospective hole in bytes. This will be rounded
3204 * up to a PAGE_SIZE boundary. A holelen of zero truncates to the
3205 * end of the file.
3206 * @even_cows: 1 when truncating a file, unmap even private COWed pages;
3207 * but 0 when invalidating pagecache, don't throw away private data.
3208 */
3209void unmap_mapping_range(struct address_space *mapping,
3210 loff_t const holebegin, loff_t const holelen, int even_cows)
3211{
3212 pgoff_t hba = holebegin >> PAGE_SHIFT;
3213 pgoff_t hlen = (holelen + PAGE_SIZE - 1) >> PAGE_SHIFT;
3214
3215 /* Check for overflow. */
3216 if (sizeof(holelen) > sizeof(hlen)) {
3217 long long holeend =
3218 (holebegin + holelen + PAGE_SIZE - 1) >> PAGE_SHIFT;
3219 if (holeend & ~(long long)ULONG_MAX)
3220 hlen = ULONG_MAX - hba + 1;
3221 }
3222
3223 unmap_mapping_pages(mapping, hba, hlen, even_cows);
3224}
3225EXPORT_SYMBOL(unmap_mapping_range);
3226
3227/*
3228 * We enter with non-exclusive mmap_lock (to exclude vma changes,
3229 * but allow concurrent faults), and pte mapped but not yet locked.
3230 * We return with pte unmapped and unlocked.
3231 *
3232 * We return with the mmap_lock locked or unlocked in the same cases
3233 * as does filemap_fault().
3234 */
3235vm_fault_t do_swap_page(struct vm_fault *vmf)
3236{
3237 struct vm_area_struct *vma = vmf->vma;
3238 struct page *page = NULL, *swapcache;
3239 swp_entry_t entry;
3240 pte_t pte;
3241 int locked;
3242 int exclusive = 0;
3243 vm_fault_t ret = 0;
3244 void *shadow = NULL;
3245
3246 if (!pte_unmap_same(vma->vm_mm, vmf->pmd, vmf->pte, vmf->orig_pte))
3247 goto out;
3248
3249 entry = pte_to_swp_entry(vmf->orig_pte);
3250 if (unlikely(non_swap_entry(entry))) {
3251 if (is_migration_entry(entry)) {
3252 migration_entry_wait(vma->vm_mm, vmf->pmd,
3253 vmf->address);
3254 } else if (is_device_private_entry(entry)) {
3255 vmf->page = device_private_entry_to_page(entry);
3256 ret = vmf->page->pgmap->ops->migrate_to_ram(vmf);
3257 } else if (is_hwpoison_entry(entry)) {
3258 ret = VM_FAULT_HWPOISON;
3259 } else {
3260 print_bad_pte(vma, vmf->address, vmf->orig_pte, NULL);
3261 ret = VM_FAULT_SIGBUS;
3262 }
3263 goto out;
3264 }
3265
3266
3267 delayacct_set_flag(DELAYACCT_PF_SWAPIN);
3268 page = lookup_swap_cache(entry, vma, vmf->address);
3269 swapcache = page;
3270
3271 if (!page) {
3272 struct swap_info_struct *si = swp_swap_info(entry);
3273
3274 if (data_race(si->flags & SWP_SYNCHRONOUS_IO) &&
3275 __swap_count(entry) == 1) {
3276 /* skip swapcache */
3277 page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma,
3278 vmf->address);
3279 if (page) {
3280 int err;
3281
3282 __SetPageLocked(page);
3283 __SetPageSwapBacked(page);
3284 set_page_private(page, entry.val);
3285
3286 /* Tell memcg to use swap ownership records */
3287 SetPageSwapCache(page);
3288 err = mem_cgroup_charge(page, vma->vm_mm,
3289 GFP_KERNEL);
3290 ClearPageSwapCache(page);
3291 if (err) {
3292 ret = VM_FAULT_OOM;
3293 goto out_page;
3294 }
3295
3296 shadow = get_shadow_from_swap_cache(entry);
3297 if (shadow)
3298 workingset_refault(page, shadow);
3299
3300 lru_cache_add(page);
3301 swap_readpage(page, true);
3302 }
3303 } else {
3304 page = swapin_readahead(entry, GFP_HIGHUSER_MOVABLE,
3305 vmf);
3306 swapcache = page;
3307 }
3308
3309 if (!page) {
3310 /*
3311 * Back out if somebody else faulted in this pte
3312 * while we released the pte lock.
3313 */
3314 vmf->pte = pte_offset_map_lock(vma->vm_mm, vmf->pmd,
3315 vmf->address, &vmf->ptl);
3316 if (likely(pte_same(*vmf->pte, vmf->orig_pte)))
3317 ret = VM_FAULT_OOM;
3318 delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
3319 goto unlock;
3320 }
3321
3322 /* Had to read the page from swap area: Major fault */
3323 ret = VM_FAULT_MAJOR;
3324 count_vm_event(PGMAJFAULT);
3325 count_memcg_event_mm(vma->vm_mm, PGMAJFAULT);
3326 } else if (PageHWPoison(page)) {
3327 /*
3328 * hwpoisoned dirty swapcache pages are kept for killing
3329 * owner processes (which may be unknown at hwpoison time)
3330 */
3331 ret = VM_FAULT_HWPOISON;
3332 delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
3333 goto out_release;
3334 }
3335
3336 locked = lock_page_or_retry(page, vma->vm_mm, vmf->flags);
3337
3338 delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
3339 if (!locked) {
3340 ret |= VM_FAULT_RETRY;
3341 goto out_release;
3342 }
3343
3344 /*
3345 * Make sure try_to_free_swap or reuse_swap_page or swapoff did not
3346 * release the swapcache from under us. The page pin, and pte_same
3347 * test below, are not enough to exclude that. Even if it is still
3348 * swapcache, we need to check that the page's swap has not changed.
3349 */
3350 if (unlikely((!PageSwapCache(page) ||
3351 page_private(page) != entry.val)) && swapcache)
3352 goto out_page;
3353
3354 page = ksm_might_need_to_copy(page, vma, vmf->address);
3355 if (unlikely(!page)) {
3356 ret = VM_FAULT_OOM;
3357 page = swapcache;
3358 goto out_page;
3359 }
3360
3361 cgroup_throttle_swaprate(page, GFP_KERNEL);
3362
3363 /*
3364 * Back out if somebody else already faulted in this pte.
3365 */
3366 vmf->pte = pte_offset_map_lock(vma->vm_mm, vmf->pmd, vmf->address,
3367 &vmf->ptl);
3368 if (unlikely(!pte_same(*vmf->pte, vmf->orig_pte)))
3369 goto out_nomap;
3370
3371 if (unlikely(!PageUptodate(page))) {
3372 ret = VM_FAULT_SIGBUS;
3373 goto out_nomap;
3374 }
3375
3376 /*
3377 * The page isn't present yet, go ahead with the fault.
3378 *
3379 * Be careful about the sequence of operations here.
3380 * To get its accounting right, reuse_swap_page() must be called
3381 * while the page is counted on swap but not yet in mapcount i.e.
3382 * before page_add_anon_rmap() and swap_free(); try_to_free_swap()
3383 * must be called after the swap_free(), or it will never succeed.
3384 */
3385
3386 inc_mm_counter_fast(vma->vm_mm, MM_ANONPAGES);
3387 dec_mm_counter_fast(vma->vm_mm, MM_SWAPENTS);
3388 pte = mk_pte(page, vma->vm_page_prot);
3389 if ((vmf->flags & FAULT_FLAG_WRITE) && reuse_swap_page(page, NULL)) {
3390 pte = maybe_mkwrite(pte_mkdirty(pte), vma);
3391 vmf->flags &= ~FAULT_FLAG_WRITE;
3392 ret |= VM_FAULT_WRITE;
3393 exclusive = RMAP_EXCLUSIVE;
3394 }
3395 flush_icache_page(vma, page);
3396 if (pte_swp_soft_dirty(vmf->orig_pte))
3397 pte = pte_mksoft_dirty(pte);
3398 if (pte_swp_uffd_wp(vmf->orig_pte)) {
3399 pte = pte_mkuffd_wp(pte);
3400 pte = pte_wrprotect(pte);
3401 }
3402 set_pte_at(vma->vm_mm, vmf->address, vmf->pte, pte);
3403 arch_do_swap_page(vma->vm_mm, vma, vmf->address, pte, vmf->orig_pte);
3404 vmf->orig_pte = pte;
3405
3406 /* ksm created a completely new copy */
3407 if (unlikely(page != swapcache && swapcache)) {
3408 page_add_new_anon_rmap(page, vma, vmf->address, false);
3409 lru_cache_add_inactive_or_unevictable(page, vma);
3410 } else {
3411 do_page_add_anon_rmap(page, vma, vmf->address, exclusive);
3412 }
3413
3414 swap_free(entry);
3415 if (mem_cgroup_swap_full(page) ||
3416 (vma->vm_flags & VM_LOCKED) || PageMlocked(page))
3417 try_to_free_swap(page);
3418 unlock_page(page);
3419 if (page != swapcache && swapcache) {
3420 /*
3421 * Hold the lock to avoid the swap entry to be reused
3422 * until we take the PT lock for the pte_same() check
3423 * (to avoid false positives from pte_same). For
3424 * further safety release the lock after the swap_free
3425 * so that the swap count won't change under a
3426 * parallel locked swapcache.
3427 */
3428 unlock_page(swapcache);
3429 put_page(swapcache);
3430 }
3431
3432 if (vmf->flags & FAULT_FLAG_WRITE) {
3433 ret |= do_wp_page(vmf);
3434 if (ret & VM_FAULT_ERROR)
3435 ret &= VM_FAULT_ERROR;
3436 goto out;
3437 }
3438
3439 /* No need to invalidate - it was non-present before */
3440 update_mmu_cache(vma, vmf->address, vmf->pte);
3441unlock:
3442 pte_unmap_unlock(vmf->pte, vmf->ptl);
3443out:
3444 return ret;
3445out_nomap:
3446 pte_unmap_unlock(vmf->pte, vmf->ptl);
3447out_page:
3448 unlock_page(page);
3449out_release:
3450 put_page(page);
3451 if (page != swapcache && swapcache) {
3452 unlock_page(swapcache);
3453 put_page(swapcache);
3454 }
3455 return ret;
3456}
3457
3458/*
3459 * We enter with non-exclusive mmap_lock (to exclude vma changes,
3460 * but allow concurrent faults), and pte mapped but not yet locked.
3461 * We return with mmap_lock still held, but pte unmapped and unlocked.
3462 */
3463static vm_fault_t do_anonymous_page(struct vm_fault *vmf)
3464{
3465 struct vm_area_struct *vma = vmf->vma;
3466 struct page *page;
3467 vm_fault_t ret = 0;
3468 pte_t entry;
3469
3470 /* File mapping without ->vm_ops ? */
3471 if (vma->vm_flags & VM_SHARED)
3472 return VM_FAULT_SIGBUS;
3473
3474 /*
3475 * Use pte_alloc() instead of pte_alloc_map(). We can't run
3476 * pte_offset_map() on pmds where a huge pmd might be created
3477 * from a different thread.
3478 *
3479 * pte_alloc_map() is safe to use under mmap_write_lock(mm) or when
3480 * parallel threads are excluded by other means.
3481 *
3482 * Here we only have mmap_read_lock(mm).
3483 */
3484 if (pte_alloc(vma->vm_mm, vmf->pmd))
3485 return VM_FAULT_OOM;
3486
3487 /* See the comment in pte_alloc_one_map() */
3488 if (unlikely(pmd_trans_unstable(vmf->pmd)))
3489 return 0;
3490
3491 /* Use the zero-page for reads */
3492 if (!(vmf->flags & FAULT_FLAG_WRITE) &&
3493 !mm_forbids_zeropage(vma->vm_mm)) {
3494 entry = pte_mkspecial(pfn_pte(my_zero_pfn(vmf->address),
3495 vma->vm_page_prot));
3496 vmf->pte = pte_offset_map_lock(vma->vm_mm, vmf->pmd,
3497 vmf->address, &vmf->ptl);
3498 if (!pte_none(*vmf->pte)) {
3499 update_mmu_tlb(vma, vmf->address, vmf->pte);
3500 goto unlock;
3501 }
3502 ret = check_stable_address_space(vma->vm_mm);
3503 if (ret)
3504 goto unlock;
3505 /* Deliver the page fault to userland, check inside PT lock */
3506 if (userfaultfd_missing(vma)) {
3507 pte_unmap_unlock(vmf->pte, vmf->ptl);
3508 return handle_userfault(vmf, VM_UFFD_MISSING);
3509 }
3510 goto setpte;
3511 }
3512
3513 /* Allocate our own private page. */
3514 if (unlikely(anon_vma_prepare(vma)))
3515 goto oom;
3516 page = alloc_zeroed_user_highpage_movable(vma, vmf->address);
3517 if (!page)
3518 goto oom;
3519
3520 if (mem_cgroup_charge(page, vma->vm_mm, GFP_KERNEL))
3521 goto oom_free_page;
3522 cgroup_throttle_swaprate(page, GFP_KERNEL);
3523
3524 /*
3525 * The memory barrier inside __SetPageUptodate makes sure that
3526 * preceding stores to the page contents become visible before
3527 * the set_pte_at() write.
3528 */
3529 __SetPageUptodate(page);
3530
3531 entry = mk_pte(page, vma->vm_page_prot);
3532 entry = pte_sw_mkyoung(entry);
3533 if (vma->vm_flags & VM_WRITE)
3534 entry = pte_mkwrite(pte_mkdirty(entry));
3535
3536 vmf->pte = pte_offset_map_lock(vma->vm_mm, vmf->pmd, vmf->address,
3537 &vmf->ptl);
3538 if (!pte_none(*vmf->pte)) {
3539 update_mmu_cache(vma, vmf->address, vmf->pte);
3540 goto release;
3541 }
3542
3543 ret = check_stable_address_space(vma->vm_mm);
3544 if (ret)
3545 goto release;
3546
3547 /* Deliver the page fault to userland, check inside PT lock */
3548 if (userfaultfd_missing(vma)) {
3549 pte_unmap_unlock(vmf->pte, vmf->ptl);
3550 put_page(page);
3551 return handle_userfault(vmf, VM_UFFD_MISSING);
3552 }
3553
3554 inc_mm_counter_fast(vma->vm_mm, MM_ANONPAGES);
3555 page_add_new_anon_rmap(page, vma, vmf->address, false);
3556 lru_cache_add_inactive_or_unevictable(page, vma);
3557setpte:
3558 set_pte_at(vma->vm_mm, vmf->address, vmf->pte, entry);
3559
3560 /* No need to invalidate - it was non-present before */
3561 update_mmu_cache(vma, vmf->address, vmf->pte);
3562unlock:
3563 pte_unmap_unlock(vmf->pte, vmf->ptl);
3564 return ret;
3565release:
3566 put_page(page);
3567 goto unlock;
3568oom_free_page:
3569 put_page(page);
3570oom:
3571 return VM_FAULT_OOM;
3572}
3573
3574/*
3575 * The mmap_lock must have been held on entry, and may have been
3576 * released depending on flags and vma->vm_ops->fault() return value.
3577 * See filemap_fault() and __lock_page_retry().
3578 */
3579static vm_fault_t __do_fault(struct vm_fault *vmf)
3580{
3581 struct vm_area_struct *vma = vmf->vma;
3582 vm_fault_t ret;
3583
3584 /*
3585 * Preallocate pte before we take page_lock because this might lead to
3586 * deadlocks for memcg reclaim which waits for pages under writeback:
3587 * lock_page(A)
3588 * SetPageWriteback(A)
3589 * unlock_page(A)
3590 * lock_page(B)
3591 * lock_page(B)
3592 * pte_alloc_pne
3593 * shrink_page_list
3594 * wait_on_page_writeback(A)
3595 * SetPageWriteback(B)
3596 * unlock_page(B)
3597 * # flush A, B to clear the writeback
3598 */
3599 if (pmd_none(*vmf->pmd) && !vmf->prealloc_pte) {
3600 vmf->prealloc_pte = pte_alloc_one(vmf->vma->vm_mm);
3601 if (!vmf->prealloc_pte)
3602 return VM_FAULT_OOM;
3603 smp_wmb(); /* See comment in __pte_alloc() */
3604 }
3605
3606 ret = vma->vm_ops->fault(vmf);
3607 if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE | VM_FAULT_RETRY |
3608 VM_FAULT_DONE_COW)))
3609 return ret;
3610
3611 if (unlikely(PageHWPoison(vmf->page))) {
3612 if (ret & VM_FAULT_LOCKED)
3613 unlock_page(vmf->page);
3614 put_page(vmf->page);
3615 vmf->page = NULL;
3616 return VM_FAULT_HWPOISON;
3617 }
3618
3619 if (unlikely(!(ret & VM_FAULT_LOCKED)))
3620 lock_page(vmf->page);
3621 else
3622 VM_BUG_ON_PAGE(!PageLocked(vmf->page), vmf->page);
3623
3624 return ret;
3625}
3626
3627/*
3628 * The ordering of these checks is important for pmds with _PAGE_DEVMAP set.
3629 * If we check pmd_trans_unstable() first we will trip the bad_pmd() check
3630 * inside of pmd_none_or_trans_huge_or_clear_bad(). This will end up correctly
3631 * returning 1 but not before it spams dmesg with the pmd_clear_bad() output.
3632 */
3633static int pmd_devmap_trans_unstable(pmd_t *pmd)
3634{
3635 return pmd_devmap(*pmd) || pmd_trans_unstable(pmd);
3636}
3637
3638static vm_fault_t pte_alloc_one_map(struct vm_fault *vmf)
3639{
3640 struct vm_area_struct *vma = vmf->vma;
3641
3642 if (!pmd_none(*vmf->pmd))
3643 goto map_pte;
3644 if (vmf->prealloc_pte) {
3645 vmf->ptl = pmd_lock(vma->vm_mm, vmf->pmd);
3646 if (unlikely(!pmd_none(*vmf->pmd))) {
3647 spin_unlock(vmf->ptl);
3648 goto map_pte;
3649 }
3650
3651 mm_inc_nr_ptes(vma->vm_mm);
3652 pmd_populate(vma->vm_mm, vmf->pmd, vmf->prealloc_pte);
3653 spin_unlock(vmf->ptl);
3654 vmf->prealloc_pte = NULL;
3655 } else if (unlikely(pte_alloc(vma->vm_mm, vmf->pmd))) {
3656 return VM_FAULT_OOM;
3657 }
3658map_pte:
3659 /*
3660 * If a huge pmd materialized under us just retry later. Use
3661 * pmd_trans_unstable() via pmd_devmap_trans_unstable() instead of
3662 * pmd_trans_huge() to ensure the pmd didn't become pmd_trans_huge
3663 * under us and then back to pmd_none, as a result of MADV_DONTNEED
3664 * running immediately after a huge pmd fault in a different thread of
3665 * this mm, in turn leading to a misleading pmd_trans_huge() retval.
3666 * All we have to ensure is that it is a regular pmd that we can walk
3667 * with pte_offset_map() and we can do that through an atomic read in
3668 * C, which is what pmd_trans_unstable() provides.
3669 */
3670 if (pmd_devmap_trans_unstable(vmf->pmd))
3671 return VM_FAULT_NOPAGE;
3672
3673 /*
3674 * At this point we know that our vmf->pmd points to a page of ptes
3675 * and it cannot become pmd_none(), pmd_devmap() or pmd_trans_huge()
3676 * for the duration of the fault. If a racing MADV_DONTNEED runs and
3677 * we zap the ptes pointed to by our vmf->pmd, the vmf->ptl will still
3678 * be valid and we will re-check to make sure the vmf->pte isn't
3679 * pte_none() under vmf->ptl protection when we return to
3680 * alloc_set_pte().
3681 */
3682 vmf->pte = pte_offset_map_lock(vma->vm_mm, vmf->pmd, vmf->address,
3683 &vmf->ptl);
3684 return 0;
3685}
3686
3687#ifdef CONFIG_TRANSPARENT_HUGEPAGE
3688static void deposit_prealloc_pte(struct vm_fault *vmf)
3689{
3690 struct vm_area_struct *vma = vmf->vma;
3691
3692 pgtable_trans_huge_deposit(vma->vm_mm, vmf->pmd, vmf->prealloc_pte);
3693 /*
3694 * We are going to consume the prealloc table,
3695 * count that as nr_ptes.
3696 */
3697 mm_inc_nr_ptes(vma->vm_mm);
3698 vmf->prealloc_pte = NULL;
3699}
3700
3701static vm_fault_t do_set_pmd(struct vm_fault *vmf, struct page *page)
3702{
3703 struct vm_area_struct *vma = vmf->vma;
3704 bool write = vmf->flags & FAULT_FLAG_WRITE;
3705 unsigned long haddr = vmf->address & HPAGE_PMD_MASK;
3706 pmd_t entry;
3707 int i;
3708 vm_fault_t ret;
3709
3710 if (!transhuge_vma_suitable(vma, haddr))
3711 return VM_FAULT_FALLBACK;
3712
3713 ret = VM_FAULT_FALLBACK;
3714 page = compound_head(page);
3715
3716 /*
3717 * Archs like ppc64 need additonal space to store information
3718 * related to pte entry. Use the preallocated table for that.
3719 */
3720 if (arch_needs_pgtable_deposit() && !vmf->prealloc_pte) {
3721 vmf->prealloc_pte = pte_alloc_one(vma->vm_mm);
3722 if (!vmf->prealloc_pte)
3723 return VM_FAULT_OOM;
3724 smp_wmb(); /* See comment in __pte_alloc() */
3725 }
3726
3727 vmf->ptl = pmd_lock(vma->vm_mm, vmf->pmd);
3728 if (unlikely(!pmd_none(*vmf->pmd)))
3729 goto out;
3730
3731 for (i = 0; i < HPAGE_PMD_NR; i++)
3732 flush_icache_page(vma, page + i);
3733
3734 entry = mk_huge_pmd(page, vma->vm_page_prot);
3735 if (write)
3736 entry = maybe_pmd_mkwrite(pmd_mkdirty(entry), vma);
3737
3738 add_mm_counter(vma->vm_mm, mm_counter_file(page), HPAGE_PMD_NR);
3739 page_add_file_rmap(page, true);
3740 /*
3741 * deposit and withdraw with pmd lock held
3742 */
3743 if (arch_needs_pgtable_deposit())
3744 deposit_prealloc_pte(vmf);
3745
3746 set_pmd_at(vma->vm_mm, haddr, vmf->pmd, entry);
3747
3748 update_mmu_cache_pmd(vma, haddr, vmf->pmd);
3749
3750 /* fault is handled */
3751 ret = 0;
3752 count_vm_event(THP_FILE_MAPPED);
3753out:
3754 spin_unlock(vmf->ptl);
3755 return ret;
3756}
3757#else
3758static vm_fault_t do_set_pmd(struct vm_fault *vmf, struct page *page)
3759{
3760 BUILD_BUG();
3761 return 0;
3762}
3763#endif
3764
3765/**
3766 * alloc_set_pte - setup new PTE entry for given page and add reverse page
3767 * mapping. If needed, the fucntion allocates page table or use pre-allocated.
3768 *
3769 * @vmf: fault environment
3770 * @page: page to map
3771 *
3772 * Caller must take care of unlocking vmf->ptl, if vmf->pte is non-NULL on
3773 * return.
3774 *
3775 * Target users are page handler itself and implementations of
3776 * vm_ops->map_pages.
3777 *
3778 * Return: %0 on success, %VM_FAULT_ code in case of error.
3779 */
3780vm_fault_t alloc_set_pte(struct vm_fault *vmf, struct page *page)
3781{
3782 struct vm_area_struct *vma = vmf->vma;
3783 bool write = vmf->flags & FAULT_FLAG_WRITE;
3784 pte_t entry;
3785 vm_fault_t ret;
3786
3787 if (pmd_none(*vmf->pmd) && PageTransCompound(page)) {
3788 ret = do_set_pmd(vmf, page);
3789 if (ret != VM_FAULT_FALLBACK)
3790 return ret;
3791 }
3792
3793 if (!vmf->pte) {
3794 ret = pte_alloc_one_map(vmf);
3795 if (ret)
3796 return ret;
3797 }
3798
3799 /* Re-check under ptl */
3800 if (unlikely(!pte_none(*vmf->pte))) {
3801 update_mmu_tlb(vma, vmf->address, vmf->pte);
3802 return VM_FAULT_NOPAGE;
3803 }
3804
3805 flush_icache_page(vma, page);
3806 entry = mk_pte(page, vma->vm_page_prot);
3807 entry = pte_sw_mkyoung(entry);
3808 if (write)
3809 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
3810 /* copy-on-write page */
3811 if (write && !(vma->vm_flags & VM_SHARED)) {
3812 inc_mm_counter_fast(vma->vm_mm, MM_ANONPAGES);
3813 page_add_new_anon_rmap(page, vma, vmf->address, false);
3814 lru_cache_add_inactive_or_unevictable(page, vma);
3815 } else {
3816 inc_mm_counter_fast(vma->vm_mm, mm_counter_file(page));
3817 page_add_file_rmap(page, false);
3818 }
3819 set_pte_at(vma->vm_mm, vmf->address, vmf->pte, entry);
3820
3821 /* no need to invalidate: a not-present page won't be cached */
3822 update_mmu_cache(vma, vmf->address, vmf->pte);
3823
3824 return 0;
3825}
3826
3827
3828/**
3829 * finish_fault - finish page fault once we have prepared the page to fault
3830 *
3831 * @vmf: structure describing the fault
3832 *
3833 * This function handles all that is needed to finish a page fault once the
3834 * page to fault in is prepared. It handles locking of PTEs, inserts PTE for
3835 * given page, adds reverse page mapping, handles memcg charges and LRU
3836 * addition.
3837 *
3838 * The function expects the page to be locked and on success it consumes a
3839 * reference of a page being mapped (for the PTE which maps it).
3840 *
3841 * Return: %0 on success, %VM_FAULT_ code in case of error.
3842 */
3843vm_fault_t finish_fault(struct vm_fault *vmf)
3844{
3845 struct page *page;
3846 vm_fault_t ret = 0;
3847
3848 /* Did we COW the page? */
3849 if ((vmf->flags & FAULT_FLAG_WRITE) &&
3850 !(vmf->vma->vm_flags & VM_SHARED))
3851 page = vmf->cow_page;
3852 else
3853 page = vmf->page;
3854
3855 /*
3856 * check even for read faults because we might have lost our CoWed
3857 * page
3858 */
3859 if (!(vmf->vma->vm_flags & VM_SHARED))
3860 ret = check_stable_address_space(vmf->vma->vm_mm);
3861 if (!ret)
3862 ret = alloc_set_pte(vmf, page);
3863 if (vmf->pte)
3864 pte_unmap_unlock(vmf->pte, vmf->ptl);
3865 return ret;
3866}
3867
3868static unsigned long fault_around_bytes __read_mostly =
3869 rounddown_pow_of_two(65536);
3870
3871#ifdef CONFIG_DEBUG_FS
3872static int fault_around_bytes_get(void *data, u64 *val)
3873{
3874 *val = fault_around_bytes;
3875 return 0;
3876}
3877
3878/*
3879 * fault_around_bytes must be rounded down to the nearest page order as it's
3880 * what do_fault_around() expects to see.
3881 */
3882static int fault_around_bytes_set(void *data, u64 val)
3883{
3884 if (val / PAGE_SIZE > PTRS_PER_PTE)
3885 return -EINVAL;
3886 if (val > PAGE_SIZE)
3887 fault_around_bytes = rounddown_pow_of_two(val);
3888 else
3889 fault_around_bytes = PAGE_SIZE; /* rounddown_pow_of_two(0) is undefined */
3890 return 0;
3891}
3892DEFINE_DEBUGFS_ATTRIBUTE(fault_around_bytes_fops,
3893 fault_around_bytes_get, fault_around_bytes_set, "%llu\n");
3894
3895static int __init fault_around_debugfs(void)
3896{
3897 debugfs_create_file_unsafe("fault_around_bytes", 0644, NULL, NULL,
3898 &fault_around_bytes_fops);
3899 return 0;
3900}
3901late_initcall(fault_around_debugfs);
3902#endif
3903
3904/*
3905 * do_fault_around() tries to map few pages around the fault address. The hope
3906 * is that the pages will be needed soon and this will lower the number of
3907 * faults to handle.
3908 *
3909 * It uses vm_ops->map_pages() to map the pages, which skips the page if it's
3910 * not ready to be mapped: not up-to-date, locked, etc.
3911 *
3912 * This function is called with the page table lock taken. In the split ptlock
3913 * case the page table lock only protects only those entries which belong to
3914 * the page table corresponding to the fault address.
3915 *
3916 * This function doesn't cross the VMA boundaries, in order to call map_pages()
3917 * only once.
3918 *
3919 * fault_around_bytes defines how many bytes we'll try to map.
3920 * do_fault_around() expects it to be set to a power of two less than or equal
3921 * to PTRS_PER_PTE.
3922 *
3923 * The virtual address of the area that we map is naturally aligned to
3924 * fault_around_bytes rounded down to the machine page size
3925 * (and therefore to page order). This way it's easier to guarantee
3926 * that we don't cross page table boundaries.
3927 */
3928static vm_fault_t do_fault_around(struct vm_fault *vmf)
3929{
3930 unsigned long address = vmf->address, nr_pages, mask;
3931 pgoff_t start_pgoff = vmf->pgoff;
3932 pgoff_t end_pgoff;
3933 int off;
3934 vm_fault_t ret = 0;
3935
3936 nr_pages = READ_ONCE(fault_around_bytes) >> PAGE_SHIFT;
3937 mask = ~(nr_pages * PAGE_SIZE - 1) & PAGE_MASK;
3938
3939 vmf->address = max(address & mask, vmf->vma->vm_start);
3940 off = ((address - vmf->address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1);
3941 start_pgoff -= off;
3942
3943 /*
3944 * end_pgoff is either the end of the page table, the end of
3945 * the vma or nr_pages from start_pgoff, depending what is nearest.
3946 */
3947 end_pgoff = start_pgoff -
3948 ((vmf->address >> PAGE_SHIFT) & (PTRS_PER_PTE - 1)) +
3949 PTRS_PER_PTE - 1;
3950 end_pgoff = min3(end_pgoff, vma_pages(vmf->vma) + vmf->vma->vm_pgoff - 1,
3951 start_pgoff + nr_pages - 1);
3952
3953 if (pmd_none(*vmf->pmd)) {
3954 vmf->prealloc_pte = pte_alloc_one(vmf->vma->vm_mm);
3955 if (!vmf->prealloc_pte)
3956 goto out;
3957 smp_wmb(); /* See comment in __pte_alloc() */
3958 }
3959
3960 vmf->vma->vm_ops->map_pages(vmf, start_pgoff, end_pgoff);
3961
3962 /* Huge page is mapped? Page fault is solved */
3963 if (pmd_trans_huge(*vmf->pmd)) {
3964 ret = VM_FAULT_NOPAGE;
3965 goto out;
3966 }
3967
3968 /* ->map_pages() haven't done anything useful. Cold page cache? */
3969 if (!vmf->pte)
3970 goto out;
3971
3972 /* check if the page fault is solved */
3973 vmf->pte -= (vmf->address >> PAGE_SHIFT) - (address >> PAGE_SHIFT);
3974 if (!pte_none(*vmf->pte))
3975 ret = VM_FAULT_NOPAGE;
3976 pte_unmap_unlock(vmf->pte, vmf->ptl);
3977out:
3978 vmf->address = address;
3979 vmf->pte = NULL;
3980 return ret;
3981}
3982
3983static vm_fault_t do_read_fault(struct vm_fault *vmf)
3984{
3985 struct vm_area_struct *vma = vmf->vma;
3986 vm_fault_t ret = 0;
3987
3988 /*
3989 * Let's call ->map_pages() first and use ->fault() as fallback
3990 * if page by the offset is not ready to be mapped (cold cache or
3991 * something).
3992 */
3993 if (vma->vm_ops->map_pages && fault_around_bytes >> PAGE_SHIFT > 1) {
3994 ret = do_fault_around(vmf);
3995 if (ret)
3996 return ret;
3997 }
3998
3999 ret = __do_fault(vmf);
4000 if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE | VM_FAULT_RETRY)))
4001 return ret;
4002
4003 ret |= finish_fault(vmf);
4004 unlock_page(vmf->page);
4005 if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE | VM_FAULT_RETRY)))
4006 put_page(vmf->page);
4007 return ret;
4008}
4009
4010static vm_fault_t do_cow_fault(struct vm_fault *vmf)
4011{
4012 struct vm_area_struct *vma = vmf->vma;
4013 vm_fault_t ret;
4014
4015 if (unlikely(anon_vma_prepare(vma)))
4016 return VM_FAULT_OOM;
4017
4018 vmf->cow_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, vmf->address);
4019 if (!vmf->cow_page)
4020 return VM_FAULT_OOM;
4021
4022 if (mem_cgroup_charge(vmf->cow_page, vma->vm_mm, GFP_KERNEL)) {
4023 put_page(vmf->cow_page);
4024 return VM_FAULT_OOM;
4025 }
4026 cgroup_throttle_swaprate(vmf->cow_page, GFP_KERNEL);
4027
4028 ret = __do_fault(vmf);
4029 if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE | VM_FAULT_RETRY)))
4030 goto uncharge_out;
4031 if (ret & VM_FAULT_DONE_COW)
4032 return ret;
4033
4034 copy_user_highpage(vmf->cow_page, vmf->page, vmf->address, vma);
4035 __SetPageUptodate(vmf->cow_page);
4036
4037 ret |= finish_fault(vmf);
4038 unlock_page(vmf->page);
4039 put_page(vmf->page);
4040 if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE | VM_FAULT_RETRY)))
4041 goto uncharge_out;
4042 return ret;
4043uncharge_out:
4044 put_page(vmf->cow_page);
4045 return ret;
4046}
4047
4048static vm_fault_t do_shared_fault(struct vm_fault *vmf)
4049{
4050 struct vm_area_struct *vma = vmf->vma;
4051 vm_fault_t ret, tmp;
4052
4053 ret = __do_fault(vmf);
4054 if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE | VM_FAULT_RETRY)))
4055 return ret;
4056
4057 /*
4058 * Check if the backing address space wants to know that the page is
4059 * about to become writable
4060 */
4061 if (vma->vm_ops->page_mkwrite) {
4062 unlock_page(vmf->page);
4063 tmp = do_page_mkwrite(vmf);
4064 if (unlikely(!tmp ||
4065 (tmp & (VM_FAULT_ERROR | VM_FAULT_NOPAGE)))) {
4066 put_page(vmf->page);
4067 return tmp;
4068 }
4069 }
4070
4071 ret |= finish_fault(vmf);
4072 if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE |
4073 VM_FAULT_RETRY))) {
4074 unlock_page(vmf->page);
4075 put_page(vmf->page);
4076 return ret;
4077 }
4078
4079 ret |= fault_dirty_shared_page(vmf);
4080 return ret;
4081}
4082
4083/*
4084 * We enter with non-exclusive mmap_lock (to exclude vma changes,
4085 * but allow concurrent faults).
4086 * The mmap_lock may have been released depending on flags and our
4087 * return value. See filemap_fault() and __lock_page_or_retry().
4088 * If mmap_lock is released, vma may become invalid (for example
4089 * by other thread calling munmap()).
4090 */
4091static vm_fault_t do_fault(struct vm_fault *vmf)
4092{
4093 struct vm_area_struct *vma = vmf->vma;
4094 struct mm_struct *vm_mm = vma->vm_mm;
4095 vm_fault_t ret;
4096
4097 /*
4098 * The VMA was not fully populated on mmap() or missing VM_DONTEXPAND
4099 */
4100 if (!vma->vm_ops->fault) {
4101 /*
4102 * If we find a migration pmd entry or a none pmd entry, which
4103 * should never happen, return SIGBUS
4104 */
4105 if (unlikely(!pmd_present(*vmf->pmd)))
4106 ret = VM_FAULT_SIGBUS;
4107 else {
4108 vmf->pte = pte_offset_map_lock(vmf->vma->vm_mm,
4109 vmf->pmd,
4110 vmf->address,
4111 &vmf->ptl);
4112 /*
4113 * Make sure this is not a temporary clearing of pte
4114 * by holding ptl and checking again. A R/M/W update
4115 * of pte involves: take ptl, clearing the pte so that
4116 * we don't have concurrent modification by hardware
4117 * followed by an update.
4118 */
4119 if (unlikely(pte_none(*vmf->pte)))
4120 ret = VM_FAULT_SIGBUS;
4121 else
4122 ret = VM_FAULT_NOPAGE;
4123
4124 pte_unmap_unlock(vmf->pte, vmf->ptl);
4125 }
4126 } else if (!(vmf->flags & FAULT_FLAG_WRITE))
4127 ret = do_read_fault(vmf);
4128 else if (!(vma->vm_flags & VM_SHARED))
4129 ret = do_cow_fault(vmf);
4130 else
4131 ret = do_shared_fault(vmf);
4132
4133 /* preallocated pagetable is unused: free it */
4134 if (vmf->prealloc_pte) {
4135 pte_free(vm_mm, vmf->prealloc_pte);
4136 vmf->prealloc_pte = NULL;
4137 }
4138 return ret;
4139}
4140
4141static int numa_migrate_prep(struct page *page, struct vm_area_struct *vma,
4142 unsigned long addr, int page_nid,
4143 int *flags)
4144{
4145 get_page(page);
4146
4147 count_vm_numa_event(NUMA_HINT_FAULTS);
4148 if (page_nid == numa_node_id()) {
4149 count_vm_numa_event(NUMA_HINT_FAULTS_LOCAL);
4150 *flags |= TNF_FAULT_LOCAL;
4151 }
4152
4153 return mpol_misplaced(page, vma, addr);
4154}
4155
4156static vm_fault_t do_numa_page(struct vm_fault *vmf)
4157{
4158 struct vm_area_struct *vma = vmf->vma;
4159 struct page *page = NULL;
4160 int page_nid = NUMA_NO_NODE;
4161 int last_cpupid;
4162 int target_nid;
4163 bool migrated = false;
4164 pte_t pte, old_pte;
4165 bool was_writable = pte_savedwrite(vmf->orig_pte);
4166 int flags = 0;
4167
4168 /*
4169 * The "pte" at this point cannot be used safely without
4170 * validation through pte_unmap_same(). It's of NUMA type but
4171 * the pfn may be screwed if the read is non atomic.
4172 */
4173 vmf->ptl = pte_lockptr(vma->vm_mm, vmf->pmd);
4174 spin_lock(vmf->ptl);
4175 if (unlikely(!pte_same(*vmf->pte, vmf->orig_pte))) {
4176 pte_unmap_unlock(vmf->pte, vmf->ptl);
4177 goto out;
4178 }
4179
4180 /*
4181 * Make it present again, Depending on how arch implementes non
4182 * accessible ptes, some can allow access by kernel mode.
4183 */
4184 old_pte = ptep_modify_prot_start(vma, vmf->address, vmf->pte);
4185 pte = pte_modify(old_pte, vma->vm_page_prot);
4186 pte = pte_mkyoung(pte);
4187 if (was_writable)
4188 pte = pte_mkwrite(pte);
4189 ptep_modify_prot_commit(vma, vmf->address, vmf->pte, old_pte, pte);
4190 update_mmu_cache(vma, vmf->address, vmf->pte);
4191
4192 page = vm_normal_page(vma, vmf->address, pte);
4193 if (!page) {
4194 pte_unmap_unlock(vmf->pte, vmf->ptl);
4195 return 0;
4196 }
4197
4198 /* TODO: handle PTE-mapped THP */
4199 if (PageCompound(page)) {
4200 pte_unmap_unlock(vmf->pte, vmf->ptl);
4201 return 0;
4202 }
4203
4204 /*
4205 * Avoid grouping on RO pages in general. RO pages shouldn't hurt as
4206 * much anyway since they can be in shared cache state. This misses
4207 * the case where a mapping is writable but the process never writes
4208 * to it but pte_write gets cleared during protection updates and
4209 * pte_dirty has unpredictable behaviour between PTE scan updates,
4210 * background writeback, dirty balancing and application behaviour.
4211 */
4212 if (!pte_write(pte))
4213 flags |= TNF_NO_GROUP;
4214
4215 /*
4216 * Flag if the page is shared between multiple address spaces. This
4217 * is later used when determining whether to group tasks together
4218 */
4219 if (page_mapcount(page) > 1 && (vma->vm_flags & VM_SHARED))
4220 flags |= TNF_SHARED;
4221
4222 last_cpupid = page_cpupid_last(page);
4223 page_nid = page_to_nid(page);
4224 target_nid = numa_migrate_prep(page, vma, vmf->address, page_nid,
4225 &flags);
4226 pte_unmap_unlock(vmf->pte, vmf->ptl);
4227 if (target_nid == NUMA_NO_NODE) {
4228 put_page(page);
4229 goto out;
4230 }
4231
4232 /* Migrate to the requested node */
4233 migrated = migrate_misplaced_page(page, vma, target_nid);
4234 if (migrated) {
4235 page_nid = target_nid;
4236 flags |= TNF_MIGRATED;
4237 } else
4238 flags |= TNF_MIGRATE_FAIL;
4239
4240out:
4241 if (page_nid != NUMA_NO_NODE)
4242 task_numa_fault(last_cpupid, page_nid, 1, flags);
4243 return 0;
4244}
4245
4246static inline vm_fault_t create_huge_pmd(struct vm_fault *vmf)
4247{
4248 if (vma_is_anonymous(vmf->vma))
4249 return do_huge_pmd_anonymous_page(vmf);
4250 if (vmf->vma->vm_ops->huge_fault)
4251 return vmf->vma->vm_ops->huge_fault(vmf, PE_SIZE_PMD);
4252 return VM_FAULT_FALLBACK;
4253}
4254
4255/* `inline' is required to avoid gcc 4.1.2 build error */
4256static inline vm_fault_t wp_huge_pmd(struct vm_fault *vmf, pmd_t orig_pmd)
4257{
4258 if (vma_is_anonymous(vmf->vma)) {
4259 if (userfaultfd_huge_pmd_wp(vmf->vma, orig_pmd))
4260 return handle_userfault(vmf, VM_UFFD_WP);
4261 return do_huge_pmd_wp_page(vmf, orig_pmd);
4262 }
4263 if (vmf->vma->vm_ops->huge_fault) {
4264 vm_fault_t ret = vmf->vma->vm_ops->huge_fault(vmf, PE_SIZE_PMD);
4265
4266 if (!(ret & VM_FAULT_FALLBACK))
4267 return ret;
4268 }
4269
4270 /* COW or write-notify handled on pte level: split pmd. */
4271 __split_huge_pmd(vmf->vma, vmf->pmd, vmf->address, false, NULL);
4272
4273 return VM_FAULT_FALLBACK;
4274}
4275
4276static vm_fault_t create_huge_pud(struct vm_fault *vmf)
4277{
4278#if defined(CONFIG_TRANSPARENT_HUGEPAGE) && \
4279 defined(CONFIG_HAVE_ARCH_TRANSPARENT_HUGEPAGE_PUD)
4280 /* No support for anonymous transparent PUD pages yet */
4281 if (vma_is_anonymous(vmf->vma))
4282 goto split;
4283 if (vmf->vma->vm_ops->huge_fault) {
4284 vm_fault_t ret = vmf->vma->vm_ops->huge_fault(vmf, PE_SIZE_PUD);
4285
4286 if (!(ret & VM_FAULT_FALLBACK))
4287 return ret;
4288 }
4289split:
4290 /* COW or write-notify not handled on PUD level: split pud.*/
4291 __split_huge_pud(vmf->vma, vmf->pud, vmf->address);
4292#endif /* CONFIG_TRANSPARENT_HUGEPAGE */
4293 return VM_FAULT_FALLBACK;
4294}
4295
4296static vm_fault_t wp_huge_pud(struct vm_fault *vmf, pud_t orig_pud)
4297{
4298#ifdef CONFIG_TRANSPARENT_HUGEPAGE
4299 /* No support for anonymous transparent PUD pages yet */
4300 if (vma_is_anonymous(vmf->vma))
4301 return VM_FAULT_FALLBACK;
4302 if (vmf->vma->vm_ops->huge_fault)
4303 return vmf->vma->vm_ops->huge_fault(vmf, PE_SIZE_PUD);
4304#endif /* CONFIG_TRANSPARENT_HUGEPAGE */
4305 return VM_FAULT_FALLBACK;
4306}
4307
4308/*
4309 * These routines also need to handle stuff like marking pages dirty
4310 * and/or accessed for architectures that don't do it in hardware (most
4311 * RISC architectures). The early dirtying is also good on the i386.
4312 *
4313 * There is also a hook called "update_mmu_cache()" that architectures
4314 * with external mmu caches can use to update those (ie the Sparc or
4315 * PowerPC hashed page tables that act as extended TLBs).
4316 *
4317 * We enter with non-exclusive mmap_lock (to exclude vma changes, but allow
4318 * concurrent faults).
4319 *
4320 * The mmap_lock may have been released depending on flags and our return value.
4321 * See filemap_fault() and __lock_page_or_retry().
4322 */
4323static vm_fault_t handle_pte_fault(struct vm_fault *vmf)
4324{
4325 pte_t entry;
4326
4327 if (unlikely(pmd_none(*vmf->pmd))) {
4328 /*
4329 * Leave __pte_alloc() until later: because vm_ops->fault may
4330 * want to allocate huge page, and if we expose page table
4331 * for an instant, it will be difficult to retract from
4332 * concurrent faults and from rmap lookups.
4333 */
4334 vmf->pte = NULL;
4335 } else {
4336 /* See comment in pte_alloc_one_map() */
4337 if (pmd_devmap_trans_unstable(vmf->pmd))
4338 return 0;
4339 /*
4340 * A regular pmd is established and it can't morph into a huge
4341 * pmd from under us anymore at this point because we hold the
4342 * mmap_lock read mode and khugepaged takes it in write mode.
4343 * So now it's safe to run pte_offset_map().
4344 */
4345 vmf->pte = pte_offset_map(vmf->pmd, vmf->address);
4346 vmf->orig_pte = *vmf->pte;
4347
4348 /*
4349 * some architectures can have larger ptes than wordsize,
4350 * e.g.ppc44x-defconfig has CONFIG_PTE_64BIT=y and
4351 * CONFIG_32BIT=y, so READ_ONCE cannot guarantee atomic
4352 * accesses. The code below just needs a consistent view
4353 * for the ifs and we later double check anyway with the
4354 * ptl lock held. So here a barrier will do.
4355 */
4356 barrier();
4357 if (pte_none(vmf->orig_pte)) {
4358 pte_unmap(vmf->pte);
4359 vmf->pte = NULL;
4360 }
4361 }
4362
4363 if (!vmf->pte) {
4364 if (vma_is_anonymous(vmf->vma))
4365 return do_anonymous_page(vmf);
4366 else
4367 return do_fault(vmf);
4368 }
4369
4370 if (!pte_present(vmf->orig_pte))
4371 return do_swap_page(vmf);
4372
4373 if (pte_protnone(vmf->orig_pte) && vma_is_accessible(vmf->vma))
4374 return do_numa_page(vmf);
4375
4376 vmf->ptl = pte_lockptr(vmf->vma->vm_mm, vmf->pmd);
4377 spin_lock(vmf->ptl);
4378 entry = vmf->orig_pte;
4379 if (unlikely(!pte_same(*vmf->pte, entry))) {
4380 update_mmu_tlb(vmf->vma, vmf->address, vmf->pte);
4381 goto unlock;
4382 }
4383 if (vmf->flags & FAULT_FLAG_WRITE) {
4384 if (!pte_write(entry))
4385 return do_wp_page(vmf);
4386 entry = pte_mkdirty(entry);
4387 }
4388 entry = pte_mkyoung(entry);
4389 if (ptep_set_access_flags(vmf->vma, vmf->address, vmf->pte, entry,
4390 vmf->flags & FAULT_FLAG_WRITE)) {
4391 update_mmu_cache(vmf->vma, vmf->address, vmf->pte);
4392 } else {
4393 /* Skip spurious TLB flush for retried page fault */
4394 if (vmf->flags & FAULT_FLAG_TRIED)
4395 goto unlock;
4396 /*
4397 * This is needed only for protection faults but the arch code
4398 * is not yet telling us if this is a protection fault or not.
4399 * This still avoids useless tlb flushes for .text page faults
4400 * with threads.
4401 */
4402 if (vmf->flags & FAULT_FLAG_WRITE)
4403 flush_tlb_fix_spurious_fault(vmf->vma, vmf->address);
4404 }
4405unlock:
4406 pte_unmap_unlock(vmf->pte, vmf->ptl);
4407 return 0;
4408}
4409
4410/*
4411 * By the time we get here, we already hold the mm semaphore
4412 *
4413 * The mmap_lock may have been released depending on flags and our
4414 * return value. See filemap_fault() and __lock_page_or_retry().
4415 */
4416static vm_fault_t __handle_mm_fault(struct vm_area_struct *vma,
4417 unsigned long address, unsigned int flags)
4418{
4419 struct vm_fault vmf = {
4420 .vma = vma,
4421 .address = address & PAGE_MASK,
4422 .flags = flags,
4423 .pgoff = linear_page_index(vma, address),
4424 .gfp_mask = __get_fault_gfp_mask(vma),
4425 };
4426 unsigned int dirty = flags & FAULT_FLAG_WRITE;
4427 struct mm_struct *mm = vma->vm_mm;
4428 pgd_t *pgd;
4429 p4d_t *p4d;
4430 vm_fault_t ret;
4431
4432 pgd = pgd_offset(mm, address);
4433 p4d = p4d_alloc(mm, pgd, address);
4434 if (!p4d)
4435 return VM_FAULT_OOM;
4436
4437 vmf.pud = pud_alloc(mm, p4d, address);
4438 if (!vmf.pud)
4439 return VM_FAULT_OOM;
4440retry_pud:
4441 if (pud_none(*vmf.pud) && __transparent_hugepage_enabled(vma)) {
4442 ret = create_huge_pud(&vmf);
4443 if (!(ret & VM_FAULT_FALLBACK))
4444 return ret;
4445 } else {
4446 pud_t orig_pud = *vmf.pud;
4447
4448 barrier();
4449 if (pud_trans_huge(orig_pud) || pud_devmap(orig_pud)) {
4450
4451 /* NUMA case for anonymous PUDs would go here */
4452
4453 if (dirty && !pud_write(orig_pud)) {
4454 ret = wp_huge_pud(&vmf, orig_pud);
4455 if (!(ret & VM_FAULT_FALLBACK))
4456 return ret;
4457 } else {
4458 huge_pud_set_accessed(&vmf, orig_pud);
4459 return 0;
4460 }
4461 }
4462 }
4463
4464 vmf.pmd = pmd_alloc(mm, vmf.pud, address);
4465 if (!vmf.pmd)
4466 return VM_FAULT_OOM;
4467
4468 /* Huge pud page fault raced with pmd_alloc? */
4469 if (pud_trans_unstable(vmf.pud))
4470 goto retry_pud;
4471
4472 if (pmd_none(*vmf.pmd) && __transparent_hugepage_enabled(vma)) {
4473 ret = create_huge_pmd(&vmf);
4474 if (!(ret & VM_FAULT_FALLBACK))
4475 return ret;
4476 } else {
4477 pmd_t orig_pmd = *vmf.pmd;
4478
4479 barrier();
4480 if (unlikely(is_swap_pmd(orig_pmd))) {
4481 VM_BUG_ON(thp_migration_supported() &&
4482 !is_pmd_migration_entry(orig_pmd));
4483 if (is_pmd_migration_entry(orig_pmd))
4484 pmd_migration_entry_wait(mm, vmf.pmd);
4485 return 0;
4486 }
4487 if (pmd_trans_huge(orig_pmd) || pmd_devmap(orig_pmd)) {
4488 if (pmd_protnone(orig_pmd) && vma_is_accessible(vma))
4489 return do_huge_pmd_numa_page(&vmf, orig_pmd);
4490
4491 if (dirty && !pmd_write(orig_pmd)) {
4492 ret = wp_huge_pmd(&vmf, orig_pmd);
4493 if (!(ret & VM_FAULT_FALLBACK))
4494 return ret;
4495 } else {
4496 huge_pmd_set_accessed(&vmf, orig_pmd);
4497 return 0;
4498 }
4499 }
4500 }
4501
4502 return handle_pte_fault(&vmf);
4503}
4504
4505/**
4506 * mm_account_fault - Do page fault accountings
4507 *
4508 * @regs: the pt_regs struct pointer. When set to NULL, will skip accounting
4509 * of perf event counters, but we'll still do the per-task accounting to
4510 * the task who triggered this page fault.
4511 * @address: the faulted address.
4512 * @flags: the fault flags.
4513 * @ret: the fault retcode.
4514 *
4515 * This will take care of most of the page fault accountings. Meanwhile, it
4516 * will also include the PERF_COUNT_SW_PAGE_FAULTS_[MAJ|MIN] perf counter
4517 * updates. However note that the handling of PERF_COUNT_SW_PAGE_FAULTS should
4518 * still be in per-arch page fault handlers at the entry of page fault.
4519 */
4520static inline void mm_account_fault(struct pt_regs *regs,
4521 unsigned long address, unsigned int flags,
4522 vm_fault_t ret)
4523{
4524 bool major;
4525
4526 /*
4527 * We don't do accounting for some specific faults:
4528 *
4529 * - Unsuccessful faults (e.g. when the address wasn't valid). That
4530 * includes arch_vma_access_permitted() failing before reaching here.
4531 * So this is not a "this many hardware page faults" counter. We
4532 * should use the hw profiling for that.
4533 *
4534 * - Incomplete faults (VM_FAULT_RETRY). They will only be counted
4535 * once they're completed.
4536 */
4537 if (ret & (VM_FAULT_ERROR | VM_FAULT_RETRY))
4538 return;
4539
4540 /*
4541 * We define the fault as a major fault when the final successful fault
4542 * is VM_FAULT_MAJOR, or if it retried (which implies that we couldn't
4543 * handle it immediately previously).
4544 */
4545 major = (ret & VM_FAULT_MAJOR) || (flags & FAULT_FLAG_TRIED);
4546
4547 if (major)
4548 current->maj_flt++;
4549 else
4550 current->min_flt++;
4551
4552 /*
4553 * If the fault is done for GUP, regs will be NULL. We only do the
4554 * accounting for the per thread fault counters who triggered the
4555 * fault, and we skip the perf event updates.
4556 */
4557 if (!regs)
4558 return;
4559
4560 if (major)
4561 perf_sw_event(PERF_COUNT_SW_PAGE_FAULTS_MAJ, 1, regs, address);
4562 else
4563 perf_sw_event(PERF_COUNT_SW_PAGE_FAULTS_MIN, 1, regs, address);
4564}
4565
4566/*
4567 * By the time we get here, we already hold the mm semaphore
4568 *
4569 * The mmap_lock may have been released depending on flags and our
4570 * return value. See filemap_fault() and __lock_page_or_retry().
4571 */
4572vm_fault_t handle_mm_fault(struct vm_area_struct *vma, unsigned long address,
4573 unsigned int flags, struct pt_regs *regs)
4574{
4575 vm_fault_t ret;
4576
4577 __set_current_state(TASK_RUNNING);
4578
4579 count_vm_event(PGFAULT);
4580 count_memcg_event_mm(vma->vm_mm, PGFAULT);
4581
4582 /* do counter updates before entering really critical section. */
4583 check_sync_rss_stat(current);
4584
4585 if (!arch_vma_access_permitted(vma, flags & FAULT_FLAG_WRITE,
4586 flags & FAULT_FLAG_INSTRUCTION,
4587 flags & FAULT_FLAG_REMOTE))
4588 return VM_FAULT_SIGSEGV;
4589
4590 /*
4591 * Enable the memcg OOM handling for faults triggered in user
4592 * space. Kernel faults are handled more gracefully.
4593 */
4594 if (flags & FAULT_FLAG_USER)
4595 mem_cgroup_enter_user_fault();
4596
4597 if (unlikely(is_vm_hugetlb_page(vma)))
4598 ret = hugetlb_fault(vma->vm_mm, vma, address, flags);
4599 else
4600 ret = __handle_mm_fault(vma, address, flags);
4601
4602 if (flags & FAULT_FLAG_USER) {
4603 mem_cgroup_exit_user_fault();
4604 /*
4605 * The task may have entered a memcg OOM situation but
4606 * if the allocation error was handled gracefully (no
4607 * VM_FAULT_OOM), there is no need to kill anything.
4608 * Just clean up the OOM state peacefully.
4609 */
4610 if (task_in_memcg_oom(current) && !(ret & VM_FAULT_OOM))
4611 mem_cgroup_oom_synchronize(false);
4612 }
4613
4614 mm_account_fault(regs, address, flags, ret);
4615
4616 return ret;
4617}
4618EXPORT_SYMBOL_GPL(handle_mm_fault);
4619
4620#ifndef __PAGETABLE_P4D_FOLDED
4621/*
4622 * Allocate p4d page table.
4623 * We've already handled the fast-path in-line.
4624 */
4625int __p4d_alloc(struct mm_struct *mm, pgd_t *pgd, unsigned long address)
4626{
4627 p4d_t *new = p4d_alloc_one(mm, address);
4628 if (!new)
4629 return -ENOMEM;
4630
4631 smp_wmb(); /* See comment in __pte_alloc */
4632
4633 spin_lock(&mm->page_table_lock);
4634 if (pgd_present(*pgd)) /* Another has populated it */
4635 p4d_free(mm, new);
4636 else
4637 pgd_populate(mm, pgd, new);
4638 spin_unlock(&mm->page_table_lock);
4639 return 0;
4640}
4641#endif /* __PAGETABLE_P4D_FOLDED */
4642
4643#ifndef __PAGETABLE_PUD_FOLDED
4644/*
4645 * Allocate page upper directory.
4646 * We've already handled the fast-path in-line.
4647 */
4648int __pud_alloc(struct mm_struct *mm, p4d_t *p4d, unsigned long address)
4649{
4650 pud_t *new = pud_alloc_one(mm, address);
4651 if (!new)
4652 return -ENOMEM;
4653
4654 smp_wmb(); /* See comment in __pte_alloc */
4655
4656 spin_lock(&mm->page_table_lock);
4657 if (!p4d_present(*p4d)) {
4658 mm_inc_nr_puds(mm);
4659 p4d_populate(mm, p4d, new);
4660 } else /* Another has populated it */
4661 pud_free(mm, new);
4662 spin_unlock(&mm->page_table_lock);
4663 return 0;
4664}
4665#endif /* __PAGETABLE_PUD_FOLDED */
4666
4667#ifndef __PAGETABLE_PMD_FOLDED
4668/*
4669 * Allocate page middle directory.
4670 * We've already handled the fast-path in-line.
4671 */
4672int __pmd_alloc(struct mm_struct *mm, pud_t *pud, unsigned long address)
4673{
4674 spinlock_t *ptl;
4675 pmd_t *new = pmd_alloc_one(mm, address);
4676 if (!new)
4677 return -ENOMEM;
4678
4679 smp_wmb(); /* See comment in __pte_alloc */
4680
4681 ptl = pud_lock(mm, pud);
4682 if (!pud_present(*pud)) {
4683 mm_inc_nr_pmds(mm);
4684 pud_populate(mm, pud, new);
4685 } else /* Another has populated it */
4686 pmd_free(mm, new);
4687 spin_unlock(ptl);
4688 return 0;
4689}
4690#endif /* __PAGETABLE_PMD_FOLDED */
4691
4692static int __follow_pte_pmd(struct mm_struct *mm, unsigned long address,
4693 struct mmu_notifier_range *range,
4694 pte_t **ptepp, pmd_t **pmdpp, spinlock_t **ptlp)
4695{
4696 pgd_t *pgd;
4697 p4d_t *p4d;
4698 pud_t *pud;
4699 pmd_t *pmd;
4700 pte_t *ptep;
4701
4702 pgd = pgd_offset(mm, address);
4703 if (pgd_none(*pgd) || unlikely(pgd_bad(*pgd)))
4704 goto out;
4705
4706 p4d = p4d_offset(pgd, address);
4707 if (p4d_none(*p4d) || unlikely(p4d_bad(*p4d)))
4708 goto out;
4709
4710 pud = pud_offset(p4d, address);
4711 if (pud_none(*pud) || unlikely(pud_bad(*pud)))
4712 goto out;
4713
4714 pmd = pmd_offset(pud, address);
4715 VM_BUG_ON(pmd_trans_huge(*pmd));
4716
4717 if (pmd_huge(*pmd)) {
4718 if (!pmdpp)
4719 goto out;
4720
4721 if (range) {
4722 mmu_notifier_range_init(range, MMU_NOTIFY_CLEAR, 0,
4723 NULL, mm, address & PMD_MASK,
4724 (address & PMD_MASK) + PMD_SIZE);
4725 mmu_notifier_invalidate_range_start(range);
4726 }
4727 *ptlp = pmd_lock(mm, pmd);
4728 if (pmd_huge(*pmd)) {
4729 *pmdpp = pmd;
4730 return 0;
4731 }
4732 spin_unlock(*ptlp);
4733 if (range)
4734 mmu_notifier_invalidate_range_end(range);
4735 }
4736
4737 if (pmd_none(*pmd) || unlikely(pmd_bad(*pmd)))
4738 goto out;
4739
4740 if (range) {
4741 mmu_notifier_range_init(range, MMU_NOTIFY_CLEAR, 0, NULL, mm,
4742 address & PAGE_MASK,
4743 (address & PAGE_MASK) + PAGE_SIZE);
4744 mmu_notifier_invalidate_range_start(range);
4745 }
4746 ptep = pte_offset_map_lock(mm, pmd, address, ptlp);
4747 if (!pte_present(*ptep))
4748 goto unlock;
4749 *ptepp = ptep;
4750 return 0;
4751unlock:
4752 pte_unmap_unlock(ptep, *ptlp);
4753 if (range)
4754 mmu_notifier_invalidate_range_end(range);
4755out:
4756 return -EINVAL;
4757}
4758
4759static inline int follow_pte(struct mm_struct *mm, unsigned long address,
4760 pte_t **ptepp, spinlock_t **ptlp)
4761{
4762 int res;
4763
4764 /* (void) is needed to make gcc happy */
4765 (void) __cond_lock(*ptlp,
4766 !(res = __follow_pte_pmd(mm, address, NULL,
4767 ptepp, NULL, ptlp)));
4768 return res;
4769}
4770
4771int follow_pte_pmd(struct mm_struct *mm, unsigned long address,
4772 struct mmu_notifier_range *range,
4773 pte_t **ptepp, pmd_t **pmdpp, spinlock_t **ptlp)
4774{
4775 int res;
4776
4777 /* (void) is needed to make gcc happy */
4778 (void) __cond_lock(*ptlp,
4779 !(res = __follow_pte_pmd(mm, address, range,
4780 ptepp, pmdpp, ptlp)));
4781 return res;
4782}
4783EXPORT_SYMBOL(follow_pte_pmd);
4784
4785/**
4786 * follow_pfn - look up PFN at a user virtual address
4787 * @vma: memory mapping
4788 * @address: user virtual address
4789 * @pfn: location to store found PFN
4790 *
4791 * Only IO mappings and raw PFN mappings are allowed.
4792 *
4793 * Return: zero and the pfn at @pfn on success, -ve otherwise.
4794 */
4795int follow_pfn(struct vm_area_struct *vma, unsigned long address,
4796 unsigned long *pfn)
4797{
4798 int ret = -EINVAL;
4799 spinlock_t *ptl;
4800 pte_t *ptep;
4801
4802 if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
4803 return ret;
4804
4805 ret = follow_pte(vma->vm_mm, address, &ptep, &ptl);
4806 if (ret)
4807 return ret;
4808 *pfn = pte_pfn(*ptep);
4809 pte_unmap_unlock(ptep, ptl);
4810 return 0;
4811}
4812EXPORT_SYMBOL(follow_pfn);
4813
4814#ifdef CONFIG_HAVE_IOREMAP_PROT
4815int follow_phys(struct vm_area_struct *vma,
4816 unsigned long address, unsigned int flags,
4817 unsigned long *prot, resource_size_t *phys)
4818{
4819 int ret = -EINVAL;
4820 pte_t *ptep, pte;
4821 spinlock_t *ptl;
4822
4823 if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
4824 goto out;
4825
4826 if (follow_pte(vma->vm_mm, address, &ptep, &ptl))
4827 goto out;
4828 pte = *ptep;
4829
4830 if ((flags & FOLL_WRITE) && !pte_write(pte))
4831 goto unlock;
4832
4833 *prot = pgprot_val(pte_pgprot(pte));
4834 *phys = (resource_size_t)pte_pfn(pte) << PAGE_SHIFT;
4835
4836 ret = 0;
4837unlock:
4838 pte_unmap_unlock(ptep, ptl);
4839out:
4840 return ret;
4841}
4842
4843int generic_access_phys(struct vm_area_struct *vma, unsigned long addr,
4844 void *buf, int len, int write)
4845{
4846 resource_size_t phys_addr;
4847 unsigned long prot = 0;
4848 void __iomem *maddr;
4849 int offset = addr & (PAGE_SIZE-1);
4850
4851 if (follow_phys(vma, addr, write, &prot, &phys_addr))
4852 return -EINVAL;
4853
4854 maddr = ioremap_prot(phys_addr, PAGE_ALIGN(len + offset), prot);
4855 if (!maddr)
4856 return -ENOMEM;
4857
4858 if (write)
4859 memcpy_toio(maddr + offset, buf, len);
4860 else
4861 memcpy_fromio(buf, maddr + offset, len);
4862 iounmap(maddr);
4863
4864 return len;
4865}
4866EXPORT_SYMBOL_GPL(generic_access_phys);
4867#endif
4868
4869/*
4870 * Access another process' address space as given in mm. If non-NULL, use the
4871 * given task for page fault accounting.
4872 */
4873int __access_remote_vm(struct task_struct *tsk, struct mm_struct *mm,
4874 unsigned long addr, void *buf, int len, unsigned int gup_flags)
4875{
4876 struct vm_area_struct *vma;
4877 void *old_buf = buf;
4878 int write = gup_flags & FOLL_WRITE;
4879
4880 if (mmap_read_lock_killable(mm))
4881 return 0;
4882
4883 /* ignore errors, just check how much was successfully transferred */
4884 while (len) {
4885 int bytes, ret, offset;
4886 void *maddr;
4887 struct page *page = NULL;
4888
4889 ret = get_user_pages_remote(mm, addr, 1,
4890 gup_flags, &page, &vma, NULL);
4891 if (ret <= 0) {
4892#ifndef CONFIG_HAVE_IOREMAP_PROT
4893 break;
4894#else
4895 /*
4896 * Check if this is a VM_IO | VM_PFNMAP VMA, which
4897 * we can access using slightly different code.
4898 */
4899 vma = find_vma(mm, addr);
4900 if (!vma || vma->vm_start > addr)
4901 break;
4902 if (vma->vm_ops && vma->vm_ops->access)
4903 ret = vma->vm_ops->access(vma, addr, buf,
4904 len, write);
4905 if (ret <= 0)
4906 break;
4907 bytes = ret;
4908#endif
4909 } else {
4910 bytes = len;
4911 offset = addr & (PAGE_SIZE-1);
4912 if (bytes > PAGE_SIZE-offset)
4913 bytes = PAGE_SIZE-offset;
4914
4915 maddr = kmap(page);
4916 if (write) {
4917 copy_to_user_page(vma, page, addr,
4918 maddr + offset, buf, bytes);
4919 set_page_dirty_lock(page);
4920 } else {
4921 copy_from_user_page(vma, page, addr,
4922 buf, maddr + offset, bytes);
4923 }
4924 kunmap(page);
4925 put_page(page);
4926 }
4927 len -= bytes;
4928 buf += bytes;
4929 addr += bytes;
4930 }
4931 mmap_read_unlock(mm);
4932
4933 return buf - old_buf;
4934}
4935
4936/**
4937 * access_remote_vm - access another process' address space
4938 * @mm: the mm_struct of the target address space
4939 * @addr: start address to access
4940 * @buf: source or destination buffer
4941 * @len: number of bytes to transfer
4942 * @gup_flags: flags modifying lookup behaviour
4943 *
4944 * The caller must hold a reference on @mm.
4945 *
4946 * Return: number of bytes copied from source to destination.
4947 */
4948int access_remote_vm(struct mm_struct *mm, unsigned long addr,
4949 void *buf, int len, unsigned int gup_flags)
4950{
4951 return __access_remote_vm(NULL, mm, addr, buf, len, gup_flags);
4952}
4953
4954/*
4955 * Access another process' address space.
4956 * Source/target buffer must be kernel space,
4957 * Do not walk the page table directly, use get_user_pages
4958 */
4959int access_process_vm(struct task_struct *tsk, unsigned long addr,
4960 void *buf, int len, unsigned int gup_flags)
4961{
4962 struct mm_struct *mm;
4963 int ret;
4964
4965 mm = get_task_mm(tsk);
4966 if (!mm)
4967 return 0;
4968
4969 ret = __access_remote_vm(tsk, mm, addr, buf, len, gup_flags);
4970
4971 mmput(mm);
4972
4973 return ret;
4974}
4975EXPORT_SYMBOL_GPL(access_process_vm);
4976
4977/*
4978 * Print the name of a VMA.
4979 */
4980void print_vma_addr(char *prefix, unsigned long ip)
4981{
4982 struct mm_struct *mm = current->mm;
4983 struct vm_area_struct *vma;
4984
4985 /*
4986 * we might be running from an atomic context so we cannot sleep
4987 */
4988 if (!mmap_read_trylock(mm))
4989 return;
4990
4991 vma = find_vma(mm, ip);
4992 if (vma && vma->vm_file) {
4993 struct file *f = vma->vm_file;
4994 char *buf = (char *)__get_free_page(GFP_NOWAIT);
4995 if (buf) {
4996 char *p;
4997
4998 p = file_path(f, buf, PAGE_SIZE);
4999 if (IS_ERR(p))
5000 p = "?";
5001 printk("%s%s[%lx+%lx]", prefix, kbasename(p),
5002 vma->vm_start,
5003 vma->vm_end - vma->vm_start);
5004 free_page((unsigned long)buf);
5005 }
5006 }
5007 mmap_read_unlock(mm);
5008}
5009
5010#if defined(CONFIG_PROVE_LOCKING) || defined(CONFIG_DEBUG_ATOMIC_SLEEP)
5011void __might_fault(const char *file, int line)
5012{
5013 /*
5014 * Some code (nfs/sunrpc) uses socket ops on kernel memory while
5015 * holding the mmap_lock, this is safe because kernel memory doesn't
5016 * get paged out, therefore we'll never actually fault, and the
5017 * below annotations will generate false positives.
5018 */
5019 if (uaccess_kernel())
5020 return;
5021 if (pagefault_disabled())
5022 return;
5023 __might_sleep(file, line, 0);
5024#if defined(CONFIG_DEBUG_ATOMIC_SLEEP)
5025 if (current->mm)
5026 might_lock_read(¤t->mm->mmap_lock);
5027#endif
5028}
5029EXPORT_SYMBOL(__might_fault);
5030#endif
5031
5032#if defined(CONFIG_TRANSPARENT_HUGEPAGE) || defined(CONFIG_HUGETLBFS)
5033/*
5034 * Process all subpages of the specified huge page with the specified
5035 * operation. The target subpage will be processed last to keep its
5036 * cache lines hot.
5037 */
5038static inline void process_huge_page(
5039 unsigned long addr_hint, unsigned int pages_per_huge_page,
5040 void (*process_subpage)(unsigned long addr, int idx, void *arg),
5041 void *arg)
5042{
5043 int i, n, base, l;
5044 unsigned long addr = addr_hint &
5045 ~(((unsigned long)pages_per_huge_page << PAGE_SHIFT) - 1);
5046
5047 /* Process target subpage last to keep its cache lines hot */
5048 might_sleep();
5049 n = (addr_hint - addr) / PAGE_SIZE;
5050 if (2 * n <= pages_per_huge_page) {
5051 /* If target subpage in first half of huge page */
5052 base = 0;
5053 l = n;
5054 /* Process subpages at the end of huge page */
5055 for (i = pages_per_huge_page - 1; i >= 2 * n; i--) {
5056 cond_resched();
5057 process_subpage(addr + i * PAGE_SIZE, i, arg);
5058 }
5059 } else {
5060 /* If target subpage in second half of huge page */
5061 base = pages_per_huge_page - 2 * (pages_per_huge_page - n);
5062 l = pages_per_huge_page - n;
5063 /* Process subpages at the begin of huge page */
5064 for (i = 0; i < base; i++) {
5065 cond_resched();
5066 process_subpage(addr + i * PAGE_SIZE, i, arg);
5067 }
5068 }
5069 /*
5070 * Process remaining subpages in left-right-left-right pattern
5071 * towards the target subpage
5072 */
5073 for (i = 0; i < l; i++) {
5074 int left_idx = base + i;
5075 int right_idx = base + 2 * l - 1 - i;
5076
5077 cond_resched();
5078 process_subpage(addr + left_idx * PAGE_SIZE, left_idx, arg);
5079 cond_resched();
5080 process_subpage(addr + right_idx * PAGE_SIZE, right_idx, arg);
5081 }
5082}
5083
5084static void clear_gigantic_page(struct page *page,
5085 unsigned long addr,
5086 unsigned int pages_per_huge_page)
5087{
5088 int i;
5089 struct page *p = page;
5090
5091 might_sleep();
5092 for (i = 0; i < pages_per_huge_page;
5093 i++, p = mem_map_next(p, page, i)) {
5094 cond_resched();
5095 clear_user_highpage(p, addr + i * PAGE_SIZE);
5096 }
5097}
5098
5099static void clear_subpage(unsigned long addr, int idx, void *arg)
5100{
5101 struct page *page = arg;
5102
5103 clear_user_highpage(page + idx, addr);
5104}
5105
5106void clear_huge_page(struct page *page,
5107 unsigned long addr_hint, unsigned int pages_per_huge_page)
5108{
5109 unsigned long addr = addr_hint &
5110 ~(((unsigned long)pages_per_huge_page << PAGE_SHIFT) - 1);
5111
5112 if (unlikely(pages_per_huge_page > MAX_ORDER_NR_PAGES)) {
5113 clear_gigantic_page(page, addr, pages_per_huge_page);
5114 return;
5115 }
5116
5117 process_huge_page(addr_hint, pages_per_huge_page, clear_subpage, page);
5118}
5119
5120static void copy_user_gigantic_page(struct page *dst, struct page *src,
5121 unsigned long addr,
5122 struct vm_area_struct *vma,
5123 unsigned int pages_per_huge_page)
5124{
5125 int i;
5126 struct page *dst_base = dst;
5127 struct page *src_base = src;
5128
5129 for (i = 0; i < pages_per_huge_page; ) {
5130 cond_resched();
5131 copy_user_highpage(dst, src, addr + i*PAGE_SIZE, vma);
5132
5133 i++;
5134 dst = mem_map_next(dst, dst_base, i);
5135 src = mem_map_next(src, src_base, i);
5136 }
5137}
5138
5139struct copy_subpage_arg {
5140 struct page *dst;
5141 struct page *src;
5142 struct vm_area_struct *vma;
5143};
5144
5145static void copy_subpage(unsigned long addr, int idx, void *arg)
5146{
5147 struct copy_subpage_arg *copy_arg = arg;
5148
5149 copy_user_highpage(copy_arg->dst + idx, copy_arg->src + idx,
5150 addr, copy_arg->vma);
5151}
5152
5153void copy_user_huge_page(struct page *dst, struct page *src,
5154 unsigned long addr_hint, struct vm_area_struct *vma,
5155 unsigned int pages_per_huge_page)
5156{
5157 unsigned long addr = addr_hint &
5158 ~(((unsigned long)pages_per_huge_page << PAGE_SHIFT) - 1);
5159 struct copy_subpage_arg arg = {
5160 .dst = dst,
5161 .src = src,
5162 .vma = vma,
5163 };
5164
5165 if (unlikely(pages_per_huge_page > MAX_ORDER_NR_PAGES)) {
5166 copy_user_gigantic_page(dst, src, addr, vma,
5167 pages_per_huge_page);
5168 return;
5169 }
5170
5171 process_huge_page(addr_hint, pages_per_huge_page, copy_subpage, &arg);
5172}
5173
5174long copy_huge_page_from_user(struct page *dst_page,
5175 const void __user *usr_src,
5176 unsigned int pages_per_huge_page,
5177 bool allow_pagefault)
5178{
5179 void *src = (void *)usr_src;
5180 void *page_kaddr;
5181 unsigned long i, rc = 0;
5182 unsigned long ret_val = pages_per_huge_page * PAGE_SIZE;
5183
5184 for (i = 0; i < pages_per_huge_page; i++) {
5185 if (allow_pagefault)
5186 page_kaddr = kmap(dst_page + i);
5187 else
5188 page_kaddr = kmap_atomic(dst_page + i);
5189 rc = copy_from_user(page_kaddr,
5190 (const void __user *)(src + i * PAGE_SIZE),
5191 PAGE_SIZE);
5192 if (allow_pagefault)
5193 kunmap(dst_page + i);
5194 else
5195 kunmap_atomic(page_kaddr);
5196
5197 ret_val -= (PAGE_SIZE - rc);
5198 if (rc)
5199 break;
5200
5201 cond_resched();
5202 }
5203 return ret_val;
5204}
5205#endif /* CONFIG_TRANSPARENT_HUGEPAGE || CONFIG_HUGETLBFS */
5206
5207#if USE_SPLIT_PTE_PTLOCKS && ALLOC_SPLIT_PTLOCKS
5208
5209static struct kmem_cache *page_ptl_cachep;
5210
5211void __init ptlock_cache_init(void)
5212{
5213 page_ptl_cachep = kmem_cache_create("page->ptl", sizeof(spinlock_t), 0,
5214 SLAB_PANIC, NULL);
5215}
5216
5217bool ptlock_alloc(struct page *page)
5218{
5219 spinlock_t *ptl;
5220
5221 ptl = kmem_cache_alloc(page_ptl_cachep, GFP_KERNEL);
5222 if (!ptl)
5223 return false;
5224 page->ptl = ptl;
5225 return true;
5226}
5227
5228void ptlock_free(struct page *page)
5229{
5230 kmem_cache_free(page_ptl_cachep, page->ptl);
5231}
5232#endif
1/*
2 * linux/mm/memory.c
3 *
4 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
5 */
6
7/*
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
10 */
11
12/*
13 * Ok, demand-loading was easy, shared pages a little bit tricker. Shared
14 * pages started 02.12.91, seems to work. - Linus.
15 *
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
18 * far as I could see.
19 *
20 * Also corrected some "invalidate()"s - I wasn't doing enough of them.
21 */
22
23/*
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.
29 */
30
31/*
32 * 05.04.94 - Multi-page memory management added for v1.1.
33 * Idea by Alex Bligh (alex@cconcepts.co.uk)
34 *
35 * 16.07.99 - Support of BIGMEM added by Gerhard Wichert, Siemens AG
36 * (Gerhard.Wichert@pdb.siemens.de)
37 *
38 * Aug/Sep 2004 Changed to four level page tables (Andi Kleen)
39 */
40
41#include <linux/kernel_stat.h>
42#include <linux/mm.h>
43#include <linux/hugetlb.h>
44#include <linux/mman.h>
45#include <linux/swap.h>
46#include <linux/highmem.h>
47#include <linux/pagemap.h>
48#include <linux/ksm.h>
49#include <linux/rmap.h>
50#include <linux/export.h>
51#include <linux/delayacct.h>
52#include <linux/init.h>
53#include <linux/writeback.h>
54#include <linux/memcontrol.h>
55#include <linux/mmu_notifier.h>
56#include <linux/kallsyms.h>
57#include <linux/swapops.h>
58#include <linux/elf.h>
59#include <linux/gfp.h>
60
61#include <asm/io.h>
62#include <asm/pgalloc.h>
63#include <asm/uaccess.h>
64#include <asm/tlb.h>
65#include <asm/tlbflush.h>
66#include <asm/pgtable.h>
67
68#include "internal.h"
69
70#ifndef CONFIG_NEED_MULTIPLE_NODES
71/* use the per-pgdat data instead for discontigmem - mbligh */
72unsigned long max_mapnr;
73struct page *mem_map;
74
75EXPORT_SYMBOL(max_mapnr);
76EXPORT_SYMBOL(mem_map);
77#endif
78
79unsigned long num_physpages;
80/*
81 * A number of key systems in x86 including ioremap() rely on the assumption
82 * that high_memory defines the upper bound on direct map memory, then end
83 * of ZONE_NORMAL. Under CONFIG_DISCONTIG this means that max_low_pfn and
84 * highstart_pfn must be the same; there must be no gap between ZONE_NORMAL
85 * and ZONE_HIGHMEM.
86 */
87void * high_memory;
88
89EXPORT_SYMBOL(num_physpages);
90EXPORT_SYMBOL(high_memory);
91
92/*
93 * Randomize the address space (stacks, mmaps, brk, etc.).
94 *
95 * ( When CONFIG_COMPAT_BRK=y we exclude brk from randomization,
96 * as ancient (libc5 based) binaries can segfault. )
97 */
98int randomize_va_space __read_mostly =
99#ifdef CONFIG_COMPAT_BRK
100 1;
101#else
102 2;
103#endif
104
105static int __init disable_randmaps(char *s)
106{
107 randomize_va_space = 0;
108 return 1;
109}
110__setup("norandmaps", disable_randmaps);
111
112unsigned long zero_pfn __read_mostly;
113unsigned long highest_memmap_pfn __read_mostly;
114
115/*
116 * CONFIG_MMU architectures set up ZERO_PAGE in their paging_init()
117 */
118static int __init init_zero_pfn(void)
119{
120 zero_pfn = page_to_pfn(ZERO_PAGE(0));
121 return 0;
122}
123core_initcall(init_zero_pfn);
124
125
126#if defined(SPLIT_RSS_COUNTING)
127
128void sync_mm_rss(struct mm_struct *mm)
129{
130 int i;
131
132 for (i = 0; i < NR_MM_COUNTERS; i++) {
133 if (current->rss_stat.count[i]) {
134 add_mm_counter(mm, i, current->rss_stat.count[i]);
135 current->rss_stat.count[i] = 0;
136 }
137 }
138 current->rss_stat.events = 0;
139}
140
141static void add_mm_counter_fast(struct mm_struct *mm, int member, int val)
142{
143 struct task_struct *task = current;
144
145 if (likely(task->mm == mm))
146 task->rss_stat.count[member] += val;
147 else
148 add_mm_counter(mm, member, val);
149}
150#define inc_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, 1)
151#define dec_mm_counter_fast(mm, member) add_mm_counter_fast(mm, member, -1)
152
153/* sync counter once per 64 page faults */
154#define TASK_RSS_EVENTS_THRESH (64)
155static void check_sync_rss_stat(struct task_struct *task)
156{
157 if (unlikely(task != current))
158 return;
159 if (unlikely(task->rss_stat.events++ > TASK_RSS_EVENTS_THRESH))
160 sync_mm_rss(task->mm);
161}
162#else /* SPLIT_RSS_COUNTING */
163
164#define inc_mm_counter_fast(mm, member) inc_mm_counter(mm, member)
165#define dec_mm_counter_fast(mm, member) dec_mm_counter(mm, member)
166
167static void check_sync_rss_stat(struct task_struct *task)
168{
169}
170
171#endif /* SPLIT_RSS_COUNTING */
172
173#ifdef HAVE_GENERIC_MMU_GATHER
174
175static int tlb_next_batch(struct mmu_gather *tlb)
176{
177 struct mmu_gather_batch *batch;
178
179 batch = tlb->active;
180 if (batch->next) {
181 tlb->active = batch->next;
182 return 1;
183 }
184
185 batch = (void *)__get_free_pages(GFP_NOWAIT | __GFP_NOWARN, 0);
186 if (!batch)
187 return 0;
188
189 batch->next = NULL;
190 batch->nr = 0;
191 batch->max = MAX_GATHER_BATCH;
192
193 tlb->active->next = batch;
194 tlb->active = batch;
195
196 return 1;
197}
198
199/* tlb_gather_mmu
200 * Called to initialize an (on-stack) mmu_gather structure for page-table
201 * tear-down from @mm. The @fullmm argument is used when @mm is without
202 * users and we're going to destroy the full address space (exit/execve).
203 */
204void tlb_gather_mmu(struct mmu_gather *tlb, struct mm_struct *mm, bool fullmm)
205{
206 tlb->mm = mm;
207
208 tlb->fullmm = fullmm;
209 tlb->need_flush = 0;
210 tlb->fast_mode = (num_possible_cpus() == 1);
211 tlb->local.next = NULL;
212 tlb->local.nr = 0;
213 tlb->local.max = ARRAY_SIZE(tlb->__pages);
214 tlb->active = &tlb->local;
215
216#ifdef CONFIG_HAVE_RCU_TABLE_FREE
217 tlb->batch = NULL;
218#endif
219}
220
221void tlb_flush_mmu(struct mmu_gather *tlb)
222{
223 struct mmu_gather_batch *batch;
224
225 if (!tlb->need_flush)
226 return;
227 tlb->need_flush = 0;
228 tlb_flush(tlb);
229#ifdef CONFIG_HAVE_RCU_TABLE_FREE
230 tlb_table_flush(tlb);
231#endif
232
233 if (tlb_fast_mode(tlb))
234 return;
235
236 for (batch = &tlb->local; batch; batch = batch->next) {
237 free_pages_and_swap_cache(batch->pages, batch->nr);
238 batch->nr = 0;
239 }
240 tlb->active = &tlb->local;
241}
242
243/* tlb_finish_mmu
244 * Called at the end of the shootdown operation to free up any resources
245 * that were required.
246 */
247void tlb_finish_mmu(struct mmu_gather *tlb, unsigned long start, unsigned long end)
248{
249 struct mmu_gather_batch *batch, *next;
250
251 tlb_flush_mmu(tlb);
252
253 /* keep the page table cache within bounds */
254 check_pgt_cache();
255
256 for (batch = tlb->local.next; batch; batch = next) {
257 next = batch->next;
258 free_pages((unsigned long)batch, 0);
259 }
260 tlb->local.next = NULL;
261}
262
263/* __tlb_remove_page
264 * Must perform the equivalent to __free_pte(pte_get_and_clear(ptep)), while
265 * handling the additional races in SMP caused by other CPUs caching valid
266 * mappings in their TLBs. Returns the number of free page slots left.
267 * When out of page slots we must call tlb_flush_mmu().
268 */
269int __tlb_remove_page(struct mmu_gather *tlb, struct page *page)
270{
271 struct mmu_gather_batch *batch;
272
273 VM_BUG_ON(!tlb->need_flush);
274
275 if (tlb_fast_mode(tlb)) {
276 free_page_and_swap_cache(page);
277 return 1; /* avoid calling tlb_flush_mmu() */
278 }
279
280 batch = tlb->active;
281 batch->pages[batch->nr++] = page;
282 if (batch->nr == batch->max) {
283 if (!tlb_next_batch(tlb))
284 return 0;
285 batch = tlb->active;
286 }
287 VM_BUG_ON(batch->nr > batch->max);
288
289 return batch->max - batch->nr;
290}
291
292#endif /* HAVE_GENERIC_MMU_GATHER */
293
294#ifdef CONFIG_HAVE_RCU_TABLE_FREE
295
296/*
297 * See the comment near struct mmu_table_batch.
298 */
299
300static void tlb_remove_table_smp_sync(void *arg)
301{
302 /* Simply deliver the interrupt */
303}
304
305static void tlb_remove_table_one(void *table)
306{
307 /*
308 * This isn't an RCU grace period and hence the page-tables cannot be
309 * assumed to be actually RCU-freed.
310 *
311 * It is however sufficient for software page-table walkers that rely on
312 * IRQ disabling. See the comment near struct mmu_table_batch.
313 */
314 smp_call_function(tlb_remove_table_smp_sync, NULL, 1);
315 __tlb_remove_table(table);
316}
317
318static void tlb_remove_table_rcu(struct rcu_head *head)
319{
320 struct mmu_table_batch *batch;
321 int i;
322
323 batch = container_of(head, struct mmu_table_batch, rcu);
324
325 for (i = 0; i < batch->nr; i++)
326 __tlb_remove_table(batch->tables[i]);
327
328 free_page((unsigned long)batch);
329}
330
331void tlb_table_flush(struct mmu_gather *tlb)
332{
333 struct mmu_table_batch **batch = &tlb->batch;
334
335 if (*batch) {
336 call_rcu_sched(&(*batch)->rcu, tlb_remove_table_rcu);
337 *batch = NULL;
338 }
339}
340
341void tlb_remove_table(struct mmu_gather *tlb, void *table)
342{
343 struct mmu_table_batch **batch = &tlb->batch;
344
345 tlb->need_flush = 1;
346
347 /*
348 * When there's less then two users of this mm there cannot be a
349 * concurrent page-table walk.
350 */
351 if (atomic_read(&tlb->mm->mm_users) < 2) {
352 __tlb_remove_table(table);
353 return;
354 }
355
356 if (*batch == NULL) {
357 *batch = (struct mmu_table_batch *)__get_free_page(GFP_NOWAIT | __GFP_NOWARN);
358 if (*batch == NULL) {
359 tlb_remove_table_one(table);
360 return;
361 }
362 (*batch)->nr = 0;
363 }
364 (*batch)->tables[(*batch)->nr++] = table;
365 if ((*batch)->nr == MAX_TABLE_BATCH)
366 tlb_table_flush(tlb);
367}
368
369#endif /* CONFIG_HAVE_RCU_TABLE_FREE */
370
371/*
372 * If a p?d_bad entry is found while walking page tables, report
373 * the error, before resetting entry to p?d_none. Usually (but
374 * very seldom) called out from the p?d_none_or_clear_bad macros.
375 */
376
377void pgd_clear_bad(pgd_t *pgd)
378{
379 pgd_ERROR(*pgd);
380 pgd_clear(pgd);
381}
382
383void pud_clear_bad(pud_t *pud)
384{
385 pud_ERROR(*pud);
386 pud_clear(pud);
387}
388
389void pmd_clear_bad(pmd_t *pmd)
390{
391 pmd_ERROR(*pmd);
392 pmd_clear(pmd);
393}
394
395/*
396 * Note: this doesn't free the actual pages themselves. That
397 * has been handled earlier when unmapping all the memory regions.
398 */
399static void free_pte_range(struct mmu_gather *tlb, pmd_t *pmd,
400 unsigned long addr)
401{
402 pgtable_t token = pmd_pgtable(*pmd);
403 pmd_clear(pmd);
404 pte_free_tlb(tlb, token, addr);
405 tlb->mm->nr_ptes--;
406}
407
408static inline void free_pmd_range(struct mmu_gather *tlb, pud_t *pud,
409 unsigned long addr, unsigned long end,
410 unsigned long floor, unsigned long ceiling)
411{
412 pmd_t *pmd;
413 unsigned long next;
414 unsigned long start;
415
416 start = addr;
417 pmd = pmd_offset(pud, addr);
418 do {
419 next = pmd_addr_end(addr, end);
420 if (pmd_none_or_clear_bad(pmd))
421 continue;
422 free_pte_range(tlb, pmd, addr);
423 } while (pmd++, addr = next, addr != end);
424
425 start &= PUD_MASK;
426 if (start < floor)
427 return;
428 if (ceiling) {
429 ceiling &= PUD_MASK;
430 if (!ceiling)
431 return;
432 }
433 if (end - 1 > ceiling - 1)
434 return;
435
436 pmd = pmd_offset(pud, start);
437 pud_clear(pud);
438 pmd_free_tlb(tlb, pmd, start);
439}
440
441static inline void free_pud_range(struct mmu_gather *tlb, pgd_t *pgd,
442 unsigned long addr, unsigned long end,
443 unsigned long floor, unsigned long ceiling)
444{
445 pud_t *pud;
446 unsigned long next;
447 unsigned long start;
448
449 start = addr;
450 pud = pud_offset(pgd, addr);
451 do {
452 next = pud_addr_end(addr, end);
453 if (pud_none_or_clear_bad(pud))
454 continue;
455 free_pmd_range(tlb, pud, addr, next, floor, ceiling);
456 } while (pud++, addr = next, addr != end);
457
458 start &= PGDIR_MASK;
459 if (start < floor)
460 return;
461 if (ceiling) {
462 ceiling &= PGDIR_MASK;
463 if (!ceiling)
464 return;
465 }
466 if (end - 1 > ceiling - 1)
467 return;
468
469 pud = pud_offset(pgd, start);
470 pgd_clear(pgd);
471 pud_free_tlb(tlb, pud, start);
472}
473
474/*
475 * This function frees user-level page tables of a process.
476 *
477 * Must be called with pagetable lock held.
478 */
479void free_pgd_range(struct mmu_gather *tlb,
480 unsigned long addr, unsigned long end,
481 unsigned long floor, unsigned long ceiling)
482{
483 pgd_t *pgd;
484 unsigned long next;
485
486 /*
487 * The next few lines have given us lots of grief...
488 *
489 * Why are we testing PMD* at this top level? Because often
490 * there will be no work to do at all, and we'd prefer not to
491 * go all the way down to the bottom just to discover that.
492 *
493 * Why all these "- 1"s? Because 0 represents both the bottom
494 * of the address space and the top of it (using -1 for the
495 * top wouldn't help much: the masks would do the wrong thing).
496 * The rule is that addr 0 and floor 0 refer to the bottom of
497 * the address space, but end 0 and ceiling 0 refer to the top
498 * Comparisons need to use "end - 1" and "ceiling - 1" (though
499 * that end 0 case should be mythical).
500 *
501 * Wherever addr is brought up or ceiling brought down, we must
502 * be careful to reject "the opposite 0" before it confuses the
503 * subsequent tests. But what about where end is brought down
504 * by PMD_SIZE below? no, end can't go down to 0 there.
505 *
506 * Whereas we round start (addr) and ceiling down, by different
507 * masks at different levels, in order to test whether a table
508 * now has no other vmas using it, so can be freed, we don't
509 * bother to round floor or end up - the tests don't need that.
510 */
511
512 addr &= PMD_MASK;
513 if (addr < floor) {
514 addr += PMD_SIZE;
515 if (!addr)
516 return;
517 }
518 if (ceiling) {
519 ceiling &= PMD_MASK;
520 if (!ceiling)
521 return;
522 }
523 if (end - 1 > ceiling - 1)
524 end -= PMD_SIZE;
525 if (addr > end - 1)
526 return;
527
528 pgd = pgd_offset(tlb->mm, addr);
529 do {
530 next = pgd_addr_end(addr, end);
531 if (pgd_none_or_clear_bad(pgd))
532 continue;
533 free_pud_range(tlb, pgd, addr, next, floor, ceiling);
534 } while (pgd++, addr = next, addr != end);
535}
536
537void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *vma,
538 unsigned long floor, unsigned long ceiling)
539{
540 while (vma) {
541 struct vm_area_struct *next = vma->vm_next;
542 unsigned long addr = vma->vm_start;
543
544 /*
545 * Hide vma from rmap and truncate_pagecache before freeing
546 * pgtables
547 */
548 unlink_anon_vmas(vma);
549 unlink_file_vma(vma);
550
551 if (is_vm_hugetlb_page(vma)) {
552 hugetlb_free_pgd_range(tlb, addr, vma->vm_end,
553 floor, next? next->vm_start: ceiling);
554 } else {
555 /*
556 * Optimization: gather nearby vmas into one call down
557 */
558 while (next && next->vm_start <= vma->vm_end + PMD_SIZE
559 && !is_vm_hugetlb_page(next)) {
560 vma = next;
561 next = vma->vm_next;
562 unlink_anon_vmas(vma);
563 unlink_file_vma(vma);
564 }
565 free_pgd_range(tlb, addr, vma->vm_end,
566 floor, next? next->vm_start: ceiling);
567 }
568 vma = next;
569 }
570}
571
572int __pte_alloc(struct mm_struct *mm, struct vm_area_struct *vma,
573 pmd_t *pmd, unsigned long address)
574{
575 pgtable_t new = pte_alloc_one(mm, address);
576 int wait_split_huge_page;
577 if (!new)
578 return -ENOMEM;
579
580 /*
581 * Ensure all pte setup (eg. pte page lock and page clearing) are
582 * visible before the pte is made visible to other CPUs by being
583 * put into page tables.
584 *
585 * The other side of the story is the pointer chasing in the page
586 * table walking code (when walking the page table without locking;
587 * ie. most of the time). Fortunately, these data accesses consist
588 * of a chain of data-dependent loads, meaning most CPUs (alpha
589 * being the notable exception) will already guarantee loads are
590 * seen in-order. See the alpha page table accessors for the
591 * smp_read_barrier_depends() barriers in page table walking code.
592 */
593 smp_wmb(); /* Could be smp_wmb__xxx(before|after)_spin_lock */
594
595 spin_lock(&mm->page_table_lock);
596 wait_split_huge_page = 0;
597 if (likely(pmd_none(*pmd))) { /* Has another populated it ? */
598 mm->nr_ptes++;
599 pmd_populate(mm, pmd, new);
600 new = NULL;
601 } else if (unlikely(pmd_trans_splitting(*pmd)))
602 wait_split_huge_page = 1;
603 spin_unlock(&mm->page_table_lock);
604 if (new)
605 pte_free(mm, new);
606 if (wait_split_huge_page)
607 wait_split_huge_page(vma->anon_vma, pmd);
608 return 0;
609}
610
611int __pte_alloc_kernel(pmd_t *pmd, unsigned long address)
612{
613 pte_t *new = pte_alloc_one_kernel(&init_mm, address);
614 if (!new)
615 return -ENOMEM;
616
617 smp_wmb(); /* See comment in __pte_alloc */
618
619 spin_lock(&init_mm.page_table_lock);
620 if (likely(pmd_none(*pmd))) { /* Has another populated it ? */
621 pmd_populate_kernel(&init_mm, pmd, new);
622 new = NULL;
623 } else
624 VM_BUG_ON(pmd_trans_splitting(*pmd));
625 spin_unlock(&init_mm.page_table_lock);
626 if (new)
627 pte_free_kernel(&init_mm, new);
628 return 0;
629}
630
631static inline void init_rss_vec(int *rss)
632{
633 memset(rss, 0, sizeof(int) * NR_MM_COUNTERS);
634}
635
636static inline void add_mm_rss_vec(struct mm_struct *mm, int *rss)
637{
638 int i;
639
640 if (current->mm == mm)
641 sync_mm_rss(mm);
642 for (i = 0; i < NR_MM_COUNTERS; i++)
643 if (rss[i])
644 add_mm_counter(mm, i, rss[i]);
645}
646
647/*
648 * This function is called to print an error when a bad pte
649 * is found. For example, we might have a PFN-mapped pte in
650 * a region that doesn't allow it.
651 *
652 * The calling function must still handle the error.
653 */
654static void print_bad_pte(struct vm_area_struct *vma, unsigned long addr,
655 pte_t pte, struct page *page)
656{
657 pgd_t *pgd = pgd_offset(vma->vm_mm, addr);
658 pud_t *pud = pud_offset(pgd, addr);
659 pmd_t *pmd = pmd_offset(pud, addr);
660 struct address_space *mapping;
661 pgoff_t index;
662 static unsigned long resume;
663 static unsigned long nr_shown;
664 static unsigned long nr_unshown;
665
666 /*
667 * Allow a burst of 60 reports, then keep quiet for that minute;
668 * or allow a steady drip of one report per second.
669 */
670 if (nr_shown == 60) {
671 if (time_before(jiffies, resume)) {
672 nr_unshown++;
673 return;
674 }
675 if (nr_unshown) {
676 printk(KERN_ALERT
677 "BUG: Bad page map: %lu messages suppressed\n",
678 nr_unshown);
679 nr_unshown = 0;
680 }
681 nr_shown = 0;
682 }
683 if (nr_shown++ == 0)
684 resume = jiffies + 60 * HZ;
685
686 mapping = vma->vm_file ? vma->vm_file->f_mapping : NULL;
687 index = linear_page_index(vma, addr);
688
689 printk(KERN_ALERT
690 "BUG: Bad page map in process %s pte:%08llx pmd:%08llx\n",
691 current->comm,
692 (long long)pte_val(pte), (long long)pmd_val(*pmd));
693 if (page)
694 dump_page(page);
695 printk(KERN_ALERT
696 "addr:%p vm_flags:%08lx anon_vma:%p mapping:%p index:%lx\n",
697 (void *)addr, vma->vm_flags, vma->anon_vma, mapping, index);
698 /*
699 * Choose text because data symbols depend on CONFIG_KALLSYMS_ALL=y
700 */
701 if (vma->vm_ops)
702 print_symbol(KERN_ALERT "vma->vm_ops->fault: %s\n",
703 (unsigned long)vma->vm_ops->fault);
704 if (vma->vm_file && vma->vm_file->f_op)
705 print_symbol(KERN_ALERT "vma->vm_file->f_op->mmap: %s\n",
706 (unsigned long)vma->vm_file->f_op->mmap);
707 dump_stack();
708 add_taint(TAINT_BAD_PAGE);
709}
710
711static inline int is_cow_mapping(vm_flags_t flags)
712{
713 return (flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
714}
715
716#ifndef is_zero_pfn
717static inline int is_zero_pfn(unsigned long pfn)
718{
719 return pfn == zero_pfn;
720}
721#endif
722
723#ifndef my_zero_pfn
724static inline unsigned long my_zero_pfn(unsigned long addr)
725{
726 return zero_pfn;
727}
728#endif
729
730/*
731 * vm_normal_page -- This function gets the "struct page" associated with a pte.
732 *
733 * "Special" mappings do not wish to be associated with a "struct page" (either
734 * it doesn't exist, or it exists but they don't want to touch it). In this
735 * case, NULL is returned here. "Normal" mappings do have a struct page.
736 *
737 * There are 2 broad cases. Firstly, an architecture may define a pte_special()
738 * pte bit, in which case this function is trivial. Secondly, an architecture
739 * may not have a spare pte bit, which requires a more complicated scheme,
740 * described below.
741 *
742 * A raw VM_PFNMAP mapping (ie. one that is not COWed) is always considered a
743 * special mapping (even if there are underlying and valid "struct pages").
744 * COWed pages of a VM_PFNMAP are always normal.
745 *
746 * The way we recognize COWed pages within VM_PFNMAP mappings is through the
747 * rules set up by "remap_pfn_range()": the vma will have the VM_PFNMAP bit
748 * set, and the vm_pgoff will point to the first PFN mapped: thus every special
749 * mapping will always honor the rule
750 *
751 * pfn_of_page == vma->vm_pgoff + ((addr - vma->vm_start) >> PAGE_SHIFT)
752 *
753 * And for normal mappings this is false.
754 *
755 * This restricts such mappings to be a linear translation from virtual address
756 * to pfn. To get around this restriction, we allow arbitrary mappings so long
757 * as the vma is not a COW mapping; in that case, we know that all ptes are
758 * special (because none can have been COWed).
759 *
760 *
761 * In order to support COW of arbitrary special mappings, we have VM_MIXEDMAP.
762 *
763 * VM_MIXEDMAP mappings can likewise contain memory with or without "struct
764 * page" backing, however the difference is that _all_ pages with a struct
765 * page (that is, those where pfn_valid is true) are refcounted and considered
766 * normal pages by the VM. The disadvantage is that pages are refcounted
767 * (which can be slower and simply not an option for some PFNMAP users). The
768 * advantage is that we don't have to follow the strict linearity rule of
769 * PFNMAP mappings in order to support COWable mappings.
770 *
771 */
772#ifdef __HAVE_ARCH_PTE_SPECIAL
773# define HAVE_PTE_SPECIAL 1
774#else
775# define HAVE_PTE_SPECIAL 0
776#endif
777struct page *vm_normal_page(struct vm_area_struct *vma, unsigned long addr,
778 pte_t pte)
779{
780 unsigned long pfn = pte_pfn(pte);
781
782 if (HAVE_PTE_SPECIAL) {
783 if (likely(!pte_special(pte)))
784 goto check_pfn;
785 if (vma->vm_flags & (VM_PFNMAP | VM_MIXEDMAP))
786 return NULL;
787 if (!is_zero_pfn(pfn))
788 print_bad_pte(vma, addr, pte, NULL);
789 return NULL;
790 }
791
792 /* !HAVE_PTE_SPECIAL case follows: */
793
794 if (unlikely(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))) {
795 if (vma->vm_flags & VM_MIXEDMAP) {
796 if (!pfn_valid(pfn))
797 return NULL;
798 goto out;
799 } else {
800 unsigned long off;
801 off = (addr - vma->vm_start) >> PAGE_SHIFT;
802 if (pfn == vma->vm_pgoff + off)
803 return NULL;
804 if (!is_cow_mapping(vma->vm_flags))
805 return NULL;
806 }
807 }
808
809 if (is_zero_pfn(pfn))
810 return NULL;
811check_pfn:
812 if (unlikely(pfn > highest_memmap_pfn)) {
813 print_bad_pte(vma, addr, pte, NULL);
814 return NULL;
815 }
816
817 /*
818 * NOTE! We still have PageReserved() pages in the page tables.
819 * eg. VDSO mappings can cause them to exist.
820 */
821out:
822 return pfn_to_page(pfn);
823}
824
825/*
826 * copy one vm_area from one task to the other. Assumes the page tables
827 * already present in the new task to be cleared in the whole range
828 * covered by this vma.
829 */
830
831static inline unsigned long
832copy_one_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm,
833 pte_t *dst_pte, pte_t *src_pte, struct vm_area_struct *vma,
834 unsigned long addr, int *rss)
835{
836 unsigned long vm_flags = vma->vm_flags;
837 pte_t pte = *src_pte;
838 struct page *page;
839
840 /* pte contains position in swap or file, so copy. */
841 if (unlikely(!pte_present(pte))) {
842 if (!pte_file(pte)) {
843 swp_entry_t entry = pte_to_swp_entry(pte);
844
845 if (swap_duplicate(entry) < 0)
846 return entry.val;
847
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,
853 &src_mm->mmlist);
854 spin_unlock(&mmlist_lock);
855 }
856 if (likely(!non_swap_entry(entry)))
857 rss[MM_SWAPENTS]++;
858 else if (is_migration_entry(entry)) {
859 page = migration_entry_to_page(entry);
860
861 if (PageAnon(page))
862 rss[MM_ANONPAGES]++;
863 else
864 rss[MM_FILEPAGES]++;
865
866 if (is_write_migration_entry(entry) &&
867 is_cow_mapping(vm_flags)) {
868 /*
869 * COW mappings require pages in both
870 * parent and child to be set to read.
871 */
872 make_migration_entry_read(&entry);
873 pte = swp_entry_to_pte(entry);
874 set_pte_at(src_mm, addr, src_pte, pte);
875 }
876 }
877 }
878 goto out_set_pte;
879 }
880
881 /*
882 * If it's a COW mapping, write protect it both
883 * in the parent and the child
884 */
885 if (is_cow_mapping(vm_flags)) {
886 ptep_set_wrprotect(src_mm, addr, src_pte);
887 pte = pte_wrprotect(pte);
888 }
889
890 /*
891 * If it's a shared mapping, mark it clean in
892 * the child
893 */
894 if (vm_flags & VM_SHARED)
895 pte = pte_mkclean(pte);
896 pte = pte_mkold(pte);
897
898 page = vm_normal_page(vma, addr, pte);
899 if (page) {
900 get_page(page);
901 page_dup_rmap(page);
902 if (PageAnon(page))
903 rss[MM_ANONPAGES]++;
904 else
905 rss[MM_FILEPAGES]++;
906 }
907
908out_set_pte:
909 set_pte_at(dst_mm, addr, dst_pte, pte);
910 return 0;
911}
912
913int copy_pte_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
914 pmd_t *dst_pmd, pmd_t *src_pmd, struct vm_area_struct *vma,
915 unsigned long addr, unsigned long end)
916{
917 pte_t *orig_src_pte, *orig_dst_pte;
918 pte_t *src_pte, *dst_pte;
919 spinlock_t *src_ptl, *dst_ptl;
920 int progress = 0;
921 int rss[NR_MM_COUNTERS];
922 swp_entry_t entry = (swp_entry_t){0};
923
924again:
925 init_rss_vec(rss);
926
927 dst_pte = pte_alloc_map_lock(dst_mm, dst_pmd, addr, &dst_ptl);
928 if (!dst_pte)
929 return -ENOMEM;
930 src_pte = pte_offset_map(src_pmd, addr);
931 src_ptl = pte_lockptr(src_mm, src_pmd);
932 spin_lock_nested(src_ptl, SINGLE_DEPTH_NESTING);
933 orig_src_pte = src_pte;
934 orig_dst_pte = dst_pte;
935 arch_enter_lazy_mmu_mode();
936
937 do {
938 /*
939 * We are holding two locks at this point - either of them
940 * could generate latencies in another task on another CPU.
941 */
942 if (progress >= 32) {
943 progress = 0;
944 if (need_resched() ||
945 spin_needbreak(src_ptl) || spin_needbreak(dst_ptl))
946 break;
947 }
948 if (pte_none(*src_pte)) {
949 progress++;
950 continue;
951 }
952 entry.val = copy_one_pte(dst_mm, src_mm, dst_pte, src_pte,
953 vma, addr, rss);
954 if (entry.val)
955 break;
956 progress += 8;
957 } while (dst_pte++, src_pte++, addr += PAGE_SIZE, addr != end);
958
959 arch_leave_lazy_mmu_mode();
960 spin_unlock(src_ptl);
961 pte_unmap(orig_src_pte);
962 add_mm_rss_vec(dst_mm, rss);
963 pte_unmap_unlock(orig_dst_pte, dst_ptl);
964 cond_resched();
965
966 if (entry.val) {
967 if (add_swap_count_continuation(entry, GFP_KERNEL) < 0)
968 return -ENOMEM;
969 progress = 0;
970 }
971 if (addr != end)
972 goto again;
973 return 0;
974}
975
976static inline int copy_pmd_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
977 pud_t *dst_pud, pud_t *src_pud, struct vm_area_struct *vma,
978 unsigned long addr, unsigned long end)
979{
980 pmd_t *src_pmd, *dst_pmd;
981 unsigned long next;
982
983 dst_pmd = pmd_alloc(dst_mm, dst_pud, addr);
984 if (!dst_pmd)
985 return -ENOMEM;
986 src_pmd = pmd_offset(src_pud, addr);
987 do {
988 next = pmd_addr_end(addr, end);
989 if (pmd_trans_huge(*src_pmd)) {
990 int err;
991 VM_BUG_ON(next-addr != HPAGE_PMD_SIZE);
992 err = copy_huge_pmd(dst_mm, src_mm,
993 dst_pmd, src_pmd, addr, vma);
994 if (err == -ENOMEM)
995 return -ENOMEM;
996 if (!err)
997 continue;
998 /* fall through */
999 }
1000 if (pmd_none_or_clear_bad(src_pmd))
1001 continue;
1002 if (copy_pte_range(dst_mm, src_mm, dst_pmd, src_pmd,
1003 vma, addr, next))
1004 return -ENOMEM;
1005 } while (dst_pmd++, src_pmd++, addr = next, addr != end);
1006 return 0;
1007}
1008
1009static inline int copy_pud_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
1010 pgd_t *dst_pgd, pgd_t *src_pgd, struct vm_area_struct *vma,
1011 unsigned long addr, unsigned long end)
1012{
1013 pud_t *src_pud, *dst_pud;
1014 unsigned long next;
1015
1016 dst_pud = pud_alloc(dst_mm, dst_pgd, addr);
1017 if (!dst_pud)
1018 return -ENOMEM;
1019 src_pud = pud_offset(src_pgd, addr);
1020 do {
1021 next = pud_addr_end(addr, end);
1022 if (pud_none_or_clear_bad(src_pud))
1023 continue;
1024 if (copy_pmd_range(dst_mm, src_mm, dst_pud, src_pud,
1025 vma, addr, next))
1026 return -ENOMEM;
1027 } while (dst_pud++, src_pud++, addr = next, addr != end);
1028 return 0;
1029}
1030
1031int copy_page_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
1032 struct vm_area_struct *vma)
1033{
1034 pgd_t *src_pgd, *dst_pgd;
1035 unsigned long next;
1036 unsigned long addr = vma->vm_start;
1037 unsigned long end = vma->vm_end;
1038 int ret;
1039
1040 /*
1041 * Don't copy ptes where a page fault will fill them correctly.
1042 * Fork becomes much lighter when there are big shared or private
1043 * readonly mappings. The tradeoff is that copy_page_range is more
1044 * efficient than faulting.
1045 */
1046 if (!(vma->vm_flags & (VM_HUGETLB|VM_NONLINEAR|VM_PFNMAP|VM_INSERTPAGE))) {
1047 if (!vma->anon_vma)
1048 return 0;
1049 }
1050
1051 if (is_vm_hugetlb_page(vma))
1052 return copy_hugetlb_page_range(dst_mm, src_mm, vma);
1053
1054 if (unlikely(is_pfn_mapping(vma))) {
1055 /*
1056 * We do not free on error cases below as remove_vma
1057 * gets called on error from higher level routine
1058 */
1059 ret = track_pfn_vma_copy(vma);
1060 if (ret)
1061 return ret;
1062 }
1063
1064 /*
1065 * We need to invalidate the secondary MMU mappings only when
1066 * there could be a permission downgrade on the ptes of the
1067 * parent mm. And a permission downgrade will only happen if
1068 * is_cow_mapping() returns true.
1069 */
1070 if (is_cow_mapping(vma->vm_flags))
1071 mmu_notifier_invalidate_range_start(src_mm, addr, end);
1072
1073 ret = 0;
1074 dst_pgd = pgd_offset(dst_mm, addr);
1075 src_pgd = pgd_offset(src_mm, addr);
1076 do {
1077 next = pgd_addr_end(addr, end);
1078 if (pgd_none_or_clear_bad(src_pgd))
1079 continue;
1080 if (unlikely(copy_pud_range(dst_mm, src_mm, dst_pgd, src_pgd,
1081 vma, addr, next))) {
1082 ret = -ENOMEM;
1083 break;
1084 }
1085 } while (dst_pgd++, src_pgd++, addr = next, addr != end);
1086
1087 if (is_cow_mapping(vma->vm_flags))
1088 mmu_notifier_invalidate_range_end(src_mm,
1089 vma->vm_start, end);
1090 return ret;
1091}
1092
1093static unsigned long zap_pte_range(struct mmu_gather *tlb,
1094 struct vm_area_struct *vma, pmd_t *pmd,
1095 unsigned long addr, unsigned long end,
1096 struct zap_details *details)
1097{
1098 struct mm_struct *mm = tlb->mm;
1099 int force_flush = 0;
1100 int rss[NR_MM_COUNTERS];
1101 spinlock_t *ptl;
1102 pte_t *start_pte;
1103 pte_t *pte;
1104
1105again:
1106 init_rss_vec(rss);
1107 start_pte = pte_offset_map_lock(mm, pmd, addr, &ptl);
1108 pte = start_pte;
1109 arch_enter_lazy_mmu_mode();
1110 do {
1111 pte_t ptent = *pte;
1112 if (pte_none(ptent)) {
1113 continue;
1114 }
1115
1116 if (pte_present(ptent)) {
1117 struct page *page;
1118
1119 page = vm_normal_page(vma, addr, ptent);
1120 if (unlikely(details) && page) {
1121 /*
1122 * unmap_shared_mapping_pages() wants to
1123 * invalidate cache without truncating:
1124 * unmap shared but keep private pages.
1125 */
1126 if (details->check_mapping &&
1127 details->check_mapping != page->mapping)
1128 continue;
1129 /*
1130 * Each page->index must be checked when
1131 * invalidating or truncating nonlinear.
1132 */
1133 if (details->nonlinear_vma &&
1134 (page->index < details->first_index ||
1135 page->index > details->last_index))
1136 continue;
1137 }
1138 ptent = ptep_get_and_clear_full(mm, addr, pte,
1139 tlb->fullmm);
1140 tlb_remove_tlb_entry(tlb, pte, addr);
1141 if (unlikely(!page))
1142 continue;
1143 if (unlikely(details) && details->nonlinear_vma
1144 && linear_page_index(details->nonlinear_vma,
1145 addr) != page->index)
1146 set_pte_at(mm, addr, pte,
1147 pgoff_to_pte(page->index));
1148 if (PageAnon(page))
1149 rss[MM_ANONPAGES]--;
1150 else {
1151 if (pte_dirty(ptent))
1152 set_page_dirty(page);
1153 if (pte_young(ptent) &&
1154 likely(!VM_SequentialReadHint(vma)))
1155 mark_page_accessed(page);
1156 rss[MM_FILEPAGES]--;
1157 }
1158 page_remove_rmap(page);
1159 if (unlikely(page_mapcount(page) < 0))
1160 print_bad_pte(vma, addr, ptent, page);
1161 force_flush = !__tlb_remove_page(tlb, page);
1162 if (force_flush)
1163 break;
1164 continue;
1165 }
1166 /*
1167 * If details->check_mapping, we leave swap entries;
1168 * if details->nonlinear_vma, we leave file entries.
1169 */
1170 if (unlikely(details))
1171 continue;
1172 if (pte_file(ptent)) {
1173 if (unlikely(!(vma->vm_flags & VM_NONLINEAR)))
1174 print_bad_pte(vma, addr, ptent, NULL);
1175 } else {
1176 swp_entry_t entry = pte_to_swp_entry(ptent);
1177
1178 if (!non_swap_entry(entry))
1179 rss[MM_SWAPENTS]--;
1180 else if (is_migration_entry(entry)) {
1181 struct page *page;
1182
1183 page = migration_entry_to_page(entry);
1184
1185 if (PageAnon(page))
1186 rss[MM_ANONPAGES]--;
1187 else
1188 rss[MM_FILEPAGES]--;
1189 }
1190 if (unlikely(!free_swap_and_cache(entry)))
1191 print_bad_pte(vma, addr, ptent, NULL);
1192 }
1193 pte_clear_not_present_full(mm, addr, pte, tlb->fullmm);
1194 } while (pte++, addr += PAGE_SIZE, addr != end);
1195
1196 add_mm_rss_vec(mm, rss);
1197 arch_leave_lazy_mmu_mode();
1198 pte_unmap_unlock(start_pte, ptl);
1199
1200 /*
1201 * mmu_gather ran out of room to batch pages, we break out of
1202 * the PTE lock to avoid doing the potential expensive TLB invalidate
1203 * and page-free while holding it.
1204 */
1205 if (force_flush) {
1206 force_flush = 0;
1207 tlb_flush_mmu(tlb);
1208 if (addr != end)
1209 goto again;
1210 }
1211
1212 return addr;
1213}
1214
1215static inline unsigned long zap_pmd_range(struct mmu_gather *tlb,
1216 struct vm_area_struct *vma, pud_t *pud,
1217 unsigned long addr, unsigned long end,
1218 struct zap_details *details)
1219{
1220 pmd_t *pmd;
1221 unsigned long next;
1222
1223 pmd = pmd_offset(pud, addr);
1224 do {
1225 next = pmd_addr_end(addr, end);
1226 if (pmd_trans_huge(*pmd)) {
1227 if (next - addr != HPAGE_PMD_SIZE) {
1228#ifdef CONFIG_DEBUG_VM
1229 if (!rwsem_is_locked(&tlb->mm->mmap_sem)) {
1230 pr_err("%s: mmap_sem is unlocked! addr=0x%lx end=0x%lx vma->vm_start=0x%lx vma->vm_end=0x%lx\n",
1231 __func__, addr, end,
1232 vma->vm_start,
1233 vma->vm_end);
1234 BUG();
1235 }
1236#endif
1237 split_huge_page_pmd(vma->vm_mm, pmd);
1238 } else if (zap_huge_pmd(tlb, vma, pmd, addr))
1239 goto next;
1240 /* fall through */
1241 }
1242 /*
1243 * Here there can be other concurrent MADV_DONTNEED or
1244 * trans huge page faults running, and if the pmd is
1245 * none or trans huge it can change under us. This is
1246 * because MADV_DONTNEED holds the mmap_sem in read
1247 * mode.
1248 */
1249 if (pmd_none_or_trans_huge_or_clear_bad(pmd))
1250 goto next;
1251 next = zap_pte_range(tlb, vma, pmd, addr, next, details);
1252next:
1253 cond_resched();
1254 } while (pmd++, addr = next, addr != end);
1255
1256 return addr;
1257}
1258
1259static inline unsigned long zap_pud_range(struct mmu_gather *tlb,
1260 struct vm_area_struct *vma, pgd_t *pgd,
1261 unsigned long addr, unsigned long end,
1262 struct zap_details *details)
1263{
1264 pud_t *pud;
1265 unsigned long next;
1266
1267 pud = pud_offset(pgd, addr);
1268 do {
1269 next = pud_addr_end(addr, end);
1270 if (pud_none_or_clear_bad(pud))
1271 continue;
1272 next = zap_pmd_range(tlb, vma, pud, addr, next, details);
1273 } while (pud++, addr = next, addr != end);
1274
1275 return addr;
1276}
1277
1278static void unmap_page_range(struct mmu_gather *tlb,
1279 struct vm_area_struct *vma,
1280 unsigned long addr, unsigned long end,
1281 struct zap_details *details)
1282{
1283 pgd_t *pgd;
1284 unsigned long next;
1285
1286 if (details && !details->check_mapping && !details->nonlinear_vma)
1287 details = NULL;
1288
1289 BUG_ON(addr >= end);
1290 mem_cgroup_uncharge_start();
1291 tlb_start_vma(tlb, vma);
1292 pgd = pgd_offset(vma->vm_mm, addr);
1293 do {
1294 next = pgd_addr_end(addr, end);
1295 if (pgd_none_or_clear_bad(pgd))
1296 continue;
1297 next = zap_pud_range(tlb, vma, pgd, addr, next, details);
1298 } while (pgd++, addr = next, addr != end);
1299 tlb_end_vma(tlb, vma);
1300 mem_cgroup_uncharge_end();
1301}
1302
1303
1304static void unmap_single_vma(struct mmu_gather *tlb,
1305 struct vm_area_struct *vma, unsigned long start_addr,
1306 unsigned long end_addr,
1307 struct zap_details *details)
1308{
1309 unsigned long start = max(vma->vm_start, start_addr);
1310 unsigned long end;
1311
1312 if (start >= vma->vm_end)
1313 return;
1314 end = min(vma->vm_end, end_addr);
1315 if (end <= vma->vm_start)
1316 return;
1317
1318 if (vma->vm_file)
1319 uprobe_munmap(vma, start, end);
1320
1321 if (unlikely(is_pfn_mapping(vma)))
1322 untrack_pfn_vma(vma, 0, 0);
1323
1324 if (start != end) {
1325 if (unlikely(is_vm_hugetlb_page(vma))) {
1326 /*
1327 * It is undesirable to test vma->vm_file as it
1328 * should be non-null for valid hugetlb area.
1329 * However, vm_file will be NULL in the error
1330 * cleanup path of do_mmap_pgoff. When
1331 * hugetlbfs ->mmap method fails,
1332 * do_mmap_pgoff() nullifies vma->vm_file
1333 * before calling this function to clean up.
1334 * Since no pte has actually been setup, it is
1335 * safe to do nothing in this case.
1336 */
1337 if (vma->vm_file)
1338 unmap_hugepage_range(vma, start, end, NULL);
1339 } else
1340 unmap_page_range(tlb, vma, start, end, details);
1341 }
1342}
1343
1344/**
1345 * unmap_vmas - unmap a range of memory covered by a list of vma's
1346 * @tlb: address of the caller's struct mmu_gather
1347 * @vma: the starting vma
1348 * @start_addr: virtual address at which to start unmapping
1349 * @end_addr: virtual address at which to end unmapping
1350 *
1351 * Unmap all pages in the vma list.
1352 *
1353 * Only addresses between `start' and `end' will be unmapped.
1354 *
1355 * The VMA list must be sorted in ascending virtual address order.
1356 *
1357 * unmap_vmas() assumes that the caller will flush the whole unmapped address
1358 * range after unmap_vmas() returns. So the only responsibility here is to
1359 * ensure that any thus-far unmapped pages are flushed before unmap_vmas()
1360 * drops the lock and schedules.
1361 */
1362void unmap_vmas(struct mmu_gather *tlb,
1363 struct vm_area_struct *vma, unsigned long start_addr,
1364 unsigned long end_addr)
1365{
1366 struct mm_struct *mm = vma->vm_mm;
1367
1368 mmu_notifier_invalidate_range_start(mm, start_addr, end_addr);
1369 for ( ; vma && vma->vm_start < end_addr; vma = vma->vm_next)
1370 unmap_single_vma(tlb, vma, start_addr, end_addr, NULL);
1371 mmu_notifier_invalidate_range_end(mm, start_addr, end_addr);
1372}
1373
1374/**
1375 * zap_page_range - remove user pages in a given range
1376 * @vma: vm_area_struct holding the applicable pages
1377 * @start: starting address of pages to zap
1378 * @size: number of bytes to zap
1379 * @details: details of nonlinear truncation or shared cache invalidation
1380 *
1381 * Caller must protect the VMA list
1382 */
1383void zap_page_range(struct vm_area_struct *vma, unsigned long start,
1384 unsigned long size, struct zap_details *details)
1385{
1386 struct mm_struct *mm = vma->vm_mm;
1387 struct mmu_gather tlb;
1388 unsigned long end = start + size;
1389
1390 lru_add_drain();
1391 tlb_gather_mmu(&tlb, mm, 0);
1392 update_hiwater_rss(mm);
1393 mmu_notifier_invalidate_range_start(mm, start, end);
1394 for ( ; vma && vma->vm_start < end; vma = vma->vm_next)
1395 unmap_single_vma(&tlb, vma, start, end, details);
1396 mmu_notifier_invalidate_range_end(mm, start, end);
1397 tlb_finish_mmu(&tlb, start, end);
1398}
1399
1400/**
1401 * zap_page_range_single - remove user pages in a given range
1402 * @vma: vm_area_struct holding the applicable pages
1403 * @address: starting address of pages to zap
1404 * @size: number of bytes to zap
1405 * @details: details of nonlinear truncation or shared cache invalidation
1406 *
1407 * The range must fit into one VMA.
1408 */
1409static void zap_page_range_single(struct vm_area_struct *vma, unsigned long address,
1410 unsigned long size, struct zap_details *details)
1411{
1412 struct mm_struct *mm = vma->vm_mm;
1413 struct mmu_gather tlb;
1414 unsigned long end = address + size;
1415
1416 lru_add_drain();
1417 tlb_gather_mmu(&tlb, mm, 0);
1418 update_hiwater_rss(mm);
1419 mmu_notifier_invalidate_range_start(mm, address, end);
1420 unmap_single_vma(&tlb, vma, address, end, details);
1421 mmu_notifier_invalidate_range_end(mm, address, end);
1422 tlb_finish_mmu(&tlb, address, end);
1423}
1424
1425/**
1426 * zap_vma_ptes - remove ptes mapping the vma
1427 * @vma: vm_area_struct holding ptes to be zapped
1428 * @address: starting address of pages to zap
1429 * @size: number of bytes to zap
1430 *
1431 * This function only unmaps ptes assigned to VM_PFNMAP vmas.
1432 *
1433 * The entire address range must be fully contained within the vma.
1434 *
1435 * Returns 0 if successful.
1436 */
1437int zap_vma_ptes(struct vm_area_struct *vma, unsigned long address,
1438 unsigned long size)
1439{
1440 if (address < vma->vm_start || address + size > vma->vm_end ||
1441 !(vma->vm_flags & VM_PFNMAP))
1442 return -1;
1443 zap_page_range_single(vma, address, size, NULL);
1444 return 0;
1445}
1446EXPORT_SYMBOL_GPL(zap_vma_ptes);
1447
1448/**
1449 * follow_page - look up a page descriptor from a user-virtual address
1450 * @vma: vm_area_struct mapping @address
1451 * @address: virtual address to look up
1452 * @flags: flags modifying lookup behaviour
1453 *
1454 * @flags can have FOLL_ flags set, defined in <linux/mm.h>
1455 *
1456 * Returns the mapped (struct page *), %NULL if no mapping exists, or
1457 * an error pointer if there is a mapping to something not represented
1458 * by a page descriptor (see also vm_normal_page()).
1459 */
1460struct page *follow_page(struct vm_area_struct *vma, unsigned long address,
1461 unsigned int flags)
1462{
1463 pgd_t *pgd;
1464 pud_t *pud;
1465 pmd_t *pmd;
1466 pte_t *ptep, pte;
1467 spinlock_t *ptl;
1468 struct page *page;
1469 struct mm_struct *mm = vma->vm_mm;
1470
1471 page = follow_huge_addr(mm, address, flags & FOLL_WRITE);
1472 if (!IS_ERR(page)) {
1473 BUG_ON(flags & FOLL_GET);
1474 goto out;
1475 }
1476
1477 page = NULL;
1478 pgd = pgd_offset(mm, address);
1479 if (pgd_none(*pgd) || unlikely(pgd_bad(*pgd)))
1480 goto no_page_table;
1481
1482 pud = pud_offset(pgd, address);
1483 if (pud_none(*pud))
1484 goto no_page_table;
1485 if (pud_huge(*pud) && vma->vm_flags & VM_HUGETLB) {
1486 BUG_ON(flags & FOLL_GET);
1487 page = follow_huge_pud(mm, address, pud, flags & FOLL_WRITE);
1488 goto out;
1489 }
1490 if (unlikely(pud_bad(*pud)))
1491 goto no_page_table;
1492
1493 pmd = pmd_offset(pud, address);
1494 if (pmd_none(*pmd))
1495 goto no_page_table;
1496 if (pmd_huge(*pmd) && vma->vm_flags & VM_HUGETLB) {
1497 BUG_ON(flags & FOLL_GET);
1498 page = follow_huge_pmd(mm, address, pmd, flags & FOLL_WRITE);
1499 goto out;
1500 }
1501 if (pmd_trans_huge(*pmd)) {
1502 if (flags & FOLL_SPLIT) {
1503 split_huge_page_pmd(mm, pmd);
1504 goto split_fallthrough;
1505 }
1506 spin_lock(&mm->page_table_lock);
1507 if (likely(pmd_trans_huge(*pmd))) {
1508 if (unlikely(pmd_trans_splitting(*pmd))) {
1509 spin_unlock(&mm->page_table_lock);
1510 wait_split_huge_page(vma->anon_vma, pmd);
1511 } else {
1512 page = follow_trans_huge_pmd(mm, address,
1513 pmd, flags);
1514 spin_unlock(&mm->page_table_lock);
1515 goto out;
1516 }
1517 } else
1518 spin_unlock(&mm->page_table_lock);
1519 /* fall through */
1520 }
1521split_fallthrough:
1522 if (unlikely(pmd_bad(*pmd)))
1523 goto no_page_table;
1524
1525 ptep = pte_offset_map_lock(mm, pmd, address, &ptl);
1526
1527 pte = *ptep;
1528 if (!pte_present(pte))
1529 goto no_page;
1530 if ((flags & FOLL_WRITE) && !pte_write(pte))
1531 goto unlock;
1532
1533 page = vm_normal_page(vma, address, pte);
1534 if (unlikely(!page)) {
1535 if ((flags & FOLL_DUMP) ||
1536 !is_zero_pfn(pte_pfn(pte)))
1537 goto bad_page;
1538 page = pte_page(pte);
1539 }
1540
1541 if (flags & FOLL_GET)
1542 get_page_foll(page);
1543 if (flags & FOLL_TOUCH) {
1544 if ((flags & FOLL_WRITE) &&
1545 !pte_dirty(pte) && !PageDirty(page))
1546 set_page_dirty(page);
1547 /*
1548 * pte_mkyoung() would be more correct here, but atomic care
1549 * is needed to avoid losing the dirty bit: it is easier to use
1550 * mark_page_accessed().
1551 */
1552 mark_page_accessed(page);
1553 }
1554 if ((flags & FOLL_MLOCK) && (vma->vm_flags & VM_LOCKED)) {
1555 /*
1556 * The preliminary mapping check is mainly to avoid the
1557 * pointless overhead of lock_page on the ZERO_PAGE
1558 * which might bounce very badly if there is contention.
1559 *
1560 * If the page is already locked, we don't need to
1561 * handle it now - vmscan will handle it later if and
1562 * when it attempts to reclaim the page.
1563 */
1564 if (page->mapping && trylock_page(page)) {
1565 lru_add_drain(); /* push cached pages to LRU */
1566 /*
1567 * Because we lock page here and migration is
1568 * blocked by the pte's page reference, we need
1569 * only check for file-cache page truncation.
1570 */
1571 if (page->mapping)
1572 mlock_vma_page(page);
1573 unlock_page(page);
1574 }
1575 }
1576unlock:
1577 pte_unmap_unlock(ptep, ptl);
1578out:
1579 return page;
1580
1581bad_page:
1582 pte_unmap_unlock(ptep, ptl);
1583 return ERR_PTR(-EFAULT);
1584
1585no_page:
1586 pte_unmap_unlock(ptep, ptl);
1587 if (!pte_none(pte))
1588 return page;
1589
1590no_page_table:
1591 /*
1592 * When core dumping an enormous anonymous area that nobody
1593 * has touched so far, we don't want to allocate unnecessary pages or
1594 * page tables. Return error instead of NULL to skip handle_mm_fault,
1595 * then get_dump_page() will return NULL to leave a hole in the dump.
1596 * But we can only make this optimization where a hole would surely
1597 * be zero-filled if handle_mm_fault() actually did handle it.
1598 */
1599 if ((flags & FOLL_DUMP) &&
1600 (!vma->vm_ops || !vma->vm_ops->fault))
1601 return ERR_PTR(-EFAULT);
1602 return page;
1603}
1604
1605static inline int stack_guard_page(struct vm_area_struct *vma, unsigned long addr)
1606{
1607 return stack_guard_page_start(vma, addr) ||
1608 stack_guard_page_end(vma, addr+PAGE_SIZE);
1609}
1610
1611/**
1612 * __get_user_pages() - pin user pages in memory
1613 * @tsk: task_struct of target task
1614 * @mm: mm_struct of target mm
1615 * @start: starting user address
1616 * @nr_pages: number of pages from start to pin
1617 * @gup_flags: flags modifying pin behaviour
1618 * @pages: array that receives pointers to the pages pinned.
1619 * Should be at least nr_pages long. Or NULL, if caller
1620 * only intends to ensure the pages are faulted in.
1621 * @vmas: array of pointers to vmas corresponding to each page.
1622 * Or NULL if the caller does not require them.
1623 * @nonblocking: whether waiting for disk IO or mmap_sem contention
1624 *
1625 * Returns number of pages pinned. This may be fewer than the number
1626 * requested. If nr_pages is 0 or negative, returns 0. If no pages
1627 * were pinned, returns -errno. Each page returned must be released
1628 * with a put_page() call when it is finished with. vmas will only
1629 * remain valid while mmap_sem is held.
1630 *
1631 * Must be called with mmap_sem held for read or write.
1632 *
1633 * __get_user_pages walks a process's page tables and takes a reference to
1634 * each struct page that each user address corresponds to at a given
1635 * instant. That is, it takes the page that would be accessed if a user
1636 * thread accesses the given user virtual address at that instant.
1637 *
1638 * This does not guarantee that the page exists in the user mappings when
1639 * __get_user_pages returns, and there may even be a completely different
1640 * page there in some cases (eg. if mmapped pagecache has been invalidated
1641 * and subsequently re faulted). However it does guarantee that the page
1642 * won't be freed completely. And mostly callers simply care that the page
1643 * contains data that was valid *at some point in time*. Typically, an IO
1644 * or similar operation cannot guarantee anything stronger anyway because
1645 * locks can't be held over the syscall boundary.
1646 *
1647 * If @gup_flags & FOLL_WRITE == 0, the page must not be written to. If
1648 * the page is written to, set_page_dirty (or set_page_dirty_lock, as
1649 * appropriate) must be called after the page is finished with, and
1650 * before put_page is called.
1651 *
1652 * If @nonblocking != NULL, __get_user_pages will not wait for disk IO
1653 * or mmap_sem contention, and if waiting is needed to pin all pages,
1654 * *@nonblocking will be set to 0.
1655 *
1656 * In most cases, get_user_pages or get_user_pages_fast should be used
1657 * instead of __get_user_pages. __get_user_pages should be used only if
1658 * you need some special @gup_flags.
1659 */
1660int __get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
1661 unsigned long start, int nr_pages, unsigned int gup_flags,
1662 struct page **pages, struct vm_area_struct **vmas,
1663 int *nonblocking)
1664{
1665 int i;
1666 unsigned long vm_flags;
1667
1668 if (nr_pages <= 0)
1669 return 0;
1670
1671 VM_BUG_ON(!!pages != !!(gup_flags & FOLL_GET));
1672
1673 /*
1674 * Require read or write permissions.
1675 * If FOLL_FORCE is set, we only require the "MAY" flags.
1676 */
1677 vm_flags = (gup_flags & FOLL_WRITE) ?
1678 (VM_WRITE | VM_MAYWRITE) : (VM_READ | VM_MAYREAD);
1679 vm_flags &= (gup_flags & FOLL_FORCE) ?
1680 (VM_MAYREAD | VM_MAYWRITE) : (VM_READ | VM_WRITE);
1681 i = 0;
1682
1683 do {
1684 struct vm_area_struct *vma;
1685
1686 vma = find_extend_vma(mm, start);
1687 if (!vma && in_gate_area(mm, start)) {
1688 unsigned long pg = start & PAGE_MASK;
1689 pgd_t *pgd;
1690 pud_t *pud;
1691 pmd_t *pmd;
1692 pte_t *pte;
1693
1694 /* user gate pages are read-only */
1695 if (gup_flags & FOLL_WRITE)
1696 return i ? : -EFAULT;
1697 if (pg > TASK_SIZE)
1698 pgd = pgd_offset_k(pg);
1699 else
1700 pgd = pgd_offset_gate(mm, pg);
1701 BUG_ON(pgd_none(*pgd));
1702 pud = pud_offset(pgd, pg);
1703 BUG_ON(pud_none(*pud));
1704 pmd = pmd_offset(pud, pg);
1705 if (pmd_none(*pmd))
1706 return i ? : -EFAULT;
1707 VM_BUG_ON(pmd_trans_huge(*pmd));
1708 pte = pte_offset_map(pmd, pg);
1709 if (pte_none(*pte)) {
1710 pte_unmap(pte);
1711 return i ? : -EFAULT;
1712 }
1713 vma = get_gate_vma(mm);
1714 if (pages) {
1715 struct page *page;
1716
1717 page = vm_normal_page(vma, start, *pte);
1718 if (!page) {
1719 if (!(gup_flags & FOLL_DUMP) &&
1720 is_zero_pfn(pte_pfn(*pte)))
1721 page = pte_page(*pte);
1722 else {
1723 pte_unmap(pte);
1724 return i ? : -EFAULT;
1725 }
1726 }
1727 pages[i] = page;
1728 get_page(page);
1729 }
1730 pte_unmap(pte);
1731 goto next_page;
1732 }
1733
1734 if (!vma ||
1735 (vma->vm_flags & (VM_IO | VM_PFNMAP)) ||
1736 !(vm_flags & vma->vm_flags))
1737 return i ? : -EFAULT;
1738
1739 if (is_vm_hugetlb_page(vma)) {
1740 i = follow_hugetlb_page(mm, vma, pages, vmas,
1741 &start, &nr_pages, i, gup_flags);
1742 continue;
1743 }
1744
1745 do {
1746 struct page *page;
1747 unsigned int foll_flags = gup_flags;
1748
1749 /*
1750 * If we have a pending SIGKILL, don't keep faulting
1751 * pages and potentially allocating memory.
1752 */
1753 if (unlikely(fatal_signal_pending(current)))
1754 return i ? i : -ERESTARTSYS;
1755
1756 cond_resched();
1757 while (!(page = follow_page(vma, start, foll_flags))) {
1758 int ret;
1759 unsigned int fault_flags = 0;
1760
1761 /* For mlock, just skip the stack guard page. */
1762 if (foll_flags & FOLL_MLOCK) {
1763 if (stack_guard_page(vma, start))
1764 goto next_page;
1765 }
1766 if (foll_flags & FOLL_WRITE)
1767 fault_flags |= FAULT_FLAG_WRITE;
1768 if (nonblocking)
1769 fault_flags |= FAULT_FLAG_ALLOW_RETRY;
1770 if (foll_flags & FOLL_NOWAIT)
1771 fault_flags |= (FAULT_FLAG_ALLOW_RETRY | FAULT_FLAG_RETRY_NOWAIT);
1772
1773 ret = handle_mm_fault(mm, vma, start,
1774 fault_flags);
1775
1776 if (ret & VM_FAULT_ERROR) {
1777 if (ret & VM_FAULT_OOM)
1778 return i ? i : -ENOMEM;
1779 if (ret & (VM_FAULT_HWPOISON |
1780 VM_FAULT_HWPOISON_LARGE)) {
1781 if (i)
1782 return i;
1783 else if (gup_flags & FOLL_HWPOISON)
1784 return -EHWPOISON;
1785 else
1786 return -EFAULT;
1787 }
1788 if (ret & VM_FAULT_SIGBUS)
1789 return i ? i : -EFAULT;
1790 BUG();
1791 }
1792
1793 if (tsk) {
1794 if (ret & VM_FAULT_MAJOR)
1795 tsk->maj_flt++;
1796 else
1797 tsk->min_flt++;
1798 }
1799
1800 if (ret & VM_FAULT_RETRY) {
1801 if (nonblocking)
1802 *nonblocking = 0;
1803 return i;
1804 }
1805
1806 /*
1807 * The VM_FAULT_WRITE bit tells us that
1808 * do_wp_page has broken COW when necessary,
1809 * even if maybe_mkwrite decided not to set
1810 * pte_write. We can thus safely do subsequent
1811 * page lookups as if they were reads. But only
1812 * do so when looping for pte_write is futile:
1813 * in some cases userspace may also be wanting
1814 * to write to the gotten user page, which a
1815 * read fault here might prevent (a readonly
1816 * page might get reCOWed by userspace write).
1817 */
1818 if ((ret & VM_FAULT_WRITE) &&
1819 !(vma->vm_flags & VM_WRITE))
1820 foll_flags &= ~FOLL_WRITE;
1821
1822 cond_resched();
1823 }
1824 if (IS_ERR(page))
1825 return i ? i : PTR_ERR(page);
1826 if (pages) {
1827 pages[i] = page;
1828
1829 flush_anon_page(vma, page, start);
1830 flush_dcache_page(page);
1831 }
1832next_page:
1833 if (vmas)
1834 vmas[i] = vma;
1835 i++;
1836 start += PAGE_SIZE;
1837 nr_pages--;
1838 } while (nr_pages && start < vma->vm_end);
1839 } while (nr_pages);
1840 return i;
1841}
1842EXPORT_SYMBOL(__get_user_pages);
1843
1844/*
1845 * fixup_user_fault() - manually resolve a user page fault
1846 * @tsk: the task_struct to use for page fault accounting, or
1847 * NULL if faults are not to be recorded.
1848 * @mm: mm_struct of target mm
1849 * @address: user address
1850 * @fault_flags:flags to pass down to handle_mm_fault()
1851 *
1852 * This is meant to be called in the specific scenario where for locking reasons
1853 * we try to access user memory in atomic context (within a pagefault_disable()
1854 * section), this returns -EFAULT, and we want to resolve the user fault before
1855 * trying again.
1856 *
1857 * Typically this is meant to be used by the futex code.
1858 *
1859 * The main difference with get_user_pages() is that this function will
1860 * unconditionally call handle_mm_fault() which will in turn perform all the
1861 * necessary SW fixup of the dirty and young bits in the PTE, while
1862 * handle_mm_fault() only guarantees to update these in the struct page.
1863 *
1864 * This is important for some architectures where those bits also gate the
1865 * access permission to the page because they are maintained in software. On
1866 * such architectures, gup() will not be enough to make a subsequent access
1867 * succeed.
1868 *
1869 * This should be called with the mm_sem held for read.
1870 */
1871int fixup_user_fault(struct task_struct *tsk, struct mm_struct *mm,
1872 unsigned long address, unsigned int fault_flags)
1873{
1874 struct vm_area_struct *vma;
1875 int ret;
1876
1877 vma = find_extend_vma(mm, address);
1878 if (!vma || address < vma->vm_start)
1879 return -EFAULT;
1880
1881 ret = handle_mm_fault(mm, vma, address, fault_flags);
1882 if (ret & VM_FAULT_ERROR) {
1883 if (ret & VM_FAULT_OOM)
1884 return -ENOMEM;
1885 if (ret & (VM_FAULT_HWPOISON | VM_FAULT_HWPOISON_LARGE))
1886 return -EHWPOISON;
1887 if (ret & VM_FAULT_SIGBUS)
1888 return -EFAULT;
1889 BUG();
1890 }
1891 if (tsk) {
1892 if (ret & VM_FAULT_MAJOR)
1893 tsk->maj_flt++;
1894 else
1895 tsk->min_flt++;
1896 }
1897 return 0;
1898}
1899
1900/*
1901 * get_user_pages() - pin user pages in memory
1902 * @tsk: the task_struct to use for page fault accounting, or
1903 * NULL if faults are not to be recorded.
1904 * @mm: mm_struct of target mm
1905 * @start: starting user address
1906 * @nr_pages: number of pages from start to pin
1907 * @write: whether pages will be written to by the caller
1908 * @force: whether to force write access even if user mapping is
1909 * readonly. This will result in the page being COWed even
1910 * in MAP_SHARED mappings. You do not want this.
1911 * @pages: array that receives pointers to the pages pinned.
1912 * Should be at least nr_pages long. Or NULL, if caller
1913 * only intends to ensure the pages are faulted in.
1914 * @vmas: array of pointers to vmas corresponding to each page.
1915 * Or NULL if the caller does not require them.
1916 *
1917 * Returns number of pages pinned. This may be fewer than the number
1918 * requested. If nr_pages is 0 or negative, returns 0. If no pages
1919 * were pinned, returns -errno. Each page returned must be released
1920 * with a put_page() call when it is finished with. vmas will only
1921 * remain valid while mmap_sem is held.
1922 *
1923 * Must be called with mmap_sem held for read or write.
1924 *
1925 * get_user_pages walks a process's page tables and takes a reference to
1926 * each struct page that each user address corresponds to at a given
1927 * instant. That is, it takes the page that would be accessed if a user
1928 * thread accesses the given user virtual address at that instant.
1929 *
1930 * This does not guarantee that the page exists in the user mappings when
1931 * get_user_pages returns, and there may even be a completely different
1932 * page there in some cases (eg. if mmapped pagecache has been invalidated
1933 * and subsequently re faulted). However it does guarantee that the page
1934 * won't be freed completely. And mostly callers simply care that the page
1935 * contains data that was valid *at some point in time*. Typically, an IO
1936 * or similar operation cannot guarantee anything stronger anyway because
1937 * locks can't be held over the syscall boundary.
1938 *
1939 * If write=0, the page must not be written to. If the page is written to,
1940 * set_page_dirty (or set_page_dirty_lock, as appropriate) must be called
1941 * after the page is finished with, and before put_page is called.
1942 *
1943 * get_user_pages is typically used for fewer-copy IO operations, to get a
1944 * handle on the memory by some means other than accesses via the user virtual
1945 * addresses. The pages may be submitted for DMA to devices or accessed via
1946 * their kernel linear mapping (via the kmap APIs). Care should be taken to
1947 * use the correct cache flushing APIs.
1948 *
1949 * See also get_user_pages_fast, for performance critical applications.
1950 */
1951int get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
1952 unsigned long start, int nr_pages, int write, int force,
1953 struct page **pages, struct vm_area_struct **vmas)
1954{
1955 int flags = FOLL_TOUCH;
1956
1957 if (pages)
1958 flags |= FOLL_GET;
1959 if (write)
1960 flags |= FOLL_WRITE;
1961 if (force)
1962 flags |= FOLL_FORCE;
1963
1964 return __get_user_pages(tsk, mm, start, nr_pages, flags, pages, vmas,
1965 NULL);
1966}
1967EXPORT_SYMBOL(get_user_pages);
1968
1969/**
1970 * get_dump_page() - pin user page in memory while writing it to core dump
1971 * @addr: user address
1972 *
1973 * Returns struct page pointer of user page pinned for dump,
1974 * to be freed afterwards by page_cache_release() or put_page().
1975 *
1976 * Returns NULL on any kind of failure - a hole must then be inserted into
1977 * the corefile, to preserve alignment with its headers; and also returns
1978 * NULL wherever the ZERO_PAGE, or an anonymous pte_none, has been found -
1979 * allowing a hole to be left in the corefile to save diskspace.
1980 *
1981 * Called without mmap_sem, but after all other threads have been killed.
1982 */
1983#ifdef CONFIG_ELF_CORE
1984struct page *get_dump_page(unsigned long addr)
1985{
1986 struct vm_area_struct *vma;
1987 struct page *page;
1988
1989 if (__get_user_pages(current, current->mm, addr, 1,
1990 FOLL_FORCE | FOLL_DUMP | FOLL_GET, &page, &vma,
1991 NULL) < 1)
1992 return NULL;
1993 flush_cache_page(vma, addr, page_to_pfn(page));
1994 return page;
1995}
1996#endif /* CONFIG_ELF_CORE */
1997
1998pte_t *__get_locked_pte(struct mm_struct *mm, unsigned long addr,
1999 spinlock_t **ptl)
2000{
2001 pgd_t * pgd = pgd_offset(mm, addr);
2002 pud_t * pud = pud_alloc(mm, pgd, addr);
2003 if (pud) {
2004 pmd_t * pmd = pmd_alloc(mm, pud, addr);
2005 if (pmd) {
2006 VM_BUG_ON(pmd_trans_huge(*pmd));
2007 return pte_alloc_map_lock(mm, pmd, addr, ptl);
2008 }
2009 }
2010 return NULL;
2011}
2012
2013/*
2014 * This is the old fallback for page remapping.
2015 *
2016 * For historical reasons, it only allows reserved pages. Only
2017 * old drivers should use this, and they needed to mark their
2018 * pages reserved for the old functions anyway.
2019 */
2020static int insert_page(struct vm_area_struct *vma, unsigned long addr,
2021 struct page *page, pgprot_t prot)
2022{
2023 struct mm_struct *mm = vma->vm_mm;
2024 int retval;
2025 pte_t *pte;
2026 spinlock_t *ptl;
2027
2028 retval = -EINVAL;
2029 if (PageAnon(page))
2030 goto out;
2031 retval = -ENOMEM;
2032 flush_dcache_page(page);
2033 pte = get_locked_pte(mm, addr, &ptl);
2034 if (!pte)
2035 goto out;
2036 retval = -EBUSY;
2037 if (!pte_none(*pte))
2038 goto out_unlock;
2039
2040 /* Ok, finally just insert the thing.. */
2041 get_page(page);
2042 inc_mm_counter_fast(mm, MM_FILEPAGES);
2043 page_add_file_rmap(page);
2044 set_pte_at(mm, addr, pte, mk_pte(page, prot));
2045
2046 retval = 0;
2047 pte_unmap_unlock(pte, ptl);
2048 return retval;
2049out_unlock:
2050 pte_unmap_unlock(pte, ptl);
2051out:
2052 return retval;
2053}
2054
2055/**
2056 * vm_insert_page - insert single page into user vma
2057 * @vma: user vma to map to
2058 * @addr: target user address of this page
2059 * @page: source kernel page
2060 *
2061 * This allows drivers to insert individual pages they've allocated
2062 * into a user vma.
2063 *
2064 * The page has to be a nice clean _individual_ kernel allocation.
2065 * If you allocate a compound page, you need to have marked it as
2066 * such (__GFP_COMP), or manually just split the page up yourself
2067 * (see split_page()).
2068 *
2069 * NOTE! Traditionally this was done with "remap_pfn_range()" which
2070 * took an arbitrary page protection parameter. This doesn't allow
2071 * that. Your vma protection will have to be set up correctly, which
2072 * means that if you want a shared writable mapping, you'd better
2073 * ask for a shared writable mapping!
2074 *
2075 * The page does not need to be reserved.
2076 */
2077int vm_insert_page(struct vm_area_struct *vma, unsigned long addr,
2078 struct page *page)
2079{
2080 if (addr < vma->vm_start || addr >= vma->vm_end)
2081 return -EFAULT;
2082 if (!page_count(page))
2083 return -EINVAL;
2084 vma->vm_flags |= VM_INSERTPAGE;
2085 return insert_page(vma, addr, page, vma->vm_page_prot);
2086}
2087EXPORT_SYMBOL(vm_insert_page);
2088
2089static int insert_pfn(struct vm_area_struct *vma, unsigned long addr,
2090 unsigned long pfn, pgprot_t prot)
2091{
2092 struct mm_struct *mm = vma->vm_mm;
2093 int retval;
2094 pte_t *pte, entry;
2095 spinlock_t *ptl;
2096
2097 retval = -ENOMEM;
2098 pte = get_locked_pte(mm, addr, &ptl);
2099 if (!pte)
2100 goto out;
2101 retval = -EBUSY;
2102 if (!pte_none(*pte))
2103 goto out_unlock;
2104
2105 /* Ok, finally just insert the thing.. */
2106 entry = pte_mkspecial(pfn_pte(pfn, prot));
2107 set_pte_at(mm, addr, pte, entry);
2108 update_mmu_cache(vma, addr, pte); /* XXX: why not for insert_page? */
2109
2110 retval = 0;
2111out_unlock:
2112 pte_unmap_unlock(pte, ptl);
2113out:
2114 return retval;
2115}
2116
2117/**
2118 * vm_insert_pfn - insert single pfn into user vma
2119 * @vma: user vma to map to
2120 * @addr: target user address of this page
2121 * @pfn: source kernel pfn
2122 *
2123 * Similar to vm_inert_page, this allows drivers to insert individual pages
2124 * they've allocated into a user vma. Same comments apply.
2125 *
2126 * This function should only be called from a vm_ops->fault handler, and
2127 * in that case the handler should return NULL.
2128 *
2129 * vma cannot be a COW mapping.
2130 *
2131 * As this is called only for pages that do not currently exist, we
2132 * do not need to flush old virtual caches or the TLB.
2133 */
2134int vm_insert_pfn(struct vm_area_struct *vma, unsigned long addr,
2135 unsigned long pfn)
2136{
2137 int ret;
2138 pgprot_t pgprot = vma->vm_page_prot;
2139 /*
2140 * Technically, architectures with pte_special can avoid all these
2141 * restrictions (same for remap_pfn_range). However we would like
2142 * consistency in testing and feature parity among all, so we should
2143 * try to keep these invariants in place for everybody.
2144 */
2145 BUG_ON(!(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP)));
2146 BUG_ON((vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP)) ==
2147 (VM_PFNMAP|VM_MIXEDMAP));
2148 BUG_ON((vma->vm_flags & VM_PFNMAP) && is_cow_mapping(vma->vm_flags));
2149 BUG_ON((vma->vm_flags & VM_MIXEDMAP) && pfn_valid(pfn));
2150
2151 if (addr < vma->vm_start || addr >= vma->vm_end)
2152 return -EFAULT;
2153 if (track_pfn_vma_new(vma, &pgprot, pfn, PAGE_SIZE))
2154 return -EINVAL;
2155
2156 ret = insert_pfn(vma, addr, pfn, pgprot);
2157
2158 if (ret)
2159 untrack_pfn_vma(vma, pfn, PAGE_SIZE);
2160
2161 return ret;
2162}
2163EXPORT_SYMBOL(vm_insert_pfn);
2164
2165int vm_insert_mixed(struct vm_area_struct *vma, unsigned long addr,
2166 unsigned long pfn)
2167{
2168 BUG_ON(!(vma->vm_flags & VM_MIXEDMAP));
2169
2170 if (addr < vma->vm_start || addr >= vma->vm_end)
2171 return -EFAULT;
2172
2173 /*
2174 * If we don't have pte special, then we have to use the pfn_valid()
2175 * based VM_MIXEDMAP scheme (see vm_normal_page), and thus we *must*
2176 * refcount the page if pfn_valid is true (hence insert_page rather
2177 * than insert_pfn). If a zero_pfn were inserted into a VM_MIXEDMAP
2178 * without pte special, it would there be refcounted as a normal page.
2179 */
2180 if (!HAVE_PTE_SPECIAL && pfn_valid(pfn)) {
2181 struct page *page;
2182
2183 page = pfn_to_page(pfn);
2184 return insert_page(vma, addr, page, vma->vm_page_prot);
2185 }
2186 return insert_pfn(vma, addr, pfn, vma->vm_page_prot);
2187}
2188EXPORT_SYMBOL(vm_insert_mixed);
2189
2190/*
2191 * maps a range of physical memory into the requested pages. the old
2192 * mappings are removed. any references to nonexistent pages results
2193 * in null mappings (currently treated as "copy-on-access")
2194 */
2195static int remap_pte_range(struct mm_struct *mm, pmd_t *pmd,
2196 unsigned long addr, unsigned long end,
2197 unsigned long pfn, pgprot_t prot)
2198{
2199 pte_t *pte;
2200 spinlock_t *ptl;
2201
2202 pte = pte_alloc_map_lock(mm, pmd, addr, &ptl);
2203 if (!pte)
2204 return -ENOMEM;
2205 arch_enter_lazy_mmu_mode();
2206 do {
2207 BUG_ON(!pte_none(*pte));
2208 set_pte_at(mm, addr, pte, pte_mkspecial(pfn_pte(pfn, prot)));
2209 pfn++;
2210 } while (pte++, addr += PAGE_SIZE, addr != end);
2211 arch_leave_lazy_mmu_mode();
2212 pte_unmap_unlock(pte - 1, ptl);
2213 return 0;
2214}
2215
2216static inline int remap_pmd_range(struct mm_struct *mm, pud_t *pud,
2217 unsigned long addr, unsigned long end,
2218 unsigned long pfn, pgprot_t prot)
2219{
2220 pmd_t *pmd;
2221 unsigned long next;
2222
2223 pfn -= addr >> PAGE_SHIFT;
2224 pmd = pmd_alloc(mm, pud, addr);
2225 if (!pmd)
2226 return -ENOMEM;
2227 VM_BUG_ON(pmd_trans_huge(*pmd));
2228 do {
2229 next = pmd_addr_end(addr, end);
2230 if (remap_pte_range(mm, pmd, addr, next,
2231 pfn + (addr >> PAGE_SHIFT), prot))
2232 return -ENOMEM;
2233 } while (pmd++, addr = next, addr != end);
2234 return 0;
2235}
2236
2237static inline int remap_pud_range(struct mm_struct *mm, pgd_t *pgd,
2238 unsigned long addr, unsigned long end,
2239 unsigned long pfn, pgprot_t prot)
2240{
2241 pud_t *pud;
2242 unsigned long next;
2243
2244 pfn -= addr >> PAGE_SHIFT;
2245 pud = pud_alloc(mm, pgd, addr);
2246 if (!pud)
2247 return -ENOMEM;
2248 do {
2249 next = pud_addr_end(addr, end);
2250 if (remap_pmd_range(mm, pud, addr, next,
2251 pfn + (addr >> PAGE_SHIFT), prot))
2252 return -ENOMEM;
2253 } while (pud++, addr = next, addr != end);
2254 return 0;
2255}
2256
2257/**
2258 * remap_pfn_range - remap kernel memory to userspace
2259 * @vma: user vma to map to
2260 * @addr: target user address to start at
2261 * @pfn: physical address of kernel memory
2262 * @size: size of map area
2263 * @prot: page protection flags for this mapping
2264 *
2265 * Note: this is only safe if the mm semaphore is held when called.
2266 */
2267int remap_pfn_range(struct vm_area_struct *vma, unsigned long addr,
2268 unsigned long pfn, unsigned long size, pgprot_t prot)
2269{
2270 pgd_t *pgd;
2271 unsigned long next;
2272 unsigned long end = addr + PAGE_ALIGN(size);
2273 struct mm_struct *mm = vma->vm_mm;
2274 int err;
2275
2276 /*
2277 * Physically remapped pages are special. Tell the
2278 * rest of the world about it:
2279 * VM_IO tells people not to look at these pages
2280 * (accesses can have side effects).
2281 * VM_RESERVED is specified all over the place, because
2282 * in 2.4 it kept swapout's vma scan off this vma; but
2283 * in 2.6 the LRU scan won't even find its pages, so this
2284 * flag means no more than count its pages in reserved_vm,
2285 * and omit it from core dump, even when VM_IO turned off.
2286 * VM_PFNMAP tells the core MM that the base pages are just
2287 * raw PFN mappings, and do not have a "struct page" associated
2288 * with them.
2289 *
2290 * There's a horrible special case to handle copy-on-write
2291 * behaviour that some programs depend on. We mark the "original"
2292 * un-COW'ed pages by matching them up with "vma->vm_pgoff".
2293 */
2294 if (addr == vma->vm_start && end == vma->vm_end) {
2295 vma->vm_pgoff = pfn;
2296 vma->vm_flags |= VM_PFN_AT_MMAP;
2297 } else if (is_cow_mapping(vma->vm_flags))
2298 return -EINVAL;
2299
2300 vma->vm_flags |= VM_IO | VM_RESERVED | VM_PFNMAP;
2301
2302 err = track_pfn_vma_new(vma, &prot, pfn, PAGE_ALIGN(size));
2303 if (err) {
2304 /*
2305 * To indicate that track_pfn related cleanup is not
2306 * needed from higher level routine calling unmap_vmas
2307 */
2308 vma->vm_flags &= ~(VM_IO | VM_RESERVED | VM_PFNMAP);
2309 vma->vm_flags &= ~VM_PFN_AT_MMAP;
2310 return -EINVAL;
2311 }
2312
2313 BUG_ON(addr >= end);
2314 pfn -= addr >> PAGE_SHIFT;
2315 pgd = pgd_offset(mm, addr);
2316 flush_cache_range(vma, addr, end);
2317 do {
2318 next = pgd_addr_end(addr, end);
2319 err = remap_pud_range(mm, pgd, addr, next,
2320 pfn + (addr >> PAGE_SHIFT), prot);
2321 if (err)
2322 break;
2323 } while (pgd++, addr = next, addr != end);
2324
2325 if (err)
2326 untrack_pfn_vma(vma, pfn, PAGE_ALIGN(size));
2327
2328 return err;
2329}
2330EXPORT_SYMBOL(remap_pfn_range);
2331
2332static int apply_to_pte_range(struct mm_struct *mm, pmd_t *pmd,
2333 unsigned long addr, unsigned long end,
2334 pte_fn_t fn, void *data)
2335{
2336 pte_t *pte;
2337 int err;
2338 pgtable_t token;
2339 spinlock_t *uninitialized_var(ptl);
2340
2341 pte = (mm == &init_mm) ?
2342 pte_alloc_kernel(pmd, addr) :
2343 pte_alloc_map_lock(mm, pmd, addr, &ptl);
2344 if (!pte)
2345 return -ENOMEM;
2346
2347 BUG_ON(pmd_huge(*pmd));
2348
2349 arch_enter_lazy_mmu_mode();
2350
2351 token = pmd_pgtable(*pmd);
2352
2353 do {
2354 err = fn(pte++, token, addr, data);
2355 if (err)
2356 break;
2357 } while (addr += PAGE_SIZE, addr != end);
2358
2359 arch_leave_lazy_mmu_mode();
2360
2361 if (mm != &init_mm)
2362 pte_unmap_unlock(pte-1, ptl);
2363 return err;
2364}
2365
2366static int apply_to_pmd_range(struct mm_struct *mm, pud_t *pud,
2367 unsigned long addr, unsigned long end,
2368 pte_fn_t fn, void *data)
2369{
2370 pmd_t *pmd;
2371 unsigned long next;
2372 int err;
2373
2374 BUG_ON(pud_huge(*pud));
2375
2376 pmd = pmd_alloc(mm, pud, addr);
2377 if (!pmd)
2378 return -ENOMEM;
2379 do {
2380 next = pmd_addr_end(addr, end);
2381 err = apply_to_pte_range(mm, pmd, addr, next, fn, data);
2382 if (err)
2383 break;
2384 } while (pmd++, addr = next, addr != end);
2385 return err;
2386}
2387
2388static int apply_to_pud_range(struct mm_struct *mm, pgd_t *pgd,
2389 unsigned long addr, unsigned long end,
2390 pte_fn_t fn, void *data)
2391{
2392 pud_t *pud;
2393 unsigned long next;
2394 int err;
2395
2396 pud = pud_alloc(mm, pgd, addr);
2397 if (!pud)
2398 return -ENOMEM;
2399 do {
2400 next = pud_addr_end(addr, end);
2401 err = apply_to_pmd_range(mm, pud, addr, next, fn, data);
2402 if (err)
2403 break;
2404 } while (pud++, addr = next, addr != end);
2405 return err;
2406}
2407
2408/*
2409 * Scan a region of virtual memory, filling in page tables as necessary
2410 * and calling a provided function on each leaf page table.
2411 */
2412int apply_to_page_range(struct mm_struct *mm, unsigned long addr,
2413 unsigned long size, pte_fn_t fn, void *data)
2414{
2415 pgd_t *pgd;
2416 unsigned long next;
2417 unsigned long end = addr + size;
2418 int err;
2419
2420 BUG_ON(addr >= end);
2421 pgd = pgd_offset(mm, addr);
2422 do {
2423 next = pgd_addr_end(addr, end);
2424 err = apply_to_pud_range(mm, pgd, addr, next, fn, data);
2425 if (err)
2426 break;
2427 } while (pgd++, addr = next, addr != end);
2428
2429 return err;
2430}
2431EXPORT_SYMBOL_GPL(apply_to_page_range);
2432
2433/*
2434 * handle_pte_fault chooses page fault handler according to an entry
2435 * which was read non-atomically. Before making any commitment, on
2436 * those architectures or configurations (e.g. i386 with PAE) which
2437 * might give a mix of unmatched parts, do_swap_page and do_nonlinear_fault
2438 * must check under lock before unmapping the pte and proceeding
2439 * (but do_wp_page is only called after already making such a check;
2440 * and do_anonymous_page can safely check later on).
2441 */
2442static inline int pte_unmap_same(struct mm_struct *mm, pmd_t *pmd,
2443 pte_t *page_table, pte_t orig_pte)
2444{
2445 int same = 1;
2446#if defined(CONFIG_SMP) || defined(CONFIG_PREEMPT)
2447 if (sizeof(pte_t) > sizeof(unsigned long)) {
2448 spinlock_t *ptl = pte_lockptr(mm, pmd);
2449 spin_lock(ptl);
2450 same = pte_same(*page_table, orig_pte);
2451 spin_unlock(ptl);
2452 }
2453#endif
2454 pte_unmap(page_table);
2455 return same;
2456}
2457
2458static inline void cow_user_page(struct page *dst, struct page *src, unsigned long va, struct vm_area_struct *vma)
2459{
2460 /*
2461 * If the source page was a PFN mapping, we don't have
2462 * a "struct page" for it. We do a best-effort copy by
2463 * just copying from the original user address. If that
2464 * fails, we just zero-fill it. Live with it.
2465 */
2466 if (unlikely(!src)) {
2467 void *kaddr = kmap_atomic(dst);
2468 void __user *uaddr = (void __user *)(va & PAGE_MASK);
2469
2470 /*
2471 * This really shouldn't fail, because the page is there
2472 * in the page tables. But it might just be unreadable,
2473 * in which case we just give up and fill the result with
2474 * zeroes.
2475 */
2476 if (__copy_from_user_inatomic(kaddr, uaddr, PAGE_SIZE))
2477 clear_page(kaddr);
2478 kunmap_atomic(kaddr);
2479 flush_dcache_page(dst);
2480 } else
2481 copy_user_highpage(dst, src, va, vma);
2482}
2483
2484/*
2485 * This routine handles present pages, when users try to write
2486 * to a shared page. It is done by copying the page to a new address
2487 * and decrementing the shared-page counter for the old page.
2488 *
2489 * Note that this routine assumes that the protection checks have been
2490 * done by the caller (the low-level page fault routine in most cases).
2491 * Thus we can safely just mark it writable once we've done any necessary
2492 * COW.
2493 *
2494 * We also mark the page dirty at this point even though the page will
2495 * change only once the write actually happens. This avoids a few races,
2496 * and potentially makes it more efficient.
2497 *
2498 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2499 * but allow concurrent faults), with pte both mapped and locked.
2500 * We return with mmap_sem still held, but pte unmapped and unlocked.
2501 */
2502static int do_wp_page(struct mm_struct *mm, struct vm_area_struct *vma,
2503 unsigned long address, pte_t *page_table, pmd_t *pmd,
2504 spinlock_t *ptl, pte_t orig_pte)
2505 __releases(ptl)
2506{
2507 struct page *old_page, *new_page;
2508 pte_t entry;
2509 int ret = 0;
2510 int page_mkwrite = 0;
2511 struct page *dirty_page = NULL;
2512
2513 old_page = vm_normal_page(vma, address, orig_pte);
2514 if (!old_page) {
2515 /*
2516 * VM_MIXEDMAP !pfn_valid() case
2517 *
2518 * We should not cow pages in a shared writeable mapping.
2519 * Just mark the pages writable as we can't do any dirty
2520 * accounting on raw pfn maps.
2521 */
2522 if ((vma->vm_flags & (VM_WRITE|VM_SHARED)) ==
2523 (VM_WRITE|VM_SHARED))
2524 goto reuse;
2525 goto gotten;
2526 }
2527
2528 /*
2529 * Take out anonymous pages first, anonymous shared vmas are
2530 * not dirty accountable.
2531 */
2532 if (PageAnon(old_page) && !PageKsm(old_page)) {
2533 if (!trylock_page(old_page)) {
2534 page_cache_get(old_page);
2535 pte_unmap_unlock(page_table, ptl);
2536 lock_page(old_page);
2537 page_table = pte_offset_map_lock(mm, pmd, address,
2538 &ptl);
2539 if (!pte_same(*page_table, orig_pte)) {
2540 unlock_page(old_page);
2541 goto unlock;
2542 }
2543 page_cache_release(old_page);
2544 }
2545 if (reuse_swap_page(old_page)) {
2546 /*
2547 * The page is all ours. Move it to our anon_vma so
2548 * the rmap code will not search our parent or siblings.
2549 * Protected against the rmap code by the page lock.
2550 */
2551 page_move_anon_rmap(old_page, vma, address);
2552 unlock_page(old_page);
2553 goto reuse;
2554 }
2555 unlock_page(old_page);
2556 } else if (unlikely((vma->vm_flags & (VM_WRITE|VM_SHARED)) ==
2557 (VM_WRITE|VM_SHARED))) {
2558 /*
2559 * Only catch write-faults on shared writable pages,
2560 * read-only shared pages can get COWed by
2561 * get_user_pages(.write=1, .force=1).
2562 */
2563 if (vma->vm_ops && vma->vm_ops->page_mkwrite) {
2564 struct vm_fault vmf;
2565 int tmp;
2566
2567 vmf.virtual_address = (void __user *)(address &
2568 PAGE_MASK);
2569 vmf.pgoff = old_page->index;
2570 vmf.flags = FAULT_FLAG_WRITE|FAULT_FLAG_MKWRITE;
2571 vmf.page = old_page;
2572
2573 /*
2574 * Notify the address space that the page is about to
2575 * become writable so that it can prohibit this or wait
2576 * for the page to get into an appropriate state.
2577 *
2578 * We do this without the lock held, so that it can
2579 * sleep if it needs to.
2580 */
2581 page_cache_get(old_page);
2582 pte_unmap_unlock(page_table, ptl);
2583
2584 tmp = vma->vm_ops->page_mkwrite(vma, &vmf);
2585 if (unlikely(tmp &
2586 (VM_FAULT_ERROR | VM_FAULT_NOPAGE))) {
2587 ret = tmp;
2588 goto unwritable_page;
2589 }
2590 if (unlikely(!(tmp & VM_FAULT_LOCKED))) {
2591 lock_page(old_page);
2592 if (!old_page->mapping) {
2593 ret = 0; /* retry the fault */
2594 unlock_page(old_page);
2595 goto unwritable_page;
2596 }
2597 } else
2598 VM_BUG_ON(!PageLocked(old_page));
2599
2600 /*
2601 * Since we dropped the lock we need to revalidate
2602 * the PTE as someone else may have changed it. If
2603 * they did, we just return, as we can count on the
2604 * MMU to tell us if they didn't also make it writable.
2605 */
2606 page_table = pte_offset_map_lock(mm, pmd, address,
2607 &ptl);
2608 if (!pte_same(*page_table, orig_pte)) {
2609 unlock_page(old_page);
2610 goto unlock;
2611 }
2612
2613 page_mkwrite = 1;
2614 }
2615 dirty_page = old_page;
2616 get_page(dirty_page);
2617
2618reuse:
2619 flush_cache_page(vma, address, pte_pfn(orig_pte));
2620 entry = pte_mkyoung(orig_pte);
2621 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
2622 if (ptep_set_access_flags(vma, address, page_table, entry,1))
2623 update_mmu_cache(vma, address, page_table);
2624 pte_unmap_unlock(page_table, ptl);
2625 ret |= VM_FAULT_WRITE;
2626
2627 if (!dirty_page)
2628 return ret;
2629
2630 /*
2631 * Yes, Virginia, this is actually required to prevent a race
2632 * with clear_page_dirty_for_io() from clearing the page dirty
2633 * bit after it clear all dirty ptes, but before a racing
2634 * do_wp_page installs a dirty pte.
2635 *
2636 * __do_fault is protected similarly.
2637 */
2638 if (!page_mkwrite) {
2639 wait_on_page_locked(dirty_page);
2640 set_page_dirty_balance(dirty_page, page_mkwrite);
2641 }
2642 put_page(dirty_page);
2643 if (page_mkwrite) {
2644 struct address_space *mapping = dirty_page->mapping;
2645
2646 set_page_dirty(dirty_page);
2647 unlock_page(dirty_page);
2648 page_cache_release(dirty_page);
2649 if (mapping) {
2650 /*
2651 * Some device drivers do not set page.mapping
2652 * but still dirty their pages
2653 */
2654 balance_dirty_pages_ratelimited(mapping);
2655 }
2656 }
2657
2658 /* file_update_time outside page_lock */
2659 if (vma->vm_file)
2660 file_update_time(vma->vm_file);
2661
2662 return ret;
2663 }
2664
2665 /*
2666 * Ok, we need to copy. Oh, well..
2667 */
2668 page_cache_get(old_page);
2669gotten:
2670 pte_unmap_unlock(page_table, ptl);
2671
2672 if (unlikely(anon_vma_prepare(vma)))
2673 goto oom;
2674
2675 if (is_zero_pfn(pte_pfn(orig_pte))) {
2676 new_page = alloc_zeroed_user_highpage_movable(vma, address);
2677 if (!new_page)
2678 goto oom;
2679 } else {
2680 new_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, address);
2681 if (!new_page)
2682 goto oom;
2683 cow_user_page(new_page, old_page, address, vma);
2684 }
2685 __SetPageUptodate(new_page);
2686
2687 if (mem_cgroup_newpage_charge(new_page, mm, GFP_KERNEL))
2688 goto oom_free_new;
2689
2690 /*
2691 * Re-check the pte - we dropped the lock
2692 */
2693 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
2694 if (likely(pte_same(*page_table, orig_pte))) {
2695 if (old_page) {
2696 if (!PageAnon(old_page)) {
2697 dec_mm_counter_fast(mm, MM_FILEPAGES);
2698 inc_mm_counter_fast(mm, MM_ANONPAGES);
2699 }
2700 } else
2701 inc_mm_counter_fast(mm, MM_ANONPAGES);
2702 flush_cache_page(vma, address, pte_pfn(orig_pte));
2703 entry = mk_pte(new_page, vma->vm_page_prot);
2704 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
2705 /*
2706 * Clear the pte entry and flush it first, before updating the
2707 * pte with the new entry. This will avoid a race condition
2708 * seen in the presence of one thread doing SMC and another
2709 * thread doing COW.
2710 */
2711 ptep_clear_flush(vma, address, page_table);
2712 page_add_new_anon_rmap(new_page, vma, address);
2713 /*
2714 * We call the notify macro here because, when using secondary
2715 * mmu page tables (such as kvm shadow page tables), we want the
2716 * new page to be mapped directly into the secondary page table.
2717 */
2718 set_pte_at_notify(mm, address, page_table, entry);
2719 update_mmu_cache(vma, address, page_table);
2720 if (old_page) {
2721 /*
2722 * Only after switching the pte to the new page may
2723 * we remove the mapcount here. Otherwise another
2724 * process may come and find the rmap count decremented
2725 * before the pte is switched to the new page, and
2726 * "reuse" the old page writing into it while our pte
2727 * here still points into it and can be read by other
2728 * threads.
2729 *
2730 * The critical issue is to order this
2731 * page_remove_rmap with the ptp_clear_flush above.
2732 * Those stores are ordered by (if nothing else,)
2733 * the barrier present in the atomic_add_negative
2734 * in page_remove_rmap.
2735 *
2736 * Then the TLB flush in ptep_clear_flush ensures that
2737 * no process can access the old page before the
2738 * decremented mapcount is visible. And the old page
2739 * cannot be reused until after the decremented
2740 * mapcount is visible. So transitively, TLBs to
2741 * old page will be flushed before it can be reused.
2742 */
2743 page_remove_rmap(old_page);
2744 }
2745
2746 /* Free the old page.. */
2747 new_page = old_page;
2748 ret |= VM_FAULT_WRITE;
2749 } else
2750 mem_cgroup_uncharge_page(new_page);
2751
2752 if (new_page)
2753 page_cache_release(new_page);
2754unlock:
2755 pte_unmap_unlock(page_table, ptl);
2756 if (old_page) {
2757 /*
2758 * Don't let another task, with possibly unlocked vma,
2759 * keep the mlocked page.
2760 */
2761 if ((ret & VM_FAULT_WRITE) && (vma->vm_flags & VM_LOCKED)) {
2762 lock_page(old_page); /* LRU manipulation */
2763 munlock_vma_page(old_page);
2764 unlock_page(old_page);
2765 }
2766 page_cache_release(old_page);
2767 }
2768 return ret;
2769oom_free_new:
2770 page_cache_release(new_page);
2771oom:
2772 if (old_page) {
2773 if (page_mkwrite) {
2774 unlock_page(old_page);
2775 page_cache_release(old_page);
2776 }
2777 page_cache_release(old_page);
2778 }
2779 return VM_FAULT_OOM;
2780
2781unwritable_page:
2782 page_cache_release(old_page);
2783 return ret;
2784}
2785
2786static void unmap_mapping_range_vma(struct vm_area_struct *vma,
2787 unsigned long start_addr, unsigned long end_addr,
2788 struct zap_details *details)
2789{
2790 zap_page_range_single(vma, start_addr, end_addr - start_addr, details);
2791}
2792
2793static inline void unmap_mapping_range_tree(struct prio_tree_root *root,
2794 struct zap_details *details)
2795{
2796 struct vm_area_struct *vma;
2797 struct prio_tree_iter iter;
2798 pgoff_t vba, vea, zba, zea;
2799
2800 vma_prio_tree_foreach(vma, &iter, root,
2801 details->first_index, details->last_index) {
2802
2803 vba = vma->vm_pgoff;
2804 vea = vba + ((vma->vm_end - vma->vm_start) >> PAGE_SHIFT) - 1;
2805 /* Assume for now that PAGE_CACHE_SHIFT == PAGE_SHIFT */
2806 zba = details->first_index;
2807 if (zba < vba)
2808 zba = vba;
2809 zea = details->last_index;
2810 if (zea > vea)
2811 zea = vea;
2812
2813 unmap_mapping_range_vma(vma,
2814 ((zba - vba) << PAGE_SHIFT) + vma->vm_start,
2815 ((zea - vba + 1) << PAGE_SHIFT) + vma->vm_start,
2816 details);
2817 }
2818}
2819
2820static inline void unmap_mapping_range_list(struct list_head *head,
2821 struct zap_details *details)
2822{
2823 struct vm_area_struct *vma;
2824
2825 /*
2826 * In nonlinear VMAs there is no correspondence between virtual address
2827 * offset and file offset. So we must perform an exhaustive search
2828 * across *all* the pages in each nonlinear VMA, not just the pages
2829 * whose virtual address lies outside the file truncation point.
2830 */
2831 list_for_each_entry(vma, head, shared.vm_set.list) {
2832 details->nonlinear_vma = vma;
2833 unmap_mapping_range_vma(vma, vma->vm_start, vma->vm_end, details);
2834 }
2835}
2836
2837/**
2838 * unmap_mapping_range - unmap the portion of all mmaps in the specified address_space corresponding to the specified page range in the underlying file.
2839 * @mapping: the address space containing mmaps to be unmapped.
2840 * @holebegin: byte in first page to unmap, relative to the start of
2841 * the underlying file. This will be rounded down to a PAGE_SIZE
2842 * boundary. Note that this is different from truncate_pagecache(), which
2843 * must keep the partial page. In contrast, we must get rid of
2844 * partial pages.
2845 * @holelen: size of prospective hole in bytes. This will be rounded
2846 * up to a PAGE_SIZE boundary. A holelen of zero truncates to the
2847 * end of the file.
2848 * @even_cows: 1 when truncating a file, unmap even private COWed pages;
2849 * but 0 when invalidating pagecache, don't throw away private data.
2850 */
2851void unmap_mapping_range(struct address_space *mapping,
2852 loff_t const holebegin, loff_t const holelen, int even_cows)
2853{
2854 struct zap_details details;
2855 pgoff_t hba = holebegin >> PAGE_SHIFT;
2856 pgoff_t hlen = (holelen + PAGE_SIZE - 1) >> PAGE_SHIFT;
2857
2858 /* Check for overflow. */
2859 if (sizeof(holelen) > sizeof(hlen)) {
2860 long long holeend =
2861 (holebegin + holelen + PAGE_SIZE - 1) >> PAGE_SHIFT;
2862 if (holeend & ~(long long)ULONG_MAX)
2863 hlen = ULONG_MAX - hba + 1;
2864 }
2865
2866 details.check_mapping = even_cows? NULL: mapping;
2867 details.nonlinear_vma = NULL;
2868 details.first_index = hba;
2869 details.last_index = hba + hlen - 1;
2870 if (details.last_index < details.first_index)
2871 details.last_index = ULONG_MAX;
2872
2873
2874 mutex_lock(&mapping->i_mmap_mutex);
2875 if (unlikely(!prio_tree_empty(&mapping->i_mmap)))
2876 unmap_mapping_range_tree(&mapping->i_mmap, &details);
2877 if (unlikely(!list_empty(&mapping->i_mmap_nonlinear)))
2878 unmap_mapping_range_list(&mapping->i_mmap_nonlinear, &details);
2879 mutex_unlock(&mapping->i_mmap_mutex);
2880}
2881EXPORT_SYMBOL(unmap_mapping_range);
2882
2883/*
2884 * We enter with non-exclusive mmap_sem (to exclude vma changes,
2885 * but allow concurrent faults), and pte mapped but not yet locked.
2886 * We return with mmap_sem still held, but pte unmapped and unlocked.
2887 */
2888static int do_swap_page(struct mm_struct *mm, struct vm_area_struct *vma,
2889 unsigned long address, pte_t *page_table, pmd_t *pmd,
2890 unsigned int flags, pte_t orig_pte)
2891{
2892 spinlock_t *ptl;
2893 struct page *page, *swapcache = NULL;
2894 swp_entry_t entry;
2895 pte_t pte;
2896 int locked;
2897 struct mem_cgroup *ptr;
2898 int exclusive = 0;
2899 int ret = 0;
2900
2901 if (!pte_unmap_same(mm, pmd, page_table, orig_pte))
2902 goto out;
2903
2904 entry = pte_to_swp_entry(orig_pte);
2905 if (unlikely(non_swap_entry(entry))) {
2906 if (is_migration_entry(entry)) {
2907 migration_entry_wait(mm, pmd, address);
2908 } else if (is_hwpoison_entry(entry)) {
2909 ret = VM_FAULT_HWPOISON;
2910 } else {
2911 print_bad_pte(vma, address, orig_pte, NULL);
2912 ret = VM_FAULT_SIGBUS;
2913 }
2914 goto out;
2915 }
2916 delayacct_set_flag(DELAYACCT_PF_SWAPIN);
2917 page = lookup_swap_cache(entry);
2918 if (!page) {
2919 page = swapin_readahead(entry,
2920 GFP_HIGHUSER_MOVABLE, vma, address);
2921 if (!page) {
2922 /*
2923 * Back out if somebody else faulted in this pte
2924 * while we released the pte lock.
2925 */
2926 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
2927 if (likely(pte_same(*page_table, orig_pte)))
2928 ret = VM_FAULT_OOM;
2929 delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
2930 goto unlock;
2931 }
2932
2933 /* Had to read the page from swap area: Major fault */
2934 ret = VM_FAULT_MAJOR;
2935 count_vm_event(PGMAJFAULT);
2936 mem_cgroup_count_vm_event(mm, PGMAJFAULT);
2937 } else if (PageHWPoison(page)) {
2938 /*
2939 * hwpoisoned dirty swapcache pages are kept for killing
2940 * owner processes (which may be unknown at hwpoison time)
2941 */
2942 ret = VM_FAULT_HWPOISON;
2943 delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
2944 goto out_release;
2945 }
2946
2947 locked = lock_page_or_retry(page, mm, flags);
2948
2949 delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
2950 if (!locked) {
2951 ret |= VM_FAULT_RETRY;
2952 goto out_release;
2953 }
2954
2955 /*
2956 * Make sure try_to_free_swap or reuse_swap_page or swapoff did not
2957 * release the swapcache from under us. The page pin, and pte_same
2958 * test below, are not enough to exclude that. Even if it is still
2959 * swapcache, we need to check that the page's swap has not changed.
2960 */
2961 if (unlikely(!PageSwapCache(page) || page_private(page) != entry.val))
2962 goto out_page;
2963
2964 if (ksm_might_need_to_copy(page, vma, address)) {
2965 swapcache = page;
2966 page = ksm_does_need_to_copy(page, vma, address);
2967
2968 if (unlikely(!page)) {
2969 ret = VM_FAULT_OOM;
2970 page = swapcache;
2971 swapcache = NULL;
2972 goto out_page;
2973 }
2974 }
2975
2976 if (mem_cgroup_try_charge_swapin(mm, page, GFP_KERNEL, &ptr)) {
2977 ret = VM_FAULT_OOM;
2978 goto out_page;
2979 }
2980
2981 /*
2982 * Back out if somebody else already faulted in this pte.
2983 */
2984 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
2985 if (unlikely(!pte_same(*page_table, orig_pte)))
2986 goto out_nomap;
2987
2988 if (unlikely(!PageUptodate(page))) {
2989 ret = VM_FAULT_SIGBUS;
2990 goto out_nomap;
2991 }
2992
2993 /*
2994 * The page isn't present yet, go ahead with the fault.
2995 *
2996 * Be careful about the sequence of operations here.
2997 * To get its accounting right, reuse_swap_page() must be called
2998 * while the page is counted on swap but not yet in mapcount i.e.
2999 * before page_add_anon_rmap() and swap_free(); try_to_free_swap()
3000 * must be called after the swap_free(), or it will never succeed.
3001 * Because delete_from_swap_page() may be called by reuse_swap_page(),
3002 * mem_cgroup_commit_charge_swapin() may not be able to find swp_entry
3003 * in page->private. In this case, a record in swap_cgroup is silently
3004 * discarded at swap_free().
3005 */
3006
3007 inc_mm_counter_fast(mm, MM_ANONPAGES);
3008 dec_mm_counter_fast(mm, MM_SWAPENTS);
3009 pte = mk_pte(page, vma->vm_page_prot);
3010 if ((flags & FAULT_FLAG_WRITE) && reuse_swap_page(page)) {
3011 pte = maybe_mkwrite(pte_mkdirty(pte), vma);
3012 flags &= ~FAULT_FLAG_WRITE;
3013 ret |= VM_FAULT_WRITE;
3014 exclusive = 1;
3015 }
3016 flush_icache_page(vma, page);
3017 set_pte_at(mm, address, page_table, pte);
3018 do_page_add_anon_rmap(page, vma, address, exclusive);
3019 /* It's better to call commit-charge after rmap is established */
3020 mem_cgroup_commit_charge_swapin(page, ptr);
3021
3022 swap_free(entry);
3023 if (vm_swap_full() || (vma->vm_flags & VM_LOCKED) || PageMlocked(page))
3024 try_to_free_swap(page);
3025 unlock_page(page);
3026 if (swapcache) {
3027 /*
3028 * Hold the lock to avoid the swap entry to be reused
3029 * until we take the PT lock for the pte_same() check
3030 * (to avoid false positives from pte_same). For
3031 * further safety release the lock after the swap_free
3032 * so that the swap count won't change under a
3033 * parallel locked swapcache.
3034 */
3035 unlock_page(swapcache);
3036 page_cache_release(swapcache);
3037 }
3038
3039 if (flags & FAULT_FLAG_WRITE) {
3040 ret |= do_wp_page(mm, vma, address, page_table, pmd, ptl, pte);
3041 if (ret & VM_FAULT_ERROR)
3042 ret &= VM_FAULT_ERROR;
3043 goto out;
3044 }
3045
3046 /* No need to invalidate - it was non-present before */
3047 update_mmu_cache(vma, address, page_table);
3048unlock:
3049 pte_unmap_unlock(page_table, ptl);
3050out:
3051 return ret;
3052out_nomap:
3053 mem_cgroup_cancel_charge_swapin(ptr);
3054 pte_unmap_unlock(page_table, ptl);
3055out_page:
3056 unlock_page(page);
3057out_release:
3058 page_cache_release(page);
3059 if (swapcache) {
3060 unlock_page(swapcache);
3061 page_cache_release(swapcache);
3062 }
3063 return ret;
3064}
3065
3066/*
3067 * This is like a special single-page "expand_{down|up}wards()",
3068 * except we must first make sure that 'address{-|+}PAGE_SIZE'
3069 * doesn't hit another vma.
3070 */
3071static inline int check_stack_guard_page(struct vm_area_struct *vma, unsigned long address)
3072{
3073 address &= PAGE_MASK;
3074 if ((vma->vm_flags & VM_GROWSDOWN) && address == vma->vm_start) {
3075 struct vm_area_struct *prev = vma->vm_prev;
3076
3077 /*
3078 * Is there a mapping abutting this one below?
3079 *
3080 * That's only ok if it's the same stack mapping
3081 * that has gotten split..
3082 */
3083 if (prev && prev->vm_end == address)
3084 return prev->vm_flags & VM_GROWSDOWN ? 0 : -ENOMEM;
3085
3086 expand_downwards(vma, address - PAGE_SIZE);
3087 }
3088 if ((vma->vm_flags & VM_GROWSUP) && address + PAGE_SIZE == vma->vm_end) {
3089 struct vm_area_struct *next = vma->vm_next;
3090
3091 /* As VM_GROWSDOWN but s/below/above/ */
3092 if (next && next->vm_start == address + PAGE_SIZE)
3093 return next->vm_flags & VM_GROWSUP ? 0 : -ENOMEM;
3094
3095 expand_upwards(vma, address + PAGE_SIZE);
3096 }
3097 return 0;
3098}
3099
3100/*
3101 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3102 * but allow concurrent faults), and pte mapped but not yet locked.
3103 * We return with mmap_sem still held, but pte unmapped and unlocked.
3104 */
3105static int do_anonymous_page(struct mm_struct *mm, struct vm_area_struct *vma,
3106 unsigned long address, pte_t *page_table, pmd_t *pmd,
3107 unsigned int flags)
3108{
3109 struct page *page;
3110 spinlock_t *ptl;
3111 pte_t entry;
3112
3113 pte_unmap(page_table);
3114
3115 /* Check if we need to add a guard page to the stack */
3116 if (check_stack_guard_page(vma, address) < 0)
3117 return VM_FAULT_SIGBUS;
3118
3119 /* Use the zero-page for reads */
3120 if (!(flags & FAULT_FLAG_WRITE)) {
3121 entry = pte_mkspecial(pfn_pte(my_zero_pfn(address),
3122 vma->vm_page_prot));
3123 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
3124 if (!pte_none(*page_table))
3125 goto unlock;
3126 goto setpte;
3127 }
3128
3129 /* Allocate our own private page. */
3130 if (unlikely(anon_vma_prepare(vma)))
3131 goto oom;
3132 page = alloc_zeroed_user_highpage_movable(vma, address);
3133 if (!page)
3134 goto oom;
3135 __SetPageUptodate(page);
3136
3137 if (mem_cgroup_newpage_charge(page, mm, GFP_KERNEL))
3138 goto oom_free_page;
3139
3140 entry = mk_pte(page, vma->vm_page_prot);
3141 if (vma->vm_flags & VM_WRITE)
3142 entry = pte_mkwrite(pte_mkdirty(entry));
3143
3144 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
3145 if (!pte_none(*page_table))
3146 goto release;
3147
3148 inc_mm_counter_fast(mm, MM_ANONPAGES);
3149 page_add_new_anon_rmap(page, vma, address);
3150setpte:
3151 set_pte_at(mm, address, page_table, entry);
3152
3153 /* No need to invalidate - it was non-present before */
3154 update_mmu_cache(vma, address, page_table);
3155unlock:
3156 pte_unmap_unlock(page_table, ptl);
3157 return 0;
3158release:
3159 mem_cgroup_uncharge_page(page);
3160 page_cache_release(page);
3161 goto unlock;
3162oom_free_page:
3163 page_cache_release(page);
3164oom:
3165 return VM_FAULT_OOM;
3166}
3167
3168/*
3169 * __do_fault() tries to create a new page mapping. It aggressively
3170 * tries to share with existing pages, but makes a separate copy if
3171 * the FAULT_FLAG_WRITE is set in the flags parameter in order to avoid
3172 * the next page fault.
3173 *
3174 * As this is called only for pages that do not currently exist, we
3175 * do not need to flush old virtual caches or the TLB.
3176 *
3177 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3178 * but allow concurrent faults), and pte neither mapped nor locked.
3179 * We return with mmap_sem still held, but pte unmapped and unlocked.
3180 */
3181static int __do_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3182 unsigned long address, pmd_t *pmd,
3183 pgoff_t pgoff, unsigned int flags, pte_t orig_pte)
3184{
3185 pte_t *page_table;
3186 spinlock_t *ptl;
3187 struct page *page;
3188 struct page *cow_page;
3189 pte_t entry;
3190 int anon = 0;
3191 struct page *dirty_page = NULL;
3192 struct vm_fault vmf;
3193 int ret;
3194 int page_mkwrite = 0;
3195
3196 /*
3197 * If we do COW later, allocate page befor taking lock_page()
3198 * on the file cache page. This will reduce lock holding time.
3199 */
3200 if ((flags & FAULT_FLAG_WRITE) && !(vma->vm_flags & VM_SHARED)) {
3201
3202 if (unlikely(anon_vma_prepare(vma)))
3203 return VM_FAULT_OOM;
3204
3205 cow_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, address);
3206 if (!cow_page)
3207 return VM_FAULT_OOM;
3208
3209 if (mem_cgroup_newpage_charge(cow_page, mm, GFP_KERNEL)) {
3210 page_cache_release(cow_page);
3211 return VM_FAULT_OOM;
3212 }
3213 } else
3214 cow_page = NULL;
3215
3216 vmf.virtual_address = (void __user *)(address & PAGE_MASK);
3217 vmf.pgoff = pgoff;
3218 vmf.flags = flags;
3219 vmf.page = NULL;
3220
3221 ret = vma->vm_ops->fault(vma, &vmf);
3222 if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE |
3223 VM_FAULT_RETRY)))
3224 goto uncharge_out;
3225
3226 if (unlikely(PageHWPoison(vmf.page))) {
3227 if (ret & VM_FAULT_LOCKED)
3228 unlock_page(vmf.page);
3229 ret = VM_FAULT_HWPOISON;
3230 goto uncharge_out;
3231 }
3232
3233 /*
3234 * For consistency in subsequent calls, make the faulted page always
3235 * locked.
3236 */
3237 if (unlikely(!(ret & VM_FAULT_LOCKED)))
3238 lock_page(vmf.page);
3239 else
3240 VM_BUG_ON(!PageLocked(vmf.page));
3241
3242 /*
3243 * Should we do an early C-O-W break?
3244 */
3245 page = vmf.page;
3246 if (flags & FAULT_FLAG_WRITE) {
3247 if (!(vma->vm_flags & VM_SHARED)) {
3248 page = cow_page;
3249 anon = 1;
3250 copy_user_highpage(page, vmf.page, address, vma);
3251 __SetPageUptodate(page);
3252 } else {
3253 /*
3254 * If the page will be shareable, see if the backing
3255 * address space wants to know that the page is about
3256 * to become writable
3257 */
3258 if (vma->vm_ops->page_mkwrite) {
3259 int tmp;
3260
3261 unlock_page(page);
3262 vmf.flags = FAULT_FLAG_WRITE|FAULT_FLAG_MKWRITE;
3263 tmp = vma->vm_ops->page_mkwrite(vma, &vmf);
3264 if (unlikely(tmp &
3265 (VM_FAULT_ERROR | VM_FAULT_NOPAGE))) {
3266 ret = tmp;
3267 goto unwritable_page;
3268 }
3269 if (unlikely(!(tmp & VM_FAULT_LOCKED))) {
3270 lock_page(page);
3271 if (!page->mapping) {
3272 ret = 0; /* retry the fault */
3273 unlock_page(page);
3274 goto unwritable_page;
3275 }
3276 } else
3277 VM_BUG_ON(!PageLocked(page));
3278 page_mkwrite = 1;
3279 }
3280 }
3281
3282 }
3283
3284 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
3285
3286 /*
3287 * This silly early PAGE_DIRTY setting removes a race
3288 * due to the bad i386 page protection. But it's valid
3289 * for other architectures too.
3290 *
3291 * Note that if FAULT_FLAG_WRITE is set, we either now have
3292 * an exclusive copy of the page, or this is a shared mapping,
3293 * so we can make it writable and dirty to avoid having to
3294 * handle that later.
3295 */
3296 /* Only go through if we didn't race with anybody else... */
3297 if (likely(pte_same(*page_table, orig_pte))) {
3298 flush_icache_page(vma, page);
3299 entry = mk_pte(page, vma->vm_page_prot);
3300 if (flags & FAULT_FLAG_WRITE)
3301 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
3302 if (anon) {
3303 inc_mm_counter_fast(mm, MM_ANONPAGES);
3304 page_add_new_anon_rmap(page, vma, address);
3305 } else {
3306 inc_mm_counter_fast(mm, MM_FILEPAGES);
3307 page_add_file_rmap(page);
3308 if (flags & FAULT_FLAG_WRITE) {
3309 dirty_page = page;
3310 get_page(dirty_page);
3311 }
3312 }
3313 set_pte_at(mm, address, page_table, entry);
3314
3315 /* no need to invalidate: a not-present page won't be cached */
3316 update_mmu_cache(vma, address, page_table);
3317 } else {
3318 if (cow_page)
3319 mem_cgroup_uncharge_page(cow_page);
3320 if (anon)
3321 page_cache_release(page);
3322 else
3323 anon = 1; /* no anon but release faulted_page */
3324 }
3325
3326 pte_unmap_unlock(page_table, ptl);
3327
3328 if (dirty_page) {
3329 struct address_space *mapping = page->mapping;
3330
3331 if (set_page_dirty(dirty_page))
3332 page_mkwrite = 1;
3333 unlock_page(dirty_page);
3334 put_page(dirty_page);
3335 if (page_mkwrite && mapping) {
3336 /*
3337 * Some device drivers do not set page.mapping but still
3338 * dirty their pages
3339 */
3340 balance_dirty_pages_ratelimited(mapping);
3341 }
3342
3343 /* file_update_time outside page_lock */
3344 if (vma->vm_file)
3345 file_update_time(vma->vm_file);
3346 } else {
3347 unlock_page(vmf.page);
3348 if (anon)
3349 page_cache_release(vmf.page);
3350 }
3351
3352 return ret;
3353
3354unwritable_page:
3355 page_cache_release(page);
3356 return ret;
3357uncharge_out:
3358 /* fs's fault handler get error */
3359 if (cow_page) {
3360 mem_cgroup_uncharge_page(cow_page);
3361 page_cache_release(cow_page);
3362 }
3363 return ret;
3364}
3365
3366static int do_linear_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3367 unsigned long address, pte_t *page_table, pmd_t *pmd,
3368 unsigned int flags, pte_t orig_pte)
3369{
3370 pgoff_t pgoff = (((address & PAGE_MASK)
3371 - vma->vm_start) >> PAGE_SHIFT) + vma->vm_pgoff;
3372
3373 pte_unmap(page_table);
3374 return __do_fault(mm, vma, address, pmd, pgoff, flags, orig_pte);
3375}
3376
3377/*
3378 * Fault of a previously existing named mapping. Repopulate the pte
3379 * from the encoded file_pte if possible. This enables swappable
3380 * nonlinear vmas.
3381 *
3382 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3383 * but allow concurrent faults), and pte mapped but not yet locked.
3384 * We return with mmap_sem still held, but pte unmapped and unlocked.
3385 */
3386static int do_nonlinear_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3387 unsigned long address, pte_t *page_table, pmd_t *pmd,
3388 unsigned int flags, pte_t orig_pte)
3389{
3390 pgoff_t pgoff;
3391
3392 flags |= FAULT_FLAG_NONLINEAR;
3393
3394 if (!pte_unmap_same(mm, pmd, page_table, orig_pte))
3395 return 0;
3396
3397 if (unlikely(!(vma->vm_flags & VM_NONLINEAR))) {
3398 /*
3399 * Page table corrupted: show pte and kill process.
3400 */
3401 print_bad_pte(vma, address, orig_pte, NULL);
3402 return VM_FAULT_SIGBUS;
3403 }
3404
3405 pgoff = pte_to_pgoff(orig_pte);
3406 return __do_fault(mm, vma, address, pmd, pgoff, flags, orig_pte);
3407}
3408
3409/*
3410 * These routines also need to handle stuff like marking pages dirty
3411 * and/or accessed for architectures that don't do it in hardware (most
3412 * RISC architectures). The early dirtying is also good on the i386.
3413 *
3414 * There is also a hook called "update_mmu_cache()" that architectures
3415 * with external mmu caches can use to update those (ie the Sparc or
3416 * PowerPC hashed page tables that act as extended TLBs).
3417 *
3418 * We enter with non-exclusive mmap_sem (to exclude vma changes,
3419 * but allow concurrent faults), and pte mapped but not yet locked.
3420 * We return with mmap_sem still held, but pte unmapped and unlocked.
3421 */
3422int handle_pte_fault(struct mm_struct *mm,
3423 struct vm_area_struct *vma, unsigned long address,
3424 pte_t *pte, pmd_t *pmd, unsigned int flags)
3425{
3426 pte_t entry;
3427 spinlock_t *ptl;
3428
3429 entry = *pte;
3430 if (!pte_present(entry)) {
3431 if (pte_none(entry)) {
3432 if (vma->vm_ops) {
3433 if (likely(vma->vm_ops->fault))
3434 return do_linear_fault(mm, vma, address,
3435 pte, pmd, flags, entry);
3436 }
3437 return do_anonymous_page(mm, vma, address,
3438 pte, pmd, flags);
3439 }
3440 if (pte_file(entry))
3441 return do_nonlinear_fault(mm, vma, address,
3442 pte, pmd, flags, entry);
3443 return do_swap_page(mm, vma, address,
3444 pte, pmd, flags, entry);
3445 }
3446
3447 ptl = pte_lockptr(mm, pmd);
3448 spin_lock(ptl);
3449 if (unlikely(!pte_same(*pte, entry)))
3450 goto unlock;
3451 if (flags & FAULT_FLAG_WRITE) {
3452 if (!pte_write(entry))
3453 return do_wp_page(mm, vma, address,
3454 pte, pmd, ptl, entry);
3455 entry = pte_mkdirty(entry);
3456 }
3457 entry = pte_mkyoung(entry);
3458 if (ptep_set_access_flags(vma, address, pte, entry, flags & FAULT_FLAG_WRITE)) {
3459 update_mmu_cache(vma, address, pte);
3460 } else {
3461 /*
3462 * This is needed only for protection faults but the arch code
3463 * is not yet telling us if this is a protection fault or not.
3464 * This still avoids useless tlb flushes for .text page faults
3465 * with threads.
3466 */
3467 if (flags & FAULT_FLAG_WRITE)
3468 flush_tlb_fix_spurious_fault(vma, address);
3469 }
3470unlock:
3471 pte_unmap_unlock(pte, ptl);
3472 return 0;
3473}
3474
3475/*
3476 * By the time we get here, we already hold the mm semaphore
3477 */
3478int handle_mm_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3479 unsigned long address, unsigned int flags)
3480{
3481 pgd_t *pgd;
3482 pud_t *pud;
3483 pmd_t *pmd;
3484 pte_t *pte;
3485
3486 __set_current_state(TASK_RUNNING);
3487
3488 count_vm_event(PGFAULT);
3489 mem_cgroup_count_vm_event(mm, PGFAULT);
3490
3491 /* do counter updates before entering really critical section. */
3492 check_sync_rss_stat(current);
3493
3494 if (unlikely(is_vm_hugetlb_page(vma)))
3495 return hugetlb_fault(mm, vma, address, flags);
3496
3497retry:
3498 pgd = pgd_offset(mm, address);
3499 pud = pud_alloc(mm, pgd, address);
3500 if (!pud)
3501 return VM_FAULT_OOM;
3502 pmd = pmd_alloc(mm, pud, address);
3503 if (!pmd)
3504 return VM_FAULT_OOM;
3505 if (pmd_none(*pmd) && transparent_hugepage_enabled(vma)) {
3506 if (!vma->vm_ops)
3507 return do_huge_pmd_anonymous_page(mm, vma, address,
3508 pmd, flags);
3509 } else {
3510 pmd_t orig_pmd = *pmd;
3511 int ret;
3512
3513 barrier();
3514 if (pmd_trans_huge(orig_pmd)) {
3515 if (flags & FAULT_FLAG_WRITE &&
3516 !pmd_write(orig_pmd) &&
3517 !pmd_trans_splitting(orig_pmd)) {
3518 ret = do_huge_pmd_wp_page(mm, vma, address, pmd,
3519 orig_pmd);
3520 /*
3521 * If COW results in an oom, the huge pmd will
3522 * have been split, so retry the fault on the
3523 * pte for a smaller charge.
3524 */
3525 if (unlikely(ret & VM_FAULT_OOM))
3526 goto retry;
3527 return ret;
3528 }
3529 return 0;
3530 }
3531 }
3532
3533 /*
3534 * Use __pte_alloc instead of pte_alloc_map, because we can't
3535 * run pte_offset_map on the pmd, if an huge pmd could
3536 * materialize from under us from a different thread.
3537 */
3538 if (unlikely(pmd_none(*pmd)) && __pte_alloc(mm, vma, pmd, address))
3539 return VM_FAULT_OOM;
3540 /* if an huge pmd materialized from under us just retry later */
3541 if (unlikely(pmd_trans_huge(*pmd)))
3542 return 0;
3543 /*
3544 * A regular pmd is established and it can't morph into a huge pmd
3545 * from under us anymore at this point because we hold the mmap_sem
3546 * read mode and khugepaged takes it in write mode. So now it's
3547 * safe to run pte_offset_map().
3548 */
3549 pte = pte_offset_map(pmd, address);
3550
3551 return handle_pte_fault(mm, vma, address, pte, pmd, flags);
3552}
3553
3554#ifndef __PAGETABLE_PUD_FOLDED
3555/*
3556 * Allocate page upper directory.
3557 * We've already handled the fast-path in-line.
3558 */
3559int __pud_alloc(struct mm_struct *mm, pgd_t *pgd, unsigned long address)
3560{
3561 pud_t *new = pud_alloc_one(mm, address);
3562 if (!new)
3563 return -ENOMEM;
3564
3565 smp_wmb(); /* See comment in __pte_alloc */
3566
3567 spin_lock(&mm->page_table_lock);
3568 if (pgd_present(*pgd)) /* Another has populated it */
3569 pud_free(mm, new);
3570 else
3571 pgd_populate(mm, pgd, new);
3572 spin_unlock(&mm->page_table_lock);
3573 return 0;
3574}
3575#endif /* __PAGETABLE_PUD_FOLDED */
3576
3577#ifndef __PAGETABLE_PMD_FOLDED
3578/*
3579 * Allocate page middle directory.
3580 * We've already handled the fast-path in-line.
3581 */
3582int __pmd_alloc(struct mm_struct *mm, pud_t *pud, unsigned long address)
3583{
3584 pmd_t *new = pmd_alloc_one(mm, address);
3585 if (!new)
3586 return -ENOMEM;
3587
3588 smp_wmb(); /* See comment in __pte_alloc */
3589
3590 spin_lock(&mm->page_table_lock);
3591#ifndef __ARCH_HAS_4LEVEL_HACK
3592 if (pud_present(*pud)) /* Another has populated it */
3593 pmd_free(mm, new);
3594 else
3595 pud_populate(mm, pud, new);
3596#else
3597 if (pgd_present(*pud)) /* Another has populated it */
3598 pmd_free(mm, new);
3599 else
3600 pgd_populate(mm, pud, new);
3601#endif /* __ARCH_HAS_4LEVEL_HACK */
3602 spin_unlock(&mm->page_table_lock);
3603 return 0;
3604}
3605#endif /* __PAGETABLE_PMD_FOLDED */
3606
3607int make_pages_present(unsigned long addr, unsigned long end)
3608{
3609 int ret, len, write;
3610 struct vm_area_struct * vma;
3611
3612 vma = find_vma(current->mm, addr);
3613 if (!vma)
3614 return -ENOMEM;
3615 /*
3616 * We want to touch writable mappings with a write fault in order
3617 * to break COW, except for shared mappings because these don't COW
3618 * and we would not want to dirty them for nothing.
3619 */
3620 write = (vma->vm_flags & (VM_WRITE | VM_SHARED)) == VM_WRITE;
3621 BUG_ON(addr >= end);
3622 BUG_ON(end > vma->vm_end);
3623 len = DIV_ROUND_UP(end, PAGE_SIZE) - addr/PAGE_SIZE;
3624 ret = get_user_pages(current, current->mm, addr,
3625 len, write, 0, NULL, NULL);
3626 if (ret < 0)
3627 return ret;
3628 return ret == len ? 0 : -EFAULT;
3629}
3630
3631#if !defined(__HAVE_ARCH_GATE_AREA)
3632
3633#if defined(AT_SYSINFO_EHDR)
3634static struct vm_area_struct gate_vma;
3635
3636static int __init gate_vma_init(void)
3637{
3638 gate_vma.vm_mm = NULL;
3639 gate_vma.vm_start = FIXADDR_USER_START;
3640 gate_vma.vm_end = FIXADDR_USER_END;
3641 gate_vma.vm_flags = VM_READ | VM_MAYREAD | VM_EXEC | VM_MAYEXEC;
3642 gate_vma.vm_page_prot = __P101;
3643
3644 return 0;
3645}
3646__initcall(gate_vma_init);
3647#endif
3648
3649struct vm_area_struct *get_gate_vma(struct mm_struct *mm)
3650{
3651#ifdef AT_SYSINFO_EHDR
3652 return &gate_vma;
3653#else
3654 return NULL;
3655#endif
3656}
3657
3658int in_gate_area_no_mm(unsigned long addr)
3659{
3660#ifdef AT_SYSINFO_EHDR
3661 if ((addr >= FIXADDR_USER_START) && (addr < FIXADDR_USER_END))
3662 return 1;
3663#endif
3664 return 0;
3665}
3666
3667#endif /* __HAVE_ARCH_GATE_AREA */
3668
3669static int __follow_pte(struct mm_struct *mm, unsigned long address,
3670 pte_t **ptepp, spinlock_t **ptlp)
3671{
3672 pgd_t *pgd;
3673 pud_t *pud;
3674 pmd_t *pmd;
3675 pte_t *ptep;
3676
3677 pgd = pgd_offset(mm, address);
3678 if (pgd_none(*pgd) || unlikely(pgd_bad(*pgd)))
3679 goto out;
3680
3681 pud = pud_offset(pgd, address);
3682 if (pud_none(*pud) || unlikely(pud_bad(*pud)))
3683 goto out;
3684
3685 pmd = pmd_offset(pud, address);
3686 VM_BUG_ON(pmd_trans_huge(*pmd));
3687 if (pmd_none(*pmd) || unlikely(pmd_bad(*pmd)))
3688 goto out;
3689
3690 /* We cannot handle huge page PFN maps. Luckily they don't exist. */
3691 if (pmd_huge(*pmd))
3692 goto out;
3693
3694 ptep = pte_offset_map_lock(mm, pmd, address, ptlp);
3695 if (!ptep)
3696 goto out;
3697 if (!pte_present(*ptep))
3698 goto unlock;
3699 *ptepp = ptep;
3700 return 0;
3701unlock:
3702 pte_unmap_unlock(ptep, *ptlp);
3703out:
3704 return -EINVAL;
3705}
3706
3707static inline int follow_pte(struct mm_struct *mm, unsigned long address,
3708 pte_t **ptepp, spinlock_t **ptlp)
3709{
3710 int res;
3711
3712 /* (void) is needed to make gcc happy */
3713 (void) __cond_lock(*ptlp,
3714 !(res = __follow_pte(mm, address, ptepp, ptlp)));
3715 return res;
3716}
3717
3718/**
3719 * follow_pfn - look up PFN at a user virtual address
3720 * @vma: memory mapping
3721 * @address: user virtual address
3722 * @pfn: location to store found PFN
3723 *
3724 * Only IO mappings and raw PFN mappings are allowed.
3725 *
3726 * Returns zero and the pfn at @pfn on success, -ve otherwise.
3727 */
3728int follow_pfn(struct vm_area_struct *vma, unsigned long address,
3729 unsigned long *pfn)
3730{
3731 int ret = -EINVAL;
3732 spinlock_t *ptl;
3733 pte_t *ptep;
3734
3735 if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
3736 return ret;
3737
3738 ret = follow_pte(vma->vm_mm, address, &ptep, &ptl);
3739 if (ret)
3740 return ret;
3741 *pfn = pte_pfn(*ptep);
3742 pte_unmap_unlock(ptep, ptl);
3743 return 0;
3744}
3745EXPORT_SYMBOL(follow_pfn);
3746
3747#ifdef CONFIG_HAVE_IOREMAP_PROT
3748int follow_phys(struct vm_area_struct *vma,
3749 unsigned long address, unsigned int flags,
3750 unsigned long *prot, resource_size_t *phys)
3751{
3752 int ret = -EINVAL;
3753 pte_t *ptep, pte;
3754 spinlock_t *ptl;
3755
3756 if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
3757 goto out;
3758
3759 if (follow_pte(vma->vm_mm, address, &ptep, &ptl))
3760 goto out;
3761 pte = *ptep;
3762
3763 if ((flags & FOLL_WRITE) && !pte_write(pte))
3764 goto unlock;
3765
3766 *prot = pgprot_val(pte_pgprot(pte));
3767 *phys = (resource_size_t)pte_pfn(pte) << PAGE_SHIFT;
3768
3769 ret = 0;
3770unlock:
3771 pte_unmap_unlock(ptep, ptl);
3772out:
3773 return ret;
3774}
3775
3776int generic_access_phys(struct vm_area_struct *vma, unsigned long addr,
3777 void *buf, int len, int write)
3778{
3779 resource_size_t phys_addr;
3780 unsigned long prot = 0;
3781 void __iomem *maddr;
3782 int offset = addr & (PAGE_SIZE-1);
3783
3784 if (follow_phys(vma, addr, write, &prot, &phys_addr))
3785 return -EINVAL;
3786
3787 maddr = ioremap_prot(phys_addr, PAGE_SIZE, prot);
3788 if (write)
3789 memcpy_toio(maddr + offset, buf, len);
3790 else
3791 memcpy_fromio(buf, maddr + offset, len);
3792 iounmap(maddr);
3793
3794 return len;
3795}
3796#endif
3797
3798/*
3799 * Access another process' address space as given in mm. If non-NULL, use the
3800 * given task for page fault accounting.
3801 */
3802static int __access_remote_vm(struct task_struct *tsk, struct mm_struct *mm,
3803 unsigned long addr, void *buf, int len, int write)
3804{
3805 struct vm_area_struct *vma;
3806 void *old_buf = buf;
3807
3808 down_read(&mm->mmap_sem);
3809 /* ignore errors, just check how much was successfully transferred */
3810 while (len) {
3811 int bytes, ret, offset;
3812 void *maddr;
3813 struct page *page = NULL;
3814
3815 ret = get_user_pages(tsk, mm, addr, 1,
3816 write, 1, &page, &vma);
3817 if (ret <= 0) {
3818 /*
3819 * Check if this is a VM_IO | VM_PFNMAP VMA, which
3820 * we can access using slightly different code.
3821 */
3822#ifdef CONFIG_HAVE_IOREMAP_PROT
3823 vma = find_vma(mm, addr);
3824 if (!vma || vma->vm_start > addr)
3825 break;
3826 if (vma->vm_ops && vma->vm_ops->access)
3827 ret = vma->vm_ops->access(vma, addr, buf,
3828 len, write);
3829 if (ret <= 0)
3830#endif
3831 break;
3832 bytes = ret;
3833 } else {
3834 bytes = len;
3835 offset = addr & (PAGE_SIZE-1);
3836 if (bytes > PAGE_SIZE-offset)
3837 bytes = PAGE_SIZE-offset;
3838
3839 maddr = kmap(page);
3840 if (write) {
3841 copy_to_user_page(vma, page, addr,
3842 maddr + offset, buf, bytes);
3843 set_page_dirty_lock(page);
3844 } else {
3845 copy_from_user_page(vma, page, addr,
3846 buf, maddr + offset, bytes);
3847 }
3848 kunmap(page);
3849 page_cache_release(page);
3850 }
3851 len -= bytes;
3852 buf += bytes;
3853 addr += bytes;
3854 }
3855 up_read(&mm->mmap_sem);
3856
3857 return buf - old_buf;
3858}
3859
3860/**
3861 * access_remote_vm - access another process' address space
3862 * @mm: the mm_struct of the target address space
3863 * @addr: start address to access
3864 * @buf: source or destination buffer
3865 * @len: number of bytes to transfer
3866 * @write: whether the access is a write
3867 *
3868 * The caller must hold a reference on @mm.
3869 */
3870int access_remote_vm(struct mm_struct *mm, unsigned long addr,
3871 void *buf, int len, int write)
3872{
3873 return __access_remote_vm(NULL, mm, addr, buf, len, write);
3874}
3875
3876/*
3877 * Access another process' address space.
3878 * Source/target buffer must be kernel space,
3879 * Do not walk the page table directly, use get_user_pages
3880 */
3881int access_process_vm(struct task_struct *tsk, unsigned long addr,
3882 void *buf, int len, int write)
3883{
3884 struct mm_struct *mm;
3885 int ret;
3886
3887 mm = get_task_mm(tsk);
3888 if (!mm)
3889 return 0;
3890
3891 ret = __access_remote_vm(tsk, mm, addr, buf, len, write);
3892 mmput(mm);
3893
3894 return ret;
3895}
3896
3897/*
3898 * Print the name of a VMA.
3899 */
3900void print_vma_addr(char *prefix, unsigned long ip)
3901{
3902 struct mm_struct *mm = current->mm;
3903 struct vm_area_struct *vma;
3904
3905 /*
3906 * Do not print if we are in atomic
3907 * contexts (in exception stacks, etc.):
3908 */
3909 if (preempt_count())
3910 return;
3911
3912 down_read(&mm->mmap_sem);
3913 vma = find_vma(mm, ip);
3914 if (vma && vma->vm_file) {
3915 struct file *f = vma->vm_file;
3916 char *buf = (char *)__get_free_page(GFP_KERNEL);
3917 if (buf) {
3918 char *p, *s;
3919
3920 p = d_path(&f->f_path, buf, PAGE_SIZE);
3921 if (IS_ERR(p))
3922 p = "?";
3923 s = strrchr(p, '/');
3924 if (s)
3925 p = s+1;
3926 printk("%s%s[%lx+%lx]", prefix, p,
3927 vma->vm_start,
3928 vma->vm_end - vma->vm_start);
3929 free_page((unsigned long)buf);
3930 }
3931 }
3932 up_read(¤t->mm->mmap_sem);
3933}
3934
3935#ifdef CONFIG_PROVE_LOCKING
3936void might_fault(void)
3937{
3938 /*
3939 * Some code (nfs/sunrpc) uses socket ops on kernel memory while
3940 * holding the mmap_sem, this is safe because kernel memory doesn't
3941 * get paged out, therefore we'll never actually fault, and the
3942 * below annotations will generate false positives.
3943 */
3944 if (segment_eq(get_fs(), KERNEL_DS))
3945 return;
3946
3947 might_sleep();
3948 /*
3949 * it would be nicer only to annotate paths which are not under
3950 * pagefault_disable, however that requires a larger audit and
3951 * providing helpers like get_user_atomic.
3952 */
3953 if (!in_atomic() && current->mm)
3954 might_lock_read(¤t->mm->mmap_sem);
3955}
3956EXPORT_SYMBOL(might_fault);
3957#endif
3958
3959#if defined(CONFIG_TRANSPARENT_HUGEPAGE) || defined(CONFIG_HUGETLBFS)
3960static void clear_gigantic_page(struct page *page,
3961 unsigned long addr,
3962 unsigned int pages_per_huge_page)
3963{
3964 int i;
3965 struct page *p = page;
3966
3967 might_sleep();
3968 for (i = 0; i < pages_per_huge_page;
3969 i++, p = mem_map_next(p, page, i)) {
3970 cond_resched();
3971 clear_user_highpage(p, addr + i * PAGE_SIZE);
3972 }
3973}
3974void clear_huge_page(struct page *page,
3975 unsigned long addr, unsigned int pages_per_huge_page)
3976{
3977 int i;
3978
3979 if (unlikely(pages_per_huge_page > MAX_ORDER_NR_PAGES)) {
3980 clear_gigantic_page(page, addr, pages_per_huge_page);
3981 return;
3982 }
3983
3984 might_sleep();
3985 for (i = 0; i < pages_per_huge_page; i++) {
3986 cond_resched();
3987 clear_user_highpage(page + i, addr + i * PAGE_SIZE);
3988 }
3989}
3990
3991static void copy_user_gigantic_page(struct page *dst, struct page *src,
3992 unsigned long addr,
3993 struct vm_area_struct *vma,
3994 unsigned int pages_per_huge_page)
3995{
3996 int i;
3997 struct page *dst_base = dst;
3998 struct page *src_base = src;
3999
4000 for (i = 0; i < pages_per_huge_page; ) {
4001 cond_resched();
4002 copy_user_highpage(dst, src, addr + i*PAGE_SIZE, vma);
4003
4004 i++;
4005 dst = mem_map_next(dst, dst_base, i);
4006 src = mem_map_next(src, src_base, i);
4007 }
4008}
4009
4010void copy_user_huge_page(struct page *dst, struct page *src,
4011 unsigned long addr, struct vm_area_struct *vma,
4012 unsigned int pages_per_huge_page)
4013{
4014 int i;
4015
4016 if (unlikely(pages_per_huge_page > MAX_ORDER_NR_PAGES)) {
4017 copy_user_gigantic_page(dst, src, addr, vma,
4018 pages_per_huge_page);
4019 return;
4020 }
4021
4022 might_sleep();
4023 for (i = 0; i < pages_per_huge_page; i++) {
4024 cond_resched();
4025 copy_user_highpage(dst + i, src + i, addr + i*PAGE_SIZE, vma);
4026 }
4027}
4028#endif /* CONFIG_TRANSPARENT_HUGEPAGE || CONFIG_HUGETLBFS */