mm: export __get_user_pages
[linux-2.6.git] / mm / memory.c
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/module.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 */
72 unsigned long max_mapnr;
73 struct page *mem_map;
74
75 EXPORT_SYMBOL(max_mapnr);
76 EXPORT_SYMBOL(mem_map);
77 #endif
78
79 unsigned 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  */
87 void * high_memory;
88
89 EXPORT_SYMBOL(num_physpages);
90 EXPORT_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  */
98 int randomize_va_space __read_mostly =
99 #ifdef CONFIG_COMPAT_BRK
100                                         1;
101 #else
102                                         2;
103 #endif
104
105 static int __init disable_randmaps(char *s)
106 {
107         randomize_va_space = 0;
108         return 1;
109 }
110 __setup("norandmaps", disable_randmaps);
111
112 unsigned long zero_pfn __read_mostly;
113 unsigned long highest_memmap_pfn __read_mostly;
114
115 /*
116  * CONFIG_MMU architectures set up ZERO_PAGE in their paging_init()
117  */
118 static int __init init_zero_pfn(void)
119 {
120         zero_pfn = page_to_pfn(ZERO_PAGE(0));
121         return 0;
122 }
123 core_initcall(init_zero_pfn);
124
125
126 #if defined(SPLIT_RSS_COUNTING)
127
128 static void __sync_task_rss_stat(struct task_struct *task, struct mm_struct *mm)
129 {
130         int i;
131
132         for (i = 0; i < NR_MM_COUNTERS; i++) {
133                 if (task->rss_stat.count[i]) {
134                         add_mm_counter(mm, i, task->rss_stat.count[i]);
135                         task->rss_stat.count[i] = 0;
136                 }
137         }
138         task->rss_stat.events = 0;
139 }
140
141 static 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)
155 static 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_task_rss_stat(task, task->mm);
161 }
162
163 unsigned long get_mm_counter(struct mm_struct *mm, int member)
164 {
165         long val = 0;
166
167         /*
168          * Don't use task->mm here...for avoiding to use task_get_mm()..
169          * The caller must guarantee task->mm is not invalid.
170          */
171         val = atomic_long_read(&mm->rss_stat.count[member]);
172         /*
173          * counter is updated in asynchronous manner and may go to minus.
174          * But it's never be expected number for users.
175          */
176         if (val < 0)
177                 return 0;
178         return (unsigned long)val;
179 }
180
181 void sync_mm_rss(struct task_struct *task, struct mm_struct *mm)
182 {
183         __sync_task_rss_stat(task, mm);
184 }
185 #else
186
187 #define inc_mm_counter_fast(mm, member) inc_mm_counter(mm, member)
188 #define dec_mm_counter_fast(mm, member) dec_mm_counter(mm, member)
189
190 static void check_sync_rss_stat(struct task_struct *task)
191 {
192 }
193
194 #endif
195
196 /*
197  * If a p?d_bad entry is found while walking page tables, report
198  * the error, before resetting entry to p?d_none.  Usually (but
199  * very seldom) called out from the p?d_none_or_clear_bad macros.
200  */
201
202 void pgd_clear_bad(pgd_t *pgd)
203 {
204         pgd_ERROR(*pgd);
205         pgd_clear(pgd);
206 }
207
208 void pud_clear_bad(pud_t *pud)
209 {
210         pud_ERROR(*pud);
211         pud_clear(pud);
212 }
213
214 void pmd_clear_bad(pmd_t *pmd)
215 {
216         pmd_ERROR(*pmd);
217         pmd_clear(pmd);
218 }
219
220 /*
221  * Note: this doesn't free the actual pages themselves. That
222  * has been handled earlier when unmapping all the memory regions.
223  */
224 static void free_pte_range(struct mmu_gather *tlb, pmd_t *pmd,
225                            unsigned long addr)
226 {
227         pgtable_t token = pmd_pgtable(*pmd);
228         pmd_clear(pmd);
229         pte_free_tlb(tlb, token, addr);
230         tlb->mm->nr_ptes--;
231 }
232
233 static inline void free_pmd_range(struct mmu_gather *tlb, pud_t *pud,
234                                 unsigned long addr, unsigned long end,
235                                 unsigned long floor, unsigned long ceiling)
236 {
237         pmd_t *pmd;
238         unsigned long next;
239         unsigned long start;
240
241         start = addr;
242         pmd = pmd_offset(pud, addr);
243         do {
244                 next = pmd_addr_end(addr, end);
245                 if (pmd_none_or_clear_bad(pmd))
246                         continue;
247                 free_pte_range(tlb, pmd, addr);
248         } while (pmd++, addr = next, addr != end);
249
250         start &= PUD_MASK;
251         if (start < floor)
252                 return;
253         if (ceiling) {
254                 ceiling &= PUD_MASK;
255                 if (!ceiling)
256                         return;
257         }
258         if (end - 1 > ceiling - 1)
259                 return;
260
261         pmd = pmd_offset(pud, start);
262         pud_clear(pud);
263         pmd_free_tlb(tlb, pmd, start);
264 }
265
266 static inline void free_pud_range(struct mmu_gather *tlb, pgd_t *pgd,
267                                 unsigned long addr, unsigned long end,
268                                 unsigned long floor, unsigned long ceiling)
269 {
270         pud_t *pud;
271         unsigned long next;
272         unsigned long start;
273
274         start = addr;
275         pud = pud_offset(pgd, addr);
276         do {
277                 next = pud_addr_end(addr, end);
278                 if (pud_none_or_clear_bad(pud))
279                         continue;
280                 free_pmd_range(tlb, pud, addr, next, floor, ceiling);
281         } while (pud++, addr = next, addr != end);
282
283         start &= PGDIR_MASK;
284         if (start < floor)
285                 return;
286         if (ceiling) {
287                 ceiling &= PGDIR_MASK;
288                 if (!ceiling)
289                         return;
290         }
291         if (end - 1 > ceiling - 1)
292                 return;
293
294         pud = pud_offset(pgd, start);
295         pgd_clear(pgd);
296         pud_free_tlb(tlb, pud, start);
297 }
298
299 /*
300  * This function frees user-level page tables of a process.
301  *
302  * Must be called with pagetable lock held.
303  */
304 void free_pgd_range(struct mmu_gather *tlb,
305                         unsigned long addr, unsigned long end,
306                         unsigned long floor, unsigned long ceiling)
307 {
308         pgd_t *pgd;
309         unsigned long next;
310
311         /*
312          * The next few lines have given us lots of grief...
313          *
314          * Why are we testing PMD* at this top level?  Because often
315          * there will be no work to do at all, and we'd prefer not to
316          * go all the way down to the bottom just to discover that.
317          *
318          * Why all these "- 1"s?  Because 0 represents both the bottom
319          * of the address space and the top of it (using -1 for the
320          * top wouldn't help much: the masks would do the wrong thing).
321          * The rule is that addr 0 and floor 0 refer to the bottom of
322          * the address space, but end 0 and ceiling 0 refer to the top
323          * Comparisons need to use "end - 1" and "ceiling - 1" (though
324          * that end 0 case should be mythical).
325          *
326          * Wherever addr is brought up or ceiling brought down, we must
327          * be careful to reject "the opposite 0" before it confuses the
328          * subsequent tests.  But what about where end is brought down
329          * by PMD_SIZE below? no, end can't go down to 0 there.
330          *
331          * Whereas we round start (addr) and ceiling down, by different
332          * masks at different levels, in order to test whether a table
333          * now has no other vmas using it, so can be freed, we don't
334          * bother to round floor or end up - the tests don't need that.
335          */
336
337         addr &= PMD_MASK;
338         if (addr < floor) {
339                 addr += PMD_SIZE;
340                 if (!addr)
341                         return;
342         }
343         if (ceiling) {
344                 ceiling &= PMD_MASK;
345                 if (!ceiling)
346                         return;
347         }
348         if (end - 1 > ceiling - 1)
349                 end -= PMD_SIZE;
350         if (addr > end - 1)
351                 return;
352
353         pgd = pgd_offset(tlb->mm, addr);
354         do {
355                 next = pgd_addr_end(addr, end);
356                 if (pgd_none_or_clear_bad(pgd))
357                         continue;
358                 free_pud_range(tlb, pgd, addr, next, floor, ceiling);
359         } while (pgd++, addr = next, addr != end);
360 }
361
362 void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *vma,
363                 unsigned long floor, unsigned long ceiling)
364 {
365         while (vma) {
366                 struct vm_area_struct *next = vma->vm_next;
367                 unsigned long addr = vma->vm_start;
368
369                 /*
370                  * Hide vma from rmap and truncate_pagecache before freeing
371                  * pgtables
372                  */
373                 unlink_anon_vmas(vma);
374                 unlink_file_vma(vma);
375
376                 if (is_vm_hugetlb_page(vma)) {
377                         hugetlb_free_pgd_range(tlb, addr, vma->vm_end,
378                                 floor, next? next->vm_start: ceiling);
379                 } else {
380                         /*
381                          * Optimization: gather nearby vmas into one call down
382                          */
383                         while (next && next->vm_start <= vma->vm_end + PMD_SIZE
384                                && !is_vm_hugetlb_page(next)) {
385                                 vma = next;
386                                 next = vma->vm_next;
387                                 unlink_anon_vmas(vma);
388                                 unlink_file_vma(vma);
389                         }
390                         free_pgd_range(tlb, addr, vma->vm_end,
391                                 floor, next? next->vm_start: ceiling);
392                 }
393                 vma = next;
394         }
395 }
396
397 int __pte_alloc(struct mm_struct *mm, struct vm_area_struct *vma,
398                 pmd_t *pmd, unsigned long address)
399 {
400         pgtable_t new = pte_alloc_one(mm, address);
401         int wait_split_huge_page;
402         if (!new)
403                 return -ENOMEM;
404
405         /*
406          * Ensure all pte setup (eg. pte page lock and page clearing) are
407          * visible before the pte is made visible to other CPUs by being
408          * put into page tables.
409          *
410          * The other side of the story is the pointer chasing in the page
411          * table walking code (when walking the page table without locking;
412          * ie. most of the time). Fortunately, these data accesses consist
413          * of a chain of data-dependent loads, meaning most CPUs (alpha
414          * being the notable exception) will already guarantee loads are
415          * seen in-order. See the alpha page table accessors for the
416          * smp_read_barrier_depends() barriers in page table walking code.
417          */
418         smp_wmb(); /* Could be smp_wmb__xxx(before|after)_spin_lock */
419
420         spin_lock(&mm->page_table_lock);
421         wait_split_huge_page = 0;
422         if (likely(pmd_none(*pmd))) {   /* Has another populated it ? */
423                 mm->nr_ptes++;
424                 pmd_populate(mm, pmd, new);
425                 new = NULL;
426         } else if (unlikely(pmd_trans_splitting(*pmd)))
427                 wait_split_huge_page = 1;
428         spin_unlock(&mm->page_table_lock);
429         if (new)
430                 pte_free(mm, new);
431         if (wait_split_huge_page)
432                 wait_split_huge_page(vma->anon_vma, pmd);
433         return 0;
434 }
435
436 int __pte_alloc_kernel(pmd_t *pmd, unsigned long address)
437 {
438         pte_t *new = pte_alloc_one_kernel(&init_mm, address);
439         if (!new)
440                 return -ENOMEM;
441
442         smp_wmb(); /* See comment in __pte_alloc */
443
444         spin_lock(&init_mm.page_table_lock);
445         if (likely(pmd_none(*pmd))) {   /* Has another populated it ? */
446                 pmd_populate_kernel(&init_mm, pmd, new);
447                 new = NULL;
448         } else
449                 VM_BUG_ON(pmd_trans_splitting(*pmd));
450         spin_unlock(&init_mm.page_table_lock);
451         if (new)
452                 pte_free_kernel(&init_mm, new);
453         return 0;
454 }
455
456 static inline void init_rss_vec(int *rss)
457 {
458         memset(rss, 0, sizeof(int) * NR_MM_COUNTERS);
459 }
460
461 static inline void add_mm_rss_vec(struct mm_struct *mm, int *rss)
462 {
463         int i;
464
465         if (current->mm == mm)
466                 sync_mm_rss(current, mm);
467         for (i = 0; i < NR_MM_COUNTERS; i++)
468                 if (rss[i])
469                         add_mm_counter(mm, i, rss[i]);
470 }
471
472 /*
473  * This function is called to print an error when a bad pte
474  * is found. For example, we might have a PFN-mapped pte in
475  * a region that doesn't allow it.
476  *
477  * The calling function must still handle the error.
478  */
479 static void print_bad_pte(struct vm_area_struct *vma, unsigned long addr,
480                           pte_t pte, struct page *page)
481 {
482         pgd_t *pgd = pgd_offset(vma->vm_mm, addr);
483         pud_t *pud = pud_offset(pgd, addr);
484         pmd_t *pmd = pmd_offset(pud, addr);
485         struct address_space *mapping;
486         pgoff_t index;
487         static unsigned long resume;
488         static unsigned long nr_shown;
489         static unsigned long nr_unshown;
490
491         /*
492          * Allow a burst of 60 reports, then keep quiet for that minute;
493          * or allow a steady drip of one report per second.
494          */
495         if (nr_shown == 60) {
496                 if (time_before(jiffies, resume)) {
497                         nr_unshown++;
498                         return;
499                 }
500                 if (nr_unshown) {
501                         printk(KERN_ALERT
502                                 "BUG: Bad page map: %lu messages suppressed\n",
503                                 nr_unshown);
504                         nr_unshown = 0;
505                 }
506                 nr_shown = 0;
507         }
508         if (nr_shown++ == 0)
509                 resume = jiffies + 60 * HZ;
510
511         mapping = vma->vm_file ? vma->vm_file->f_mapping : NULL;
512         index = linear_page_index(vma, addr);
513
514         printk(KERN_ALERT
515                 "BUG: Bad page map in process %s  pte:%08llx pmd:%08llx\n",
516                 current->comm,
517                 (long long)pte_val(pte), (long long)pmd_val(*pmd));
518         if (page)
519                 dump_page(page);
520         printk(KERN_ALERT
521                 "addr:%p vm_flags:%08lx anon_vma:%p mapping:%p index:%lx\n",
522                 (void *)addr, vma->vm_flags, vma->anon_vma, mapping, index);
523         /*
524          * Choose text because data symbols depend on CONFIG_KALLSYMS_ALL=y
525          */
526         if (vma->vm_ops)
527                 print_symbol(KERN_ALERT "vma->vm_ops->fault: %s\n",
528                                 (unsigned long)vma->vm_ops->fault);
529         if (vma->vm_file && vma->vm_file->f_op)
530                 print_symbol(KERN_ALERT "vma->vm_file->f_op->mmap: %s\n",
531                                 (unsigned long)vma->vm_file->f_op->mmap);
532         dump_stack();
533         add_taint(TAINT_BAD_PAGE);
534 }
535
536 static inline int is_cow_mapping(unsigned int flags)
537 {
538         return (flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
539 }
540
541 #ifndef is_zero_pfn
542 static inline int is_zero_pfn(unsigned long pfn)
543 {
544         return pfn == zero_pfn;
545 }
546 #endif
547
548 #ifndef my_zero_pfn
549 static inline unsigned long my_zero_pfn(unsigned long addr)
550 {
551         return zero_pfn;
552 }
553 #endif
554
555 /*
556  * vm_normal_page -- This function gets the "struct page" associated with a pte.
557  *
558  * "Special" mappings do not wish to be associated with a "struct page" (either
559  * it doesn't exist, or it exists but they don't want to touch it). In this
560  * case, NULL is returned here. "Normal" mappings do have a struct page.
561  *
562  * There are 2 broad cases. Firstly, an architecture may define a pte_special()
563  * pte bit, in which case this function is trivial. Secondly, an architecture
564  * may not have a spare pte bit, which requires a more complicated scheme,
565  * described below.
566  *
567  * A raw VM_PFNMAP mapping (ie. one that is not COWed) is always considered a
568  * special mapping (even if there are underlying and valid "struct pages").
569  * COWed pages of a VM_PFNMAP are always normal.
570  *
571  * The way we recognize COWed pages within VM_PFNMAP mappings is through the
572  * rules set up by "remap_pfn_range()": the vma will have the VM_PFNMAP bit
573  * set, and the vm_pgoff will point to the first PFN mapped: thus every special
574  * mapping will always honor the rule
575  *
576  *      pfn_of_page == vma->vm_pgoff + ((addr - vma->vm_start) >> PAGE_SHIFT)
577  *
578  * And for normal mappings this is false.
579  *
580  * This restricts such mappings to be a linear translation from virtual address
581  * to pfn. To get around this restriction, we allow arbitrary mappings so long
582  * as the vma is not a COW mapping; in that case, we know that all ptes are
583  * special (because none can have been COWed).
584  *
585  *
586  * In order to support COW of arbitrary special mappings, we have VM_MIXEDMAP.
587  *
588  * VM_MIXEDMAP mappings can likewise contain memory with or without "struct
589  * page" backing, however the difference is that _all_ pages with a struct
590  * page (that is, those where pfn_valid is true) are refcounted and considered
591  * normal pages by the VM. The disadvantage is that pages are refcounted
592  * (which can be slower and simply not an option for some PFNMAP users). The
593  * advantage is that we don't have to follow the strict linearity rule of
594  * PFNMAP mappings in order to support COWable mappings.
595  *
596  */
597 #ifdef __HAVE_ARCH_PTE_SPECIAL
598 # define HAVE_PTE_SPECIAL 1
599 #else
600 # define HAVE_PTE_SPECIAL 0
601 #endif
602 struct page *vm_normal_page(struct vm_area_struct *vma, unsigned long addr,
603                                 pte_t pte)
604 {
605         unsigned long pfn = pte_pfn(pte);
606
607         if (HAVE_PTE_SPECIAL) {
608                 if (likely(!pte_special(pte)))
609                         goto check_pfn;
610                 if (vma->vm_flags & (VM_PFNMAP | VM_MIXEDMAP))
611                         return NULL;
612                 if (!is_zero_pfn(pfn))
613                         print_bad_pte(vma, addr, pte, NULL);
614                 return NULL;
615         }
616
617         /* !HAVE_PTE_SPECIAL case follows: */
618
619         if (unlikely(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))) {
620                 if (vma->vm_flags & VM_MIXEDMAP) {
621                         if (!pfn_valid(pfn))
622                                 return NULL;
623                         goto out;
624                 } else {
625                         unsigned long off;
626                         off = (addr - vma->vm_start) >> PAGE_SHIFT;
627                         if (pfn == vma->vm_pgoff + off)
628                                 return NULL;
629                         if (!is_cow_mapping(vma->vm_flags))
630                                 return NULL;
631                 }
632         }
633
634         if (is_zero_pfn(pfn))
635                 return NULL;
636 check_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          */
646 out:
647         return pfn_to_page(pfn);
648 }
649
650 /*
651  * copy one vm_area from one task to the other. Assumes the page tables
652  * already present in the new task to be cleared in the whole range
653  * covered by this vma.
654  */
655
656 static inline unsigned long
657 copy_one_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm,
658                 pte_t *dst_pte, pte_t *src_pte, struct vm_area_struct *vma,
659                 unsigned long addr, int *rss)
660 {
661         unsigned long vm_flags = vma->vm_flags;
662         pte_t pte = *src_pte;
663         struct page *page;
664
665         /* pte contains position in swap or file, so copy. */
666         if (unlikely(!pte_present(pte))) {
667                 if (!pte_file(pte)) {
668                         swp_entry_t entry = pte_to_swp_entry(pte);
669
670                         if (swap_duplicate(entry) < 0)
671                                 return entry.val;
672
673                         /* make sure dst_mm is on swapoff's mmlist. */
674                         if (unlikely(list_empty(&dst_mm->mmlist))) {
675                                 spin_lock(&mmlist_lock);
676                                 if (list_empty(&dst_mm->mmlist))
677                                         list_add(&dst_mm->mmlist,
678                                                  &src_mm->mmlist);
679                                 spin_unlock(&mmlist_lock);
680                         }
681                         if (likely(!non_swap_entry(entry)))
682                                 rss[MM_SWAPENTS]++;
683                         else if (is_write_migration_entry(entry) &&
684                                         is_cow_mapping(vm_flags)) {
685                                 /*
686                                  * COW mappings require pages in both parent
687                                  * and child to be set to read.
688                                  */
689                                 make_migration_entry_read(&entry);
690                                 pte = swp_entry_to_pte(entry);
691                                 set_pte_at(src_mm, addr, src_pte, pte);
692                         }
693                 }
694                 goto out_set_pte;
695         }
696
697         /*
698          * If it's a COW mapping, write protect it both
699          * in the parent and the child
700          */
701         if (is_cow_mapping(vm_flags)) {
702                 ptep_set_wrprotect(src_mm, addr, src_pte);
703                 pte = pte_wrprotect(pte);
704         }
705
706         /*
707          * If it's a shared mapping, mark it clean in
708          * the child
709          */
710         if (vm_flags & VM_SHARED)
711                 pte = pte_mkclean(pte);
712         pte = pte_mkold(pte);
713
714         page = vm_normal_page(vma, addr, pte);
715         if (page) {
716                 get_page(page);
717                 page_dup_rmap(page);
718                 if (PageAnon(page))
719                         rss[MM_ANONPAGES]++;
720                 else
721                         rss[MM_FILEPAGES]++;
722         }
723
724 out_set_pte:
725         set_pte_at(dst_mm, addr, dst_pte, pte);
726         return 0;
727 }
728
729 int copy_pte_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
730                    pmd_t *dst_pmd, pmd_t *src_pmd, struct vm_area_struct *vma,
731                    unsigned long addr, unsigned long end)
732 {
733         pte_t *orig_src_pte, *orig_dst_pte;
734         pte_t *src_pte, *dst_pte;
735         spinlock_t *src_ptl, *dst_ptl;
736         int progress = 0;
737         int rss[NR_MM_COUNTERS];
738         swp_entry_t entry = (swp_entry_t){0};
739
740 again:
741         init_rss_vec(rss);
742
743         dst_pte = pte_alloc_map_lock(dst_mm, dst_pmd, addr, &dst_ptl);
744         if (!dst_pte)
745                 return -ENOMEM;
746         src_pte = pte_offset_map(src_pmd, addr);
747         src_ptl = pte_lockptr(src_mm, src_pmd);
748         spin_lock_nested(src_ptl, SINGLE_DEPTH_NESTING);
749         orig_src_pte = src_pte;
750         orig_dst_pte = dst_pte;
751         arch_enter_lazy_mmu_mode();
752
753         do {
754                 /*
755                  * We are holding two locks at this point - either of them
756                  * could generate latencies in another task on another CPU.
757                  */
758                 if (progress >= 32) {
759                         progress = 0;
760                         if (need_resched() ||
761                             spin_needbreak(src_ptl) || spin_needbreak(dst_ptl))
762                                 break;
763                 }
764                 if (pte_none(*src_pte)) {
765                         progress++;
766                         continue;
767                 }
768                 entry.val = copy_one_pte(dst_mm, src_mm, dst_pte, src_pte,
769                                                         vma, addr, rss);
770                 if (entry.val)
771                         break;
772                 progress += 8;
773         } while (dst_pte++, src_pte++, addr += PAGE_SIZE, addr != end);
774
775         arch_leave_lazy_mmu_mode();
776         spin_unlock(src_ptl);
777         pte_unmap(orig_src_pte);
778         add_mm_rss_vec(dst_mm, rss);
779         pte_unmap_unlock(orig_dst_pte, dst_ptl);
780         cond_resched();
781
782         if (entry.val) {
783                 if (add_swap_count_continuation(entry, GFP_KERNEL) < 0)
784                         return -ENOMEM;
785                 progress = 0;
786         }
787         if (addr != end)
788                 goto again;
789         return 0;
790 }
791
792 static inline int copy_pmd_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
793                 pud_t *dst_pud, pud_t *src_pud, struct vm_area_struct *vma,
794                 unsigned long addr, unsigned long end)
795 {
796         pmd_t *src_pmd, *dst_pmd;
797         unsigned long next;
798
799         dst_pmd = pmd_alloc(dst_mm, dst_pud, addr);
800         if (!dst_pmd)
801                 return -ENOMEM;
802         src_pmd = pmd_offset(src_pud, addr);
803         do {
804                 next = pmd_addr_end(addr, end);
805                 if (pmd_trans_huge(*src_pmd)) {
806                         int err;
807                         VM_BUG_ON(next-addr != HPAGE_PMD_SIZE);
808                         err = copy_huge_pmd(dst_mm, src_mm,
809                                             dst_pmd, src_pmd, addr, vma);
810                         if (err == -ENOMEM)
811                                 return -ENOMEM;
812                         if (!err)
813                                 continue;
814                         /* fall through */
815                 }
816                 if (pmd_none_or_clear_bad(src_pmd))
817                         continue;
818                 if (copy_pte_range(dst_mm, src_mm, dst_pmd, src_pmd,
819                                                 vma, addr, next))
820                         return -ENOMEM;
821         } while (dst_pmd++, src_pmd++, addr = next, addr != end);
822         return 0;
823 }
824
825 static inline int copy_pud_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
826                 pgd_t *dst_pgd, pgd_t *src_pgd, struct vm_area_struct *vma,
827                 unsigned long addr, unsigned long end)
828 {
829         pud_t *src_pud, *dst_pud;
830         unsigned long next;
831
832         dst_pud = pud_alloc(dst_mm, dst_pgd, addr);
833         if (!dst_pud)
834                 return -ENOMEM;
835         src_pud = pud_offset(src_pgd, addr);
836         do {
837                 next = pud_addr_end(addr, end);
838                 if (pud_none_or_clear_bad(src_pud))
839                         continue;
840                 if (copy_pmd_range(dst_mm, src_mm, dst_pud, src_pud,
841                                                 vma, addr, next))
842                         return -ENOMEM;
843         } while (dst_pud++, src_pud++, addr = next, addr != end);
844         return 0;
845 }
846
847 int copy_page_range(struct mm_struct *dst_mm, struct mm_struct *src_mm,
848                 struct vm_area_struct *vma)
849 {
850         pgd_t *src_pgd, *dst_pgd;
851         unsigned long next;
852         unsigned long addr = vma->vm_start;
853         unsigned long end = vma->vm_end;
854         int ret;
855
856         /*
857          * Don't copy ptes where a page fault will fill them correctly.
858          * Fork becomes much lighter when there are big shared or private
859          * readonly mappings. The tradeoff is that copy_page_range is more
860          * efficient than faulting.
861          */
862         if (!(vma->vm_flags & (VM_HUGETLB|VM_NONLINEAR|VM_PFNMAP|VM_INSERTPAGE))) {
863                 if (!vma->anon_vma)
864                         return 0;
865         }
866
867         if (is_vm_hugetlb_page(vma))
868                 return copy_hugetlb_page_range(dst_mm, src_mm, vma);
869
870         if (unlikely(is_pfn_mapping(vma))) {
871                 /*
872                  * We do not free on error cases below as remove_vma
873                  * gets called on error from higher level routine
874                  */
875                 ret = track_pfn_vma_copy(vma);
876                 if (ret)
877                         return ret;
878         }
879
880         /*
881          * We need to invalidate the secondary MMU mappings only when
882          * there could be a permission downgrade on the ptes of the
883          * parent mm. And a permission downgrade will only happen if
884          * is_cow_mapping() returns true.
885          */
886         if (is_cow_mapping(vma->vm_flags))
887                 mmu_notifier_invalidate_range_start(src_mm, addr, end);
888
889         ret = 0;
890         dst_pgd = pgd_offset(dst_mm, addr);
891         src_pgd = pgd_offset(src_mm, addr);
892         do {
893                 next = pgd_addr_end(addr, end);
894                 if (pgd_none_or_clear_bad(src_pgd))
895                         continue;
896                 if (unlikely(copy_pud_range(dst_mm, src_mm, dst_pgd, src_pgd,
897                                             vma, addr, next))) {
898                         ret = -ENOMEM;
899                         break;
900                 }
901         } while (dst_pgd++, src_pgd++, addr = next, addr != end);
902
903         if (is_cow_mapping(vma->vm_flags))
904                 mmu_notifier_invalidate_range_end(src_mm,
905                                                   vma->vm_start, end);
906         return ret;
907 }
908
909 static unsigned long zap_pte_range(struct mmu_gather *tlb,
910                                 struct vm_area_struct *vma, pmd_t *pmd,
911                                 unsigned long addr, unsigned long end,
912                                 long *zap_work, struct zap_details *details)
913 {
914         struct mm_struct *mm = tlb->mm;
915         pte_t *pte;
916         spinlock_t *ptl;
917         int rss[NR_MM_COUNTERS];
918
919         init_rss_vec(rss);
920
921         pte = pte_offset_map_lock(mm, pmd, addr, &ptl);
922         arch_enter_lazy_mmu_mode();
923         do {
924                 pte_t ptent = *pte;
925                 if (pte_none(ptent)) {
926                         (*zap_work)--;
927                         continue;
928                 }
929
930                 (*zap_work) -= PAGE_SIZE;
931
932                 if (pte_present(ptent)) {
933                         struct page *page;
934
935                         page = vm_normal_page(vma, addr, ptent);
936                         if (unlikely(details) && page) {
937                                 /*
938                                  * unmap_shared_mapping_pages() wants to
939                                  * invalidate cache without truncating:
940                                  * unmap shared but keep private pages.
941                                  */
942                                 if (details->check_mapping &&
943                                     details->check_mapping != page->mapping)
944                                         continue;
945                                 /*
946                                  * Each page->index must be checked when
947                                  * invalidating or truncating nonlinear.
948                                  */
949                                 if (details->nonlinear_vma &&
950                                     (page->index < details->first_index ||
951                                      page->index > details->last_index))
952                                         continue;
953                         }
954                         ptent = ptep_get_and_clear_full(mm, addr, pte,
955                                                         tlb->fullmm);
956                         tlb_remove_tlb_entry(tlb, pte, addr);
957                         if (unlikely(!page))
958                                 continue;
959                         if (unlikely(details) && details->nonlinear_vma
960                             && linear_page_index(details->nonlinear_vma,
961                                                 addr) != page->index)
962                                 set_pte_at(mm, addr, pte,
963                                            pgoff_to_pte(page->index));
964                         if (PageAnon(page))
965                                 rss[MM_ANONPAGES]--;
966                         else {
967                                 if (pte_dirty(ptent))
968                                         set_page_dirty(page);
969                                 if (pte_young(ptent) &&
970                                     likely(!VM_SequentialReadHint(vma)))
971                                         mark_page_accessed(page);
972                                 rss[MM_FILEPAGES]--;
973                         }
974                         page_remove_rmap(page);
975                         if (unlikely(page_mapcount(page) < 0))
976                                 print_bad_pte(vma, addr, ptent, page);
977                         tlb_remove_page(tlb, page);
978                         continue;
979                 }
980                 /*
981                  * If details->check_mapping, we leave swap entries;
982                  * if details->nonlinear_vma, we leave file entries.
983                  */
984                 if (unlikely(details))
985                         continue;
986                 if (pte_file(ptent)) {
987                         if (unlikely(!(vma->vm_flags & VM_NONLINEAR)))
988                                 print_bad_pte(vma, addr, ptent, NULL);
989                 } else {
990                         swp_entry_t entry = pte_to_swp_entry(ptent);
991
992                         if (!non_swap_entry(entry))
993                                 rss[MM_SWAPENTS]--;
994                         if (unlikely(!free_swap_and_cache(entry)))
995                                 print_bad_pte(vma, addr, ptent, NULL);
996                 }
997                 pte_clear_not_present_full(mm, addr, pte, tlb->fullmm);
998         } while (pte++, addr += PAGE_SIZE, (addr != end && *zap_work > 0));
999
1000         add_mm_rss_vec(mm, rss);
1001         arch_leave_lazy_mmu_mode();
1002         pte_unmap_unlock(pte - 1, ptl);
1003
1004         return addr;
1005 }
1006
1007 static inline unsigned long zap_pmd_range(struct mmu_gather *tlb,
1008                                 struct vm_area_struct *vma, pud_t *pud,
1009                                 unsigned long addr, unsigned long end,
1010                                 long *zap_work, struct zap_details *details)
1011 {
1012         pmd_t *pmd;
1013         unsigned long next;
1014
1015         pmd = pmd_offset(pud, addr);
1016         do {
1017                 next = pmd_addr_end(addr, end);
1018                 if (pmd_trans_huge(*pmd)) {
1019                         if (next-addr != HPAGE_PMD_SIZE) {
1020                                 VM_BUG_ON(!rwsem_is_locked(&tlb->mm->mmap_sem));
1021                                 split_huge_page_pmd(vma->vm_mm, pmd);
1022                         } else if (zap_huge_pmd(tlb, vma, pmd)) {
1023                                 (*zap_work)--;
1024                                 continue;
1025                         }
1026                         /* fall through */
1027                 }
1028                 if (pmd_none_or_clear_bad(pmd)) {
1029                         (*zap_work)--;
1030                         continue;
1031                 }
1032                 next = zap_pte_range(tlb, vma, pmd, addr, next,
1033                                                 zap_work, details);
1034         } while (pmd++, addr = next, (addr != end && *zap_work > 0));
1035
1036         return addr;
1037 }
1038
1039 static inline unsigned long zap_pud_range(struct mmu_gather *tlb,
1040                                 struct vm_area_struct *vma, pgd_t *pgd,
1041                                 unsigned long addr, unsigned long end,
1042                                 long *zap_work, struct zap_details *details)
1043 {
1044         pud_t *pud;
1045         unsigned long next;
1046
1047         pud = pud_offset(pgd, addr);
1048         do {
1049                 next = pud_addr_end(addr, end);
1050                 if (pud_none_or_clear_bad(pud)) {
1051                         (*zap_work)--;
1052                         continue;
1053                 }
1054                 next = zap_pmd_range(tlb, vma, pud, addr, next,
1055                                                 zap_work, details);
1056         } while (pud++, addr = next, (addr != end && *zap_work > 0));
1057
1058         return addr;
1059 }
1060
1061 static unsigned long unmap_page_range(struct mmu_gather *tlb,
1062                                 struct vm_area_struct *vma,
1063                                 unsigned long addr, unsigned long end,
1064                                 long *zap_work, struct zap_details *details)
1065 {
1066         pgd_t *pgd;
1067         unsigned long next;
1068
1069         if (details && !details->check_mapping && !details->nonlinear_vma)
1070                 details = NULL;
1071
1072         BUG_ON(addr >= end);
1073         mem_cgroup_uncharge_start();
1074         tlb_start_vma(tlb, vma);
1075         pgd = pgd_offset(vma->vm_mm, addr);
1076         do {
1077                 next = pgd_addr_end(addr, end);
1078                 if (pgd_none_or_clear_bad(pgd)) {
1079                         (*zap_work)--;
1080                         continue;
1081                 }
1082                 next = zap_pud_range(tlb, vma, pgd, addr, next,
1083                                                 zap_work, details);
1084         } while (pgd++, addr = next, (addr != end && *zap_work > 0));
1085         tlb_end_vma(tlb, vma);
1086         mem_cgroup_uncharge_end();
1087
1088         return addr;
1089 }
1090
1091 #ifdef CONFIG_PREEMPT
1092 # define ZAP_BLOCK_SIZE (8 * PAGE_SIZE)
1093 #else
1094 /* No preempt: go for improved straight-line efficiency */
1095 # define ZAP_BLOCK_SIZE (1024 * PAGE_SIZE)
1096 #endif
1097
1098 /**
1099  * unmap_vmas - unmap a range of memory covered by a list of vma's
1100  * @tlbp: address of the caller's struct mmu_gather
1101  * @vma: the starting vma
1102  * @start_addr: virtual address at which to start unmapping
1103  * @end_addr: virtual address at which to end unmapping
1104  * @nr_accounted: Place number of unmapped pages in vm-accountable vma's here
1105  * @details: details of nonlinear truncation or shared cache invalidation
1106  *
1107  * Returns the end address of the unmapping (restart addr if interrupted).
1108  *
1109  * Unmap all pages in the vma list.
1110  *
1111  * We aim to not hold locks for too long (for scheduling latency reasons).
1112  * So zap pages in ZAP_BLOCK_SIZE bytecounts.  This means we need to
1113  * return the ending mmu_gather to the caller.
1114  *
1115  * Only addresses between `start' and `end' will be unmapped.
1116  *
1117  * The VMA list must be sorted in ascending virtual address order.
1118  *
1119  * unmap_vmas() assumes that the caller will flush the whole unmapped address
1120  * range after unmap_vmas() returns.  So the only responsibility here is to
1121  * ensure that any thus-far unmapped pages are flushed before unmap_vmas()
1122  * drops the lock and schedules.
1123  */
1124 unsigned long unmap_vmas(struct mmu_gather **tlbp,
1125                 struct vm_area_struct *vma, unsigned long start_addr,
1126                 unsigned long end_addr, unsigned long *nr_accounted,
1127                 struct zap_details *details)
1128 {
1129         long zap_work = ZAP_BLOCK_SIZE;
1130         unsigned long tlb_start = 0;    /* For tlb_finish_mmu */
1131         int tlb_start_valid = 0;
1132         unsigned long start = start_addr;
1133         spinlock_t *i_mmap_lock = details? details->i_mmap_lock: NULL;
1134         int fullmm = (*tlbp)->fullmm;
1135         struct mm_struct *mm = vma->vm_mm;
1136
1137         mmu_notifier_invalidate_range_start(mm, start_addr, end_addr);
1138         for ( ; vma && vma->vm_start < end_addr; vma = vma->vm_next) {
1139                 unsigned long end;
1140
1141                 start = max(vma->vm_start, start_addr);
1142                 if (start >= vma->vm_end)
1143                         continue;
1144                 end = min(vma->vm_end, end_addr);
1145                 if (end <= vma->vm_start)
1146                         continue;
1147
1148                 if (vma->vm_flags & VM_ACCOUNT)
1149                         *nr_accounted += (end - start) >> PAGE_SHIFT;
1150
1151                 if (unlikely(is_pfn_mapping(vma)))
1152                         untrack_pfn_vma(vma, 0, 0);
1153
1154                 while (start != end) {
1155                         if (!tlb_start_valid) {
1156                                 tlb_start = start;
1157                                 tlb_start_valid = 1;
1158                         }
1159
1160                         if (unlikely(is_vm_hugetlb_page(vma))) {
1161                                 /*
1162                                  * It is undesirable to test vma->vm_file as it
1163                                  * should be non-null for valid hugetlb area.
1164                                  * However, vm_file will be NULL in the error
1165                                  * cleanup path of do_mmap_pgoff. When
1166                                  * hugetlbfs ->mmap method fails,
1167                                  * do_mmap_pgoff() nullifies vma->vm_file
1168                                  * before calling this function to clean up.
1169                                  * Since no pte has actually been setup, it is
1170                                  * safe to do nothing in this case.
1171                                  */
1172                                 if (vma->vm_file) {
1173                                         unmap_hugepage_range(vma, start, end, NULL);
1174                                         zap_work -= (end - start) /
1175                                         pages_per_huge_page(hstate_vma(vma));
1176                                 }
1177
1178                                 start = end;
1179                         } else
1180                                 start = unmap_page_range(*tlbp, vma,
1181                                                 start, end, &zap_work, details);
1182
1183                         if (zap_work > 0) {
1184                                 BUG_ON(start != end);
1185                                 break;
1186                         }
1187
1188                         tlb_finish_mmu(*tlbp, tlb_start, start);
1189
1190                         if (need_resched() ||
1191                                 (i_mmap_lock && spin_needbreak(i_mmap_lock))) {
1192                                 if (i_mmap_lock) {
1193                                         *tlbp = NULL;
1194                                         goto out;
1195                                 }
1196                                 cond_resched();
1197                         }
1198
1199                         *tlbp = tlb_gather_mmu(vma->vm_mm, fullmm);
1200                         tlb_start_valid = 0;
1201                         zap_work = ZAP_BLOCK_SIZE;
1202                 }
1203         }
1204 out:
1205         mmu_notifier_invalidate_range_end(mm, start_addr, end_addr);
1206         return start;   /* which is now the end (or restart) address */
1207 }
1208
1209 /**
1210  * zap_page_range - remove user pages in a given range
1211  * @vma: vm_area_struct holding the applicable pages
1212  * @address: starting address of pages to zap
1213  * @size: number of bytes to zap
1214  * @details: details of nonlinear truncation or shared cache invalidation
1215  */
1216 unsigned long zap_page_range(struct vm_area_struct *vma, unsigned long address,
1217                 unsigned long size, struct zap_details *details)
1218 {
1219         struct mm_struct *mm = vma->vm_mm;
1220         struct mmu_gather *tlb;
1221         unsigned long end = address + size;
1222         unsigned long nr_accounted = 0;
1223
1224         lru_add_drain();
1225         tlb = tlb_gather_mmu(mm, 0);
1226         update_hiwater_rss(mm);
1227         end = unmap_vmas(&tlb, vma, address, end, &nr_accounted, details);
1228         if (tlb)
1229                 tlb_finish_mmu(tlb, address, end);
1230         return end;
1231 }
1232
1233 /**
1234  * zap_vma_ptes - remove ptes mapping the vma
1235  * @vma: vm_area_struct holding ptes to be zapped
1236  * @address: starting address of pages to zap
1237  * @size: number of bytes to zap
1238  *
1239  * This function only unmaps ptes assigned to VM_PFNMAP vmas.
1240  *
1241  * The entire address range must be fully contained within the vma.
1242  *
1243  * Returns 0 if successful.
1244  */
1245 int zap_vma_ptes(struct vm_area_struct *vma, unsigned long address,
1246                 unsigned long size)
1247 {
1248         if (address < vma->vm_start || address + size > vma->vm_end ||
1249                         !(vma->vm_flags & VM_PFNMAP))
1250                 return -1;
1251         zap_page_range(vma, address, size, NULL);
1252         return 0;
1253 }
1254 EXPORT_SYMBOL_GPL(zap_vma_ptes);
1255
1256 /**
1257  * follow_page - look up a page descriptor from a user-virtual address
1258  * @vma: vm_area_struct mapping @address
1259  * @address: virtual address to look up
1260  * @flags: flags modifying lookup behaviour
1261  *
1262  * @flags can have FOLL_ flags set, defined in <linux/mm.h>
1263  *
1264  * Returns the mapped (struct page *), %NULL if no mapping exists, or
1265  * an error pointer if there is a mapping to something not represented
1266  * by a page descriptor (see also vm_normal_page()).
1267  */
1268 struct page *follow_page(struct vm_area_struct *vma, unsigned long address,
1269                         unsigned int flags)
1270 {
1271         pgd_t *pgd;
1272         pud_t *pud;
1273         pmd_t *pmd;
1274         pte_t *ptep, pte;
1275         spinlock_t *ptl;
1276         struct page *page;
1277         struct mm_struct *mm = vma->vm_mm;
1278
1279         page = follow_huge_addr(mm, address, flags & FOLL_WRITE);
1280         if (!IS_ERR(page)) {
1281                 BUG_ON(flags & FOLL_GET);
1282                 goto out;
1283         }
1284
1285         page = NULL;
1286         pgd = pgd_offset(mm, address);
1287         if (pgd_none(*pgd) || unlikely(pgd_bad(*pgd)))
1288                 goto no_page_table;
1289
1290         pud = pud_offset(pgd, address);
1291         if (pud_none(*pud))
1292                 goto no_page_table;
1293         if (pud_huge(*pud) && vma->vm_flags & VM_HUGETLB) {
1294                 BUG_ON(flags & FOLL_GET);
1295                 page = follow_huge_pud(mm, address, pud, flags & FOLL_WRITE);
1296                 goto out;
1297         }
1298         if (unlikely(pud_bad(*pud)))
1299                 goto no_page_table;
1300
1301         pmd = pmd_offset(pud, address);
1302         if (pmd_none(*pmd))
1303                 goto no_page_table;
1304         if (pmd_huge(*pmd) && vma->vm_flags & VM_HUGETLB) {
1305                 BUG_ON(flags & FOLL_GET);
1306                 page = follow_huge_pmd(mm, address, pmd, flags & FOLL_WRITE);
1307                 goto out;
1308         }
1309         if (pmd_trans_huge(*pmd)) {
1310                 if (flags & FOLL_SPLIT) {
1311                         split_huge_page_pmd(mm, pmd);
1312                         goto split_fallthrough;
1313                 }
1314                 spin_lock(&mm->page_table_lock);
1315                 if (likely(pmd_trans_huge(*pmd))) {
1316                         if (unlikely(pmd_trans_splitting(*pmd))) {
1317                                 spin_unlock(&mm->page_table_lock);
1318                                 wait_split_huge_page(vma->anon_vma, pmd);
1319                         } else {
1320                                 page = follow_trans_huge_pmd(mm, address,
1321                                                              pmd, flags);
1322                                 spin_unlock(&mm->page_table_lock);
1323                                 goto out;
1324                         }
1325                 } else
1326                         spin_unlock(&mm->page_table_lock);
1327                 /* fall through */
1328         }
1329 split_fallthrough:
1330         if (unlikely(pmd_bad(*pmd)))
1331                 goto no_page_table;
1332
1333         ptep = pte_offset_map_lock(mm, pmd, address, &ptl);
1334
1335         pte = *ptep;
1336         if (!pte_present(pte))
1337                 goto no_page;
1338         if ((flags & FOLL_WRITE) && !pte_write(pte))
1339                 goto unlock;
1340
1341         page = vm_normal_page(vma, address, pte);
1342         if (unlikely(!page)) {
1343                 if ((flags & FOLL_DUMP) ||
1344                     !is_zero_pfn(pte_pfn(pte)))
1345                         goto bad_page;
1346                 page = pte_page(pte);
1347         }
1348
1349         if (flags & FOLL_GET)
1350                 get_page(page);
1351         if (flags & FOLL_TOUCH) {
1352                 if ((flags & FOLL_WRITE) &&
1353                     !pte_dirty(pte) && !PageDirty(page))
1354                         set_page_dirty(page);
1355                 /*
1356                  * pte_mkyoung() would be more correct here, but atomic care
1357                  * is needed to avoid losing the dirty bit: it is easier to use
1358                  * mark_page_accessed().
1359                  */
1360                 mark_page_accessed(page);
1361         }
1362         if (flags & FOLL_MLOCK) {
1363                 /*
1364                  * The preliminary mapping check is mainly to avoid the
1365                  * pointless overhead of lock_page on the ZERO_PAGE
1366                  * which might bounce very badly if there is contention.
1367                  *
1368                  * If the page is already locked, we don't need to
1369                  * handle it now - vmscan will handle it later if and
1370                  * when it attempts to reclaim the page.
1371                  */
1372                 if (page->mapping && trylock_page(page)) {
1373                         lru_add_drain();  /* push cached pages to LRU */
1374                         /*
1375                          * Because we lock page here and migration is
1376                          * blocked by the pte's page reference, we need
1377                          * only check for file-cache page truncation.
1378                          */
1379                         if (page->mapping)
1380                                 mlock_vma_page(page);
1381                         unlock_page(page);
1382                 }
1383         }
1384 unlock:
1385         pte_unmap_unlock(ptep, ptl);
1386 out:
1387         return page;
1388
1389 bad_page:
1390         pte_unmap_unlock(ptep, ptl);
1391         return ERR_PTR(-EFAULT);
1392
1393 no_page:
1394         pte_unmap_unlock(ptep, ptl);
1395         if (!pte_none(pte))
1396                 return page;
1397
1398 no_page_table:
1399         /*
1400          * When core dumping an enormous anonymous area that nobody
1401          * has touched so far, we don't want to allocate unnecessary pages or
1402          * page tables.  Return error instead of NULL to skip handle_mm_fault,
1403          * then get_dump_page() will return NULL to leave a hole in the dump.
1404          * But we can only make this optimization where a hole would surely
1405          * be zero-filled if handle_mm_fault() actually did handle it.
1406          */
1407         if ((flags & FOLL_DUMP) &&
1408             (!vma->vm_ops || !vma->vm_ops->fault))
1409                 return ERR_PTR(-EFAULT);
1410         return page;
1411 }
1412
1413 /**
1414  * __get_user_pages() - pin user pages in memory
1415  * @tsk:        task_struct of target task
1416  * @mm:         mm_struct of target mm
1417  * @start:      starting user address
1418  * @nr_pages:   number of pages from start to pin
1419  * @gup_flags:  flags modifying pin behaviour
1420  * @pages:      array that receives pointers to the pages pinned.
1421  *              Should be at least nr_pages long. Or NULL, if caller
1422  *              only intends to ensure the pages are faulted in.
1423  * @vmas:       array of pointers to vmas corresponding to each page.
1424  *              Or NULL if the caller does not require them.
1425  * @nonblocking: whether waiting for disk IO or mmap_sem contention
1426  *
1427  * Returns number of pages pinned. This may be fewer than the number
1428  * requested. If nr_pages is 0 or negative, returns 0. If no pages
1429  * were pinned, returns -errno. Each page returned must be released
1430  * with a put_page() call when it is finished with. vmas will only
1431  * remain valid while mmap_sem is held.
1432  *
1433  * Must be called with mmap_sem held for read or write.
1434  *
1435  * __get_user_pages walks a process's page tables and takes a reference to
1436  * each struct page that each user address corresponds to at a given
1437  * instant. That is, it takes the page that would be accessed if a user
1438  * thread accesses the given user virtual address at that instant.
1439  *
1440  * This does not guarantee that the page exists in the user mappings when
1441  * __get_user_pages returns, and there may even be a completely different
1442  * page there in some cases (eg. if mmapped pagecache has been invalidated
1443  * and subsequently re faulted). However it does guarantee that the page
1444  * won't be freed completely. And mostly callers simply care that the page
1445  * contains data that was valid *at some point in time*. Typically, an IO
1446  * or similar operation cannot guarantee anything stronger anyway because
1447  * locks can't be held over the syscall boundary.
1448  *
1449  * If @gup_flags & FOLL_WRITE == 0, the page must not be written to. If
1450  * the page is written to, set_page_dirty (or set_page_dirty_lock, as
1451  * appropriate) must be called after the page is finished with, and
1452  * before put_page is called.
1453  *
1454  * If @nonblocking != NULL, __get_user_pages will not wait for disk IO
1455  * or mmap_sem contention, and if waiting is needed to pin all pages,
1456  * *@nonblocking will be set to 0.
1457  *
1458  * In most cases, get_user_pages or get_user_pages_fast should be used
1459  * instead of __get_user_pages. __get_user_pages should be used only if
1460  * you need some special @gup_flags.
1461  */
1462 int __get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
1463                      unsigned long start, int nr_pages, unsigned int gup_flags,
1464                      struct page **pages, struct vm_area_struct **vmas,
1465                      int *nonblocking)
1466 {
1467         int i;
1468         unsigned long vm_flags;
1469
1470         if (nr_pages <= 0)
1471                 return 0;
1472
1473         VM_BUG_ON(!!pages != !!(gup_flags & FOLL_GET));
1474
1475         /* 
1476          * Require read or write permissions.
1477          * If FOLL_FORCE is set, we only require the "MAY" flags.
1478          */
1479         vm_flags  = (gup_flags & FOLL_WRITE) ?
1480                         (VM_WRITE | VM_MAYWRITE) : (VM_READ | VM_MAYREAD);
1481         vm_flags &= (gup_flags & FOLL_FORCE) ?
1482                         (VM_MAYREAD | VM_MAYWRITE) : (VM_READ | VM_WRITE);
1483         i = 0;
1484
1485         do {
1486                 struct vm_area_struct *vma;
1487
1488                 vma = find_extend_vma(mm, start);
1489                 if (!vma && in_gate_area(tsk, start)) {
1490                         unsigned long pg = start & PAGE_MASK;
1491                         struct vm_area_struct *gate_vma = get_gate_vma(tsk);
1492                         pgd_t *pgd;
1493                         pud_t *pud;
1494                         pmd_t *pmd;
1495                         pte_t *pte;
1496
1497                         /* user gate pages are read-only */
1498                         if (gup_flags & FOLL_WRITE)
1499                                 return i ? : -EFAULT;
1500                         if (pg > TASK_SIZE)
1501                                 pgd = pgd_offset_k(pg);
1502                         else
1503                                 pgd = pgd_offset_gate(mm, pg);
1504                         BUG_ON(pgd_none(*pgd));
1505                         pud = pud_offset(pgd, pg);
1506                         BUG_ON(pud_none(*pud));
1507                         pmd = pmd_offset(pud, pg);
1508                         if (pmd_none(*pmd))
1509                                 return i ? : -EFAULT;
1510                         VM_BUG_ON(pmd_trans_huge(*pmd));
1511                         pte = pte_offset_map(pmd, pg);
1512                         if (pte_none(*pte)) {
1513                                 pte_unmap(pte);
1514                                 return i ? : -EFAULT;
1515                         }
1516                         if (pages) {
1517                                 struct page *page;
1518
1519                                 page = vm_normal_page(gate_vma, start, *pte);
1520                                 if (!page) {
1521                                         if (!(gup_flags & FOLL_DUMP) &&
1522                                              is_zero_pfn(pte_pfn(*pte)))
1523                                                 page = pte_page(*pte);
1524                                         else {
1525                                                 pte_unmap(pte);
1526                                                 return i ? : -EFAULT;
1527                                         }
1528                                 }
1529                                 pages[i] = page;
1530                                 get_page(page);
1531                         }
1532                         pte_unmap(pte);
1533                         if (vmas)
1534                                 vmas[i] = gate_vma;
1535                         i++;
1536                         start += PAGE_SIZE;
1537                         nr_pages--;
1538                         continue;
1539                 }
1540
1541                 if (!vma ||
1542                     (vma->vm_flags & (VM_IO | VM_PFNMAP)) ||
1543                     !(vm_flags & vma->vm_flags))
1544                         return i ? : -EFAULT;
1545
1546                 if (is_vm_hugetlb_page(vma)) {
1547                         i = follow_hugetlb_page(mm, vma, pages, vmas,
1548                                         &start, &nr_pages, i, gup_flags);
1549                         continue;
1550                 }
1551
1552                 do {
1553                         struct page *page;
1554                         unsigned int foll_flags = gup_flags;
1555
1556                         /*
1557                          * If we have a pending SIGKILL, don't keep faulting
1558                          * pages and potentially allocating memory.
1559                          */
1560                         if (unlikely(fatal_signal_pending(current)))
1561                                 return i ? i : -ERESTARTSYS;
1562
1563                         cond_resched();
1564                         while (!(page = follow_page(vma, start, foll_flags))) {
1565                                 int ret;
1566                                 unsigned int fault_flags = 0;
1567
1568                                 if (foll_flags & FOLL_WRITE)
1569                                         fault_flags |= FAULT_FLAG_WRITE;
1570                                 if (nonblocking)
1571                                         fault_flags |= FAULT_FLAG_ALLOW_RETRY;
1572
1573                                 ret = handle_mm_fault(mm, vma, start,
1574                                                         fault_flags);
1575
1576                                 if (ret & VM_FAULT_ERROR) {
1577                                         if (ret & VM_FAULT_OOM)
1578                                                 return i ? i : -ENOMEM;
1579                                         if (ret &
1580                                             (VM_FAULT_HWPOISON|VM_FAULT_HWPOISON_LARGE|
1581                                              VM_FAULT_SIGBUS))
1582                                                 return i ? i : -EFAULT;
1583                                         BUG();
1584                                 }
1585                                 if (ret & VM_FAULT_MAJOR)
1586                                         tsk->maj_flt++;
1587                                 else
1588                                         tsk->min_flt++;
1589
1590                                 if (ret & VM_FAULT_RETRY) {
1591                                         *nonblocking = 0;
1592                                         return i;
1593                                 }
1594
1595                                 /*
1596                                  * The VM_FAULT_WRITE bit tells us that
1597                                  * do_wp_page has broken COW when necessary,
1598                                  * even if maybe_mkwrite decided not to set
1599                                  * pte_write. We can thus safely do subsequent
1600                                  * page lookups as if they were reads. But only
1601                                  * do so when looping for pte_write is futile:
1602                                  * in some cases userspace may also be wanting
1603                                  * to write to the gotten user page, which a
1604                                  * read fault here might prevent (a readonly
1605                                  * page might get reCOWed by userspace write).
1606                                  */
1607                                 if ((ret & VM_FAULT_WRITE) &&
1608                                     !(vma->vm_flags & VM_WRITE))
1609                                         foll_flags &= ~FOLL_WRITE;
1610
1611                                 cond_resched();
1612                         }
1613                         if (IS_ERR(page))
1614                                 return i ? i : PTR_ERR(page);
1615                         if (pages) {
1616                                 pages[i] = page;
1617
1618                                 flush_anon_page(vma, page, start);
1619                                 flush_dcache_page(page);
1620                         }
1621                         if (vmas)
1622                                 vmas[i] = vma;
1623                         i++;
1624                         start += PAGE_SIZE;
1625                         nr_pages--;
1626                 } while (nr_pages && start < vma->vm_end);
1627         } while (nr_pages);
1628         return i;
1629 }
1630 EXPORT_SYMBOL(__get_user_pages);
1631
1632 /**
1633  * get_user_pages() - pin user pages in memory
1634  * @tsk:        task_struct of target task
1635  * @mm:         mm_struct of target mm
1636  * @start:      starting user address
1637  * @nr_pages:   number of pages from start to pin
1638  * @write:      whether pages will be written to by the caller
1639  * @force:      whether to force write access even if user mapping is
1640  *              readonly. This will result in the page being COWed even
1641  *              in MAP_SHARED mappings. You do not want this.
1642  * @pages:      array that receives pointers to the pages pinned.
1643  *              Should be at least nr_pages long. Or NULL, if caller
1644  *              only intends to ensure the pages are faulted in.
1645  * @vmas:       array of pointers to vmas corresponding to each page.
1646  *              Or NULL if the caller does not require them.
1647  *
1648  * Returns number of pages pinned. This may be fewer than the number
1649  * requested. If nr_pages is 0 or negative, returns 0. If no pages
1650  * were pinned, returns -errno. Each page returned must be released
1651  * with a put_page() call when it is finished with. vmas will only
1652  * remain valid while mmap_sem is held.
1653  *
1654  * Must be called with mmap_sem held for read or write.
1655  *
1656  * get_user_pages walks a process's page tables and takes a reference to
1657  * each struct page that each user address corresponds to at a given
1658  * instant. That is, it takes the page that would be accessed if a user
1659  * thread accesses the given user virtual address at that instant.
1660  *
1661  * This does not guarantee that the page exists in the user mappings when
1662  * get_user_pages returns, and there may even be a completely different
1663  * page there in some cases (eg. if mmapped pagecache has been invalidated
1664  * and subsequently re faulted). However it does guarantee that the page
1665  * won't be freed completely. And mostly callers simply care that the page
1666  * contains data that was valid *at some point in time*. Typically, an IO
1667  * or similar operation cannot guarantee anything stronger anyway because
1668  * locks can't be held over the syscall boundary.
1669  *
1670  * If write=0, the page must not be written to. If the page is written to,
1671  * set_page_dirty (or set_page_dirty_lock, as appropriate) must be called
1672  * after the page is finished with, and before put_page is called.
1673  *
1674  * get_user_pages is typically used for fewer-copy IO operations, to get a
1675  * handle on the memory by some means other than accesses via the user virtual
1676  * addresses. The pages may be submitted for DMA to devices or accessed via
1677  * their kernel linear mapping (via the kmap APIs). Care should be taken to
1678  * use the correct cache flushing APIs.
1679  *
1680  * See also get_user_pages_fast, for performance critical applications.
1681  */
1682 int get_user_pages(struct task_struct *tsk, struct mm_struct *mm,
1683                 unsigned long start, int nr_pages, int write, int force,
1684                 struct page **pages, struct vm_area_struct **vmas)
1685 {
1686         int flags = FOLL_TOUCH;
1687
1688         if (pages)
1689                 flags |= FOLL_GET;
1690         if (write)
1691                 flags |= FOLL_WRITE;
1692         if (force)
1693                 flags |= FOLL_FORCE;
1694
1695         return __get_user_pages(tsk, mm, start, nr_pages, flags, pages, vmas,
1696                                 NULL);
1697 }
1698 EXPORT_SYMBOL(get_user_pages);
1699
1700 /**
1701  * get_dump_page() - pin user page in memory while writing it to core dump
1702  * @addr: user address
1703  *
1704  * Returns struct page pointer of user page pinned for dump,
1705  * to be freed afterwards by page_cache_release() or put_page().
1706  *
1707  * Returns NULL on any kind of failure - a hole must then be inserted into
1708  * the corefile, to preserve alignment with its headers; and also returns
1709  * NULL wherever the ZERO_PAGE, or an anonymous pte_none, has been found -
1710  * allowing a hole to be left in the corefile to save diskspace.
1711  *
1712  * Called without mmap_sem, but after all other threads have been killed.
1713  */
1714 #ifdef CONFIG_ELF_CORE
1715 struct page *get_dump_page(unsigned long addr)
1716 {
1717         struct vm_area_struct *vma;
1718         struct page *page;
1719
1720         if (__get_user_pages(current, current->mm, addr, 1,
1721                              FOLL_FORCE | FOLL_DUMP | FOLL_GET, &page, &vma,
1722                              NULL) < 1)
1723                 return NULL;
1724         flush_cache_page(vma, addr, page_to_pfn(page));
1725         return page;
1726 }
1727 #endif /* CONFIG_ELF_CORE */
1728
1729 pte_t *__get_locked_pte(struct mm_struct *mm, unsigned long addr,
1730                         spinlock_t **ptl)
1731 {
1732         pgd_t * pgd = pgd_offset(mm, addr);
1733         pud_t * pud = pud_alloc(mm, pgd, addr);
1734         if (pud) {
1735                 pmd_t * pmd = pmd_alloc(mm, pud, addr);
1736                 if (pmd) {
1737                         VM_BUG_ON(pmd_trans_huge(*pmd));
1738                         return pte_alloc_map_lock(mm, pmd, addr, ptl);
1739                 }
1740         }
1741         return NULL;
1742 }
1743
1744 /*
1745  * This is the old fallback for page remapping.
1746  *
1747  * For historical reasons, it only allows reserved pages. Only
1748  * old drivers should use this, and they needed to mark their
1749  * pages reserved for the old functions anyway.
1750  */
1751 static int insert_page(struct vm_area_struct *vma, unsigned long addr,
1752                         struct page *page, pgprot_t prot)
1753 {
1754         struct mm_struct *mm = vma->vm_mm;
1755         int retval;
1756         pte_t *pte;
1757         spinlock_t *ptl;
1758
1759         retval = -EINVAL;
1760         if (PageAnon(page))
1761                 goto out;
1762         retval = -ENOMEM;
1763         flush_dcache_page(page);
1764         pte = get_locked_pte(mm, addr, &ptl);
1765         if (!pte)
1766                 goto out;
1767         retval = -EBUSY;
1768         if (!pte_none(*pte))
1769                 goto out_unlock;
1770
1771         /* Ok, finally just insert the thing.. */
1772         get_page(page);
1773         inc_mm_counter_fast(mm, MM_FILEPAGES);
1774         page_add_file_rmap(page);
1775         set_pte_at(mm, addr, pte, mk_pte(page, prot));
1776
1777         retval = 0;
1778         pte_unmap_unlock(pte, ptl);
1779         return retval;
1780 out_unlock:
1781         pte_unmap_unlock(pte, ptl);
1782 out:
1783         return retval;
1784 }
1785
1786 /**
1787  * vm_insert_page - insert single page into user vma
1788  * @vma: user vma to map to
1789  * @addr: target user address of this page
1790  * @page: source kernel page
1791  *
1792  * This allows drivers to insert individual pages they've allocated
1793  * into a user vma.
1794  *
1795  * The page has to be a nice clean _individual_ kernel allocation.
1796  * If you allocate a compound page, you need to have marked it as
1797  * such (__GFP_COMP), or manually just split the page up yourself
1798  * (see split_page()).
1799  *
1800  * NOTE! Traditionally this was done with "remap_pfn_range()" which
1801  * took an arbitrary page protection parameter. This doesn't allow
1802  * that. Your vma protection will have to be set up correctly, which
1803  * means that if you want a shared writable mapping, you'd better
1804  * ask for a shared writable mapping!
1805  *
1806  * The page does not need to be reserved.
1807  */
1808 int vm_insert_page(struct vm_area_struct *vma, unsigned long addr,
1809                         struct page *page)
1810 {
1811         if (addr < vma->vm_start || addr >= vma->vm_end)
1812                 return -EFAULT;
1813         if (!page_count(page))
1814                 return -EINVAL;
1815         vma->vm_flags |= VM_INSERTPAGE;
1816         return insert_page(vma, addr, page, vma->vm_page_prot);
1817 }
1818 EXPORT_SYMBOL(vm_insert_page);
1819
1820 static int insert_pfn(struct vm_area_struct *vma, unsigned long addr,
1821                         unsigned long pfn, pgprot_t prot)
1822 {
1823         struct mm_struct *mm = vma->vm_mm;
1824         int retval;
1825         pte_t *pte, entry;
1826         spinlock_t *ptl;
1827
1828         retval = -ENOMEM;
1829         pte = get_locked_pte(mm, addr, &ptl);
1830         if (!pte)
1831                 goto out;
1832         retval = -EBUSY;
1833         if (!pte_none(*pte))
1834                 goto out_unlock;
1835
1836         /* Ok, finally just insert the thing.. */
1837         entry = pte_mkspecial(pfn_pte(pfn, prot));
1838         set_pte_at(mm, addr, pte, entry);
1839         update_mmu_cache(vma, addr, pte); /* XXX: why not for insert_page? */
1840
1841         retval = 0;
1842 out_unlock:
1843         pte_unmap_unlock(pte, ptl);
1844 out:
1845         return retval;
1846 }
1847
1848 /**
1849  * vm_insert_pfn - insert single pfn into user vma
1850  * @vma: user vma to map to
1851  * @addr: target user address of this page
1852  * @pfn: source kernel pfn
1853  *
1854  * Similar to vm_inert_page, this allows drivers to insert individual pages
1855  * they've allocated into a user vma. Same comments apply.
1856  *
1857  * This function should only be called from a vm_ops->fault handler, and
1858  * in that case the handler should return NULL.
1859  *
1860  * vma cannot be a COW mapping.
1861  *
1862  * As this is called only for pages that do not currently exist, we
1863  * do not need to flush old virtual caches or the TLB.
1864  */
1865 int vm_insert_pfn(struct vm_area_struct *vma, unsigned long addr,
1866                         unsigned long pfn)
1867 {
1868         int ret;
1869         pgprot_t pgprot = vma->vm_page_prot;
1870         /*
1871          * Technically, architectures with pte_special can avoid all these
1872          * restrictions (same for remap_pfn_range).  However we would like
1873          * consistency in testing and feature parity among all, so we should
1874          * try to keep these invariants in place for everybody.
1875          */
1876         BUG_ON(!(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP)));
1877         BUG_ON((vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP)) ==
1878                                                 (VM_PFNMAP|VM_MIXEDMAP));
1879         BUG_ON((vma->vm_flags & VM_PFNMAP) && is_cow_mapping(vma->vm_flags));
1880         BUG_ON((vma->vm_flags & VM_MIXEDMAP) && pfn_valid(pfn));
1881
1882         if (addr < vma->vm_start || addr >= vma->vm_end)
1883                 return -EFAULT;
1884         if (track_pfn_vma_new(vma, &pgprot, pfn, PAGE_SIZE))
1885                 return -EINVAL;
1886
1887         ret = insert_pfn(vma, addr, pfn, pgprot);
1888
1889         if (ret)
1890                 untrack_pfn_vma(vma, pfn, PAGE_SIZE);
1891
1892         return ret;
1893 }
1894 EXPORT_SYMBOL(vm_insert_pfn);
1895
1896 int vm_insert_mixed(struct vm_area_struct *vma, unsigned long addr,
1897                         unsigned long pfn)
1898 {
1899         BUG_ON(!(vma->vm_flags & VM_MIXEDMAP));
1900
1901         if (addr < vma->vm_start || addr >= vma->vm_end)
1902                 return -EFAULT;
1903
1904         /*
1905          * If we don't have pte special, then we have to use the pfn_valid()
1906          * based VM_MIXEDMAP scheme (see vm_normal_page), and thus we *must*
1907          * refcount the page if pfn_valid is true (hence insert_page rather
1908          * than insert_pfn).  If a zero_pfn were inserted into a VM_MIXEDMAP
1909          * without pte special, it would there be refcounted as a normal page.
1910          */
1911         if (!HAVE_PTE_SPECIAL && pfn_valid(pfn)) {
1912                 struct page *page;
1913
1914                 page = pfn_to_page(pfn);
1915                 return insert_page(vma, addr, page, vma->vm_page_prot);
1916         }
1917         return insert_pfn(vma, addr, pfn, vma->vm_page_prot);
1918 }
1919 EXPORT_SYMBOL(vm_insert_mixed);
1920
1921 /*
1922  * maps a range of physical memory into the requested pages. the old
1923  * mappings are removed. any references to nonexistent pages results
1924  * in null mappings (currently treated as "copy-on-access")
1925  */
1926 static int remap_pte_range(struct mm_struct *mm, pmd_t *pmd,
1927                         unsigned long addr, unsigned long end,
1928                         unsigned long pfn, pgprot_t prot)
1929 {
1930         pte_t *pte;
1931         spinlock_t *ptl;
1932
1933         pte = pte_alloc_map_lock(mm, pmd, addr, &ptl);
1934         if (!pte)
1935                 return -ENOMEM;
1936         arch_enter_lazy_mmu_mode();
1937         do {
1938                 BUG_ON(!pte_none(*pte));
1939                 set_pte_at(mm, addr, pte, pte_mkspecial(pfn_pte(pfn, prot)));
1940                 pfn++;
1941         } while (pte++, addr += PAGE_SIZE, addr != end);
1942         arch_leave_lazy_mmu_mode();
1943         pte_unmap_unlock(pte - 1, ptl);
1944         return 0;
1945 }
1946
1947 static inline int remap_pmd_range(struct mm_struct *mm, pud_t *pud,
1948                         unsigned long addr, unsigned long end,
1949                         unsigned long pfn, pgprot_t prot)
1950 {
1951         pmd_t *pmd;
1952         unsigned long next;
1953
1954         pfn -= addr >> PAGE_SHIFT;
1955         pmd = pmd_alloc(mm, pud, addr);
1956         if (!pmd)
1957                 return -ENOMEM;
1958         VM_BUG_ON(pmd_trans_huge(*pmd));
1959         do {
1960                 next = pmd_addr_end(addr, end);
1961                 if (remap_pte_range(mm, pmd, addr, next,
1962                                 pfn + (addr >> PAGE_SHIFT), prot))
1963                         return -ENOMEM;
1964         } while (pmd++, addr = next, addr != end);
1965         return 0;
1966 }
1967
1968 static inline int remap_pud_range(struct mm_struct *mm, pgd_t *pgd,
1969                         unsigned long addr, unsigned long end,
1970                         unsigned long pfn, pgprot_t prot)
1971 {
1972         pud_t *pud;
1973         unsigned long next;
1974
1975         pfn -= addr >> PAGE_SHIFT;
1976         pud = pud_alloc(mm, pgd, addr);
1977         if (!pud)
1978                 return -ENOMEM;
1979         do {
1980                 next = pud_addr_end(addr, end);
1981                 if (remap_pmd_range(mm, pud, addr, next,
1982                                 pfn + (addr >> PAGE_SHIFT), prot))
1983                         return -ENOMEM;
1984         } while (pud++, addr = next, addr != end);
1985         return 0;
1986 }
1987
1988 /**
1989  * remap_pfn_range - remap kernel memory to userspace
1990  * @vma: user vma to map to
1991  * @addr: target user address to start at
1992  * @pfn: physical address of kernel memory
1993  * @size: size of map area
1994  * @prot: page protection flags for this mapping
1995  *
1996  *  Note: this is only safe if the mm semaphore is held when called.
1997  */
1998 int remap_pfn_range(struct vm_area_struct *vma, unsigned long addr,
1999                     unsigned long pfn, unsigned long size, pgprot_t prot)
2000 {
2001         pgd_t *pgd;
2002         unsigned long next;
2003         unsigned long end = addr + PAGE_ALIGN(size);
2004         struct mm_struct *mm = vma->vm_mm;
2005         int err;
2006
2007         /*
2008          * Physically remapped pages are special. Tell the
2009          * rest of the world about it:
2010          *   VM_IO tells people not to look at these pages
2011          *      (accesses can have side effects).
2012          *   VM_RESERVED is specified all over the place, because
2013          *      in 2.4 it kept swapout's vma scan off this vma; but
2014          *      in 2.6 the LRU scan won't even find its pages, so this
2015          *      flag means no more than count its pages in reserved_vm,
2016          *      and omit it from core dump, even when VM_IO turned off.
2017          *   VM_PFNMAP tells the core MM that the base pages are just
2018          *      raw PFN mappings, and do not have a "struct page" associated
2019          *      with them.
2020          *
2021          * There's a horrible special case to handle copy-on-write
2022          * behaviour that some programs depend on. We mark the "original"
2023          * un-COW'ed pages by matching them up with "vma->vm_pgoff".
2024          */
2025         if (addr == vma->vm_start && end == vma->vm_end) {
2026                 vma->vm_pgoff = pfn;
2027                 vma->vm_flags |= VM_PFN_AT_MMAP;
2028         } else if (is_cow_mapping(vma->vm_flags))
2029                 return -EINVAL;
2030
2031         vma->vm_flags |= VM_IO | VM_RESERVED | VM_PFNMAP;
2032
2033         err = track_pfn_vma_new(vma, &prot, pfn, PAGE_ALIGN(size));
2034         if (err) {
2035                 /*
2036                  * To indicate that track_pfn related cleanup is not
2037                  * needed from higher level routine calling unmap_vmas
2038                  */
2039                 vma->vm_flags &= ~(VM_IO | VM_RESERVED | VM_PFNMAP);
2040                 vma->vm_flags &= ~VM_PFN_AT_MMAP;
2041                 return -EINVAL;
2042         }
2043
2044         BUG_ON(addr >= end);
2045         pfn -= addr >> PAGE_SHIFT;
2046         pgd = pgd_offset(mm, addr);
2047         flush_cache_range(vma, addr, end);
2048         do {
2049                 next = pgd_addr_end(addr, end);
2050                 err = remap_pud_range(mm, pgd, addr, next,
2051                                 pfn + (addr >> PAGE_SHIFT), prot);
2052                 if (err)
2053                         break;
2054         } while (pgd++, addr = next, addr != end);
2055
2056         if (err)
2057                 untrack_pfn_vma(vma, pfn, PAGE_ALIGN(size));
2058
2059         return err;
2060 }
2061 EXPORT_SYMBOL(remap_pfn_range);
2062
2063 static int apply_to_pte_range(struct mm_struct *mm, pmd_t *pmd,
2064                                      unsigned long addr, unsigned long end,
2065                                      pte_fn_t fn, void *data)
2066 {
2067         pte_t *pte;
2068         int err;
2069         pgtable_t token;
2070         spinlock_t *uninitialized_var(ptl);
2071
2072         pte = (mm == &init_mm) ?
2073                 pte_alloc_kernel(pmd, addr) :
2074                 pte_alloc_map_lock(mm, pmd, addr, &ptl);
2075         if (!pte)
2076                 return -ENOMEM;
2077
2078         BUG_ON(pmd_huge(*pmd));
2079
2080         arch_enter_lazy_mmu_mode();
2081
2082         token = pmd_pgtable(*pmd);
2083
2084         do {
2085                 err = fn(pte++, token, addr, data);
2086                 if (err)
2087                         break;
2088         } while (addr += PAGE_SIZE, addr != end);
2089
2090         arch_leave_lazy_mmu_mode();
2091
2092         if (mm != &init_mm)
2093                 pte_unmap_unlock(pte-1, ptl);
2094         return err;
2095 }
2096
2097 static int apply_to_pmd_range(struct mm_struct *mm, pud_t *pud,
2098                                      unsigned long addr, unsigned long end,
2099                                      pte_fn_t fn, void *data)
2100 {
2101         pmd_t *pmd;
2102         unsigned long next;
2103         int err;
2104
2105         BUG_ON(pud_huge(*pud));
2106
2107         pmd = pmd_alloc(mm, pud, addr);
2108         if (!pmd)
2109                 return -ENOMEM;
2110         do {
2111                 next = pmd_addr_end(addr, end);
2112                 err = apply_to_pte_range(mm, pmd, addr, next, fn, data);
2113                 if (err)
2114                         break;
2115         } while (pmd++, addr = next, addr != end);
2116         return err;
2117 }
2118
2119 static int apply_to_pud_range(struct mm_struct *mm, pgd_t *pgd,
2120                                      unsigned long addr, unsigned long end,
2121                                      pte_fn_t fn, void *data)
2122 {
2123         pud_t *pud;
2124         unsigned long next;
2125         int err;
2126
2127         pud = pud_alloc(mm, pgd, addr);
2128         if (!pud)
2129                 return -ENOMEM;
2130         do {
2131                 next = pud_addr_end(addr, end);
2132                 err = apply_to_pmd_range(mm, pud, addr, next, fn, data);
2133                 if (err)
2134                         break;
2135         } while (pud++, addr = next, addr != end);
2136         return err;
2137 }
2138
2139 /*
2140  * Scan a region of virtual memory, filling in page tables as necessary
2141  * and calling a provided function on each leaf page table.
2142  */
2143 int apply_to_page_range(struct mm_struct *mm, unsigned long addr,
2144                         unsigned long size, pte_fn_t fn, void *data)
2145 {
2146         pgd_t *pgd;
2147         unsigned long next;
2148         unsigned long end = addr + size;
2149         int err;
2150
2151         BUG_ON(addr >= end);
2152         pgd = pgd_offset(mm, addr);
2153         do {
2154                 next = pgd_addr_end(addr, end);
2155                 err = apply_to_pud_range(mm, pgd, addr, next, fn, data);
2156                 if (err)
2157                         break;
2158         } while (pgd++, addr = next, addr != end);
2159
2160         return err;
2161 }
2162 EXPORT_SYMBOL_GPL(apply_to_page_range);
2163
2164 /*
2165  * handle_pte_fault chooses page fault handler according to an entry
2166  * which was read non-atomically.  Before making any commitment, on
2167  * those architectures or configurations (e.g. i386 with PAE) which
2168  * might give a mix of unmatched parts, do_swap_page and do_file_page
2169  * must check under lock before unmapping the pte and proceeding
2170  * (but do_wp_page is only called after already making such a check;
2171  * and do_anonymous_page and do_no_page can safely check later on).
2172  */
2173 static inline int pte_unmap_same(struct mm_struct *mm, pmd_t *pmd,
2174                                 pte_t *page_table, pte_t orig_pte)
2175 {
2176         int same = 1;
2177 #if defined(CONFIG_SMP) || defined(CONFIG_PREEMPT)
2178         if (sizeof(pte_t) > sizeof(unsigned long)) {
2179                 spinlock_t *ptl = pte_lockptr(mm, pmd);
2180                 spin_lock(ptl);
2181                 same = pte_same(*page_table, orig_pte);
2182                 spin_unlock(ptl);
2183         }
2184 #endif
2185         pte_unmap(page_table);
2186         return same;
2187 }
2188
2189 static inline void cow_user_page(struct page *dst, struct page *src, unsigned long va, struct vm_area_struct *vma)
2190 {
2191         /*
2192          * If the source page was a PFN mapping, we don't have
2193          * a "struct page" for it. We do a best-effort copy by
2194          * just copying from the original user address. If that
2195          * fails, we just zero-fill it. Live with it.
2196          */
2197         if (unlikely(!src)) {
2198                 void *kaddr = kmap_atomic(dst, KM_USER0);
2199                 void __user *uaddr = (void __user *)(va & PAGE_MASK);
2200
2201                 /*
2202                  * This really shouldn't fail, because the page is there
2203                  * in the page tables. But it might just be unreadable,
2204                  * in which case we just give up and fill the result with
2205                  * zeroes.
2206                  */
2207                 if (__copy_from_user_inatomic(kaddr, uaddr, PAGE_SIZE))
2208                         clear_page(kaddr);
2209                 kunmap_atomic(kaddr, KM_USER0);
2210                 flush_dcache_page(dst);
2211         } else
2212                 copy_user_highpage(dst, src, va, vma);
2213 }
2214
2215 /*
2216  * This routine handles present pages, when users try to write
2217  * to a shared page. It is done by copying the page to a new address
2218  * and decrementing the shared-page counter for the old page.
2219  *
2220  * Note that this routine assumes that the protection checks have been
2221  * done by the caller (the low-level page fault routine in most cases).
2222  * Thus we can safely just mark it writable once we've done any necessary
2223  * COW.
2224  *
2225  * We also mark the page dirty at this point even though the page will
2226  * change only once the write actually happens. This avoids a few races,
2227  * and potentially makes it more efficient.
2228  *
2229  * We enter with non-exclusive mmap_sem (to exclude vma changes,
2230  * but allow concurrent faults), with pte both mapped and locked.
2231  * We return with mmap_sem still held, but pte unmapped and unlocked.
2232  */
2233 static int do_wp_page(struct mm_struct *mm, struct vm_area_struct *vma,
2234                 unsigned long address, pte_t *page_table, pmd_t *pmd,
2235                 spinlock_t *ptl, pte_t orig_pte)
2236         __releases(ptl)
2237 {
2238         struct page *old_page, *new_page;
2239         pte_t entry;
2240         int ret = 0;
2241         int page_mkwrite = 0;
2242         struct page *dirty_page = NULL;
2243
2244         old_page = vm_normal_page(vma, address, orig_pte);
2245         if (!old_page) {
2246                 /*
2247                  * VM_MIXEDMAP !pfn_valid() case
2248                  *
2249                  * We should not cow pages in a shared writeable mapping.
2250                  * Just mark the pages writable as we can't do any dirty
2251                  * accounting on raw pfn maps.
2252                  */
2253                 if ((vma->vm_flags & (VM_WRITE|VM_SHARED)) ==
2254                                      (VM_WRITE|VM_SHARED))
2255                         goto reuse;
2256                 goto gotten;
2257         }
2258
2259         /*
2260          * Take out anonymous pages first, anonymous shared vmas are
2261          * not dirty accountable.
2262          */
2263         if (PageAnon(old_page) && !PageKsm(old_page)) {
2264                 if (!trylock_page(old_page)) {
2265                         page_cache_get(old_page);
2266                         pte_unmap_unlock(page_table, ptl);
2267                         lock_page(old_page);
2268                         page_table = pte_offset_map_lock(mm, pmd, address,
2269                                                          &ptl);
2270                         if (!pte_same(*page_table, orig_pte)) {
2271                                 unlock_page(old_page);
2272                                 goto unlock;
2273                         }
2274                         page_cache_release(old_page);
2275                 }
2276                 if (reuse_swap_page(old_page)) {
2277                         /*
2278                          * The page is all ours.  Move it to our anon_vma so
2279                          * the rmap code will not search our parent or siblings.
2280                          * Protected against the rmap code by the page lock.
2281                          */
2282                         page_move_anon_rmap(old_page, vma, address);
2283                         unlock_page(old_page);
2284                         goto reuse;
2285                 }
2286                 unlock_page(old_page);
2287         } else if (unlikely((vma->vm_flags & (VM_WRITE|VM_SHARED)) ==
2288                                         (VM_WRITE|VM_SHARED))) {
2289                 /*
2290                  * Only catch write-faults on shared writable pages,
2291                  * read-only shared pages can get COWed by
2292                  * get_user_pages(.write=1, .force=1).
2293                  */
2294                 if (vma->vm_ops && vma->vm_ops->page_mkwrite) {
2295                         struct vm_fault vmf;
2296                         int tmp;
2297
2298                         vmf.virtual_address = (void __user *)(address &
2299                                                                 PAGE_MASK);
2300                         vmf.pgoff = old_page->index;
2301                         vmf.flags = FAULT_FLAG_WRITE|FAULT_FLAG_MKWRITE;
2302                         vmf.page = old_page;
2303
2304                         /*
2305                          * Notify the address space that the page is about to
2306                          * become writable so that it can prohibit this or wait
2307                          * for the page to get into an appropriate state.
2308                          *
2309                          * We do this without the lock held, so that it can
2310                          * sleep if it needs to.
2311                          */
2312                         page_cache_get(old_page);
2313                         pte_unmap_unlock(page_table, ptl);
2314
2315                         tmp = vma->vm_ops->page_mkwrite(vma, &vmf);
2316                         if (unlikely(tmp &
2317                                         (VM_FAULT_ERROR | VM_FAULT_NOPAGE))) {
2318                                 ret = tmp;
2319                                 goto unwritable_page;
2320                         }
2321                         if (unlikely(!(tmp & VM_FAULT_LOCKED))) {
2322                                 lock_page(old_page);
2323                                 if (!old_page->mapping) {
2324                                         ret = 0; /* retry the fault */
2325                                         unlock_page(old_page);
2326                                         goto unwritable_page;
2327                                 }
2328                         } else
2329                                 VM_BUG_ON(!PageLocked(old_page));
2330
2331                         /*
2332                          * Since we dropped the lock we need to revalidate
2333                          * the PTE as someone else may have changed it.  If
2334                          * they did, we just return, as we can count on the
2335                          * MMU to tell us if they didn't also make it writable.
2336                          */
2337                         page_table = pte_offset_map_lock(mm, pmd, address,
2338                                                          &ptl);
2339                         if (!pte_same(*page_table, orig_pte)) {
2340                                 unlock_page(old_page);
2341                                 goto unlock;
2342                         }
2343
2344                         page_mkwrite = 1;
2345                 }
2346                 dirty_page = old_page;
2347                 get_page(dirty_page);
2348
2349 reuse:
2350                 flush_cache_page(vma, address, pte_pfn(orig_pte));
2351                 entry = pte_mkyoung(orig_pte);
2352                 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
2353                 if (ptep_set_access_flags(vma, address, page_table, entry,1))
2354                         update_mmu_cache(vma, address, page_table);
2355                 pte_unmap_unlock(page_table, ptl);
2356                 ret |= VM_FAULT_WRITE;
2357
2358                 if (!dirty_page)
2359                         return ret;
2360
2361                 /*
2362                  * Yes, Virginia, this is actually required to prevent a race
2363                  * with clear_page_dirty_for_io() from clearing the page dirty
2364                  * bit after it clear all dirty ptes, but before a racing
2365                  * do_wp_page installs a dirty pte.
2366                  *
2367                  * do_no_page is protected similarly.
2368                  */
2369                 if (!page_mkwrite) {
2370                         wait_on_page_locked(dirty_page);
2371                         set_page_dirty_balance(dirty_page, page_mkwrite);
2372                 }
2373                 put_page(dirty_page);
2374                 if (page_mkwrite) {
2375                         struct address_space *mapping = dirty_page->mapping;
2376
2377                         set_page_dirty(dirty_page);
2378                         unlock_page(dirty_page);
2379                         page_cache_release(dirty_page);
2380                         if (mapping)    {
2381                                 /*
2382                                  * Some device drivers do not set page.mapping
2383                                  * but still dirty their pages
2384                                  */
2385                                 balance_dirty_pages_ratelimited(mapping);
2386                         }
2387                 }
2388
2389                 /* file_update_time outside page_lock */
2390                 if (vma->vm_file)
2391                         file_update_time(vma->vm_file);
2392
2393                 return ret;
2394         }
2395
2396         /*
2397          * Ok, we need to copy. Oh, well..
2398          */
2399         page_cache_get(old_page);
2400 gotten:
2401         pte_unmap_unlock(page_table, ptl);
2402
2403         if (unlikely(anon_vma_prepare(vma)))
2404                 goto oom;
2405
2406         if (is_zero_pfn(pte_pfn(orig_pte))) {
2407                 new_page = alloc_zeroed_user_highpage_movable(vma, address);
2408                 if (!new_page)
2409                         goto oom;
2410         } else {
2411                 new_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, address);
2412                 if (!new_page)
2413                         goto oom;
2414                 cow_user_page(new_page, old_page, address, vma);
2415         }
2416         __SetPageUptodate(new_page);
2417
2418         if (mem_cgroup_newpage_charge(new_page, mm, GFP_KERNEL))
2419                 goto oom_free_new;
2420
2421         /*
2422          * Re-check the pte - we dropped the lock
2423          */
2424         page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
2425         if (likely(pte_same(*page_table, orig_pte))) {
2426                 if (old_page) {
2427                         if (!PageAnon(old_page)) {
2428                                 dec_mm_counter_fast(mm, MM_FILEPAGES);
2429                                 inc_mm_counter_fast(mm, MM_ANONPAGES);
2430                         }
2431                 } else
2432                         inc_mm_counter_fast(mm, MM_ANONPAGES);
2433                 flush_cache_page(vma, address, pte_pfn(orig_pte));
2434                 entry = mk_pte(new_page, vma->vm_page_prot);
2435                 entry = maybe_mkwrite(pte_mkdirty(entry), vma);
2436                 /*
2437                  * Clear the pte entry and flush it first, before updating the
2438                  * pte with the new entry. This will avoid a race condition
2439                  * seen in the presence of one thread doing SMC and another
2440                  * thread doing COW.
2441                  */
2442                 ptep_clear_flush(vma, address, page_table);
2443                 page_add_new_anon_rmap(new_page, vma, address);
2444                 /*
2445                  * We call the notify macro here because, when using secondary
2446                  * mmu page tables (such as kvm shadow page tables), we want the
2447                  * new page to be mapped directly into the secondary page table.
2448                  */
2449                 set_pte_at_notify(mm, address, page_table, entry);
2450                 update_mmu_cache(vma, address, page_table);
2451                 if (old_page) {
2452                         /*
2453                          * Only after switching the pte to the new page may
2454                          * we remove the mapcount here. Otherwise another
2455                          * process may come and find the rmap count decremented
2456                          * before the pte is switched to the new page, and
2457                          * "reuse" the old page writing into it while our pte
2458                          * here still points into it and can be read by other
2459                          * threads.
2460                          *
2461                          * The critical issue is to order this
2462                          * page_remove_rmap with the ptp_clear_flush above.
2463                          * Those stores are ordered by (if nothing else,)
2464                          * the barrier present in the atomic_add_negative
2465                          * in page_remove_rmap.
2466                          *
2467                          * Then the TLB flush in ptep_clear_flush ensures that
2468                          * no process can access the old page before the
2469                          * decremented mapcount is visible. And the old page
2470                          * cannot be reused until after the decremented
2471                          * mapcount is visible. So transitively, TLBs to
2472                          * old page will be flushed before it can be reused.
2473                          */
2474                         page_remove_rmap(old_page);
2475                 }
2476
2477                 /* Free the old page.. */
2478                 new_page = old_page;
2479                 ret |= VM_FAULT_WRITE;
2480         } else
2481                 mem_cgroup_uncharge_page(new_page);
2482
2483         if (new_page)
2484                 page_cache_release(new_page);
2485 unlock:
2486         pte_unmap_unlock(page_table, ptl);
2487         if (old_page) {
2488                 /*
2489                  * Don't let another task, with possibly unlocked vma,
2490                  * keep the mlocked page.
2491                  */
2492                 if ((ret & VM_FAULT_WRITE) && (vma->vm_flags & VM_LOCKED)) {
2493                         lock_page(old_page);    /* LRU manipulation */
2494                         munlock_vma_page(old_page);
2495                         unlock_page(old_page);
2496                 }
2497                 page_cache_release(old_page);
2498         }
2499         return ret;
2500 oom_free_new:
2501         page_cache_release(new_page);
2502 oom:
2503         if (old_page) {
2504                 if (page_mkwrite) {
2505                         unlock_page(old_page);
2506                         page_cache_release(old_page);
2507                 }
2508                 page_cache_release(old_page);
2509         }
2510         return VM_FAULT_OOM;
2511
2512 unwritable_page:
2513         page_cache_release(old_page);
2514         return ret;
2515 }
2516
2517 /*
2518  * Helper functions for unmap_mapping_range().
2519  *
2520  * __ Notes on dropping i_mmap_lock to reduce latency while unmapping __
2521  *
2522  * We have to restart searching the prio_tree whenever we drop the lock,
2523  * since the iterator is only valid while the lock is held, and anyway
2524  * a later vma might be split and reinserted earlier while lock dropped.
2525  *
2526  * The list of nonlinear vmas could be handled more efficiently, using
2527  * a placeholder, but handle it in the same way until a need is shown.
2528  * It is important to search the prio_tree before nonlinear list: a vma
2529  * may become nonlinear and be shifted from prio_tree to nonlinear list
2530  * while the lock is dropped; but never shifted from list to prio_tree.
2531  *
2532  * In order to make forward progress despite restarting the search,
2533  * vm_truncate_count is used to mark a vma as now dealt with, so we can
2534  * quickly skip it next time around.  Since the prio_tree search only
2535  * shows us those vmas affected by unmapping the range in question, we
2536  * can't efficiently keep all vmas in step with mapping->truncate_count:
2537  * so instead reset them all whenever it wraps back to 0 (then go to 1).
2538  * mapping->truncate_count and vma->vm_truncate_count are protected by
2539  * i_mmap_lock.
2540  *
2541  * In order to make forward progress despite repeatedly restarting some
2542  * large vma, note the restart_addr from unmap_vmas when it breaks out:
2543  * and restart from that address when we reach that vma again.  It might
2544  * have been split or merged, shrunk or extended, but never shifted: so
2545  * restart_addr remains valid so long as it remains in the vma's range.
2546  * unmap_mapping_range forces truncate_count to leap over page-aligned
2547  * values so we can save vma's restart_addr in its truncate_count field.
2548  */
2549 #define is_restart_addr(truncate_count) (!((truncate_count) & ~PAGE_MASK))
2550
2551 static void reset_vma_truncate_counts(struct address_space *mapping)
2552 {
2553         struct vm_area_struct *vma;
2554         struct prio_tree_iter iter;
2555
2556         vma_prio_tree_foreach(vma, &iter, &mapping->i_mmap, 0, ULONG_MAX)
2557                 vma->vm_truncate_count = 0;
2558         list_for_each_entry(vma, &mapping->i_mmap_nonlinear, shared.vm_set.list)
2559                 vma->vm_truncate_count = 0;
2560 }
2561
2562 static int unmap_mapping_range_vma(struct vm_area_struct *vma,
2563                 unsigned long start_addr, unsigned long end_addr,
2564                 struct zap_details *details)
2565 {
2566         unsigned long restart_addr;
2567         int need_break;
2568
2569         /*
2570          * files that support invalidating or truncating portions of the
2571          * file from under mmaped areas must have their ->fault function
2572          * return a locked page (and set VM_FAULT_LOCKED in the return).
2573          * This provides synchronisation against concurrent unmapping here.
2574          */
2575
2576 again:
2577         restart_addr = vma->vm_truncate_count;
2578         if (is_restart_addr(restart_addr) && start_addr < restart_addr) {
2579                 start_addr = restart_addr;
2580                 if (start_addr >= end_addr) {
2581                         /* Top of vma has been split off since last time */
2582                         vma->vm_truncate_count = details->truncate_count;
2583                         return 0;
2584                 }
2585         }
2586
2587         restart_addr = zap_page_range(vma, start_addr,
2588                                         end_addr - start_addr, details);
2589         need_break = need_resched() || spin_needbreak(details->i_mmap_lock);
2590
2591         if (restart_addr >= end_addr) {
2592                 /* We have now completed this vma: mark it so */
2593                 vma->vm_truncate_count = details->truncate_count;
2594                 if (!need_break)
2595                         return 0;
2596         } else {
2597                 /* Note restart_addr in vma's truncate_count field */
2598                 vma->vm_truncate_count = restart_addr;
2599                 if (!need_break)
2600                         goto again;
2601         }
2602
2603         spin_unlock(details->i_mmap_lock);
2604         cond_resched();
2605         spin_lock(details->i_mmap_lock);
2606         return -EINTR;
2607 }
2608
2609 static inline void unmap_mapping_range_tree(struct prio_tree_root *root,
2610                                             struct zap_details *details)
2611 {
2612         struct vm_area_struct *vma;
2613         struct prio_tree_iter iter;
2614         pgoff_t vba, vea, zba, zea;
2615
2616 restart:
2617         vma_prio_tree_foreach(vma, &iter, root,
2618                         details->first_index, details->last_index) {
2619                 /* Skip quickly over those we have already dealt with */
2620                 if (vma->vm_truncate_count == details->truncate_count)
2621                         continue;
2622
2623                 vba = vma->vm_pgoff;
2624                 vea = vba + ((vma->vm_end - vma->vm_start) >> PAGE_SHIFT) - 1;
2625                 /* Assume for now that PAGE_CACHE_SHIFT == PAGE_SHIFT */
2626                 zba = details->first_index;
2627                 if (zba < vba)
2628                         zba = vba;
2629                 zea = details->last_index;
2630                 if (zea > vea)
2631                         zea = vea;
2632
2633                 if (unmap_mapping_range_vma(vma,
2634                         ((zba - vba) << PAGE_SHIFT) + vma->vm_start,
2635                         ((zea - vba + 1) << PAGE_SHIFT) + vma->vm_start,
2636                                 details) < 0)
2637                         goto restart;
2638         }
2639 }
2640
2641 static inline void unmap_mapping_range_list(struct list_head *head,
2642                                             struct zap_details *details)
2643 {
2644         struct vm_area_struct *vma;
2645
2646         /*
2647          * In nonlinear VMAs there is no correspondence between virtual address
2648          * offset and file offset.  So we must perform an exhaustive search
2649          * across *all* the pages in each nonlinear VMA, not just the pages
2650          * whose virtual address lies outside the file truncation point.
2651          */
2652 restart:
2653         list_for_each_entry(vma, head, shared.vm_set.list) {
2654                 /* Skip quickly over those we have already dealt with */
2655                 if (vma->vm_truncate_count == details->truncate_count)
2656                         continue;
2657                 details->nonlinear_vma = vma;
2658                 if (unmap_mapping_range_vma(vma, vma->vm_start,
2659                                         vma->vm_end, details) < 0)
2660                         goto restart;
2661         }
2662 }
2663
2664 /**
2665  * unmap_mapping_range - unmap the portion of all mmaps in the specified address_space corresponding to the specified page range in the underlying file.
2666  * @mapping: the address space containing mmaps to be unmapped.
2667  * @holebegin: byte in first page to unmap, relative to the start of
2668  * the underlying file.  This will be rounded down to a PAGE_SIZE
2669  * boundary.  Note that this is different from truncate_pagecache(), which
2670  * must keep the partial page.  In contrast, we must get rid of
2671  * partial pages.
2672  * @holelen: size of prospective hole in bytes.  This will be rounded
2673  * up to a PAGE_SIZE boundary.  A holelen of zero truncates to the
2674  * end of the file.
2675  * @even_cows: 1 when truncating a file, unmap even private COWed pages;
2676  * but 0 when invalidating pagecache, don't throw away private data.
2677  */
2678 void unmap_mapping_range(struct address_space *mapping,
2679                 loff_t const holebegin, loff_t const holelen, int even_cows)
2680 {
2681         struct zap_details details;
2682         pgoff_t hba = holebegin >> PAGE_SHIFT;
2683         pgoff_t hlen = (holelen + PAGE_SIZE - 1) >> PAGE_SHIFT;
2684
2685         /* Check for overflow. */
2686         if (sizeof(holelen) > sizeof(hlen)) {
2687                 long long holeend =
2688                         (holebegin + holelen + PAGE_SIZE - 1) >> PAGE_SHIFT;
2689                 if (holeend & ~(long long)ULONG_MAX)
2690                         hlen = ULONG_MAX - hba + 1;
2691         }
2692
2693         details.check_mapping = even_cows? NULL: mapping;
2694         details.nonlinear_vma = NULL;
2695         details.first_index = hba;
2696         details.last_index = hba + hlen - 1;
2697         if (details.last_index < details.first_index)
2698                 details.last_index = ULONG_MAX;
2699         details.i_mmap_lock = &mapping->i_mmap_lock;
2700
2701         mutex_lock(&mapping->unmap_mutex);
2702         spin_lock(&mapping->i_mmap_lock);
2703
2704         /* Protect against endless unmapping loops */
2705         mapping->truncate_count++;
2706         if (unlikely(is_restart_addr(mapping->truncate_count))) {
2707                 if (mapping->truncate_count == 0)
2708                         reset_vma_truncate_counts(mapping);
2709                 mapping->truncate_count++;
2710         }
2711         details.truncate_count = mapping->truncate_count;
2712
2713         if (unlikely(!prio_tree_empty(&mapping->i_mmap)))
2714                 unmap_mapping_range_tree(&mapping->i_mmap, &details);
2715         if (unlikely(!list_empty(&mapping->i_mmap_nonlinear)))
2716                 unmap_mapping_range_list(&mapping->i_mmap_nonlinear, &details);
2717         spin_unlock(&mapping->i_mmap_lock);
2718         mutex_unlock(&mapping->unmap_mutex);
2719 }
2720 EXPORT_SYMBOL(unmap_mapping_range);
2721
2722 int vmtruncate_range(struct inode *inode, loff_t offset, loff_t end)
2723 {
2724         struct address_space *mapping = inode->i_mapping;
2725
2726         /*
2727          * If the underlying filesystem is not going to provide
2728          * a way to truncate a range of blocks (punch a hole) -
2729          * we should return failure right now.
2730          */
2731         if (!inode->i_op->truncate_range)
2732                 return -ENOSYS;
2733
2734         mutex_lock(&inode->i_mutex);
2735         down_write(&inode->i_alloc_sem);
2736         unmap_mapping_range(mapping, offset, (end - offset), 1);
2737         truncate_inode_pages_range(mapping, offset, end);
2738         unmap_mapping_range(mapping, offset, (end - offset), 1);
2739         inode->i_op->truncate_range(inode, offset, end);
2740         up_write(&inode->i_alloc_sem);
2741         mutex_unlock(&inode->i_mutex);
2742
2743         return 0;
2744 }
2745
2746 /*
2747  * We enter with non-exclusive mmap_sem (to exclude vma changes,
2748  * but allow concurrent faults), and pte mapped but not yet locked.
2749  * We return with mmap_sem still held, but pte unmapped and unlocked.
2750  */
2751 static int do_swap_page(struct mm_struct *mm, struct vm_area_struct *vma,
2752                 unsigned long address, pte_t *page_table, pmd_t *pmd,
2753                 unsigned int flags, pte_t orig_pte)
2754 {
2755         spinlock_t *ptl;
2756         struct page *page, *swapcache = NULL;
2757         swp_entry_t entry;
2758         pte_t pte;
2759         int locked;
2760         struct mem_cgroup *ptr = NULL;
2761         int exclusive = 0;
2762         int ret = 0;
2763
2764         if (!pte_unmap_same(mm, pmd, page_table, orig_pte))
2765                 goto out;
2766
2767         entry = pte_to_swp_entry(orig_pte);
2768         if (unlikely(non_swap_entry(entry))) {
2769                 if (is_migration_entry(entry)) {
2770                         migration_entry_wait(mm, pmd, address);
2771                 } else if (is_hwpoison_entry(entry)) {
2772                         ret = VM_FAULT_HWPOISON;
2773                 } else {
2774                         print_bad_pte(vma, address, orig_pte, NULL);
2775                         ret = VM_FAULT_SIGBUS;
2776                 }
2777                 goto out;
2778         }
2779         delayacct_set_flag(DELAYACCT_PF_SWAPIN);
2780         page = lookup_swap_cache(entry);
2781         if (!page) {
2782                 grab_swap_token(mm); /* Contend for token _before_ read-in */
2783                 page = swapin_readahead(entry,
2784                                         GFP_HIGHUSER_MOVABLE, vma, address);
2785                 if (!page) {
2786                         /*
2787                          * Back out if somebody else faulted in this pte
2788                          * while we released the pte lock.
2789                          */
2790                         page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
2791                         if (likely(pte_same(*page_table, orig_pte)))
2792                                 ret = VM_FAULT_OOM;
2793                         delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
2794                         goto unlock;
2795                 }
2796
2797                 /* Had to read the page from swap area: Major fault */
2798                 ret = VM_FAULT_MAJOR;
2799                 count_vm_event(PGMAJFAULT);
2800         } else if (PageHWPoison(page)) {
2801                 /*
2802                  * hwpoisoned dirty swapcache pages are kept for killing
2803                  * owner processes (which may be unknown at hwpoison time)
2804                  */
2805                 ret = VM_FAULT_HWPOISON;
2806                 delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
2807                 goto out_release;
2808         }
2809
2810         locked = lock_page_or_retry(page, mm, flags);
2811         delayacct_clear_flag(DELAYACCT_PF_SWAPIN);
2812         if (!locked) {
2813                 ret |= VM_FAULT_RETRY;
2814                 goto out_release;
2815         }
2816
2817         /*
2818          * Make sure try_to_free_swap or reuse_swap_page or swapoff did not
2819          * release the swapcache from under us.  The page pin, and pte_same
2820          * test below, are not enough to exclude that.  Even if it is still
2821          * swapcache, we need to check that the page's swap has not changed.
2822          */
2823         if (unlikely(!PageSwapCache(page) || page_private(page) != entry.val))
2824                 goto out_page;
2825
2826         if (ksm_might_need_to_copy(page, vma, address)) {
2827                 swapcache = page;
2828                 page = ksm_does_need_to_copy(page, vma, address);
2829
2830                 if (unlikely(!page)) {
2831                         ret = VM_FAULT_OOM;
2832                         page = swapcache;
2833                         swapcache = NULL;
2834                         goto out_page;
2835                 }
2836         }
2837
2838         if (mem_cgroup_try_charge_swapin(mm, page, GFP_KERNEL, &ptr)) {
2839                 ret = VM_FAULT_OOM;
2840                 goto out_page;
2841         }
2842
2843         /*
2844          * Back out if somebody else already faulted in this pte.
2845          */
2846         page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
2847         if (unlikely(!pte_same(*page_table, orig_pte)))
2848                 goto out_nomap;
2849
2850         if (unlikely(!PageUptodate(page))) {
2851                 ret = VM_FAULT_SIGBUS;
2852                 goto out_nomap;
2853         }
2854
2855         /*
2856          * The page isn't present yet, go ahead with the fault.
2857          *
2858          * Be careful about the sequence of operations here.
2859          * To get its accounting right, reuse_swap_page() must be called
2860          * while the page is counted on swap but not yet in mapcount i.e.
2861          * before page_add_anon_rmap() and swap_free(); try_to_free_swap()
2862          * must be called after the swap_free(), or it will never succeed.
2863          * Because delete_from_swap_page() may be called by reuse_swap_page(),
2864          * mem_cgroup_commit_charge_swapin() may not be able to find swp_entry
2865          * in page->private. In this case, a record in swap_cgroup  is silently
2866          * discarded at swap_free().
2867          */
2868
2869         inc_mm_counter_fast(mm, MM_ANONPAGES);
2870         dec_mm_counter_fast(mm, MM_SWAPENTS);
2871         pte = mk_pte(page, vma->vm_page_prot);
2872         if ((flags & FAULT_FLAG_WRITE) && reuse_swap_page(page)) {
2873                 pte = maybe_mkwrite(pte_mkdirty(pte), vma);
2874                 flags &= ~FAULT_FLAG_WRITE;
2875                 ret |= VM_FAULT_WRITE;
2876                 exclusive = 1;
2877         }
2878         flush_icache_page(vma, page);
2879         set_pte_at(mm, address, page_table, pte);
2880         do_page_add_anon_rmap(page, vma, address, exclusive);
2881         /* It's better to call commit-charge after rmap is established */
2882         mem_cgroup_commit_charge_swapin(page, ptr);
2883
2884         swap_free(entry);
2885         if (vm_swap_full() || (vma->vm_flags & VM_LOCKED) || PageMlocked(page))
2886                 try_to_free_swap(page);
2887         unlock_page(page);
2888         if (swapcache) {
2889                 /*
2890                  * Hold the lock to avoid the swap entry to be reused
2891                  * until we take the PT lock for the pte_same() check
2892                  * (to avoid false positives from pte_same). For
2893                  * further safety release the lock after the swap_free
2894                  * so that the swap count won't change under a
2895                  * parallel locked swapcache.
2896                  */
2897                 unlock_page(swapcache);
2898                 page_cache_release(swapcache);
2899         }
2900
2901         if (flags & FAULT_FLAG_WRITE) {
2902                 ret |= do_wp_page(mm, vma, address, page_table, pmd, ptl, pte);
2903                 if (ret & VM_FAULT_ERROR)
2904                         ret &= VM_FAULT_ERROR;
2905                 goto out;
2906         }
2907
2908         /* No need to invalidate - it was non-present before */
2909         update_mmu_cache(vma, address, page_table);
2910 unlock:
2911         pte_unmap_unlock(page_table, ptl);
2912 out:
2913         return ret;
2914 out_nomap:
2915         mem_cgroup_cancel_charge_swapin(ptr);
2916         pte_unmap_unlock(page_table, ptl);
2917 out_page:
2918         unlock_page(page);
2919 out_release:
2920         page_cache_release(page);
2921         if (swapcache) {
2922                 unlock_page(swapcache);
2923                 page_cache_release(swapcache);
2924         }
2925         return ret;
2926 }
2927
2928 /*
2929  * This is like a special single-page "expand_{down|up}wards()",
2930  * except we must first make sure that 'address{-|+}PAGE_SIZE'
2931  * doesn't hit another vma.
2932  */
2933 static inline int check_stack_guard_page(struct vm_area_struct *vma, unsigned long address)
2934 {
2935         address &= PAGE_MASK;
2936         if ((vma->vm_flags & VM_GROWSDOWN) && address == vma->vm_start) {
2937                 struct vm_area_struct *prev = vma->vm_prev;
2938
2939                 /*
2940                  * Is there a mapping abutting this one below?
2941                  *
2942                  * That's only ok if it's the same stack mapping
2943                  * that has gotten split..
2944                  */
2945                 if (prev && prev->vm_end == address)
2946                         return prev->vm_flags & VM_GROWSDOWN ? 0 : -ENOMEM;
2947
2948                 expand_stack(vma, address - PAGE_SIZE);
2949         }
2950         if ((vma->vm_flags & VM_GROWSUP) && address + PAGE_SIZE == vma->vm_end) {
2951                 struct vm_area_struct *next = vma->vm_next;
2952
2953                 /* As VM_GROWSDOWN but s/below/above/ */
2954                 if (next && next->vm_start == address + PAGE_SIZE)
2955                         return next->vm_flags & VM_GROWSUP ? 0 : -ENOMEM;
2956
2957                 expand_upwards(vma, address + PAGE_SIZE);
2958         }
2959         return 0;
2960 }
2961
2962 /*
2963  * We enter with non-exclusive mmap_sem (to exclude vma changes,
2964  * but allow concurrent faults), and pte mapped but not yet locked.
2965  * We return with mmap_sem still held, but pte unmapped and unlocked.
2966  */
2967 static int do_anonymous_page(struct mm_struct *mm, struct vm_area_struct *vma,
2968                 unsigned long address, pte_t *page_table, pmd_t *pmd,
2969                 unsigned int flags)
2970 {
2971         struct page *page;
2972         spinlock_t *ptl;
2973         pte_t entry;
2974
2975         pte_unmap(page_table);
2976
2977         /* Check if we need to add a guard page to the stack */
2978         if (check_stack_guard_page(vma, address) < 0)
2979                 return VM_FAULT_SIGBUS;
2980
2981         /* Use the zero-page for reads */
2982         if (!(flags & FAULT_FLAG_WRITE)) {
2983                 entry = pte_mkspecial(pfn_pte(my_zero_pfn(address),
2984                                                 vma->vm_page_prot));
2985                 page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
2986                 if (!pte_none(*page_table))
2987                         goto unlock;
2988                 goto setpte;
2989         }
2990
2991         /* Allocate our own private page. */
2992         if (unlikely(anon_vma_prepare(vma)))
2993                 goto oom;
2994         page = alloc_zeroed_user_highpage_movable(vma, address);
2995         if (!page)
2996                 goto oom;
2997         __SetPageUptodate(page);
2998
2999         if (mem_cgroup_newpage_charge(page, mm, GFP_KERNEL))
3000                 goto oom_free_page;
3001
3002         entry = mk_pte(page, vma->vm_page_prot);
3003         if (vma->vm_flags & VM_WRITE)
3004                 entry = pte_mkwrite(pte_mkdirty(entry));
3005
3006         page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
3007         if (!pte_none(*page_table))
3008                 goto release;
3009
3010         inc_mm_counter_fast(mm, MM_ANONPAGES);
3011         page_add_new_anon_rmap(page, vma, address);
3012 setpte:
3013         set_pte_at(mm, address, page_table, entry);
3014
3015         /* No need to invalidate - it was non-present before */
3016         update_mmu_cache(vma, address, page_table);
3017 unlock:
3018         pte_unmap_unlock(page_table, ptl);
3019         return 0;
3020 release:
3021         mem_cgroup_uncharge_page(page);
3022         page_cache_release(page);
3023         goto unlock;
3024 oom_free_page:
3025         page_cache_release(page);
3026 oom:
3027         return VM_FAULT_OOM;
3028 }
3029
3030 /*
3031  * __do_fault() tries to create a new page mapping. It aggressively
3032  * tries to share with existing pages, but makes a separate copy if
3033  * the FAULT_FLAG_WRITE is set in the flags parameter in order to avoid
3034  * the next page fault.
3035  *
3036  * As this is called only for pages that do not currently exist, we
3037  * do not need to flush old virtual caches or the TLB.
3038  *
3039  * We enter with non-exclusive mmap_sem (to exclude vma changes,
3040  * but allow concurrent faults), and pte neither mapped nor locked.
3041  * We return with mmap_sem still held, but pte unmapped and unlocked.
3042  */
3043 static int __do_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3044                 unsigned long address, pmd_t *pmd,
3045                 pgoff_t pgoff, unsigned int flags, pte_t orig_pte)
3046 {
3047         pte_t *page_table;
3048         spinlock_t *ptl;
3049         struct page *page;
3050         pte_t entry;
3051         int anon = 0;
3052         int charged = 0;
3053         struct page *dirty_page = NULL;
3054         struct vm_fault vmf;
3055         int ret;
3056         int page_mkwrite = 0;
3057
3058         vmf.virtual_address = (void __user *)(address & PAGE_MASK);
3059         vmf.pgoff = pgoff;
3060         vmf.flags = flags;
3061         vmf.page = NULL;
3062
3063         ret = vma->vm_ops->fault(vma, &vmf);
3064         if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE |
3065                             VM_FAULT_RETRY)))
3066                 return ret;
3067
3068         if (unlikely(PageHWPoison(vmf.page))) {
3069                 if (ret & VM_FAULT_LOCKED)
3070                         unlock_page(vmf.page);
3071                 return VM_FAULT_HWPOISON;
3072         }
3073
3074         /*
3075          * For consistency in subsequent calls, make the faulted page always
3076          * locked.
3077          */
3078         if (unlikely(!(ret & VM_FAULT_LOCKED)))
3079                 lock_page(vmf.page);
3080         else
3081                 VM_BUG_ON(!PageLocked(vmf.page));
3082
3083         /*
3084          * Should we do an early C-O-W break?
3085          */
3086         page = vmf.page;
3087         if (flags & FAULT_FLAG_WRITE) {
3088                 if (!(vma->vm_flags & VM_SHARED)) {
3089                         anon = 1;
3090                         if (unlikely(anon_vma_prepare(vma))) {
3091                                 ret = VM_FAULT_OOM;
3092                                 goto out;
3093                         }
3094                         page = alloc_page_vma(GFP_HIGHUSER_MOVABLE,
3095                                                 vma, address);
3096                         if (!page) {
3097                                 ret = VM_FAULT_OOM;
3098                                 goto out;
3099                         }
3100                         if (mem_cgroup_newpage_charge(page, mm, GFP_KERNEL)) {
3101                                 ret = VM_FAULT_OOM;
3102                                 page_cache_release(page);
3103                                 goto out;
3104                         }
3105                         charged = 1;
3106                         copy_user_highpage(page, vmf.page, address, vma);
3107                         __SetPageUptodate(page);
3108                 } else {
3109                         /*
3110                          * If the page will be shareable, see if the backing
3111                          * address space wants to know that the page is about
3112                          * to become writable
3113                          */
3114                         if (vma->vm_ops->page_mkwrite) {
3115                                 int tmp;
3116
3117                                 unlock_page(page);
3118                                 vmf.flags = FAULT_FLAG_WRITE|FAULT_FLAG_MKWRITE;
3119                                 tmp = vma->vm_ops->page_mkwrite(vma, &vmf);
3120                                 if (unlikely(tmp &
3121                                           (VM_FAULT_ERROR | VM_FAULT_NOPAGE))) {
3122                                         ret = tmp;
3123                                         goto unwritable_page;
3124                                 }
3125                                 if (unlikely(!(tmp & VM_FAULT_LOCKED))) {
3126                                         lock_page(page);
3127                                         if (!page->mapping) {
3128                                                 ret = 0; /* retry the fault */
3129                                                 unlock_page(page);
3130                                                 goto unwritable_page;
3131                                         }
3132                                 } else
3133                                         VM_BUG_ON(!PageLocked(page));
3134                                 page_mkwrite = 1;
3135                         }
3136                 }
3137
3138         }
3139
3140         page_table = pte_offset_map_lock(mm, pmd, address, &ptl);
3141
3142         /*
3143          * This silly early PAGE_DIRTY setting removes a race
3144          * due to the bad i386 page protection. But it's valid
3145          * for other architectures too.
3146          *
3147          * Note that if FAULT_FLAG_WRITE is set, we either now have
3148          * an exclusive copy of the page, or this is a shared mapping,
3149          * so we can make it writable and dirty to avoid having to
3150          * handle that later.
3151          */
3152         /* Only go through if we didn't race with anybody else... */
3153         if (likely(pte_same(*page_table, orig_pte))) {
3154                 flush_icache_page(vma, page);
3155                 entry = mk_pte(page, vma->vm_page_prot);
3156                 if (flags & FAULT_FLAG_WRITE)
3157                         entry = maybe_mkwrite(pte_mkdirty(entry), vma);
3158                 if (anon) {
3159                         inc_mm_counter_fast(mm, MM_ANONPAGES);
3160                         page_add_new_anon_rmap(page, vma, address);
3161                 } else {
3162                         inc_mm_counter_fast(mm, MM_FILEPAGES);
3163                         page_add_file_rmap(page);
3164                         if (flags & FAULT_FLAG_WRITE) {
3165                                 dirty_page = page;
3166                                 get_page(dirty_page);
3167                         }
3168                 }
3169                 set_pte_at(mm, address, page_table, entry);
3170
3171                 /* no need to invalidate: a not-present page won't be cached */
3172                 update_mmu_cache(vma, address, page_table);
3173         } else {
3174                 if (charged)
3175                         mem_cgroup_uncharge_page(page);
3176                 if (anon)
3177                         page_cache_release(page);
3178                 else
3179                         anon = 1; /* no anon but release faulted_page */
3180         }
3181
3182         pte_unmap_unlock(page_table, ptl);
3183
3184 out:
3185         if (dirty_page) {
3186                 struct address_space *mapping = page->mapping;
3187
3188                 if (set_page_dirty(dirty_page))
3189                         page_mkwrite = 1;
3190                 unlock_page(dirty_page);
3191                 put_page(dirty_page);
3192                 if (page_mkwrite && mapping) {
3193                         /*
3194                          * Some device drivers do not set page.mapping but still
3195                          * dirty their pages
3196                          */
3197                         balance_dirty_pages_ratelimited(mapping);
3198                 }
3199
3200                 /* file_update_time outside page_lock */
3201                 if (vma->vm_file)
3202                         file_update_time(vma->vm_file);
3203         } else {
3204                 unlock_page(vmf.page);
3205                 if (anon)
3206                         page_cache_release(vmf.page);
3207         }
3208
3209         return ret;
3210
3211 unwritable_page:
3212         page_cache_release(page);
3213         return ret;
3214 }
3215
3216 static int do_linear_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3217                 unsigned long address, pte_t *page_table, pmd_t *pmd,
3218                 unsigned int flags, pte_t orig_pte)
3219 {
3220         pgoff_t pgoff = (((address & PAGE_MASK)
3221                         - vma->vm_start) >> PAGE_SHIFT) + vma->vm_pgoff;
3222
3223         pte_unmap(page_table);
3224         return __do_fault(mm, vma, address, pmd, pgoff, flags, orig_pte);
3225 }
3226
3227 /*
3228  * Fault of a previously existing named mapping. Repopulate the pte
3229  * from the encoded file_pte if possible. This enables swappable
3230  * nonlinear vmas.
3231  *
3232  * We enter with non-exclusive mmap_sem (to exclude vma changes,
3233  * but allow concurrent faults), and pte mapped but not yet locked.
3234  * We return with mmap_sem still held, but pte unmapped and unlocked.
3235  */
3236 static int do_nonlinear_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3237                 unsigned long address, pte_t *page_table, pmd_t *pmd,
3238                 unsigned int flags, pte_t orig_pte)
3239 {
3240         pgoff_t pgoff;
3241
3242         flags |= FAULT_FLAG_NONLINEAR;
3243
3244         if (!pte_unmap_same(mm, pmd, page_table, orig_pte))
3245                 return 0;
3246
3247         if (unlikely(!(vma->vm_flags & VM_NONLINEAR))) {
3248                 /*
3249                  * Page table corrupted: show pte and kill process.
3250                  */
3251                 print_bad_pte(vma, address, orig_pte, NULL);
3252                 return VM_FAULT_SIGBUS;
3253         }
3254
3255         pgoff = pte_to_pgoff(orig_pte);
3256         return __do_fault(mm, vma, address, pmd, pgoff, flags, orig_pte);
3257 }
3258
3259 /*
3260  * These routines also need to handle stuff like marking pages dirty
3261  * and/or accessed for architectures that don't do it in hardware (most
3262  * RISC architectures).  The early dirtying is also good on the i386.
3263  *
3264  * There is also a hook called "update_mmu_cache()" that architectures
3265  * with external mmu caches can use to update those (ie the Sparc or
3266  * PowerPC hashed page tables that act as extended TLBs).
3267  *
3268  * We enter with non-exclusive mmap_sem (to exclude vma changes,
3269  * but allow concurrent faults), and pte mapped but not yet locked.
3270  * We return with mmap_sem still held, but pte unmapped and unlocked.
3271  */
3272 int handle_pte_fault(struct mm_struct *mm,
3273                      struct vm_area_struct *vma, unsigned long address,
3274                      pte_t *pte, pmd_t *pmd, unsigned int flags)
3275 {
3276         pte_t entry;
3277         spinlock_t *ptl;
3278
3279         entry = *pte;
3280         if (!pte_present(entry)) {
3281                 if (pte_none(entry)) {
3282                         if (vma->vm_ops) {
3283                                 if (likely(vma->vm_ops->fault))
3284                                         return do_linear_fault(mm, vma, address,
3285                                                 pte, pmd, flags, entry);
3286                         }
3287                         return do_anonymous_page(mm, vma, address,
3288                                                  pte, pmd, flags);
3289                 }
3290                 if (pte_file(entry))
3291                         return do_nonlinear_fault(mm, vma, address,
3292                                         pte, pmd, flags, entry);
3293                 return do_swap_page(mm, vma, address,
3294                                         pte, pmd, flags, entry);
3295         }
3296
3297         ptl = pte_lockptr(mm, pmd);
3298         spin_lock(ptl);
3299         if (unlikely(!pte_same(*pte, entry)))
3300                 goto unlock;
3301         if (flags & FAULT_FLAG_WRITE) {
3302                 if (!pte_write(entry))
3303                         return do_wp_page(mm, vma, address,
3304                                         pte, pmd, ptl, entry);
3305                 entry = pte_mkdirty(entry);
3306         }
3307         entry = pte_mkyoung(entry);
3308         if (ptep_set_access_flags(vma, address, pte, entry, flags & FAULT_FLAG_WRITE)) {
3309                 update_mmu_cache(vma, address, pte);
3310         } else {
3311                 /*
3312                  * This is needed only for protection faults but the arch code
3313                  * is not yet telling us if this is a protection fault or not.
3314                  * This still avoids useless tlb flushes for .text page faults
3315                  * with threads.
3316                  */
3317                 if (flags & FAULT_FLAG_WRITE)
3318                         flush_tlb_fix_spurious_fault(vma, address);
3319         }
3320 unlock:
3321         pte_unmap_unlock(pte, ptl);
3322         return 0;
3323 }
3324
3325 /*
3326  * By the time we get here, we already hold the mm semaphore
3327  */
3328 int handle_mm_fault(struct mm_struct *mm, struct vm_area_struct *vma,
3329                 unsigned long address, unsigned int flags)
3330 {
3331         pgd_t *pgd;
3332         pud_t *pud;
3333         pmd_t *pmd;
3334         pte_t *pte;
3335
3336         __set_current_state(TASK_RUNNING);
3337
3338         count_vm_event(PGFAULT);
3339
3340         /* do counter updates before entering really critical section. */
3341         check_sync_rss_stat(current);
3342
3343         if (unlikely(is_vm_hugetlb_page(vma)))
3344                 return hugetlb_fault(mm, vma, address, flags);
3345
3346         pgd = pgd_offset(mm, address);
3347         pud = pud_alloc(mm, pgd, address);
3348         if (!pud)
3349                 return VM_FAULT_OOM;
3350         pmd = pmd_alloc(mm, pud, address);
3351         if (!pmd)
3352                 return VM_FAULT_OOM;
3353         if (pmd_none(*pmd) && transparent_hugepage_enabled(vma)) {
3354                 if (!vma->vm_ops)
3355                         return do_huge_pmd_anonymous_page(mm, vma, address,
3356                                                           pmd, flags);
3357         } else {
3358                 pmd_t orig_pmd = *pmd;
3359                 barrier();
3360                 if (pmd_trans_huge(orig_pmd)) {
3361                         if (flags & FAULT_FLAG_WRITE &&
3362                             !pmd_write(orig_pmd) &&
3363                             !pmd_trans_splitting(orig_pmd))
3364                                 return do_huge_pmd_wp_page(mm, vma, address,
3365                                                            pmd, orig_pmd);
3366                         return 0;
3367                 }
3368         }
3369
3370         /*
3371          * Use __pte_alloc instead of pte_alloc_map, because we can't
3372          * run pte_offset_map on the pmd, if an huge pmd could
3373          * materialize from under us from a different thread.
3374          */
3375         if (unlikely(__pte_alloc(mm, vma, pmd, address)))
3376                 return VM_FAULT_OOM;
3377         /* if an huge pmd materialized from under us just retry later */
3378         if (unlikely(pmd_trans_huge(*pmd)))
3379                 return 0;
3380         /*
3381          * A regular pmd is established and it can't morph into a huge pmd
3382          * from under us anymore at this point because we hold the mmap_sem
3383          * read mode and khugepaged takes it in write mode. So now it's
3384          * safe to run pte_offset_map().
3385          */
3386         pte = pte_offset_map(pmd, address);
3387
3388         return handle_pte_fault(mm, vma, address, pte, pmd, flags);
3389 }
3390
3391 #ifndef __PAGETABLE_PUD_FOLDED
3392 /*
3393  * Allocate page upper directory.
3394  * We've already handled the fast-path in-line.
3395  */
3396 int __pud_alloc(struct mm_struct *mm, pgd_t *pgd, unsigned long address)
3397 {
3398         pud_t *new = pud_alloc_one(mm, address);
3399         if (!new)
3400                 return -ENOMEM;
3401
3402         smp_wmb(); /* See comment in __pte_alloc */
3403
3404         spin_lock(&mm->page_table_lock);
3405         if (pgd_present(*pgd))          /* Another has populated it */
3406                 pud_free(mm, new);
3407         else
3408                 pgd_populate(mm, pgd, new);
3409         spin_unlock(&mm->page_table_lock);
3410         return 0;
3411 }
3412 #endif /* __PAGETABLE_PUD_FOLDED */
3413
3414 #ifndef __PAGETABLE_PMD_FOLDED
3415 /*
3416  * Allocate page middle directory.
3417  * We've already handled the fast-path in-line.
3418  */
3419 int __pmd_alloc(struct mm_struct *mm, pud_t *pud, unsigned long address)
3420 {
3421         pmd_t *new = pmd_alloc_one(mm, address);
3422         if (!new)
3423                 return -ENOMEM;
3424
3425         smp_wmb(); /* See comment in __pte_alloc */
3426
3427         spin_lock(&mm->page_table_lock);
3428 #ifndef __ARCH_HAS_4LEVEL_HACK
3429         if (pud_present(*pud))          /* Another has populated it */
3430                 pmd_free(mm, new);
3431         else
3432                 pud_populate(mm, pud, new);
3433 #else
3434         if (pgd_present(*pud))          /* Another has populated it */
3435                 pmd_free(mm, new);
3436         else
3437                 pgd_populate(mm, pud, new);
3438 #endif /* __ARCH_HAS_4LEVEL_HACK */
3439         spin_unlock(&mm->page_table_lock);
3440         return 0;
3441 }
3442 #endif /* __PAGETABLE_PMD_FOLDED */
3443
3444 int make_pages_present(unsigned long addr, unsigned long end)
3445 {
3446         int ret, len, write;
3447         struct vm_area_struct * vma;
3448
3449         vma = find_vma(current->mm, addr);
3450         if (!vma)
3451                 return -ENOMEM;
3452         /*
3453          * We want to touch writable mappings with a write fault in order
3454          * to break COW, except for shared mappings because these don't COW
3455          * and we would not want to dirty them for nothing.
3456          */
3457         write = (vma->vm_flags & (VM_WRITE | VM_SHARED)) == VM_WRITE;
3458         BUG_ON(addr >= end);
3459         BUG_ON(end > vma->vm_end);
3460         len = DIV_ROUND_UP(end, PAGE_SIZE) - addr/PAGE_SIZE;
3461         ret = get_user_pages(current, current->mm, addr,
3462                         len, write, 0, NULL, NULL);
3463         if (ret < 0)
3464                 return ret;
3465         return ret == len ? 0 : -EFAULT;
3466 }
3467
3468 #if !defined(__HAVE_ARCH_GATE_AREA)
3469
3470 #if defined(AT_SYSINFO_EHDR)
3471 static struct vm_area_struct gate_vma;
3472
3473 static int __init gate_vma_init(void)
3474 {
3475         gate_vma.vm_mm = NULL;
3476         gate_vma.vm_start = FIXADDR_USER_START;
3477         gate_vma.vm_end = FIXADDR_USER_END;
3478         gate_vma.vm_flags = VM_READ | VM_MAYREAD | VM_EXEC | VM_MAYEXEC;
3479         gate_vma.vm_page_prot = __P101;
3480         /*
3481          * Make sure the vDSO gets into every core dump.
3482          * Dumping its contents makes post-mortem fully interpretable later
3483          * without matching up the same kernel and hardware config to see
3484          * what PC values meant.
3485          */
3486         gate_vma.vm_flags |= VM_ALWAYSDUMP;
3487         return 0;
3488 }
3489 __initcall(gate_vma_init);
3490 #endif
3491
3492 struct vm_area_struct *get_gate_vma(struct task_struct *tsk)
3493 {
3494 #ifdef AT_SYSINFO_EHDR
3495         return &gate_vma;
3496 #else
3497         return NULL;
3498 #endif
3499 }
3500
3501 int in_gate_area_no_task(unsigned long addr)
3502 {
3503 #ifdef AT_SYSINFO_EHDR
3504         if ((addr >= FIXADDR_USER_START) && (addr < FIXADDR_USER_END))
3505                 return 1;
3506 #endif
3507         return 0;
3508 }
3509
3510 #endif  /* __HAVE_ARCH_GATE_AREA */
3511
3512 static int __follow_pte(struct mm_struct *mm, unsigned long address,
3513                 pte_t **ptepp, spinlock_t **ptlp)
3514 {
3515         pgd_t *pgd;
3516         pud_t *pud;
3517         pmd_t *pmd;
3518         pte_t *ptep;
3519
3520         pgd = pgd_offset(mm, address);
3521         if (pgd_none(*pgd) || unlikely(pgd_bad(*pgd)))
3522                 goto out;
3523
3524         pud = pud_offset(pgd, address);
3525         if (pud_none(*pud) || unlikely(pud_bad(*pud)))
3526                 goto out;
3527
3528         pmd = pmd_offset(pud, address);
3529         VM_BUG_ON(pmd_trans_huge(*pmd));
3530         if (pmd_none(*pmd) || unlikely(pmd_bad(*pmd)))
3531                 goto out;
3532
3533         /* We cannot handle huge page PFN maps. Luckily they don't exist. */
3534         if (pmd_huge(*pmd))
3535                 goto out;
3536
3537         ptep = pte_offset_map_lock(mm, pmd, address, ptlp);
3538         if (!ptep)
3539                 goto out;
3540         if (!pte_present(*ptep))
3541                 goto unlock;
3542         *ptepp = ptep;
3543         return 0;
3544 unlock:
3545         pte_unmap_unlock(ptep, *ptlp);
3546 out:
3547         return -EINVAL;
3548 }
3549
3550 static inline int follow_pte(struct mm_struct *mm, unsigned long address,
3551                              pte_t **ptepp, spinlock_t **ptlp)
3552 {
3553         int res;
3554
3555         /* (void) is needed to make gcc happy */
3556         (void) __cond_lock(*ptlp,
3557                            !(res = __follow_pte(mm, address, ptepp, ptlp)));
3558         return res;
3559 }
3560
3561 /**
3562  * follow_pfn - look up PFN at a user virtual address
3563  * @vma: memory mapping
3564  * @address: user virtual address
3565  * @pfn: location to store found PFN
3566  *
3567  * Only IO mappings and raw PFN mappings are allowed.
3568  *
3569  * Returns zero and the pfn at @pfn on success, -ve otherwise.
3570  */
3571 int follow_pfn(struct vm_area_struct *vma, unsigned long address,
3572         unsigned long *pfn)
3573 {
3574         int ret = -EINVAL;
3575         spinlock_t *ptl;
3576         pte_t *ptep;
3577
3578         if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
3579                 return ret;
3580
3581         ret = follow_pte(vma->vm_mm, address, &ptep, &ptl);
3582         if (ret)
3583                 return ret;
3584         *pfn = pte_pfn(*ptep);
3585         pte_unmap_unlock(ptep, ptl);
3586         return 0;
3587 }
3588 EXPORT_SYMBOL(follow_pfn);
3589
3590 #ifdef CONFIG_HAVE_IOREMAP_PROT
3591 int follow_phys(struct vm_area_struct *vma,
3592                 unsigned long address, unsigned int flags,
3593                 unsigned long *prot, resource_size_t *phys)
3594 {
3595         int ret = -EINVAL;
3596         pte_t *ptep, pte;
3597         spinlock_t *ptl;
3598
3599         if (!(vma->vm_flags & (VM_IO | VM_PFNMAP)))
3600                 goto out;
3601
3602         if (follow_pte(vma->vm_mm, address, &ptep, &ptl))
3603                 goto out;
3604         pte = *ptep;
3605
3606         if ((flags & FOLL_WRITE) && !pte_write(pte))
3607                 goto unlock;
3608
3609         *prot = pgprot_val(pte_pgprot(pte));
3610         *phys = (resource_size_t)pte_pfn(pte) << PAGE_SHIFT;
3611
3612         ret = 0;
3613 unlock:
3614         pte_unmap_unlock(ptep, ptl);
3615 out:
3616         return ret;
3617 }
3618
3619 int generic_access_phys(struct vm_area_struct *vma, unsigned long addr,
3620                         void *buf, int len, int write)
3621 {
3622         resource_size_t phys_addr;
3623         unsigned long prot = 0;
3624         void __iomem *maddr;
3625         int offset = addr & (PAGE_SIZE-1);
3626
3627         if (follow_phys(vma, addr, write, &prot, &phys_addr))
3628                 return -EINVAL;
3629
3630         maddr = ioremap_prot(phys_addr, PAGE_SIZE, prot);
3631         if (write)
3632                 memcpy_toio(maddr + offset, buf, len);
3633         else
3634                 memcpy_fromio(buf, maddr + offset, len);
3635         iounmap(maddr);
3636
3637         return len;
3638 }
3639 #endif
3640
3641 /*
3642  * Access another process' address space.
3643  * Source/target buffer must be kernel space,
3644  * Do not walk the page table directly, use get_user_pages
3645  */
3646 int access_process_vm(struct task_struct *tsk, unsigned long addr, void *buf, int len, int write)
3647 {
3648         struct mm_struct *mm;
3649         struct vm_area_struct *vma;
3650         void *old_buf = buf;
3651
3652         mm = get_task_mm(tsk);
3653         if (!mm)
3654                 return 0;
3655
3656         down_read(&mm->mmap_sem);
3657         /* ignore errors, just check how much was successfully transferred */
3658         while (len) {
3659                 int bytes, ret, offset;
3660                 void *maddr;
3661                 struct page *page = NULL;
3662
3663                 ret = get_user_pages(tsk, mm, addr, 1,
3664                                 write, 1, &page, &vma);
3665                 if (ret <= 0) {
3666                         /*
3667                          * Check if this is a VM_IO | VM_PFNMAP VMA, which
3668                          * we can access using slightly different code.
3669                          */
3670 #ifdef CONFIG_HAVE_IOREMAP_PROT
3671                         vma = find_vma(mm, addr);
3672                         if (!vma)
3673                                 break;
3674                         if (vma->vm_ops && vma->vm_ops->access)
3675                                 ret = vma->vm_ops->access(vma, addr, buf,
3676                                                           len, write);
3677                         if (ret <= 0)
3678 #endif
3679                                 break;
3680                         bytes = ret;
3681                 } else {
3682                         bytes = len;
3683                         offset = addr & (PAGE_SIZE-1);
3684                         if (bytes > PAGE_SIZE-offset)
3685                                 bytes = PAGE_SIZE-offset;
3686
3687                         maddr = kmap(page);
3688                         if (write) {
3689                                 copy_to_user_page(vma, page, addr,
3690                                                   maddr + offset, buf, bytes);
3691                                 set_page_dirty_lock(page);
3692                         } else {
3693                                 copy_from_user_page(vma, page, addr,
3694                                                     buf, maddr + offset, bytes);
3695                         }
3696                         kunmap(page);
3697                         page_cache_release(page);
3698                 }
3699                 len -= bytes;
3700                 buf += bytes;
3701                 addr += bytes;
3702         }
3703         up_read(&mm->mmap_sem);
3704         mmput(mm);
3705
3706         return buf - old_buf;
3707 }
3708
3709 /*
3710  * Print the name of a VMA.
3711  */
3712 void print_vma_addr(char *prefix, unsigned long ip)
3713 {
3714         struct mm_struct *mm = current->mm;
3715         struct vm_area_struct *vma;
3716
3717         /*
3718          * Do not print if we are in atomic
3719          * contexts (in exception stacks, etc.):
3720          */
3721         if (preempt_count())
3722                 return;
3723
3724         down_read(&mm->mmap_sem);
3725         vma = find_vma(mm, ip);
3726         if (vma && vma->vm_file) {
3727                 struct file *f = vma->vm_file;
3728                 char *buf = (char *)__get_free_page(GFP_KERNEL);
3729                 if (buf) {
3730                         char *p, *s;
3731
3732                         p = d_path(&f->f_path, buf, PAGE_SIZE);
3733                         if (IS_ERR(p))
3734                                 p = "?";
3735                         s = strrchr(p, '/');
3736                         if (s)
3737                                 p = s+1;
3738                         printk("%s%s[%lx+%lx]", prefix, p,
3739                                         vma->vm_start,
3740                                         vma->vm_end - vma->vm_start);
3741                         free_page((unsigned long)buf);
3742                 }
3743         }
3744         up_read(&current->mm->mmap_sem);
3745 }
3746
3747 #ifdef CONFIG_PROVE_LOCKING
3748 void might_fault(void)
3749 {
3750         /*
3751          * Some code (nfs/sunrpc) uses socket ops on kernel memory while
3752          * holding the mmap_sem, this is safe because kernel memory doesn't
3753          * get paged out, therefore we'll never actually fault, and the
3754          * below annotations will generate false positives.
3755          */
3756         if (segment_eq(get_fs(), KERNEL_DS))
3757                 return;
3758
3759         might_sleep();
3760         /*
3761          * it would be nicer only to annotate paths which are not under
3762          * pagefault_disable, however that requires a larger audit and
3763          * providing helpers like get_user_atomic.
3764          */
3765         if (!in_atomic() && current->mm)
3766                 might_lock_read(&current->mm->mmap_sem);
3767 }
3768 EXPORT_SYMBOL(might_fault);
3769 #endif
3770
3771 #if defined(CONFIG_TRANSPARENT_HUGEPAGE) || defined(CONFIG_HUGETLBFS)
3772 static void clear_gigantic_page(struct page *page,
3773                                 unsigned long addr,
3774                                 unsigned int pages_per_huge_page)
3775 {
3776         int i;
3777         struct page *p = page;
3778
3779         might_sleep();
3780         for (i = 0; i < pages_per_huge_page;
3781              i++, p = mem_map_next(p, page, i)) {
3782                 cond_resched();
3783                 clear_user_highpage(p, addr + i * PAGE_SIZE);
3784         }
3785 }
3786 void clear_huge_page(struct page *page,
3787                      unsigned long addr, unsigned int pages_per_huge_page)
3788 {
3789         int i;
3790
3791         if (unlikely(pages_per_huge_page > MAX_ORDER_NR_PAGES)) {
3792                 clear_gigantic_page(page, addr, pages_per_huge_page);
3793                 return;
3794         }
3795
3796         might_sleep();
3797         for (i = 0; i < pages_per_huge_page; i++) {
3798                 cond_resched();
3799                 clear_user_highpage(page + i, addr + i * PAGE_SIZE);
3800         }
3801 }
3802
3803 static void copy_user_gigantic_page(struct page *dst, struct page *src,
3804                                     unsigned long addr,
3805                                     struct vm_area_struct *vma,
3806                                     unsigned int pages_per_huge_page)
3807 {
3808         int i;
3809         struct page *dst_base = dst;
3810         struct page *src_base = src;
3811
3812         for (i = 0; i < pages_per_huge_page; ) {
3813                 cond_resched();
3814                 copy_user_highpage(dst, src, addr + i*PAGE_SIZE, vma);
3815
3816                 i++;
3817                 dst = mem_map_next(dst, dst_base, i);
3818                 src = mem_map_next(src, src_base, i);
3819         }
3820 }
3821
3822 void copy_user_huge_page(struct page *dst, struct page *src,
3823                          unsigned long addr, struct vm_area_struct *vma,
3824                          unsigned int pages_per_huge_page)
3825 {
3826         int i;
3827
3828         if (unlikely(pages_per_huge_page > MAX_ORDER_NR_PAGES)) {
3829                 copy_user_gigantic_page(dst, src, addr, vma,
3830                                         pages_per_huge_page);
3831                 return;
3832         }
3833
3834         might_sleep();
3835         for (i = 0; i < pages_per_huge_page; i++) {
3836                 cond_resched();
3837                 copy_user_highpage(dst + i, src + i, addr + i*PAGE_SIZE, vma);
3838         }
3839 }
3840 #endif /* CONFIG_TRANSPARENT_HUGEPAGE || CONFIG_HUGETLBFS */