]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
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/rmap.h> | |
49 | #include <linux/module.h> | |
0ff92245 | 50 | #include <linux/delayacct.h> |
1da177e4 | 51 | #include <linux/init.h> |
edc79b2a | 52 | #include <linux/writeback.h> |
8a9f3ccd | 53 | #include <linux/memcontrol.h> |
cddb8a5c | 54 | #include <linux/mmu_notifier.h> |
3dc14741 HD |
55 | #include <linux/kallsyms.h> |
56 | #include <linux/swapops.h> | |
57 | #include <linux/elf.h> | |
1da177e4 LT |
58 | |
59 | #include <asm/pgalloc.h> | |
60 | #include <asm/uaccess.h> | |
61 | #include <asm/tlb.h> | |
62 | #include <asm/tlbflush.h> | |
63 | #include <asm/pgtable.h> | |
64 | ||
42b77728 JB |
65 | #include "internal.h" |
66 | ||
d41dee36 | 67 | #ifndef CONFIG_NEED_MULTIPLE_NODES |
1da177e4 LT |
68 | /* use the per-pgdat data instead for discontigmem - mbligh */ |
69 | unsigned long max_mapnr; | |
70 | struct page *mem_map; | |
71 | ||
72 | EXPORT_SYMBOL(max_mapnr); | |
73 | EXPORT_SYMBOL(mem_map); | |
74 | #endif | |
75 | ||
76 | unsigned long num_physpages; | |
77 | /* | |
78 | * A number of key systems in x86 including ioremap() rely on the assumption | |
79 | * that high_memory defines the upper bound on direct map memory, then end | |
80 | * of ZONE_NORMAL. Under CONFIG_DISCONTIG this means that max_low_pfn and | |
81 | * highstart_pfn must be the same; there must be no gap between ZONE_NORMAL | |
82 | * and ZONE_HIGHMEM. | |
83 | */ | |
84 | void * high_memory; | |
1da177e4 LT |
85 | |
86 | EXPORT_SYMBOL(num_physpages); | |
87 | EXPORT_SYMBOL(high_memory); | |
1da177e4 | 88 | |
32a93233 IM |
89 | /* |
90 | * Randomize the address space (stacks, mmaps, brk, etc.). | |
91 | * | |
92 | * ( When CONFIG_COMPAT_BRK=y we exclude brk from randomization, | |
93 | * as ancient (libc5 based) binaries can segfault. ) | |
94 | */ | |
95 | int randomize_va_space __read_mostly = | |
96 | #ifdef CONFIG_COMPAT_BRK | |
97 | 1; | |
98 | #else | |
99 | 2; | |
100 | #endif | |
a62eaf15 AK |
101 | |
102 | static int __init disable_randmaps(char *s) | |
103 | { | |
104 | randomize_va_space = 0; | |
9b41046c | 105 | return 1; |
a62eaf15 AK |
106 | } |
107 | __setup("norandmaps", disable_randmaps); | |
108 | ||
109 | ||
1da177e4 LT |
110 | /* |
111 | * If a p?d_bad entry is found while walking page tables, report | |
112 | * the error, before resetting entry to p?d_none. Usually (but | |
113 | * very seldom) called out from the p?d_none_or_clear_bad macros. | |
114 | */ | |
115 | ||
116 | void pgd_clear_bad(pgd_t *pgd) | |
117 | { | |
118 | pgd_ERROR(*pgd); | |
119 | pgd_clear(pgd); | |
120 | } | |
121 | ||
122 | void pud_clear_bad(pud_t *pud) | |
123 | { | |
124 | pud_ERROR(*pud); | |
125 | pud_clear(pud); | |
126 | } | |
127 | ||
128 | void pmd_clear_bad(pmd_t *pmd) | |
129 | { | |
130 | pmd_ERROR(*pmd); | |
131 | pmd_clear(pmd); | |
132 | } | |
133 | ||
134 | /* | |
135 | * Note: this doesn't free the actual pages themselves. That | |
136 | * has been handled earlier when unmapping all the memory regions. | |
137 | */ | |
e0da382c | 138 | static void free_pte_range(struct mmu_gather *tlb, pmd_t *pmd) |
1da177e4 | 139 | { |
2f569afd | 140 | pgtable_t token = pmd_pgtable(*pmd); |
e0da382c | 141 | pmd_clear(pmd); |
2f569afd | 142 | pte_free_tlb(tlb, token); |
e0da382c | 143 | tlb->mm->nr_ptes--; |
1da177e4 LT |
144 | } |
145 | ||
e0da382c HD |
146 | static inline void free_pmd_range(struct mmu_gather *tlb, pud_t *pud, |
147 | unsigned long addr, unsigned long end, | |
148 | unsigned long floor, unsigned long ceiling) | |
1da177e4 LT |
149 | { |
150 | pmd_t *pmd; | |
151 | unsigned long next; | |
e0da382c | 152 | unsigned long start; |
1da177e4 | 153 | |
e0da382c | 154 | start = addr; |
1da177e4 | 155 | pmd = pmd_offset(pud, addr); |
1da177e4 LT |
156 | do { |
157 | next = pmd_addr_end(addr, end); | |
158 | if (pmd_none_or_clear_bad(pmd)) | |
159 | continue; | |
e0da382c | 160 | free_pte_range(tlb, pmd); |
1da177e4 LT |
161 | } while (pmd++, addr = next, addr != end); |
162 | ||
e0da382c HD |
163 | start &= PUD_MASK; |
164 | if (start < floor) | |
165 | return; | |
166 | if (ceiling) { | |
167 | ceiling &= PUD_MASK; | |
168 | if (!ceiling) | |
169 | return; | |
1da177e4 | 170 | } |
e0da382c HD |
171 | if (end - 1 > ceiling - 1) |
172 | return; | |
173 | ||
174 | pmd = pmd_offset(pud, start); | |
175 | pud_clear(pud); | |
176 | pmd_free_tlb(tlb, pmd); | |
1da177e4 LT |
177 | } |
178 | ||
e0da382c HD |
179 | static inline void free_pud_range(struct mmu_gather *tlb, pgd_t *pgd, |
180 | unsigned long addr, unsigned long end, | |
181 | unsigned long floor, unsigned long ceiling) | |
1da177e4 LT |
182 | { |
183 | pud_t *pud; | |
184 | unsigned long next; | |
e0da382c | 185 | unsigned long start; |
1da177e4 | 186 | |
e0da382c | 187 | start = addr; |
1da177e4 | 188 | pud = pud_offset(pgd, addr); |
1da177e4 LT |
189 | do { |
190 | next = pud_addr_end(addr, end); | |
191 | if (pud_none_or_clear_bad(pud)) | |
192 | continue; | |
e0da382c | 193 | free_pmd_range(tlb, pud, addr, next, floor, ceiling); |
1da177e4 LT |
194 | } while (pud++, addr = next, addr != end); |
195 | ||
e0da382c HD |
196 | start &= PGDIR_MASK; |
197 | if (start < floor) | |
198 | return; | |
199 | if (ceiling) { | |
200 | ceiling &= PGDIR_MASK; | |
201 | if (!ceiling) | |
202 | return; | |
1da177e4 | 203 | } |
e0da382c HD |
204 | if (end - 1 > ceiling - 1) |
205 | return; | |
206 | ||
207 | pud = pud_offset(pgd, start); | |
208 | pgd_clear(pgd); | |
209 | pud_free_tlb(tlb, pud); | |
1da177e4 LT |
210 | } |
211 | ||
212 | /* | |
e0da382c HD |
213 | * This function frees user-level page tables of a process. |
214 | * | |
1da177e4 LT |
215 | * Must be called with pagetable lock held. |
216 | */ | |
42b77728 | 217 | void free_pgd_range(struct mmu_gather *tlb, |
e0da382c HD |
218 | unsigned long addr, unsigned long end, |
219 | unsigned long floor, unsigned long ceiling) | |
1da177e4 LT |
220 | { |
221 | pgd_t *pgd; | |
222 | unsigned long next; | |
e0da382c HD |
223 | unsigned long start; |
224 | ||
225 | /* | |
226 | * The next few lines have given us lots of grief... | |
227 | * | |
228 | * Why are we testing PMD* at this top level? Because often | |
229 | * there will be no work to do at all, and we'd prefer not to | |
230 | * go all the way down to the bottom just to discover that. | |
231 | * | |
232 | * Why all these "- 1"s? Because 0 represents both the bottom | |
233 | * of the address space and the top of it (using -1 for the | |
234 | * top wouldn't help much: the masks would do the wrong thing). | |
235 | * The rule is that addr 0 and floor 0 refer to the bottom of | |
236 | * the address space, but end 0 and ceiling 0 refer to the top | |
237 | * Comparisons need to use "end - 1" and "ceiling - 1" (though | |
238 | * that end 0 case should be mythical). | |
239 | * | |
240 | * Wherever addr is brought up or ceiling brought down, we must | |
241 | * be careful to reject "the opposite 0" before it confuses the | |
242 | * subsequent tests. But what about where end is brought down | |
243 | * by PMD_SIZE below? no, end can't go down to 0 there. | |
244 | * | |
245 | * Whereas we round start (addr) and ceiling down, by different | |
246 | * masks at different levels, in order to test whether a table | |
247 | * now has no other vmas using it, so can be freed, we don't | |
248 | * bother to round floor or end up - the tests don't need that. | |
249 | */ | |
1da177e4 | 250 | |
e0da382c HD |
251 | addr &= PMD_MASK; |
252 | if (addr < floor) { | |
253 | addr += PMD_SIZE; | |
254 | if (!addr) | |
255 | return; | |
256 | } | |
257 | if (ceiling) { | |
258 | ceiling &= PMD_MASK; | |
259 | if (!ceiling) | |
260 | return; | |
261 | } | |
262 | if (end - 1 > ceiling - 1) | |
263 | end -= PMD_SIZE; | |
264 | if (addr > end - 1) | |
265 | return; | |
266 | ||
267 | start = addr; | |
42b77728 | 268 | pgd = pgd_offset(tlb->mm, addr); |
1da177e4 LT |
269 | do { |
270 | next = pgd_addr_end(addr, end); | |
271 | if (pgd_none_or_clear_bad(pgd)) | |
272 | continue; | |
42b77728 | 273 | free_pud_range(tlb, pgd, addr, next, floor, ceiling); |
1da177e4 | 274 | } while (pgd++, addr = next, addr != end); |
e0da382c HD |
275 | } |
276 | ||
42b77728 | 277 | void free_pgtables(struct mmu_gather *tlb, struct vm_area_struct *vma, |
3bf5ee95 | 278 | unsigned long floor, unsigned long ceiling) |
e0da382c HD |
279 | { |
280 | while (vma) { | |
281 | struct vm_area_struct *next = vma->vm_next; | |
282 | unsigned long addr = vma->vm_start; | |
283 | ||
8f4f8c16 HD |
284 | /* |
285 | * Hide vma from rmap and vmtruncate before freeing pgtables | |
286 | */ | |
287 | anon_vma_unlink(vma); | |
288 | unlink_file_vma(vma); | |
289 | ||
9da61aef | 290 | if (is_vm_hugetlb_page(vma)) { |
3bf5ee95 | 291 | hugetlb_free_pgd_range(tlb, addr, vma->vm_end, |
e0da382c | 292 | floor, next? next->vm_start: ceiling); |
3bf5ee95 HD |
293 | } else { |
294 | /* | |
295 | * Optimization: gather nearby vmas into one call down | |
296 | */ | |
297 | while (next && next->vm_start <= vma->vm_end + PMD_SIZE | |
4866920b | 298 | && !is_vm_hugetlb_page(next)) { |
3bf5ee95 HD |
299 | vma = next; |
300 | next = vma->vm_next; | |
8f4f8c16 HD |
301 | anon_vma_unlink(vma); |
302 | unlink_file_vma(vma); | |
3bf5ee95 HD |
303 | } |
304 | free_pgd_range(tlb, addr, vma->vm_end, | |
305 | floor, next? next->vm_start: ceiling); | |
306 | } | |
e0da382c HD |
307 | vma = next; |
308 | } | |
1da177e4 LT |
309 | } |
310 | ||
1bb3630e | 311 | int __pte_alloc(struct mm_struct *mm, pmd_t *pmd, unsigned long address) |
1da177e4 | 312 | { |
2f569afd | 313 | pgtable_t new = pte_alloc_one(mm, address); |
1bb3630e HD |
314 | if (!new) |
315 | return -ENOMEM; | |
316 | ||
362a61ad NP |
317 | /* |
318 | * Ensure all pte setup (eg. pte page lock and page clearing) are | |
319 | * visible before the pte is made visible to other CPUs by being | |
320 | * put into page tables. | |
321 | * | |
322 | * The other side of the story is the pointer chasing in the page | |
323 | * table walking code (when walking the page table without locking; | |
324 | * ie. most of the time). Fortunately, these data accesses consist | |
325 | * of a chain of data-dependent loads, meaning most CPUs (alpha | |
326 | * being the notable exception) will already guarantee loads are | |
327 | * seen in-order. See the alpha page table accessors for the | |
328 | * smp_read_barrier_depends() barriers in page table walking code. | |
329 | */ | |
330 | smp_wmb(); /* Could be smp_wmb__xxx(before|after)_spin_lock */ | |
331 | ||
c74df32c | 332 | spin_lock(&mm->page_table_lock); |
2f569afd | 333 | if (!pmd_present(*pmd)) { /* Has another populated it ? */ |
1da177e4 | 334 | mm->nr_ptes++; |
1da177e4 | 335 | pmd_populate(mm, pmd, new); |
2f569afd | 336 | new = NULL; |
1da177e4 | 337 | } |
c74df32c | 338 | spin_unlock(&mm->page_table_lock); |
2f569afd MS |
339 | if (new) |
340 | pte_free(mm, new); | |
1bb3630e | 341 | return 0; |
1da177e4 LT |
342 | } |
343 | ||
1bb3630e | 344 | int __pte_alloc_kernel(pmd_t *pmd, unsigned long address) |
1da177e4 | 345 | { |
1bb3630e HD |
346 | pte_t *new = pte_alloc_one_kernel(&init_mm, address); |
347 | if (!new) | |
348 | return -ENOMEM; | |
349 | ||
362a61ad NP |
350 | smp_wmb(); /* See comment in __pte_alloc */ |
351 | ||
1bb3630e | 352 | spin_lock(&init_mm.page_table_lock); |
2f569afd | 353 | if (!pmd_present(*pmd)) { /* Has another populated it ? */ |
1bb3630e | 354 | pmd_populate_kernel(&init_mm, pmd, new); |
2f569afd MS |
355 | new = NULL; |
356 | } | |
1bb3630e | 357 | spin_unlock(&init_mm.page_table_lock); |
2f569afd MS |
358 | if (new) |
359 | pte_free_kernel(&init_mm, new); | |
1bb3630e | 360 | return 0; |
1da177e4 LT |
361 | } |
362 | ||
ae859762 HD |
363 | static inline void add_mm_rss(struct mm_struct *mm, int file_rss, int anon_rss) |
364 | { | |
365 | if (file_rss) | |
366 | add_mm_counter(mm, file_rss, file_rss); | |
367 | if (anon_rss) | |
368 | add_mm_counter(mm, anon_rss, anon_rss); | |
369 | } | |
370 | ||
b5810039 | 371 | /* |
6aab341e LT |
372 | * This function is called to print an error when a bad pte |
373 | * is found. For example, we might have a PFN-mapped pte in | |
374 | * a region that doesn't allow it. | |
b5810039 NP |
375 | * |
376 | * The calling function must still handle the error. | |
377 | */ | |
3dc14741 HD |
378 | static void print_bad_pte(struct vm_area_struct *vma, unsigned long addr, |
379 | pte_t pte, struct page *page) | |
b5810039 | 380 | { |
3dc14741 HD |
381 | pgd_t *pgd = pgd_offset(vma->vm_mm, addr); |
382 | pud_t *pud = pud_offset(pgd, addr); | |
383 | pmd_t *pmd = pmd_offset(pud, addr); | |
384 | struct address_space *mapping; | |
385 | pgoff_t index; | |
d936cf9b HD |
386 | static unsigned long resume; |
387 | static unsigned long nr_shown; | |
388 | static unsigned long nr_unshown; | |
389 | ||
390 | /* | |
391 | * Allow a burst of 60 reports, then keep quiet for that minute; | |
392 | * or allow a steady drip of one report per second. | |
393 | */ | |
394 | if (nr_shown == 60) { | |
395 | if (time_before(jiffies, resume)) { | |
396 | nr_unshown++; | |
397 | return; | |
398 | } | |
399 | if (nr_unshown) { | |
1e9e6365 HD |
400 | printk(KERN_ALERT |
401 | "BUG: Bad page map: %lu messages suppressed\n", | |
d936cf9b HD |
402 | nr_unshown); |
403 | nr_unshown = 0; | |
404 | } | |
405 | nr_shown = 0; | |
406 | } | |
407 | if (nr_shown++ == 0) | |
408 | resume = jiffies + 60 * HZ; | |
3dc14741 HD |
409 | |
410 | mapping = vma->vm_file ? vma->vm_file->f_mapping : NULL; | |
411 | index = linear_page_index(vma, addr); | |
412 | ||
1e9e6365 HD |
413 | printk(KERN_ALERT |
414 | "BUG: Bad page map in process %s pte:%08llx pmd:%08llx\n", | |
3dc14741 HD |
415 | current->comm, |
416 | (long long)pte_val(pte), (long long)pmd_val(*pmd)); | |
417 | if (page) { | |
1e9e6365 | 418 | printk(KERN_ALERT |
3dc14741 HD |
419 | "page:%p flags:%p count:%d mapcount:%d mapping:%p index:%lx\n", |
420 | page, (void *)page->flags, page_count(page), | |
421 | page_mapcount(page), page->mapping, page->index); | |
422 | } | |
1e9e6365 | 423 | printk(KERN_ALERT |
3dc14741 HD |
424 | "addr:%p vm_flags:%08lx anon_vma:%p mapping:%p index:%lx\n", |
425 | (void *)addr, vma->vm_flags, vma->anon_vma, mapping, index); | |
426 | /* | |
427 | * Choose text because data symbols depend on CONFIG_KALLSYMS_ALL=y | |
428 | */ | |
429 | if (vma->vm_ops) | |
1e9e6365 | 430 | print_symbol(KERN_ALERT "vma->vm_ops->fault: %s\n", |
3dc14741 HD |
431 | (unsigned long)vma->vm_ops->fault); |
432 | if (vma->vm_file && vma->vm_file->f_op) | |
1e9e6365 | 433 | print_symbol(KERN_ALERT "vma->vm_file->f_op->mmap: %s\n", |
3dc14741 | 434 | (unsigned long)vma->vm_file->f_op->mmap); |
b5810039 | 435 | dump_stack(); |
3dc14741 | 436 | add_taint(TAINT_BAD_PAGE); |
b5810039 NP |
437 | } |
438 | ||
67121172 LT |
439 | static inline int is_cow_mapping(unsigned int flags) |
440 | { | |
441 | return (flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE; | |
442 | } | |
443 | ||
ee498ed7 | 444 | /* |
7e675137 | 445 | * vm_normal_page -- This function gets the "struct page" associated with a pte. |
6aab341e | 446 | * |
7e675137 NP |
447 | * "Special" mappings do not wish to be associated with a "struct page" (either |
448 | * it doesn't exist, or it exists but they don't want to touch it). In this | |
449 | * case, NULL is returned here. "Normal" mappings do have a struct page. | |
b379d790 | 450 | * |
7e675137 NP |
451 | * There are 2 broad cases. Firstly, an architecture may define a pte_special() |
452 | * pte bit, in which case this function is trivial. Secondly, an architecture | |
453 | * may not have a spare pte bit, which requires a more complicated scheme, | |
454 | * described below. | |
455 | * | |
456 | * A raw VM_PFNMAP mapping (ie. one that is not COWed) is always considered a | |
457 | * special mapping (even if there are underlying and valid "struct pages"). | |
458 | * COWed pages of a VM_PFNMAP are always normal. | |
6aab341e | 459 | * |
b379d790 JH |
460 | * The way we recognize COWed pages within VM_PFNMAP mappings is through the |
461 | * rules set up by "remap_pfn_range()": the vma will have the VM_PFNMAP bit | |
7e675137 NP |
462 | * set, and the vm_pgoff will point to the first PFN mapped: thus every special |
463 | * mapping will always honor the rule | |
6aab341e LT |
464 | * |
465 | * pfn_of_page == vma->vm_pgoff + ((addr - vma->vm_start) >> PAGE_SHIFT) | |
466 | * | |
7e675137 NP |
467 | * And for normal mappings this is false. |
468 | * | |
469 | * This restricts such mappings to be a linear translation from virtual address | |
470 | * to pfn. To get around this restriction, we allow arbitrary mappings so long | |
471 | * as the vma is not a COW mapping; in that case, we know that all ptes are | |
472 | * special (because none can have been COWed). | |
b379d790 | 473 | * |
b379d790 | 474 | * |
7e675137 | 475 | * In order to support COW of arbitrary special mappings, we have VM_MIXEDMAP. |
b379d790 JH |
476 | * |
477 | * VM_MIXEDMAP mappings can likewise contain memory with or without "struct | |
478 | * page" backing, however the difference is that _all_ pages with a struct | |
479 | * page (that is, those where pfn_valid is true) are refcounted and considered | |
480 | * normal pages by the VM. The disadvantage is that pages are refcounted | |
481 | * (which can be slower and simply not an option for some PFNMAP users). The | |
482 | * advantage is that we don't have to follow the strict linearity rule of | |
483 | * PFNMAP mappings in order to support COWable mappings. | |
484 | * | |
ee498ed7 | 485 | */ |
7e675137 NP |
486 | #ifdef __HAVE_ARCH_PTE_SPECIAL |
487 | # define HAVE_PTE_SPECIAL 1 | |
488 | #else | |
489 | # define HAVE_PTE_SPECIAL 0 | |
490 | #endif | |
491 | struct page *vm_normal_page(struct vm_area_struct *vma, unsigned long addr, | |
492 | pte_t pte) | |
ee498ed7 | 493 | { |
22b31eec | 494 | unsigned long pfn = pte_pfn(pte); |
7e675137 NP |
495 | |
496 | if (HAVE_PTE_SPECIAL) { | |
22b31eec HD |
497 | if (likely(!pte_special(pte))) |
498 | goto check_pfn; | |
499 | if (!(vma->vm_flags & (VM_PFNMAP | VM_MIXEDMAP))) | |
500 | print_bad_pte(vma, addr, pte, NULL); | |
7e675137 NP |
501 | return NULL; |
502 | } | |
503 | ||
504 | /* !HAVE_PTE_SPECIAL case follows: */ | |
505 | ||
b379d790 JH |
506 | if (unlikely(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))) { |
507 | if (vma->vm_flags & VM_MIXEDMAP) { | |
508 | if (!pfn_valid(pfn)) | |
509 | return NULL; | |
510 | goto out; | |
511 | } else { | |
7e675137 NP |
512 | unsigned long off; |
513 | off = (addr - vma->vm_start) >> PAGE_SHIFT; | |
b379d790 JH |
514 | if (pfn == vma->vm_pgoff + off) |
515 | return NULL; | |
516 | if (!is_cow_mapping(vma->vm_flags)) | |
517 | return NULL; | |
518 | } | |
6aab341e LT |
519 | } |
520 | ||
22b31eec HD |
521 | check_pfn: |
522 | if (unlikely(pfn > highest_memmap_pfn)) { | |
523 | print_bad_pte(vma, addr, pte, NULL); | |
524 | return NULL; | |
525 | } | |
6aab341e LT |
526 | |
527 | /* | |
7e675137 | 528 | * NOTE! We still have PageReserved() pages in the page tables. |
7e675137 | 529 | * eg. VDSO mappings can cause them to exist. |
6aab341e | 530 | */ |
b379d790 | 531 | out: |
6aab341e | 532 | return pfn_to_page(pfn); |
ee498ed7 HD |
533 | } |
534 | ||
1da177e4 LT |
535 | /* |
536 | * copy one vm_area from one task to the other. Assumes the page tables | |
537 | * already present in the new task to be cleared in the whole range | |
538 | * covered by this vma. | |
1da177e4 LT |
539 | */ |
540 | ||
8c103762 | 541 | static inline void |
1da177e4 | 542 | copy_one_pte(struct mm_struct *dst_mm, struct mm_struct *src_mm, |
b5810039 | 543 | pte_t *dst_pte, pte_t *src_pte, struct vm_area_struct *vma, |
8c103762 | 544 | unsigned long addr, int *rss) |
1da177e4 | 545 | { |
b5810039 | 546 | unsigned long vm_flags = vma->vm_flags; |
1da177e4 LT |
547 | pte_t pte = *src_pte; |
548 | struct page *page; | |
1da177e4 LT |
549 | |
550 | /* pte contains position in swap or file, so copy. */ | |
551 | if (unlikely(!pte_present(pte))) { | |
552 | if (!pte_file(pte)) { | |
0697212a CL |
553 | swp_entry_t entry = pte_to_swp_entry(pte); |
554 | ||
555 | swap_duplicate(entry); | |
1da177e4 LT |
556 | /* make sure dst_mm is on swapoff's mmlist. */ |
557 | if (unlikely(list_empty(&dst_mm->mmlist))) { | |
558 | spin_lock(&mmlist_lock); | |
f412ac08 HD |
559 | if (list_empty(&dst_mm->mmlist)) |
560 | list_add(&dst_mm->mmlist, | |
561 | &src_mm->mmlist); | |
1da177e4 LT |
562 | spin_unlock(&mmlist_lock); |
563 | } | |
0697212a CL |
564 | if (is_write_migration_entry(entry) && |
565 | is_cow_mapping(vm_flags)) { | |
566 | /* | |
567 | * COW mappings require pages in both parent | |
568 | * and child to be set to read. | |
569 | */ | |
570 | make_migration_entry_read(&entry); | |
571 | pte = swp_entry_to_pte(entry); | |
572 | set_pte_at(src_mm, addr, src_pte, pte); | |
573 | } | |
1da177e4 | 574 | } |
ae859762 | 575 | goto out_set_pte; |
1da177e4 LT |
576 | } |
577 | ||
1da177e4 LT |
578 | /* |
579 | * If it's a COW mapping, write protect it both | |
580 | * in the parent and the child | |
581 | */ | |
67121172 | 582 | if (is_cow_mapping(vm_flags)) { |
1da177e4 | 583 | ptep_set_wrprotect(src_mm, addr, src_pte); |
3dc90795 | 584 | pte = pte_wrprotect(pte); |
1da177e4 LT |
585 | } |
586 | ||
587 | /* | |
588 | * If it's a shared mapping, mark it clean in | |
589 | * the child | |
590 | */ | |
591 | if (vm_flags & VM_SHARED) | |
592 | pte = pte_mkclean(pte); | |
593 | pte = pte_mkold(pte); | |
6aab341e LT |
594 | |
595 | page = vm_normal_page(vma, addr, pte); | |
596 | if (page) { | |
597 | get_page(page); | |
c97a9e10 | 598 | page_dup_rmap(page, vma, addr); |
6aab341e LT |
599 | rss[!!PageAnon(page)]++; |
600 | } | |
ae859762 HD |
601 | |
602 | out_set_pte: | |
603 | set_pte_at(dst_mm, addr, dst_pte, pte); | |
1da177e4 LT |
604 | } |
605 | ||
606 | static int copy_pte_range(struct mm_struct *dst_mm, struct mm_struct *src_mm, | |
607 | pmd_t *dst_pmd, pmd_t *src_pmd, struct vm_area_struct *vma, | |
608 | unsigned long addr, unsigned long end) | |
609 | { | |
610 | pte_t *src_pte, *dst_pte; | |
c74df32c | 611 | spinlock_t *src_ptl, *dst_ptl; |
e040f218 | 612 | int progress = 0; |
8c103762 | 613 | int rss[2]; |
1da177e4 LT |
614 | |
615 | again: | |
ae859762 | 616 | rss[1] = rss[0] = 0; |
c74df32c | 617 | dst_pte = pte_alloc_map_lock(dst_mm, dst_pmd, addr, &dst_ptl); |
1da177e4 LT |
618 | if (!dst_pte) |
619 | return -ENOMEM; | |
620 | src_pte = pte_offset_map_nested(src_pmd, addr); | |
4c21e2f2 | 621 | src_ptl = pte_lockptr(src_mm, src_pmd); |
f20dc5f7 | 622 | spin_lock_nested(src_ptl, SINGLE_DEPTH_NESTING); |
6606c3e0 | 623 | arch_enter_lazy_mmu_mode(); |
1da177e4 | 624 | |
1da177e4 LT |
625 | do { |
626 | /* | |
627 | * We are holding two locks at this point - either of them | |
628 | * could generate latencies in another task on another CPU. | |
629 | */ | |
e040f218 HD |
630 | if (progress >= 32) { |
631 | progress = 0; | |
632 | if (need_resched() || | |
95c354fe | 633 | spin_needbreak(src_ptl) || spin_needbreak(dst_ptl)) |
e040f218 HD |
634 | break; |
635 | } | |
1da177e4 LT |
636 | if (pte_none(*src_pte)) { |
637 | progress++; | |
638 | continue; | |
639 | } | |
8c103762 | 640 | copy_one_pte(dst_mm, src_mm, dst_pte, src_pte, vma, addr, rss); |
1da177e4 LT |
641 | progress += 8; |
642 | } while (dst_pte++, src_pte++, addr += PAGE_SIZE, addr != end); | |
1da177e4 | 643 | |
6606c3e0 | 644 | arch_leave_lazy_mmu_mode(); |
c74df32c | 645 | spin_unlock(src_ptl); |
1da177e4 | 646 | pte_unmap_nested(src_pte - 1); |
ae859762 | 647 | add_mm_rss(dst_mm, rss[0], rss[1]); |
c74df32c HD |
648 | pte_unmap_unlock(dst_pte - 1, dst_ptl); |
649 | cond_resched(); | |
1da177e4 LT |
650 | if (addr != end) |
651 | goto again; | |
652 | return 0; | |
653 | } | |
654 | ||
655 | static inline int copy_pmd_range(struct mm_struct *dst_mm, struct mm_struct *src_mm, | |
656 | pud_t *dst_pud, pud_t *src_pud, struct vm_area_struct *vma, | |
657 | unsigned long addr, unsigned long end) | |
658 | { | |
659 | pmd_t *src_pmd, *dst_pmd; | |
660 | unsigned long next; | |
661 | ||
662 | dst_pmd = pmd_alloc(dst_mm, dst_pud, addr); | |
663 | if (!dst_pmd) | |
664 | return -ENOMEM; | |
665 | src_pmd = pmd_offset(src_pud, addr); | |
666 | do { | |
667 | next = pmd_addr_end(addr, end); | |
668 | if (pmd_none_or_clear_bad(src_pmd)) | |
669 | continue; | |
670 | if (copy_pte_range(dst_mm, src_mm, dst_pmd, src_pmd, | |
671 | vma, addr, next)) | |
672 | return -ENOMEM; | |
673 | } while (dst_pmd++, src_pmd++, addr = next, addr != end); | |
674 | return 0; | |
675 | } | |
676 | ||
677 | static inline int copy_pud_range(struct mm_struct *dst_mm, struct mm_struct *src_mm, | |
678 | pgd_t *dst_pgd, pgd_t *src_pgd, struct vm_area_struct *vma, | |
679 | unsigned long addr, unsigned long end) | |
680 | { | |
681 | pud_t *src_pud, *dst_pud; | |
682 | unsigned long next; | |
683 | ||
684 | dst_pud = pud_alloc(dst_mm, dst_pgd, addr); | |
685 | if (!dst_pud) | |
686 | return -ENOMEM; | |
687 | src_pud = pud_offset(src_pgd, addr); | |
688 | do { | |
689 | next = pud_addr_end(addr, end); | |
690 | if (pud_none_or_clear_bad(src_pud)) | |
691 | continue; | |
692 | if (copy_pmd_range(dst_mm, src_mm, dst_pud, src_pud, | |
693 | vma, addr, next)) | |
694 | return -ENOMEM; | |
695 | } while (dst_pud++, src_pud++, addr = next, addr != end); | |
696 | return 0; | |
697 | } | |
698 | ||
699 | int copy_page_range(struct mm_struct *dst_mm, struct mm_struct *src_mm, | |
700 | struct vm_area_struct *vma) | |
701 | { | |
702 | pgd_t *src_pgd, *dst_pgd; | |
703 | unsigned long next; | |
704 | unsigned long addr = vma->vm_start; | |
705 | unsigned long end = vma->vm_end; | |
cddb8a5c | 706 | int ret; |
1da177e4 | 707 | |
d992895b NP |
708 | /* |
709 | * Don't copy ptes where a page fault will fill them correctly. | |
710 | * Fork becomes much lighter when there are big shared or private | |
711 | * readonly mappings. The tradeoff is that copy_page_range is more | |
712 | * efficient than faulting. | |
713 | */ | |
4d7672b4 | 714 | if (!(vma->vm_flags & (VM_HUGETLB|VM_NONLINEAR|VM_PFNMAP|VM_INSERTPAGE))) { |
d992895b NP |
715 | if (!vma->anon_vma) |
716 | return 0; | |
717 | } | |
718 | ||
1da177e4 LT |
719 | if (is_vm_hugetlb_page(vma)) |
720 | return copy_hugetlb_page_range(dst_mm, src_mm, vma); | |
721 | ||
34801ba9 | 722 | if (unlikely(is_pfn_mapping(vma))) { |
2ab64037 | 723 | /* |
724 | * We do not free on error cases below as remove_vma | |
725 | * gets called on error from higher level routine | |
726 | */ | |
727 | ret = track_pfn_vma_copy(vma); | |
728 | if (ret) | |
729 | return ret; | |
730 | } | |
731 | ||
cddb8a5c AA |
732 | /* |
733 | * We need to invalidate the secondary MMU mappings only when | |
734 | * there could be a permission downgrade on the ptes of the | |
735 | * parent mm. And a permission downgrade will only happen if | |
736 | * is_cow_mapping() returns true. | |
737 | */ | |
738 | if (is_cow_mapping(vma->vm_flags)) | |
739 | mmu_notifier_invalidate_range_start(src_mm, addr, end); | |
740 | ||
741 | ret = 0; | |
1da177e4 LT |
742 | dst_pgd = pgd_offset(dst_mm, addr); |
743 | src_pgd = pgd_offset(src_mm, addr); | |
744 | do { | |
745 | next = pgd_addr_end(addr, end); | |
746 | if (pgd_none_or_clear_bad(src_pgd)) | |
747 | continue; | |
cddb8a5c AA |
748 | if (unlikely(copy_pud_range(dst_mm, src_mm, dst_pgd, src_pgd, |
749 | vma, addr, next))) { | |
750 | ret = -ENOMEM; | |
751 | break; | |
752 | } | |
1da177e4 | 753 | } while (dst_pgd++, src_pgd++, addr = next, addr != end); |
cddb8a5c AA |
754 | |
755 | if (is_cow_mapping(vma->vm_flags)) | |
756 | mmu_notifier_invalidate_range_end(src_mm, | |
757 | vma->vm_start, end); | |
758 | return ret; | |
1da177e4 LT |
759 | } |
760 | ||
51c6f666 | 761 | static unsigned long zap_pte_range(struct mmu_gather *tlb, |
b5810039 | 762 | struct vm_area_struct *vma, pmd_t *pmd, |
1da177e4 | 763 | unsigned long addr, unsigned long end, |
51c6f666 | 764 | long *zap_work, struct zap_details *details) |
1da177e4 | 765 | { |
b5810039 | 766 | struct mm_struct *mm = tlb->mm; |
1da177e4 | 767 | pte_t *pte; |
508034a3 | 768 | spinlock_t *ptl; |
ae859762 HD |
769 | int file_rss = 0; |
770 | int anon_rss = 0; | |
1da177e4 | 771 | |
508034a3 | 772 | pte = pte_offset_map_lock(mm, pmd, addr, &ptl); |
6606c3e0 | 773 | arch_enter_lazy_mmu_mode(); |
1da177e4 LT |
774 | do { |
775 | pte_t ptent = *pte; | |
51c6f666 RH |
776 | if (pte_none(ptent)) { |
777 | (*zap_work)--; | |
1da177e4 | 778 | continue; |
51c6f666 | 779 | } |
6f5e6b9e HD |
780 | |
781 | (*zap_work) -= PAGE_SIZE; | |
782 | ||
1da177e4 | 783 | if (pte_present(ptent)) { |
ee498ed7 | 784 | struct page *page; |
51c6f666 | 785 | |
6aab341e | 786 | page = vm_normal_page(vma, addr, ptent); |
1da177e4 LT |
787 | if (unlikely(details) && page) { |
788 | /* | |
789 | * unmap_shared_mapping_pages() wants to | |
790 | * invalidate cache without truncating: | |
791 | * unmap shared but keep private pages. | |
792 | */ | |
793 | if (details->check_mapping && | |
794 | details->check_mapping != page->mapping) | |
795 | continue; | |
796 | /* | |
797 | * Each page->index must be checked when | |
798 | * invalidating or truncating nonlinear. | |
799 | */ | |
800 | if (details->nonlinear_vma && | |
801 | (page->index < details->first_index || | |
802 | page->index > details->last_index)) | |
803 | continue; | |
804 | } | |
b5810039 | 805 | ptent = ptep_get_and_clear_full(mm, addr, pte, |
a600388d | 806 | tlb->fullmm); |
1da177e4 LT |
807 | tlb_remove_tlb_entry(tlb, pte, addr); |
808 | if (unlikely(!page)) | |
809 | continue; | |
810 | if (unlikely(details) && details->nonlinear_vma | |
811 | && linear_page_index(details->nonlinear_vma, | |
812 | addr) != page->index) | |
b5810039 | 813 | set_pte_at(mm, addr, pte, |
1da177e4 | 814 | pgoff_to_pte(page->index)); |
1da177e4 | 815 | if (PageAnon(page)) |
86d912f4 | 816 | anon_rss--; |
6237bcd9 HD |
817 | else { |
818 | if (pte_dirty(ptent)) | |
819 | set_page_dirty(page); | |
4917e5d0 JW |
820 | if (pte_young(ptent) && |
821 | likely(!VM_SequentialReadHint(vma))) | |
bf3f3bc5 | 822 | mark_page_accessed(page); |
86d912f4 | 823 | file_rss--; |
6237bcd9 | 824 | } |
edc315fd | 825 | page_remove_rmap(page); |
3dc14741 HD |
826 | if (unlikely(page_mapcount(page) < 0)) |
827 | print_bad_pte(vma, addr, ptent, page); | |
1da177e4 LT |
828 | tlb_remove_page(tlb, page); |
829 | continue; | |
830 | } | |
831 | /* | |
832 | * If details->check_mapping, we leave swap entries; | |
833 | * if details->nonlinear_vma, we leave file entries. | |
834 | */ | |
835 | if (unlikely(details)) | |
836 | continue; | |
2509ef26 HD |
837 | if (pte_file(ptent)) { |
838 | if (unlikely(!(vma->vm_flags & VM_NONLINEAR))) | |
839 | print_bad_pte(vma, addr, ptent, NULL); | |
840 | } else if | |
841 | (unlikely(!free_swap_and_cache(pte_to_swp_entry(ptent)))) | |
842 | print_bad_pte(vma, addr, ptent, NULL); | |
9888a1ca | 843 | pte_clear_not_present_full(mm, addr, pte, tlb->fullmm); |
51c6f666 | 844 | } while (pte++, addr += PAGE_SIZE, (addr != end && *zap_work > 0)); |
ae859762 | 845 | |
86d912f4 | 846 | add_mm_rss(mm, file_rss, anon_rss); |
6606c3e0 | 847 | arch_leave_lazy_mmu_mode(); |
508034a3 | 848 | pte_unmap_unlock(pte - 1, ptl); |
51c6f666 RH |
849 | |
850 | return addr; | |
1da177e4 LT |
851 | } |
852 | ||
51c6f666 | 853 | static inline unsigned long zap_pmd_range(struct mmu_gather *tlb, |
b5810039 | 854 | struct vm_area_struct *vma, pud_t *pud, |
1da177e4 | 855 | unsigned long addr, unsigned long end, |
51c6f666 | 856 | long *zap_work, struct zap_details *details) |
1da177e4 LT |
857 | { |
858 | pmd_t *pmd; | |
859 | unsigned long next; | |
860 | ||
861 | pmd = pmd_offset(pud, addr); | |
862 | do { | |
863 | next = pmd_addr_end(addr, end); | |
51c6f666 RH |
864 | if (pmd_none_or_clear_bad(pmd)) { |
865 | (*zap_work)--; | |
1da177e4 | 866 | continue; |
51c6f666 RH |
867 | } |
868 | next = zap_pte_range(tlb, vma, pmd, addr, next, | |
869 | zap_work, details); | |
870 | } while (pmd++, addr = next, (addr != end && *zap_work > 0)); | |
871 | ||
872 | return addr; | |
1da177e4 LT |
873 | } |
874 | ||
51c6f666 | 875 | static inline unsigned long zap_pud_range(struct mmu_gather *tlb, |
b5810039 | 876 | struct vm_area_struct *vma, pgd_t *pgd, |
1da177e4 | 877 | unsigned long addr, unsigned long end, |
51c6f666 | 878 | long *zap_work, struct zap_details *details) |
1da177e4 LT |
879 | { |
880 | pud_t *pud; | |
881 | unsigned long next; | |
882 | ||
883 | pud = pud_offset(pgd, addr); | |
884 | do { | |
885 | next = pud_addr_end(addr, end); | |
51c6f666 RH |
886 | if (pud_none_or_clear_bad(pud)) { |
887 | (*zap_work)--; | |
1da177e4 | 888 | continue; |
51c6f666 RH |
889 | } |
890 | next = zap_pmd_range(tlb, vma, pud, addr, next, | |
891 | zap_work, details); | |
892 | } while (pud++, addr = next, (addr != end && *zap_work > 0)); | |
893 | ||
894 | return addr; | |
1da177e4 LT |
895 | } |
896 | ||
51c6f666 RH |
897 | static unsigned long unmap_page_range(struct mmu_gather *tlb, |
898 | struct vm_area_struct *vma, | |
1da177e4 | 899 | unsigned long addr, unsigned long end, |
51c6f666 | 900 | long *zap_work, struct zap_details *details) |
1da177e4 LT |
901 | { |
902 | pgd_t *pgd; | |
903 | unsigned long next; | |
904 | ||
905 | if (details && !details->check_mapping && !details->nonlinear_vma) | |
906 | details = NULL; | |
907 | ||
908 | BUG_ON(addr >= end); | |
909 | tlb_start_vma(tlb, vma); | |
910 | pgd = pgd_offset(vma->vm_mm, addr); | |
911 | do { | |
912 | next = pgd_addr_end(addr, end); | |
51c6f666 RH |
913 | if (pgd_none_or_clear_bad(pgd)) { |
914 | (*zap_work)--; | |
1da177e4 | 915 | continue; |
51c6f666 RH |
916 | } |
917 | next = zap_pud_range(tlb, vma, pgd, addr, next, | |
918 | zap_work, details); | |
919 | } while (pgd++, addr = next, (addr != end && *zap_work > 0)); | |
1da177e4 | 920 | tlb_end_vma(tlb, vma); |
51c6f666 RH |
921 | |
922 | return addr; | |
1da177e4 LT |
923 | } |
924 | ||
925 | #ifdef CONFIG_PREEMPT | |
926 | # define ZAP_BLOCK_SIZE (8 * PAGE_SIZE) | |
927 | #else | |
928 | /* No preempt: go for improved straight-line efficiency */ | |
929 | # define ZAP_BLOCK_SIZE (1024 * PAGE_SIZE) | |
930 | #endif | |
931 | ||
932 | /** | |
933 | * unmap_vmas - unmap a range of memory covered by a list of vma's | |
934 | * @tlbp: address of the caller's struct mmu_gather | |
1da177e4 LT |
935 | * @vma: the starting vma |
936 | * @start_addr: virtual address at which to start unmapping | |
937 | * @end_addr: virtual address at which to end unmapping | |
938 | * @nr_accounted: Place number of unmapped pages in vm-accountable vma's here | |
939 | * @details: details of nonlinear truncation or shared cache invalidation | |
940 | * | |
ee39b37b | 941 | * Returns the end address of the unmapping (restart addr if interrupted). |
1da177e4 | 942 | * |
508034a3 | 943 | * Unmap all pages in the vma list. |
1da177e4 | 944 | * |
508034a3 HD |
945 | * We aim to not hold locks for too long (for scheduling latency reasons). |
946 | * So zap pages in ZAP_BLOCK_SIZE bytecounts. This means we need to | |
1da177e4 LT |
947 | * return the ending mmu_gather to the caller. |
948 | * | |
949 | * Only addresses between `start' and `end' will be unmapped. | |
950 | * | |
951 | * The VMA list must be sorted in ascending virtual address order. | |
952 | * | |
953 | * unmap_vmas() assumes that the caller will flush the whole unmapped address | |
954 | * range after unmap_vmas() returns. So the only responsibility here is to | |
955 | * ensure that any thus-far unmapped pages are flushed before unmap_vmas() | |
956 | * drops the lock and schedules. | |
957 | */ | |
508034a3 | 958 | unsigned long unmap_vmas(struct mmu_gather **tlbp, |
1da177e4 LT |
959 | struct vm_area_struct *vma, unsigned long start_addr, |
960 | unsigned long end_addr, unsigned long *nr_accounted, | |
961 | struct zap_details *details) | |
962 | { | |
51c6f666 | 963 | long zap_work = ZAP_BLOCK_SIZE; |
1da177e4 LT |
964 | unsigned long tlb_start = 0; /* For tlb_finish_mmu */ |
965 | int tlb_start_valid = 0; | |
ee39b37b | 966 | unsigned long start = start_addr; |
1da177e4 | 967 | spinlock_t *i_mmap_lock = details? details->i_mmap_lock: NULL; |
4d6ddfa9 | 968 | int fullmm = (*tlbp)->fullmm; |
cddb8a5c | 969 | struct mm_struct *mm = vma->vm_mm; |
1da177e4 | 970 | |
cddb8a5c | 971 | mmu_notifier_invalidate_range_start(mm, start_addr, end_addr); |
1da177e4 | 972 | for ( ; vma && vma->vm_start < end_addr; vma = vma->vm_next) { |
1da177e4 LT |
973 | unsigned long end; |
974 | ||
975 | start = max(vma->vm_start, start_addr); | |
976 | if (start >= vma->vm_end) | |
977 | continue; | |
978 | end = min(vma->vm_end, end_addr); | |
979 | if (end <= vma->vm_start) | |
980 | continue; | |
981 | ||
982 | if (vma->vm_flags & VM_ACCOUNT) | |
983 | *nr_accounted += (end - start) >> PAGE_SHIFT; | |
984 | ||
34801ba9 | 985 | if (unlikely(is_pfn_mapping(vma))) |
2ab64037 | 986 | untrack_pfn_vma(vma, 0, 0); |
987 | ||
1da177e4 | 988 | while (start != end) { |
1da177e4 LT |
989 | if (!tlb_start_valid) { |
990 | tlb_start = start; | |
991 | tlb_start_valid = 1; | |
992 | } | |
993 | ||
51c6f666 | 994 | if (unlikely(is_vm_hugetlb_page(vma))) { |
a137e1cc AK |
995 | /* |
996 | * It is undesirable to test vma->vm_file as it | |
997 | * should be non-null for valid hugetlb area. | |
998 | * However, vm_file will be NULL in the error | |
999 | * cleanup path of do_mmap_pgoff. When | |
1000 | * hugetlbfs ->mmap method fails, | |
1001 | * do_mmap_pgoff() nullifies vma->vm_file | |
1002 | * before calling this function to clean up. | |
1003 | * Since no pte has actually been setup, it is | |
1004 | * safe to do nothing in this case. | |
1005 | */ | |
1006 | if (vma->vm_file) { | |
1007 | unmap_hugepage_range(vma, start, end, NULL); | |
1008 | zap_work -= (end - start) / | |
a5516438 | 1009 | pages_per_huge_page(hstate_vma(vma)); |
a137e1cc AK |
1010 | } |
1011 | ||
51c6f666 RH |
1012 | start = end; |
1013 | } else | |
1014 | start = unmap_page_range(*tlbp, vma, | |
1015 | start, end, &zap_work, details); | |
1016 | ||
1017 | if (zap_work > 0) { | |
1018 | BUG_ON(start != end); | |
1019 | break; | |
1da177e4 LT |
1020 | } |
1021 | ||
1da177e4 LT |
1022 | tlb_finish_mmu(*tlbp, tlb_start, start); |
1023 | ||
1024 | if (need_resched() || | |
95c354fe | 1025 | (i_mmap_lock && spin_needbreak(i_mmap_lock))) { |
1da177e4 | 1026 | if (i_mmap_lock) { |
508034a3 | 1027 | *tlbp = NULL; |
1da177e4 LT |
1028 | goto out; |
1029 | } | |
1da177e4 | 1030 | cond_resched(); |
1da177e4 LT |
1031 | } |
1032 | ||
508034a3 | 1033 | *tlbp = tlb_gather_mmu(vma->vm_mm, fullmm); |
1da177e4 | 1034 | tlb_start_valid = 0; |
51c6f666 | 1035 | zap_work = ZAP_BLOCK_SIZE; |
1da177e4 LT |
1036 | } |
1037 | } | |
1038 | out: | |
cddb8a5c | 1039 | mmu_notifier_invalidate_range_end(mm, start_addr, end_addr); |
ee39b37b | 1040 | return start; /* which is now the end (or restart) address */ |
1da177e4 LT |
1041 | } |
1042 | ||
1043 | /** | |
1044 | * zap_page_range - remove user pages in a given range | |
1045 | * @vma: vm_area_struct holding the applicable pages | |
1046 | * @address: starting address of pages to zap | |
1047 | * @size: number of bytes to zap | |
1048 | * @details: details of nonlinear truncation or shared cache invalidation | |
1049 | */ | |
ee39b37b | 1050 | unsigned long zap_page_range(struct vm_area_struct *vma, unsigned long address, |
1da177e4 LT |
1051 | unsigned long size, struct zap_details *details) |
1052 | { | |
1053 | struct mm_struct *mm = vma->vm_mm; | |
1054 | struct mmu_gather *tlb; | |
1055 | unsigned long end = address + size; | |
1056 | unsigned long nr_accounted = 0; | |
1057 | ||
1da177e4 | 1058 | lru_add_drain(); |
1da177e4 | 1059 | tlb = tlb_gather_mmu(mm, 0); |
365e9c87 | 1060 | update_hiwater_rss(mm); |
508034a3 HD |
1061 | end = unmap_vmas(&tlb, vma, address, end, &nr_accounted, details); |
1062 | if (tlb) | |
1063 | tlb_finish_mmu(tlb, address, end); | |
ee39b37b | 1064 | return end; |
1da177e4 LT |
1065 | } |
1066 | ||
c627f9cc JS |
1067 | /** |
1068 | * zap_vma_ptes - remove ptes mapping the vma | |
1069 | * @vma: vm_area_struct holding ptes to be zapped | |
1070 | * @address: starting address of pages to zap | |
1071 | * @size: number of bytes to zap | |
1072 | * | |
1073 | * This function only unmaps ptes assigned to VM_PFNMAP vmas. | |
1074 | * | |
1075 | * The entire address range must be fully contained within the vma. | |
1076 | * | |
1077 | * Returns 0 if successful. | |
1078 | */ | |
1079 | int zap_vma_ptes(struct vm_area_struct *vma, unsigned long address, | |
1080 | unsigned long size) | |
1081 | { | |
1082 | if (address < vma->vm_start || address + size > vma->vm_end || | |
1083 | !(vma->vm_flags & VM_PFNMAP)) | |
1084 | return -1; | |
1085 | zap_page_range(vma, address, size, NULL); | |
1086 | return 0; | |
1087 | } | |
1088 | EXPORT_SYMBOL_GPL(zap_vma_ptes); | |
1089 | ||
1da177e4 LT |
1090 | /* |
1091 | * Do a quick page-table lookup for a single page. | |
1da177e4 | 1092 | */ |
6aab341e | 1093 | struct page *follow_page(struct vm_area_struct *vma, unsigned long address, |
deceb6cd | 1094 | unsigned int flags) |
1da177e4 LT |
1095 | { |
1096 | pgd_t *pgd; | |
1097 | pud_t *pud; | |
1098 | pmd_t *pmd; | |
1099 | pte_t *ptep, pte; | |
deceb6cd | 1100 | spinlock_t *ptl; |
1da177e4 | 1101 | struct page *page; |
6aab341e | 1102 | struct mm_struct *mm = vma->vm_mm; |
1da177e4 | 1103 | |
deceb6cd HD |
1104 | page = follow_huge_addr(mm, address, flags & FOLL_WRITE); |
1105 | if (!IS_ERR(page)) { | |
1106 | BUG_ON(flags & FOLL_GET); | |
1107 | goto out; | |
1108 | } | |
1da177e4 | 1109 | |
deceb6cd | 1110 | page = NULL; |
1da177e4 LT |
1111 | pgd = pgd_offset(mm, address); |
1112 | if (pgd_none(*pgd) || unlikely(pgd_bad(*pgd))) | |
deceb6cd | 1113 | goto no_page_table; |
1da177e4 LT |
1114 | |
1115 | pud = pud_offset(pgd, address); | |
ceb86879 | 1116 | if (pud_none(*pud)) |
deceb6cd | 1117 | goto no_page_table; |
ceb86879 AK |
1118 | if (pud_huge(*pud)) { |
1119 | BUG_ON(flags & FOLL_GET); | |
1120 | page = follow_huge_pud(mm, address, pud, flags & FOLL_WRITE); | |
1121 | goto out; | |
1122 | } | |
1123 | if (unlikely(pud_bad(*pud))) | |
1124 | goto no_page_table; | |
1125 | ||
1da177e4 | 1126 | pmd = pmd_offset(pud, address); |
aeed5fce | 1127 | if (pmd_none(*pmd)) |
deceb6cd | 1128 | goto no_page_table; |
deceb6cd HD |
1129 | if (pmd_huge(*pmd)) { |
1130 | BUG_ON(flags & FOLL_GET); | |
1131 | page = follow_huge_pmd(mm, address, pmd, flags & FOLL_WRITE); | |
1da177e4 | 1132 | goto out; |
deceb6cd | 1133 | } |
aeed5fce HD |
1134 | if (unlikely(pmd_bad(*pmd))) |
1135 | goto no_page_table; | |
1136 | ||
deceb6cd | 1137 | ptep = pte_offset_map_lock(mm, pmd, address, &ptl); |
1da177e4 LT |
1138 | |
1139 | pte = *ptep; | |
deceb6cd | 1140 | if (!pte_present(pte)) |
89f5b7da | 1141 | goto no_page; |
deceb6cd HD |
1142 | if ((flags & FOLL_WRITE) && !pte_write(pte)) |
1143 | goto unlock; | |
6aab341e LT |
1144 | page = vm_normal_page(vma, address, pte); |
1145 | if (unlikely(!page)) | |
89f5b7da | 1146 | goto bad_page; |
1da177e4 | 1147 | |
deceb6cd HD |
1148 | if (flags & FOLL_GET) |
1149 | get_page(page); | |
1150 | if (flags & FOLL_TOUCH) { | |
1151 | if ((flags & FOLL_WRITE) && | |
1152 | !pte_dirty(pte) && !PageDirty(page)) | |
1153 | set_page_dirty(page); | |
bd775c42 KM |
1154 | /* |
1155 | * pte_mkyoung() would be more correct here, but atomic care | |
1156 | * is needed to avoid losing the dirty bit: it is easier to use | |
1157 | * mark_page_accessed(). | |
1158 | */ | |
deceb6cd HD |
1159 | mark_page_accessed(page); |
1160 | } | |
1161 | unlock: | |
1162 | pte_unmap_unlock(ptep, ptl); | |
1da177e4 | 1163 | out: |
deceb6cd | 1164 | return page; |
1da177e4 | 1165 | |
89f5b7da LT |
1166 | bad_page: |
1167 | pte_unmap_unlock(ptep, ptl); | |
1168 | return ERR_PTR(-EFAULT); | |
1169 | ||
1170 | no_page: | |
1171 | pte_unmap_unlock(ptep, ptl); | |
1172 | if (!pte_none(pte)) | |
1173 | return page; | |
1174 | /* Fall through to ZERO_PAGE handling */ | |
deceb6cd HD |
1175 | no_page_table: |
1176 | /* | |
1177 | * When core dumping an enormous anonymous area that nobody | |
1178 | * has touched so far, we don't want to allocate page tables. | |
1179 | */ | |
1180 | if (flags & FOLL_ANON) { | |
557ed1fa | 1181 | page = ZERO_PAGE(0); |
deceb6cd HD |
1182 | if (flags & FOLL_GET) |
1183 | get_page(page); | |
1184 | BUG_ON(flags & FOLL_WRITE); | |
1185 | } | |
1186 | return page; | |
1da177e4 LT |
1187 | } |
1188 | ||
672ca28e LT |
1189 | /* Can we do the FOLL_ANON optimization? */ |
1190 | static inline int use_zero_page(struct vm_area_struct *vma) | |
1191 | { | |
1192 | /* | |
1193 | * We don't want to optimize FOLL_ANON for make_pages_present() | |
1194 | * when it tries to page in a VM_LOCKED region. As to VM_SHARED, | |
1195 | * we want to get the page from the page tables to make sure | |
1196 | * that we serialize and update with any other user of that | |
1197 | * mapping. | |
1198 | */ | |
1199 | if (vma->vm_flags & (VM_LOCKED | VM_SHARED)) | |
1200 | return 0; | |
1201 | /* | |
0d71d10a | 1202 | * And if we have a fault routine, it's not an anonymous region. |
672ca28e | 1203 | */ |
0d71d10a | 1204 | return !vma->vm_ops || !vma->vm_ops->fault; |
672ca28e LT |
1205 | } |
1206 | ||
b291f000 NP |
1207 | |
1208 | ||
1209 | int __get_user_pages(struct task_struct *tsk, struct mm_struct *mm, | |
1210 | unsigned long start, int len, int flags, | |
1da177e4 LT |
1211 | struct page **pages, struct vm_area_struct **vmas) |
1212 | { | |
1213 | int i; | |
b291f000 NP |
1214 | unsigned int vm_flags = 0; |
1215 | int write = !!(flags & GUP_FLAGS_WRITE); | |
1216 | int force = !!(flags & GUP_FLAGS_FORCE); | |
1217 | int ignore = !!(flags & GUP_FLAGS_IGNORE_VMA_PERMISSIONS); | |
4779280d | 1218 | int ignore_sigkill = !!(flags & GUP_FLAGS_IGNORE_SIGKILL); |
1da177e4 | 1219 | |
900cf086 JC |
1220 | if (len <= 0) |
1221 | return 0; | |
1da177e4 LT |
1222 | /* |
1223 | * Require read or write permissions. | |
1224 | * If 'force' is set, we only require the "MAY" flags. | |
1225 | */ | |
deceb6cd HD |
1226 | vm_flags = write ? (VM_WRITE | VM_MAYWRITE) : (VM_READ | VM_MAYREAD); |
1227 | vm_flags &= force ? (VM_MAYREAD | VM_MAYWRITE) : (VM_READ | VM_WRITE); | |
1da177e4 LT |
1228 | i = 0; |
1229 | ||
1230 | do { | |
deceb6cd HD |
1231 | struct vm_area_struct *vma; |
1232 | unsigned int foll_flags; | |
1da177e4 LT |
1233 | |
1234 | vma = find_extend_vma(mm, start); | |
1235 | if (!vma && in_gate_area(tsk, start)) { | |
1236 | unsigned long pg = start & PAGE_MASK; | |
1237 | struct vm_area_struct *gate_vma = get_gate_vma(tsk); | |
1238 | pgd_t *pgd; | |
1239 | pud_t *pud; | |
1240 | pmd_t *pmd; | |
1241 | pte_t *pte; | |
b291f000 NP |
1242 | |
1243 | /* user gate pages are read-only */ | |
1244 | if (!ignore && write) | |
1da177e4 LT |
1245 | return i ? : -EFAULT; |
1246 | if (pg > TASK_SIZE) | |
1247 | pgd = pgd_offset_k(pg); | |
1248 | else | |
1249 | pgd = pgd_offset_gate(mm, pg); | |
1250 | BUG_ON(pgd_none(*pgd)); | |
1251 | pud = pud_offset(pgd, pg); | |
1252 | BUG_ON(pud_none(*pud)); | |
1253 | pmd = pmd_offset(pud, pg); | |
690dbe1c HD |
1254 | if (pmd_none(*pmd)) |
1255 | return i ? : -EFAULT; | |
1da177e4 | 1256 | pte = pte_offset_map(pmd, pg); |
690dbe1c HD |
1257 | if (pte_none(*pte)) { |
1258 | pte_unmap(pte); | |
1259 | return i ? : -EFAULT; | |
1260 | } | |
1da177e4 | 1261 | if (pages) { |
fa2a455b | 1262 | struct page *page = vm_normal_page(gate_vma, start, *pte); |
6aab341e LT |
1263 | pages[i] = page; |
1264 | if (page) | |
1265 | get_page(page); | |
1da177e4 LT |
1266 | } |
1267 | pte_unmap(pte); | |
1268 | if (vmas) | |
1269 | vmas[i] = gate_vma; | |
1270 | i++; | |
1271 | start += PAGE_SIZE; | |
1272 | len--; | |
1273 | continue; | |
1274 | } | |
1275 | ||
b291f000 NP |
1276 | if (!vma || |
1277 | (vma->vm_flags & (VM_IO | VM_PFNMAP)) || | |
1278 | (!ignore && !(vm_flags & vma->vm_flags))) | |
1da177e4 LT |
1279 | return i ? : -EFAULT; |
1280 | ||
1281 | if (is_vm_hugetlb_page(vma)) { | |
1282 | i = follow_hugetlb_page(mm, vma, pages, vmas, | |
5b23dbe8 | 1283 | &start, &len, i, write); |
1da177e4 LT |
1284 | continue; |
1285 | } | |
deceb6cd HD |
1286 | |
1287 | foll_flags = FOLL_TOUCH; | |
1288 | if (pages) | |
1289 | foll_flags |= FOLL_GET; | |
672ca28e | 1290 | if (!write && use_zero_page(vma)) |
deceb6cd HD |
1291 | foll_flags |= FOLL_ANON; |
1292 | ||
1da177e4 | 1293 | do { |
08ef4729 | 1294 | struct page *page; |
1da177e4 | 1295 | |
462e00cc | 1296 | /* |
4779280d YH |
1297 | * If we have a pending SIGKILL, don't keep faulting |
1298 | * pages and potentially allocating memory, unless | |
1299 | * current is handling munlock--e.g., on exit. In | |
1300 | * that case, we are not allocating memory. Rather, | |
1301 | * we're only unlocking already resident/mapped pages. | |
462e00cc | 1302 | */ |
4779280d YH |
1303 | if (unlikely(!ignore_sigkill && |
1304 | fatal_signal_pending(current))) | |
1305 | return i ? i : -ERESTARTSYS; | |
462e00cc | 1306 | |
deceb6cd HD |
1307 | if (write) |
1308 | foll_flags |= FOLL_WRITE; | |
a68d2ebc | 1309 | |
deceb6cd | 1310 | cond_resched(); |
6aab341e | 1311 | while (!(page = follow_page(vma, start, foll_flags))) { |
deceb6cd | 1312 | int ret; |
83c54070 | 1313 | ret = handle_mm_fault(mm, vma, start, |
deceb6cd | 1314 | foll_flags & FOLL_WRITE); |
83c54070 NP |
1315 | if (ret & VM_FAULT_ERROR) { |
1316 | if (ret & VM_FAULT_OOM) | |
1317 | return i ? i : -ENOMEM; | |
1318 | else if (ret & VM_FAULT_SIGBUS) | |
1319 | return i ? i : -EFAULT; | |
1320 | BUG(); | |
1321 | } | |
1322 | if (ret & VM_FAULT_MAJOR) | |
1323 | tsk->maj_flt++; | |
1324 | else | |
1325 | tsk->min_flt++; | |
1326 | ||
a68d2ebc | 1327 | /* |
83c54070 NP |
1328 | * The VM_FAULT_WRITE bit tells us that |
1329 | * do_wp_page has broken COW when necessary, | |
1330 | * even if maybe_mkwrite decided not to set | |
1331 | * pte_write. We can thus safely do subsequent | |
878b63ac HD |
1332 | * page lookups as if they were reads. But only |
1333 | * do so when looping for pte_write is futile: | |
1334 | * in some cases userspace may also be wanting | |
1335 | * to write to the gotten user page, which a | |
1336 | * read fault here might prevent (a readonly | |
1337 | * page might get reCOWed by userspace write). | |
a68d2ebc | 1338 | */ |
878b63ac HD |
1339 | if ((ret & VM_FAULT_WRITE) && |
1340 | !(vma->vm_flags & VM_WRITE)) | |
deceb6cd | 1341 | foll_flags &= ~FOLL_WRITE; |
83c54070 | 1342 | |
7f7bbbe5 | 1343 | cond_resched(); |
1da177e4 | 1344 | } |
89f5b7da LT |
1345 | if (IS_ERR(page)) |
1346 | return i ? i : PTR_ERR(page); | |
1da177e4 | 1347 | if (pages) { |
08ef4729 | 1348 | pages[i] = page; |
03beb076 | 1349 | |
a6f36be3 | 1350 | flush_anon_page(vma, page, start); |
08ef4729 | 1351 | flush_dcache_page(page); |
1da177e4 LT |
1352 | } |
1353 | if (vmas) | |
1354 | vmas[i] = vma; | |
1355 | i++; | |
1356 | start += PAGE_SIZE; | |
1357 | len--; | |
08ef4729 | 1358 | } while (len && start < vma->vm_end); |
08ef4729 | 1359 | } while (len); |
1da177e4 LT |
1360 | return i; |
1361 | } | |
b291f000 NP |
1362 | |
1363 | int get_user_pages(struct task_struct *tsk, struct mm_struct *mm, | |
1364 | unsigned long start, int len, int write, int force, | |
1365 | struct page **pages, struct vm_area_struct **vmas) | |
1366 | { | |
1367 | int flags = 0; | |
1368 | ||
1369 | if (write) | |
1370 | flags |= GUP_FLAGS_WRITE; | |
1371 | if (force) | |
1372 | flags |= GUP_FLAGS_FORCE; | |
1373 | ||
1374 | return __get_user_pages(tsk, mm, | |
1375 | start, len, flags, | |
1376 | pages, vmas); | |
1377 | } | |
1378 | ||
1da177e4 LT |
1379 | EXPORT_SYMBOL(get_user_pages); |
1380 | ||
920c7a5d HH |
1381 | pte_t *get_locked_pte(struct mm_struct *mm, unsigned long addr, |
1382 | spinlock_t **ptl) | |
c9cfcddf LT |
1383 | { |
1384 | pgd_t * pgd = pgd_offset(mm, addr); | |
1385 | pud_t * pud = pud_alloc(mm, pgd, addr); | |
1386 | if (pud) { | |
49c91fb0 | 1387 | pmd_t * pmd = pmd_alloc(mm, pud, addr); |
c9cfcddf LT |
1388 | if (pmd) |
1389 | return pte_alloc_map_lock(mm, pmd, addr, ptl); | |
1390 | } | |
1391 | return NULL; | |
1392 | } | |
1393 | ||
238f58d8 LT |
1394 | /* |
1395 | * This is the old fallback for page remapping. | |
1396 | * | |
1397 | * For historical reasons, it only allows reserved pages. Only | |
1398 | * old drivers should use this, and they needed to mark their | |
1399 | * pages reserved for the old functions anyway. | |
1400 | */ | |
423bad60 NP |
1401 | static int insert_page(struct vm_area_struct *vma, unsigned long addr, |
1402 | struct page *page, pgprot_t prot) | |
238f58d8 | 1403 | { |
423bad60 | 1404 | struct mm_struct *mm = vma->vm_mm; |
238f58d8 | 1405 | int retval; |
c9cfcddf | 1406 | pte_t *pte; |
8a9f3ccd BS |
1407 | spinlock_t *ptl; |
1408 | ||
238f58d8 | 1409 | retval = -EINVAL; |
a145dd41 | 1410 | if (PageAnon(page)) |
5b4e655e | 1411 | goto out; |
238f58d8 LT |
1412 | retval = -ENOMEM; |
1413 | flush_dcache_page(page); | |
c9cfcddf | 1414 | pte = get_locked_pte(mm, addr, &ptl); |
238f58d8 | 1415 | if (!pte) |
5b4e655e | 1416 | goto out; |
238f58d8 LT |
1417 | retval = -EBUSY; |
1418 | if (!pte_none(*pte)) | |
1419 | goto out_unlock; | |
1420 | ||
1421 | /* Ok, finally just insert the thing.. */ | |
1422 | get_page(page); | |
1423 | inc_mm_counter(mm, file_rss); | |
1424 | page_add_file_rmap(page); | |
1425 | set_pte_at(mm, addr, pte, mk_pte(page, prot)); | |
1426 | ||
1427 | retval = 0; | |
8a9f3ccd BS |
1428 | pte_unmap_unlock(pte, ptl); |
1429 | return retval; | |
238f58d8 LT |
1430 | out_unlock: |
1431 | pte_unmap_unlock(pte, ptl); | |
1432 | out: | |
1433 | return retval; | |
1434 | } | |
1435 | ||
bfa5bf6d REB |
1436 | /** |
1437 | * vm_insert_page - insert single page into user vma | |
1438 | * @vma: user vma to map to | |
1439 | * @addr: target user address of this page | |
1440 | * @page: source kernel page | |
1441 | * | |
a145dd41 LT |
1442 | * This allows drivers to insert individual pages they've allocated |
1443 | * into a user vma. | |
1444 | * | |
1445 | * The page has to be a nice clean _individual_ kernel allocation. | |
1446 | * If you allocate a compound page, you need to have marked it as | |
1447 | * such (__GFP_COMP), or manually just split the page up yourself | |
8dfcc9ba | 1448 | * (see split_page()). |
a145dd41 LT |
1449 | * |
1450 | * NOTE! Traditionally this was done with "remap_pfn_range()" which | |
1451 | * took an arbitrary page protection parameter. This doesn't allow | |
1452 | * that. Your vma protection will have to be set up correctly, which | |
1453 | * means that if you want a shared writable mapping, you'd better | |
1454 | * ask for a shared writable mapping! | |
1455 | * | |
1456 | * The page does not need to be reserved. | |
1457 | */ | |
423bad60 NP |
1458 | int vm_insert_page(struct vm_area_struct *vma, unsigned long addr, |
1459 | struct page *page) | |
a145dd41 LT |
1460 | { |
1461 | if (addr < vma->vm_start || addr >= vma->vm_end) | |
1462 | return -EFAULT; | |
1463 | if (!page_count(page)) | |
1464 | return -EINVAL; | |
4d7672b4 | 1465 | vma->vm_flags |= VM_INSERTPAGE; |
423bad60 | 1466 | return insert_page(vma, addr, page, vma->vm_page_prot); |
a145dd41 | 1467 | } |
e3c3374f | 1468 | EXPORT_SYMBOL(vm_insert_page); |
a145dd41 | 1469 | |
423bad60 NP |
1470 | static int insert_pfn(struct vm_area_struct *vma, unsigned long addr, |
1471 | unsigned long pfn, pgprot_t prot) | |
1472 | { | |
1473 | struct mm_struct *mm = vma->vm_mm; | |
1474 | int retval; | |
1475 | pte_t *pte, entry; | |
1476 | spinlock_t *ptl; | |
1477 | ||
1478 | retval = -ENOMEM; | |
1479 | pte = get_locked_pte(mm, addr, &ptl); | |
1480 | if (!pte) | |
1481 | goto out; | |
1482 | retval = -EBUSY; | |
1483 | if (!pte_none(*pte)) | |
1484 | goto out_unlock; | |
1485 | ||
1486 | /* Ok, finally just insert the thing.. */ | |
1487 | entry = pte_mkspecial(pfn_pte(pfn, prot)); | |
1488 | set_pte_at(mm, addr, pte, entry); | |
1489 | update_mmu_cache(vma, addr, entry); /* XXX: why not for insert_page? */ | |
1490 | ||
1491 | retval = 0; | |
1492 | out_unlock: | |
1493 | pte_unmap_unlock(pte, ptl); | |
1494 | out: | |
1495 | return retval; | |
1496 | } | |
1497 | ||
e0dc0d8f NP |
1498 | /** |
1499 | * vm_insert_pfn - insert single pfn into user vma | |
1500 | * @vma: user vma to map to | |
1501 | * @addr: target user address of this page | |
1502 | * @pfn: source kernel pfn | |
1503 | * | |
1504 | * Similar to vm_inert_page, this allows drivers to insert individual pages | |
1505 | * they've allocated into a user vma. Same comments apply. | |
1506 | * | |
1507 | * This function should only be called from a vm_ops->fault handler, and | |
1508 | * in that case the handler should return NULL. | |
0d71d10a NP |
1509 | * |
1510 | * vma cannot be a COW mapping. | |
1511 | * | |
1512 | * As this is called only for pages that do not currently exist, we | |
1513 | * do not need to flush old virtual caches or the TLB. | |
e0dc0d8f NP |
1514 | */ |
1515 | int vm_insert_pfn(struct vm_area_struct *vma, unsigned long addr, | |
423bad60 | 1516 | unsigned long pfn) |
e0dc0d8f | 1517 | { |
2ab64037 | 1518 | int ret; |
e4b866ed | 1519 | pgprot_t pgprot = vma->vm_page_prot; |
7e675137 NP |
1520 | /* |
1521 | * Technically, architectures with pte_special can avoid all these | |
1522 | * restrictions (same for remap_pfn_range). However we would like | |
1523 | * consistency in testing and feature parity among all, so we should | |
1524 | * try to keep these invariants in place for everybody. | |
1525 | */ | |
b379d790 JH |
1526 | BUG_ON(!(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))); |
1527 | BUG_ON((vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP)) == | |
1528 | (VM_PFNMAP|VM_MIXEDMAP)); | |
1529 | BUG_ON((vma->vm_flags & VM_PFNMAP) && is_cow_mapping(vma->vm_flags)); | |
1530 | BUG_ON((vma->vm_flags & VM_MIXEDMAP) && pfn_valid(pfn)); | |
e0dc0d8f | 1531 | |
423bad60 NP |
1532 | if (addr < vma->vm_start || addr >= vma->vm_end) |
1533 | return -EFAULT; | |
e4b866ed | 1534 | if (track_pfn_vma_new(vma, &pgprot, pfn, PAGE_SIZE)) |
2ab64037 | 1535 | return -EINVAL; |
1536 | ||
e4b866ed | 1537 | ret = insert_pfn(vma, addr, pfn, pgprot); |
2ab64037 | 1538 | |
1539 | if (ret) | |
1540 | untrack_pfn_vma(vma, pfn, PAGE_SIZE); | |
1541 | ||
1542 | return ret; | |
423bad60 NP |
1543 | } |
1544 | EXPORT_SYMBOL(vm_insert_pfn); | |
e0dc0d8f | 1545 | |
423bad60 NP |
1546 | int vm_insert_mixed(struct vm_area_struct *vma, unsigned long addr, |
1547 | unsigned long pfn) | |
1548 | { | |
1549 | BUG_ON(!(vma->vm_flags & VM_MIXEDMAP)); | |
e0dc0d8f | 1550 | |
423bad60 NP |
1551 | if (addr < vma->vm_start || addr >= vma->vm_end) |
1552 | return -EFAULT; | |
e0dc0d8f | 1553 | |
423bad60 NP |
1554 | /* |
1555 | * If we don't have pte special, then we have to use the pfn_valid() | |
1556 | * based VM_MIXEDMAP scheme (see vm_normal_page), and thus we *must* | |
1557 | * refcount the page if pfn_valid is true (hence insert_page rather | |
1558 | * than insert_pfn). | |
1559 | */ | |
1560 | if (!HAVE_PTE_SPECIAL && pfn_valid(pfn)) { | |
1561 | struct page *page; | |
1562 | ||
1563 | page = pfn_to_page(pfn); | |
1564 | return insert_page(vma, addr, page, vma->vm_page_prot); | |
1565 | } | |
1566 | return insert_pfn(vma, addr, pfn, vma->vm_page_prot); | |
e0dc0d8f | 1567 | } |
423bad60 | 1568 | EXPORT_SYMBOL(vm_insert_mixed); |
e0dc0d8f | 1569 | |
1da177e4 LT |
1570 | /* |
1571 | * maps a range of physical memory into the requested pages. the old | |
1572 | * mappings are removed. any references to nonexistent pages results | |
1573 | * in null mappings (currently treated as "copy-on-access") | |
1574 | */ | |
1575 | static int remap_pte_range(struct mm_struct *mm, pmd_t *pmd, | |
1576 | unsigned long addr, unsigned long end, | |
1577 | unsigned long pfn, pgprot_t prot) | |
1578 | { | |
1579 | pte_t *pte; | |
c74df32c | 1580 | spinlock_t *ptl; |
1da177e4 | 1581 | |
c74df32c | 1582 | pte = pte_alloc_map_lock(mm, pmd, addr, &ptl); |
1da177e4 LT |
1583 | if (!pte) |
1584 | return -ENOMEM; | |
6606c3e0 | 1585 | arch_enter_lazy_mmu_mode(); |
1da177e4 LT |
1586 | do { |
1587 | BUG_ON(!pte_none(*pte)); | |
7e675137 | 1588 | set_pte_at(mm, addr, pte, pte_mkspecial(pfn_pte(pfn, prot))); |
1da177e4 LT |
1589 | pfn++; |
1590 | } while (pte++, addr += PAGE_SIZE, addr != end); | |
6606c3e0 | 1591 | arch_leave_lazy_mmu_mode(); |
c74df32c | 1592 | pte_unmap_unlock(pte - 1, ptl); |
1da177e4 LT |
1593 | return 0; |
1594 | } | |
1595 | ||
1596 | static inline int remap_pmd_range(struct mm_struct *mm, pud_t *pud, | |
1597 | unsigned long addr, unsigned long end, | |
1598 | unsigned long pfn, pgprot_t prot) | |
1599 | { | |
1600 | pmd_t *pmd; | |
1601 | unsigned long next; | |
1602 | ||
1603 | pfn -= addr >> PAGE_SHIFT; | |
1604 | pmd = pmd_alloc(mm, pud, addr); | |
1605 | if (!pmd) | |
1606 | return -ENOMEM; | |
1607 | do { | |
1608 | next = pmd_addr_end(addr, end); | |
1609 | if (remap_pte_range(mm, pmd, addr, next, | |
1610 | pfn + (addr >> PAGE_SHIFT), prot)) | |
1611 | return -ENOMEM; | |
1612 | } while (pmd++, addr = next, addr != end); | |
1613 | return 0; | |
1614 | } | |
1615 | ||
1616 | static inline int remap_pud_range(struct mm_struct *mm, pgd_t *pgd, | |
1617 | unsigned long addr, unsigned long end, | |
1618 | unsigned long pfn, pgprot_t prot) | |
1619 | { | |
1620 | pud_t *pud; | |
1621 | unsigned long next; | |
1622 | ||
1623 | pfn -= addr >> PAGE_SHIFT; | |
1624 | pud = pud_alloc(mm, pgd, addr); | |
1625 | if (!pud) | |
1626 | return -ENOMEM; | |
1627 | do { | |
1628 | next = pud_addr_end(addr, end); | |
1629 | if (remap_pmd_range(mm, pud, addr, next, | |
1630 | pfn + (addr >> PAGE_SHIFT), prot)) | |
1631 | return -ENOMEM; | |
1632 | } while (pud++, addr = next, addr != end); | |
1633 | return 0; | |
1634 | } | |
1635 | ||
bfa5bf6d REB |
1636 | /** |
1637 | * remap_pfn_range - remap kernel memory to userspace | |
1638 | * @vma: user vma to map to | |
1639 | * @addr: target user address to start at | |
1640 | * @pfn: physical address of kernel memory | |
1641 | * @size: size of map area | |
1642 | * @prot: page protection flags for this mapping | |
1643 | * | |
1644 | * Note: this is only safe if the mm semaphore is held when called. | |
1645 | */ | |
1da177e4 LT |
1646 | int remap_pfn_range(struct vm_area_struct *vma, unsigned long addr, |
1647 | unsigned long pfn, unsigned long size, pgprot_t prot) | |
1648 | { | |
1649 | pgd_t *pgd; | |
1650 | unsigned long next; | |
2d15cab8 | 1651 | unsigned long end = addr + PAGE_ALIGN(size); |
1da177e4 LT |
1652 | struct mm_struct *mm = vma->vm_mm; |
1653 | int err; | |
1654 | ||
1655 | /* | |
1656 | * Physically remapped pages are special. Tell the | |
1657 | * rest of the world about it: | |
1658 | * VM_IO tells people not to look at these pages | |
1659 | * (accesses can have side effects). | |
0b14c179 HD |
1660 | * VM_RESERVED is specified all over the place, because |
1661 | * in 2.4 it kept swapout's vma scan off this vma; but | |
1662 | * in 2.6 the LRU scan won't even find its pages, so this | |
1663 | * flag means no more than count its pages in reserved_vm, | |
1664 | * and omit it from core dump, even when VM_IO turned off. | |
6aab341e LT |
1665 | * VM_PFNMAP tells the core MM that the base pages are just |
1666 | * raw PFN mappings, and do not have a "struct page" associated | |
1667 | * with them. | |
fb155c16 LT |
1668 | * |
1669 | * There's a horrible special case to handle copy-on-write | |
1670 | * behaviour that some programs depend on. We mark the "original" | |
1671 | * un-COW'ed pages by matching them up with "vma->vm_pgoff". | |
1da177e4 | 1672 | */ |
4bb9c5c0 | 1673 | if (addr == vma->vm_start && end == vma->vm_end) { |
fb155c16 | 1674 | vma->vm_pgoff = pfn; |
895791da | 1675 | vma->vm_flags |= VM_PFN_AT_MMAP; |
4bb9c5c0 | 1676 | } else if (is_cow_mapping(vma->vm_flags)) |
3c8bb73a | 1677 | return -EINVAL; |
fb155c16 | 1678 | |
6aab341e | 1679 | vma->vm_flags |= VM_IO | VM_RESERVED | VM_PFNMAP; |
1da177e4 | 1680 | |
e4b866ed | 1681 | err = track_pfn_vma_new(vma, &prot, pfn, PAGE_ALIGN(size)); |
a3670613 | 1682 | if (err) { |
1683 | /* | |
1684 | * To indicate that track_pfn related cleanup is not | |
1685 | * needed from higher level routine calling unmap_vmas | |
1686 | */ | |
1687 | vma->vm_flags &= ~(VM_IO | VM_RESERVED | VM_PFNMAP); | |
895791da | 1688 | vma->vm_flags &= ~VM_PFN_AT_MMAP; |
2ab64037 | 1689 | return -EINVAL; |
a3670613 | 1690 | } |
2ab64037 | 1691 | |
1da177e4 LT |
1692 | BUG_ON(addr >= end); |
1693 | pfn -= addr >> PAGE_SHIFT; | |
1694 | pgd = pgd_offset(mm, addr); | |
1695 | flush_cache_range(vma, addr, end); | |
1da177e4 LT |
1696 | do { |
1697 | next = pgd_addr_end(addr, end); | |
1698 | err = remap_pud_range(mm, pgd, addr, next, | |
1699 | pfn + (addr >> PAGE_SHIFT), prot); | |
1700 | if (err) | |
1701 | break; | |
1702 | } while (pgd++, addr = next, addr != end); | |
2ab64037 | 1703 | |
1704 | if (err) | |
1705 | untrack_pfn_vma(vma, pfn, PAGE_ALIGN(size)); | |
1706 | ||
1da177e4 LT |
1707 | return err; |
1708 | } | |
1709 | EXPORT_SYMBOL(remap_pfn_range); | |
1710 | ||
aee16b3c JF |
1711 | static int apply_to_pte_range(struct mm_struct *mm, pmd_t *pmd, |
1712 | unsigned long addr, unsigned long end, | |
1713 | pte_fn_t fn, void *data) | |
1714 | { | |
1715 | pte_t *pte; | |
1716 | int err; | |
2f569afd | 1717 | pgtable_t token; |
94909914 | 1718 | spinlock_t *uninitialized_var(ptl); |
aee16b3c JF |
1719 | |
1720 | pte = (mm == &init_mm) ? | |
1721 | pte_alloc_kernel(pmd, addr) : | |
1722 | pte_alloc_map_lock(mm, pmd, addr, &ptl); | |
1723 | if (!pte) | |
1724 | return -ENOMEM; | |
1725 | ||
1726 | BUG_ON(pmd_huge(*pmd)); | |
1727 | ||
38e0edb1 JF |
1728 | arch_enter_lazy_mmu_mode(); |
1729 | ||
2f569afd | 1730 | token = pmd_pgtable(*pmd); |
aee16b3c JF |
1731 | |
1732 | do { | |
2f569afd | 1733 | err = fn(pte, token, addr, data); |
aee16b3c JF |
1734 | if (err) |
1735 | break; | |
1736 | } while (pte++, addr += PAGE_SIZE, addr != end); | |
1737 | ||
38e0edb1 JF |
1738 | arch_leave_lazy_mmu_mode(); |
1739 | ||
aee16b3c JF |
1740 | if (mm != &init_mm) |
1741 | pte_unmap_unlock(pte-1, ptl); | |
1742 | return err; | |
1743 | } | |
1744 | ||
1745 | static int apply_to_pmd_range(struct mm_struct *mm, pud_t *pud, | |
1746 | unsigned long addr, unsigned long end, | |
1747 | pte_fn_t fn, void *data) | |
1748 | { | |
1749 | pmd_t *pmd; | |
1750 | unsigned long next; | |
1751 | int err; | |
1752 | ||
ceb86879 AK |
1753 | BUG_ON(pud_huge(*pud)); |
1754 | ||
aee16b3c JF |
1755 | pmd = pmd_alloc(mm, pud, addr); |
1756 | if (!pmd) | |
1757 | return -ENOMEM; | |
1758 | do { | |
1759 | next = pmd_addr_end(addr, end); | |
1760 | err = apply_to_pte_range(mm, pmd, addr, next, fn, data); | |
1761 | if (err) | |
1762 | break; | |
1763 | } while (pmd++, addr = next, addr != end); | |
1764 | return err; | |
1765 | } | |
1766 | ||
1767 | static int apply_to_pud_range(struct mm_struct *mm, pgd_t *pgd, | |
1768 | unsigned long addr, unsigned long end, | |
1769 | pte_fn_t fn, void *data) | |
1770 | { | |
1771 | pud_t *pud; | |
1772 | unsigned long next; | |
1773 | int err; | |
1774 | ||
1775 | pud = pud_alloc(mm, pgd, addr); | |
1776 | if (!pud) | |
1777 | return -ENOMEM; | |
1778 | do { | |
1779 | next = pud_addr_end(addr, end); | |
1780 | err = apply_to_pmd_range(mm, pud, addr, next, fn, data); | |
1781 | if (err) | |
1782 | break; | |
1783 | } while (pud++, addr = next, addr != end); | |
1784 | return err; | |
1785 | } | |
1786 | ||
1787 | /* | |
1788 | * Scan a region of virtual memory, filling in page tables as necessary | |
1789 | * and calling a provided function on each leaf page table. | |
1790 | */ | |
1791 | int apply_to_page_range(struct mm_struct *mm, unsigned long addr, | |
1792 | unsigned long size, pte_fn_t fn, void *data) | |
1793 | { | |
1794 | pgd_t *pgd; | |
1795 | unsigned long next; | |
cddb8a5c | 1796 | unsigned long start = addr, end = addr + size; |
aee16b3c JF |
1797 | int err; |
1798 | ||
1799 | BUG_ON(addr >= end); | |
cddb8a5c | 1800 | mmu_notifier_invalidate_range_start(mm, start, end); |
aee16b3c JF |
1801 | pgd = pgd_offset(mm, addr); |
1802 | do { | |
1803 | next = pgd_addr_end(addr, end); | |
1804 | err = apply_to_pud_range(mm, pgd, addr, next, fn, data); | |
1805 | if (err) | |
1806 | break; | |
1807 | } while (pgd++, addr = next, addr != end); | |
cddb8a5c | 1808 | mmu_notifier_invalidate_range_end(mm, start, end); |
aee16b3c JF |
1809 | return err; |
1810 | } | |
1811 | EXPORT_SYMBOL_GPL(apply_to_page_range); | |
1812 | ||
8f4e2101 HD |
1813 | /* |
1814 | * handle_pte_fault chooses page fault handler according to an entry | |
1815 | * which was read non-atomically. Before making any commitment, on | |
1816 | * those architectures or configurations (e.g. i386 with PAE) which | |
1817 | * might give a mix of unmatched parts, do_swap_page and do_file_page | |
1818 | * must check under lock before unmapping the pte and proceeding | |
1819 | * (but do_wp_page is only called after already making such a check; | |
1820 | * and do_anonymous_page and do_no_page can safely check later on). | |
1821 | */ | |
4c21e2f2 | 1822 | static inline int pte_unmap_same(struct mm_struct *mm, pmd_t *pmd, |
8f4e2101 HD |
1823 | pte_t *page_table, pte_t orig_pte) |
1824 | { | |
1825 | int same = 1; | |
1826 | #if defined(CONFIG_SMP) || defined(CONFIG_PREEMPT) | |
1827 | if (sizeof(pte_t) > sizeof(unsigned long)) { | |
4c21e2f2 HD |
1828 | spinlock_t *ptl = pte_lockptr(mm, pmd); |
1829 | spin_lock(ptl); | |
8f4e2101 | 1830 | same = pte_same(*page_table, orig_pte); |
4c21e2f2 | 1831 | spin_unlock(ptl); |
8f4e2101 HD |
1832 | } |
1833 | #endif | |
1834 | pte_unmap(page_table); | |
1835 | return same; | |
1836 | } | |
1837 | ||
1da177e4 LT |
1838 | /* |
1839 | * Do pte_mkwrite, but only if the vma says VM_WRITE. We do this when | |
1840 | * servicing faults for write access. In the normal case, do always want | |
1841 | * pte_mkwrite. But get_user_pages can cause write faults for mappings | |
1842 | * that do not have writing enabled, when used by access_process_vm. | |
1843 | */ | |
1844 | static inline pte_t maybe_mkwrite(pte_t pte, struct vm_area_struct *vma) | |
1845 | { | |
1846 | if (likely(vma->vm_flags & VM_WRITE)) | |
1847 | pte = pte_mkwrite(pte); | |
1848 | return pte; | |
1849 | } | |
1850 | ||
9de455b2 | 1851 | static inline void cow_user_page(struct page *dst, struct page *src, unsigned long va, struct vm_area_struct *vma) |
6aab341e LT |
1852 | { |
1853 | /* | |
1854 | * If the source page was a PFN mapping, we don't have | |
1855 | * a "struct page" for it. We do a best-effort copy by | |
1856 | * just copying from the original user address. If that | |
1857 | * fails, we just zero-fill it. Live with it. | |
1858 | */ | |
1859 | if (unlikely(!src)) { | |
1860 | void *kaddr = kmap_atomic(dst, KM_USER0); | |
5d2a2dbb LT |
1861 | void __user *uaddr = (void __user *)(va & PAGE_MASK); |
1862 | ||
1863 | /* | |
1864 | * This really shouldn't fail, because the page is there | |
1865 | * in the page tables. But it might just be unreadable, | |
1866 | * in which case we just give up and fill the result with | |
1867 | * zeroes. | |
1868 | */ | |
1869 | if (__copy_from_user_inatomic(kaddr, uaddr, PAGE_SIZE)) | |
6aab341e LT |
1870 | memset(kaddr, 0, PAGE_SIZE); |
1871 | kunmap_atomic(kaddr, KM_USER0); | |
c4ec7b0d | 1872 | flush_dcache_page(dst); |
0ed361de NP |
1873 | } else |
1874 | copy_user_highpage(dst, src, va, vma); | |
6aab341e LT |
1875 | } |
1876 | ||
1da177e4 LT |
1877 | /* |
1878 | * This routine handles present pages, when users try to write | |
1879 | * to a shared page. It is done by copying the page to a new address | |
1880 | * and decrementing the shared-page counter for the old page. | |
1881 | * | |
1da177e4 LT |
1882 | * Note that this routine assumes that the protection checks have been |
1883 | * done by the caller (the low-level page fault routine in most cases). | |
1884 | * Thus we can safely just mark it writable once we've done any necessary | |
1885 | * COW. | |
1886 | * | |
1887 | * We also mark the page dirty at this point even though the page will | |
1888 | * change only once the write actually happens. This avoids a few races, | |
1889 | * and potentially makes it more efficient. | |
1890 | * | |
8f4e2101 HD |
1891 | * We enter with non-exclusive mmap_sem (to exclude vma changes, |
1892 | * but allow concurrent faults), with pte both mapped and locked. | |
1893 | * We return with mmap_sem still held, but pte unmapped and unlocked. | |
1da177e4 | 1894 | */ |
65500d23 HD |
1895 | static int do_wp_page(struct mm_struct *mm, struct vm_area_struct *vma, |
1896 | unsigned long address, pte_t *page_table, pmd_t *pmd, | |
8f4e2101 | 1897 | spinlock_t *ptl, pte_t orig_pte) |
1da177e4 | 1898 | { |
e5bbe4df | 1899 | struct page *old_page, *new_page; |
1da177e4 | 1900 | pte_t entry; |
83c54070 | 1901 | int reuse = 0, ret = 0; |
a200ee18 | 1902 | int page_mkwrite = 0; |
d08b3851 | 1903 | struct page *dirty_page = NULL; |
1da177e4 | 1904 | |
6aab341e | 1905 | old_page = vm_normal_page(vma, address, orig_pte); |
251b97f5 PZ |
1906 | if (!old_page) { |
1907 | /* | |
1908 | * VM_MIXEDMAP !pfn_valid() case | |
1909 | * | |
1910 | * We should not cow pages in a shared writeable mapping. | |
1911 | * Just mark the pages writable as we can't do any dirty | |
1912 | * accounting on raw pfn maps. | |
1913 | */ | |
1914 | if ((vma->vm_flags & (VM_WRITE|VM_SHARED)) == | |
1915 | (VM_WRITE|VM_SHARED)) | |
1916 | goto reuse; | |
6aab341e | 1917 | goto gotten; |
251b97f5 | 1918 | } |
1da177e4 | 1919 | |
d08b3851 | 1920 | /* |
ee6a6457 PZ |
1921 | * Take out anonymous pages first, anonymous shared vmas are |
1922 | * not dirty accountable. | |
d08b3851 | 1923 | */ |
ee6a6457 | 1924 | if (PageAnon(old_page)) { |
ab967d86 HD |
1925 | if (!trylock_page(old_page)) { |
1926 | page_cache_get(old_page); | |
1927 | pte_unmap_unlock(page_table, ptl); | |
1928 | lock_page(old_page); | |
1929 | page_table = pte_offset_map_lock(mm, pmd, address, | |
1930 | &ptl); | |
1931 | if (!pte_same(*page_table, orig_pte)) { | |
1932 | unlock_page(old_page); | |
1933 | page_cache_release(old_page); | |
1934 | goto unlock; | |
1935 | } | |
1936 | page_cache_release(old_page); | |
ee6a6457 | 1937 | } |
7b1fe597 | 1938 | reuse = reuse_swap_page(old_page); |
ab967d86 | 1939 | unlock_page(old_page); |
ee6a6457 | 1940 | } else if (unlikely((vma->vm_flags & (VM_WRITE|VM_SHARED)) == |
d08b3851 | 1941 | (VM_WRITE|VM_SHARED))) { |
ee6a6457 PZ |
1942 | /* |
1943 | * Only catch write-faults on shared writable pages, | |
1944 | * read-only shared pages can get COWed by | |
1945 | * get_user_pages(.write=1, .force=1). | |
1946 | */ | |
9637a5ef DH |
1947 | if (vma->vm_ops && vma->vm_ops->page_mkwrite) { |
1948 | /* | |
1949 | * Notify the address space that the page is about to | |
1950 | * become writable so that it can prohibit this or wait | |
1951 | * for the page to get into an appropriate state. | |
1952 | * | |
1953 | * We do this without the lock held, so that it can | |
1954 | * sleep if it needs to. | |
1955 | */ | |
1956 | page_cache_get(old_page); | |
1957 | pte_unmap_unlock(page_table, ptl); | |
1958 | ||
1959 | if (vma->vm_ops->page_mkwrite(vma, old_page) < 0) | |
1960 | goto unwritable_page; | |
1961 | ||
9637a5ef DH |
1962 | /* |
1963 | * Since we dropped the lock we need to revalidate | |
1964 | * the PTE as someone else may have changed it. If | |
1965 | * they did, we just return, as we can count on the | |
1966 | * MMU to tell us if they didn't also make it writable. | |
1967 | */ | |
1968 | page_table = pte_offset_map_lock(mm, pmd, address, | |
1969 | &ptl); | |
c3704ceb | 1970 | page_cache_release(old_page); |
9637a5ef DH |
1971 | if (!pte_same(*page_table, orig_pte)) |
1972 | goto unlock; | |
a200ee18 PZ |
1973 | |
1974 | page_mkwrite = 1; | |
1da177e4 | 1975 | } |
d08b3851 PZ |
1976 | dirty_page = old_page; |
1977 | get_page(dirty_page); | |
9637a5ef | 1978 | reuse = 1; |
9637a5ef DH |
1979 | } |
1980 | ||
1981 | if (reuse) { | |
251b97f5 | 1982 | reuse: |
9637a5ef DH |
1983 | flush_cache_page(vma, address, pte_pfn(orig_pte)); |
1984 | entry = pte_mkyoung(orig_pte); | |
1985 | entry = maybe_mkwrite(pte_mkdirty(entry), vma); | |
954ffcb3 | 1986 | if (ptep_set_access_flags(vma, address, page_table, entry,1)) |
8dab5241 | 1987 | update_mmu_cache(vma, address, entry); |
9637a5ef DH |
1988 | ret |= VM_FAULT_WRITE; |
1989 | goto unlock; | |
1da177e4 | 1990 | } |
1da177e4 LT |
1991 | |
1992 | /* | |
1993 | * Ok, we need to copy. Oh, well.. | |
1994 | */ | |
b5810039 | 1995 | page_cache_get(old_page); |
920fc356 | 1996 | gotten: |
8f4e2101 | 1997 | pte_unmap_unlock(page_table, ptl); |
1da177e4 LT |
1998 | |
1999 | if (unlikely(anon_vma_prepare(vma))) | |
65500d23 | 2000 | goto oom; |
557ed1fa NP |
2001 | VM_BUG_ON(old_page == ZERO_PAGE(0)); |
2002 | new_page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, vma, address); | |
2003 | if (!new_page) | |
2004 | goto oom; | |
b291f000 NP |
2005 | /* |
2006 | * Don't let another task, with possibly unlocked vma, | |
2007 | * keep the mlocked page. | |
2008 | */ | |
ab92661d | 2009 | if ((vma->vm_flags & VM_LOCKED) && old_page) { |
b291f000 NP |
2010 | lock_page(old_page); /* for LRU manipulation */ |
2011 | clear_page_mlock(old_page); | |
2012 | unlock_page(old_page); | |
2013 | } | |
557ed1fa | 2014 | cow_user_page(new_page, old_page, address, vma); |
0ed361de | 2015 | __SetPageUptodate(new_page); |
65500d23 | 2016 | |
2c26fdd7 | 2017 | if (mem_cgroup_newpage_charge(new_page, mm, GFP_KERNEL)) |
8a9f3ccd BS |
2018 | goto oom_free_new; |
2019 | ||
1da177e4 LT |
2020 | /* |
2021 | * Re-check the pte - we dropped the lock | |
2022 | */ | |
8f4e2101 | 2023 | page_table = pte_offset_map_lock(mm, pmd, address, &ptl); |
65500d23 | 2024 | if (likely(pte_same(*page_table, orig_pte))) { |
920fc356 | 2025 | if (old_page) { |
920fc356 HD |
2026 | if (!PageAnon(old_page)) { |
2027 | dec_mm_counter(mm, file_rss); | |
2028 | inc_mm_counter(mm, anon_rss); | |
2029 | } | |
2030 | } else | |
4294621f | 2031 | inc_mm_counter(mm, anon_rss); |
eca35133 | 2032 | flush_cache_page(vma, address, pte_pfn(orig_pte)); |
65500d23 HD |
2033 | entry = mk_pte(new_page, vma->vm_page_prot); |
2034 | entry = maybe_mkwrite(pte_mkdirty(entry), vma); | |
4ce072f1 SS |
2035 | /* |
2036 | * Clear the pte entry and flush it first, before updating the | |
2037 | * pte with the new entry. This will avoid a race condition | |
2038 | * seen in the presence of one thread doing SMC and another | |
2039 | * thread doing COW. | |
2040 | */ | |
cddb8a5c | 2041 | ptep_clear_flush_notify(vma, address, page_table); |
9617d95e | 2042 | page_add_new_anon_rmap(new_page, vma, address); |
64d6519d LS |
2043 | set_pte_at(mm, address, page_table, entry); |
2044 | update_mmu_cache(vma, address, entry); | |
945754a1 NP |
2045 | if (old_page) { |
2046 | /* | |
2047 | * Only after switching the pte to the new page may | |
2048 | * we remove the mapcount here. Otherwise another | |
2049 | * process may come and find the rmap count decremented | |
2050 | * before the pte is switched to the new page, and | |
2051 | * "reuse" the old page writing into it while our pte | |
2052 | * here still points into it and can be read by other | |
2053 | * threads. | |
2054 | * | |
2055 | * The critical issue is to order this | |
2056 | * page_remove_rmap with the ptp_clear_flush above. | |
2057 | * Those stores are ordered by (if nothing else,) | |
2058 | * the barrier present in the atomic_add_negative | |
2059 | * in page_remove_rmap. | |
2060 | * | |
2061 | * Then the TLB flush in ptep_clear_flush ensures that | |
2062 | * no process can access the old page before the | |
2063 | * decremented mapcount is visible. And the old page | |
2064 | * cannot be reused until after the decremented | |
2065 | * mapcount is visible. So transitively, TLBs to | |
2066 | * old page will be flushed before it can be reused. | |
2067 | */ | |
edc315fd | 2068 | page_remove_rmap(old_page); |
945754a1 NP |
2069 | } |
2070 | ||
1da177e4 LT |
2071 | /* Free the old page.. */ |
2072 | new_page = old_page; | |
f33ea7f4 | 2073 | ret |= VM_FAULT_WRITE; |
8a9f3ccd BS |
2074 | } else |
2075 | mem_cgroup_uncharge_page(new_page); | |
2076 | ||
920fc356 HD |
2077 | if (new_page) |
2078 | page_cache_release(new_page); | |
2079 | if (old_page) | |
2080 | page_cache_release(old_page); | |
65500d23 | 2081 | unlock: |
8f4e2101 | 2082 | pte_unmap_unlock(page_table, ptl); |
d08b3851 | 2083 | if (dirty_page) { |
8f7b3d15 AS |
2084 | if (vma->vm_file) |
2085 | file_update_time(vma->vm_file); | |
2086 | ||
79352894 NP |
2087 | /* |
2088 | * Yes, Virginia, this is actually required to prevent a race | |
2089 | * with clear_page_dirty_for_io() from clearing the page dirty | |
2090 | * bit after it clear all dirty ptes, but before a racing | |
2091 | * do_wp_page installs a dirty pte. | |
2092 | * | |
2093 | * do_no_page is protected similarly. | |
2094 | */ | |
2095 | wait_on_page_locked(dirty_page); | |
a200ee18 | 2096 | set_page_dirty_balance(dirty_page, page_mkwrite); |
d08b3851 PZ |
2097 | put_page(dirty_page); |
2098 | } | |
f33ea7f4 | 2099 | return ret; |
8a9f3ccd | 2100 | oom_free_new: |
6dbf6d3b | 2101 | page_cache_release(new_page); |
65500d23 | 2102 | oom: |
920fc356 HD |
2103 | if (old_page) |
2104 | page_cache_release(old_page); | |
1da177e4 | 2105 | return VM_FAULT_OOM; |
9637a5ef DH |
2106 | |
2107 | unwritable_page: | |
2108 | page_cache_release(old_page); | |
2109 | return VM_FAULT_SIGBUS; | |
1da177e4 LT |
2110 | } |
2111 | ||
2112 | /* | |
2113 | * Helper functions for unmap_mapping_range(). | |
2114 | * | |
2115 | * __ Notes on dropping i_mmap_lock to reduce latency while unmapping __ | |
2116 | * | |
2117 | * We have to restart searching the prio_tree whenever we drop the lock, | |
2118 | * since the iterator is only valid while the lock is held, and anyway | |
2119 | * a later vma might be split and reinserted earlier while lock dropped. | |
2120 | * | |
2121 | * The list of nonlinear vmas could be handled more efficiently, using | |
2122 | * a placeholder, but handle it in the same way until a need is shown. | |
2123 | * It is important to search the prio_tree before nonlinear list: a vma | |
2124 | * may become nonlinear and be shifted from prio_tree to nonlinear list | |
2125 | * while the lock is dropped; but never shifted from list to prio_tree. | |
2126 | * | |
2127 | * In order to make forward progress despite restarting the search, | |
2128 | * vm_truncate_count is used to mark a vma as now dealt with, so we can | |
2129 | * quickly skip it next time around. Since the prio_tree search only | |
2130 | * shows us those vmas affected by unmapping the range in question, we | |
2131 | * can't efficiently keep all vmas in step with mapping->truncate_count: | |
2132 | * so instead reset them all whenever it wraps back to 0 (then go to 1). | |
2133 | * mapping->truncate_count and vma->vm_truncate_count are protected by | |
2134 | * i_mmap_lock. | |
2135 | * | |
2136 | * In order to make forward progress despite repeatedly restarting some | |
ee39b37b | 2137 | * large vma, note the restart_addr from unmap_vmas when it breaks out: |
1da177e4 LT |
2138 | * and restart from that address when we reach that vma again. It might |
2139 | * have been split or merged, shrunk or extended, but never shifted: so | |
2140 | * restart_addr remains valid so long as it remains in the vma's range. | |
2141 | * unmap_mapping_range forces truncate_count to leap over page-aligned | |
2142 | * values so we can save vma's restart_addr in its truncate_count field. | |
2143 | */ | |
2144 | #define is_restart_addr(truncate_count) (!((truncate_count) & ~PAGE_MASK)) | |
2145 | ||
2146 | static void reset_vma_truncate_counts(struct address_space *mapping) | |
2147 | { | |
2148 | struct vm_area_struct *vma; | |
2149 | struct prio_tree_iter iter; | |
2150 | ||
2151 | vma_prio_tree_foreach(vma, &iter, &mapping->i_mmap, 0, ULONG_MAX) | |
2152 | vma->vm_truncate_count = 0; | |
2153 | list_for_each_entry(vma, &mapping->i_mmap_nonlinear, shared.vm_set.list) | |
2154 | vma->vm_truncate_count = 0; | |
2155 | } | |
2156 | ||
2157 | static int unmap_mapping_range_vma(struct vm_area_struct *vma, | |
2158 | unsigned long start_addr, unsigned long end_addr, | |
2159 | struct zap_details *details) | |
2160 | { | |
2161 | unsigned long restart_addr; | |
2162 | int need_break; | |
2163 | ||
d00806b1 NP |
2164 | /* |
2165 | * files that support invalidating or truncating portions of the | |
d0217ac0 | 2166 | * file from under mmaped areas must have their ->fault function |
83c54070 NP |
2167 | * return a locked page (and set VM_FAULT_LOCKED in the return). |
2168 | * This provides synchronisation against concurrent unmapping here. | |
d00806b1 | 2169 | */ |
d00806b1 | 2170 | |
1da177e4 LT |
2171 | again: |
2172 | restart_addr = vma->vm_truncate_count; | |
2173 | if (is_restart_addr(restart_addr) && start_addr < restart_addr) { | |
2174 | start_addr = restart_addr; | |
2175 | if (start_addr >= end_addr) { | |
2176 | /* Top of vma has been split off since last time */ | |
2177 | vma->vm_truncate_count = details->truncate_count; | |
2178 | return 0; | |
2179 | } | |
2180 | } | |
2181 | ||
ee39b37b HD |
2182 | restart_addr = zap_page_range(vma, start_addr, |
2183 | end_addr - start_addr, details); | |
95c354fe | 2184 | need_break = need_resched() || spin_needbreak(details->i_mmap_lock); |
1da177e4 | 2185 | |
ee39b37b | 2186 | if (restart_addr >= end_addr) { |
1da177e4 LT |
2187 | /* We have now completed this vma: mark it so */ |
2188 | vma->vm_truncate_count = details->truncate_count; | |
2189 | if (!need_break) | |
2190 | return 0; | |
2191 | } else { | |
2192 | /* Note restart_addr in vma's truncate_count field */ | |
ee39b37b | 2193 | vma->vm_truncate_count = restart_addr; |
1da177e4 LT |
2194 | if (!need_break) |
2195 | goto again; | |
2196 | } | |
2197 | ||
2198 | spin_unlock(details->i_mmap_lock); | |
2199 | cond_resched(); | |
2200 | spin_lock(details->i_mmap_lock); | |
2201 | return -EINTR; | |
2202 | } | |
2203 | ||
2204 | static inline void unmap_mapping_range_tree(struct prio_tree_root *root, | |
2205 | struct zap_details *details) | |
2206 | { | |
2207 | struct vm_area_struct *vma; | |
2208 | struct prio_tree_iter iter; | |
2209 | pgoff_t vba, vea, zba, zea; | |
2210 | ||
2211 | restart: | |
2212 | vma_prio_tree_foreach(vma, &iter, root, | |
2213 | details->first_index, details->last_index) { | |
2214 | /* Skip quickly over those we have already dealt with */ | |
2215 | if (vma->vm_truncate_count == details->truncate_count) | |
2216 | continue; | |
2217 | ||
2218 | vba = vma->vm_pgoff; | |
2219 | vea = vba + ((vma->vm_end - vma->vm_start) >> PAGE_SHIFT) - 1; | |
2220 | /* Assume for now that PAGE_CACHE_SHIFT == PAGE_SHIFT */ | |
2221 | zba = details->first_index; | |
2222 | if (zba < vba) | |
2223 | zba = vba; | |
2224 | zea = details->last_index; | |
2225 | if (zea > vea) | |
2226 | zea = vea; | |
2227 | ||
2228 | if (unmap_mapping_range_vma(vma, | |
2229 | ((zba - vba) << PAGE_SHIFT) + vma->vm_start, | |
2230 | ((zea - vba + 1) << PAGE_SHIFT) + vma->vm_start, | |
2231 | details) < 0) | |
2232 | goto restart; | |
2233 | } | |
2234 | } | |
2235 | ||
2236 | static inline void unmap_mapping_range_list(struct list_head *head, | |
2237 | struct zap_details *details) | |
2238 | { | |
2239 | struct vm_area_struct *vma; | |
2240 | ||
2241 | /* | |
2242 | * In nonlinear VMAs there is no correspondence between virtual address | |
2243 | * offset and file offset. So we must perform an exhaustive search | |
2244 | * across *all* the pages in each nonlinear VMA, not just the pages | |
2245 | * whose virtual address lies outside the file truncation point. | |
2246 | */ | |
2247 | restart: | |
2248 | list_for_each_entry(vma, head, shared.vm_set.list) { | |
2249 | /* Skip quickly over those we have already dealt with */ | |
2250 | if (vma->vm_truncate_count == details->truncate_count) | |
2251 | continue; | |
2252 | details->nonlinear_vma = vma; | |
2253 | if (unmap_mapping_range_vma(vma, vma->vm_start, | |
2254 | vma->vm_end, details) < 0) | |
2255 | goto restart; | |
2256 | } | |
2257 | } | |
2258 | ||
2259 | /** | |
72fd4a35 | 2260 | * unmap_mapping_range - unmap the portion of all mmaps in the specified address_space corresponding to the specified page range in the underlying file. |
3d41088f | 2261 | * @mapping: the address space containing mmaps to be unmapped. |
1da177e4 LT |
2262 | * @holebegin: byte in first page to unmap, relative to the start of |
2263 | * the underlying file. This will be rounded down to a PAGE_SIZE | |
2264 | * boundary. Note that this is different from vmtruncate(), which | |
2265 | * must keep the partial page. In contrast, we must get rid of | |
2266 | * partial pages. | |
2267 | * @holelen: size of prospective hole in bytes. This will be rounded | |
2268 | * up to a PAGE_SIZE boundary. A holelen of zero truncates to the | |
2269 | * end of the file. | |
2270 | * @even_cows: 1 when truncating a file, unmap even private COWed pages; | |
2271 | * but 0 when invalidating pagecache, don't throw away private data. | |
2272 | */ | |
2273 | void unmap_mapping_range(struct address_space *mapping, | |
2274 | loff_t const holebegin, loff_t const holelen, int even_cows) | |
2275 | { | |
2276 | struct zap_details details; | |
2277 | pgoff_t hba = holebegin >> PAGE_SHIFT; | |
2278 | pgoff_t hlen = (holelen + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
2279 | ||
2280 | /* Check for overflow. */ | |
2281 | if (sizeof(holelen) > sizeof(hlen)) { | |
2282 | long long holeend = | |
2283 | (holebegin + holelen + PAGE_SIZE - 1) >> PAGE_SHIFT; | |
2284 | if (holeend & ~(long long)ULONG_MAX) | |
2285 | hlen = ULONG_MAX - hba + 1; | |
2286 | } | |
2287 | ||
2288 | details.check_mapping = even_cows? NULL: mapping; | |
2289 | details.nonlinear_vma = NULL; | |
2290 | details.first_index = hba; | |
2291 | details.last_index = hba + hlen - 1; | |
2292 | if (details.last_index < details.first_index) | |
2293 | details.last_index = ULONG_MAX; | |
2294 | details.i_mmap_lock = &mapping->i_mmap_lock; | |
2295 | ||
2296 | spin_lock(&mapping->i_mmap_lock); | |
2297 | ||
d00806b1 | 2298 | /* Protect against endless unmapping loops */ |
1da177e4 | 2299 | mapping->truncate_count++; |
1da177e4 LT |
2300 | if (unlikely(is_restart_addr(mapping->truncate_count))) { |
2301 | if (mapping->truncate_count == 0) | |
2302 | reset_vma_truncate_counts(mapping); | |
2303 | mapping->truncate_count++; | |
2304 | } | |
2305 | details.truncate_count = mapping->truncate_count; | |
2306 | ||
2307 | if (unlikely(!prio_tree_empty(&mapping->i_mmap))) | |
2308 | unmap_mapping_range_tree(&mapping->i_mmap, &details); | |
2309 | if (unlikely(!list_empty(&mapping->i_mmap_nonlinear))) | |
2310 | unmap_mapping_range_list(&mapping->i_mmap_nonlinear, &details); | |
2311 | spin_unlock(&mapping->i_mmap_lock); | |
2312 | } | |
2313 | EXPORT_SYMBOL(unmap_mapping_range); | |
2314 | ||
bfa5bf6d REB |
2315 | /** |
2316 | * vmtruncate - unmap mappings "freed" by truncate() syscall | |
2317 | * @inode: inode of the file used | |
2318 | * @offset: file offset to start truncating | |
1da177e4 LT |
2319 | * |
2320 | * NOTE! We have to be ready to update the memory sharing | |
2321 | * between the file and the memory map for a potential last | |
2322 | * incomplete page. Ugly, but necessary. | |
2323 | */ | |
2324 | int vmtruncate(struct inode * inode, loff_t offset) | |
2325 | { | |
61d5048f CH |
2326 | if (inode->i_size < offset) { |
2327 | unsigned long limit; | |
2328 | ||
2329 | limit = current->signal->rlim[RLIMIT_FSIZE].rlim_cur; | |
2330 | if (limit != RLIM_INFINITY && offset > limit) | |
2331 | goto out_sig; | |
2332 | if (offset > inode->i_sb->s_maxbytes) | |
2333 | goto out_big; | |
2334 | i_size_write(inode, offset); | |
2335 | } else { | |
2336 | struct address_space *mapping = inode->i_mapping; | |
1da177e4 | 2337 | |
61d5048f CH |
2338 | /* |
2339 | * truncation of in-use swapfiles is disallowed - it would | |
2340 | * cause subsequent swapout to scribble on the now-freed | |
2341 | * blocks. | |
2342 | */ | |
2343 | if (IS_SWAPFILE(inode)) | |
2344 | return -ETXTBSY; | |
2345 | i_size_write(inode, offset); | |
2346 | ||
2347 | /* | |
2348 | * unmap_mapping_range is called twice, first simply for | |
2349 | * efficiency so that truncate_inode_pages does fewer | |
2350 | * single-page unmaps. However after this first call, and | |
2351 | * before truncate_inode_pages finishes, it is possible for | |
2352 | * private pages to be COWed, which remain after | |
2353 | * truncate_inode_pages finishes, hence the second | |
2354 | * unmap_mapping_range call must be made for correctness. | |
2355 | */ | |
2356 | unmap_mapping_range(mapping, offset + PAGE_SIZE - 1, 0, 1); | |
2357 | truncate_inode_pages(mapping, offset); | |
2358 | unmap_mapping_range(mapping, offset + PAGE_SIZE - 1, 0, 1); | |
2359 | } | |
d00806b1 | 2360 | |
acfa4380 | 2361 | if (inode->i_op->truncate) |
1da177e4 LT |
2362 | inode->i_op->truncate(inode); |
2363 | return 0; | |
61d5048f | 2364 | |
1da177e4 LT |
2365 | out_sig: |
2366 | send_sig(SIGXFSZ, current, 0); | |
2367 | out_big: | |
2368 | return -EFBIG; | |
1da177e4 | 2369 | } |
1da177e4 LT |
2370 | EXPORT_SYMBOL(vmtruncate); |
2371 | ||
f6b3ec23 BP |
2372 | int vmtruncate_range(struct inode *inode, loff_t offset, loff_t end) |
2373 | { | |
2374 | struct address_space *mapping = inode->i_mapping; | |
2375 | ||
2376 | /* | |
2377 | * If the underlying filesystem is not going to provide | |
2378 | * a way to truncate a range of blocks (punch a hole) - | |
2379 | * we should return failure right now. | |
2380 | */ | |
acfa4380 | 2381 | if (!inode->i_op->truncate_range) |
f6b3ec23 BP |
2382 | return -ENOSYS; |
2383 | ||
1b1dcc1b | 2384 | mutex_lock(&inode->i_mutex); |
f6b3ec23 BP |
2385 | down_write(&inode->i_alloc_sem); |
2386 | unmap_mapping_range(mapping, offset, (end - offset), 1); | |
2387 | truncate_inode_pages_range(mapping, offset, end); | |
d00806b1 | 2388 | unmap_mapping_range(mapping, offset, (end - offset), 1); |
f6b3ec23 BP |
2389 | inode->i_op->truncate_range(inode, offset, end); |
2390 | up_write(&inode->i_alloc_sem); | |
1b1dcc1b | 2391 | mutex_unlock(&inode->i_mutex); |
f6b3ec23 BP |
2392 | |
2393 | return 0; | |
2394 | } | |
f6b3ec23 | 2395 | |
1da177e4 | 2396 | /* |
8f4e2101 HD |
2397 | * We enter with non-exclusive mmap_sem (to exclude vma changes, |
2398 | * but allow concurrent faults), and pte mapped but not yet locked. | |
2399 | * We return with mmap_sem still held, but pte unmapped and unlocked. | |
1da177e4 | 2400 | */ |
65500d23 HD |
2401 | static int do_swap_page(struct mm_struct *mm, struct vm_area_struct *vma, |
2402 | unsigned long address, pte_t *page_table, pmd_t *pmd, | |
2403 | int write_access, pte_t orig_pte) | |
1da177e4 | 2404 | { |
8f4e2101 | 2405 | spinlock_t *ptl; |
1da177e4 | 2406 | struct page *page; |
65500d23 | 2407 | swp_entry_t entry; |
1da177e4 | 2408 | pte_t pte; |
7a81b88c | 2409 | struct mem_cgroup *ptr = NULL; |
83c54070 | 2410 | int ret = 0; |
1da177e4 | 2411 | |
4c21e2f2 | 2412 | if (!pte_unmap_same(mm, pmd, page_table, orig_pte)) |
8f4e2101 | 2413 | goto out; |
65500d23 HD |
2414 | |
2415 | entry = pte_to_swp_entry(orig_pte); | |
0697212a CL |
2416 | if (is_migration_entry(entry)) { |
2417 | migration_entry_wait(mm, pmd, address); | |
2418 | goto out; | |
2419 | } | |
0ff92245 | 2420 | delayacct_set_flag(DELAYACCT_PF_SWAPIN); |
1da177e4 LT |
2421 | page = lookup_swap_cache(entry); |
2422 | if (!page) { | |
098fe651 | 2423 | grab_swap_token(); /* Contend for token _before_ read-in */ |
02098fea HD |
2424 | page = swapin_readahead(entry, |
2425 | GFP_HIGHUSER_MOVABLE, vma, address); | |
1da177e4 LT |
2426 | if (!page) { |
2427 | /* | |
8f4e2101 HD |
2428 | * Back out if somebody else faulted in this pte |
2429 | * while we released the pte lock. | |
1da177e4 | 2430 | */ |
8f4e2101 | 2431 | page_table = pte_offset_map_lock(mm, pmd, address, &ptl); |
1da177e4 LT |
2432 | if (likely(pte_same(*page_table, orig_pte))) |
2433 | ret = VM_FAULT_OOM; | |
0ff92245 | 2434 | delayacct_clear_flag(DELAYACCT_PF_SWAPIN); |
65500d23 | 2435 | goto unlock; |
1da177e4 LT |
2436 | } |
2437 | ||
2438 | /* Had to read the page from swap area: Major fault */ | |
2439 | ret = VM_FAULT_MAJOR; | |
f8891e5e | 2440 | count_vm_event(PGMAJFAULT); |
1da177e4 LT |
2441 | } |
2442 | ||
073e587e KH |
2443 | lock_page(page); |
2444 | delayacct_clear_flag(DELAYACCT_PF_SWAPIN); | |
2445 | ||
2c26fdd7 | 2446 | if (mem_cgroup_try_charge_swapin(mm, page, GFP_KERNEL, &ptr)) { |
8a9f3ccd | 2447 | ret = VM_FAULT_OOM; |
073e587e | 2448 | unlock_page(page); |
8a9f3ccd BS |
2449 | goto out; |
2450 | } | |
2451 | ||
1da177e4 | 2452 | /* |
8f4e2101 | 2453 | * Back out if somebody else already faulted in this pte. |
1da177e4 | 2454 | */ |
8f4e2101 | 2455 | page_table = pte_offset_map_lock(mm, pmd, address, &ptl); |
9e9bef07 | 2456 | if (unlikely(!pte_same(*page_table, orig_pte))) |
b8107480 | 2457 | goto out_nomap; |
b8107480 KK |
2458 | |
2459 | if (unlikely(!PageUptodate(page))) { | |
2460 | ret = VM_FAULT_SIGBUS; | |
2461 | goto out_nomap; | |
1da177e4 LT |
2462 | } |
2463 | ||
8c7c6e34 KH |
2464 | /* |
2465 | * The page isn't present yet, go ahead with the fault. | |
2466 | * | |
2467 | * Be careful about the sequence of operations here. | |
2468 | * To get its accounting right, reuse_swap_page() must be called | |
2469 | * while the page is counted on swap but not yet in mapcount i.e. | |
2470 | * before page_add_anon_rmap() and swap_free(); try_to_free_swap() | |
2471 | * must be called after the swap_free(), or it will never succeed. | |
03f3c433 KH |
2472 | * Because delete_from_swap_page() may be called by reuse_swap_page(), |
2473 | * mem_cgroup_commit_charge_swapin() may not be able to find swp_entry | |
2474 | * in page->private. In this case, a record in swap_cgroup is silently | |
2475 | * discarded at swap_free(). | |
8c7c6e34 | 2476 | */ |
1da177e4 | 2477 | |
4294621f | 2478 | inc_mm_counter(mm, anon_rss); |
1da177e4 | 2479 | pte = mk_pte(page, vma->vm_page_prot); |
7b1fe597 | 2480 | if (write_access && reuse_swap_page(page)) { |
1da177e4 LT |
2481 | pte = maybe_mkwrite(pte_mkdirty(pte), vma); |
2482 | write_access = 0; | |
2483 | } | |
1da177e4 LT |
2484 | flush_icache_page(vma, page); |
2485 | set_pte_at(mm, address, page_table, pte); | |
2486 | page_add_anon_rmap(page, vma, address); | |
03f3c433 KH |
2487 | /* It's better to call commit-charge after rmap is established */ |
2488 | mem_cgroup_commit_charge_swapin(page, ptr); | |
1da177e4 | 2489 | |
c475a8ab | 2490 | swap_free(entry); |
b291f000 | 2491 | if (vm_swap_full() || (vma->vm_flags & VM_LOCKED) || PageMlocked(page)) |
a2c43eed | 2492 | try_to_free_swap(page); |
c475a8ab HD |
2493 | unlock_page(page); |
2494 | ||
1da177e4 | 2495 | if (write_access) { |
61469f1d HD |
2496 | ret |= do_wp_page(mm, vma, address, page_table, pmd, ptl, pte); |
2497 | if (ret & VM_FAULT_ERROR) | |
2498 | ret &= VM_FAULT_ERROR; | |
1da177e4 LT |
2499 | goto out; |
2500 | } | |
2501 | ||
2502 | /* No need to invalidate - it was non-present before */ | |
2503 | update_mmu_cache(vma, address, pte); | |
65500d23 | 2504 | unlock: |
8f4e2101 | 2505 | pte_unmap_unlock(page_table, ptl); |
1da177e4 LT |
2506 | out: |
2507 | return ret; | |
b8107480 | 2508 | out_nomap: |
7a81b88c | 2509 | mem_cgroup_cancel_charge_swapin(ptr); |
8f4e2101 | 2510 | pte_unmap_unlock(page_table, ptl); |
b8107480 KK |
2511 | unlock_page(page); |
2512 | page_cache_release(page); | |
65500d23 | 2513 | return ret; |
1da177e4 LT |
2514 | } |
2515 | ||
2516 | /* | |
8f4e2101 HD |
2517 | * We enter with non-exclusive mmap_sem (to exclude vma changes, |
2518 | * but allow concurrent faults), and pte mapped but not yet locked. | |
2519 | * We return with mmap_sem still held, but pte unmapped and unlocked. | |
1da177e4 | 2520 | */ |
65500d23 HD |
2521 | static int do_anonymous_page(struct mm_struct *mm, struct vm_area_struct *vma, |
2522 | unsigned long address, pte_t *page_table, pmd_t *pmd, | |
2523 | int write_access) | |
1da177e4 | 2524 | { |
8f4e2101 HD |
2525 | struct page *page; |
2526 | spinlock_t *ptl; | |
1da177e4 | 2527 | pte_t entry; |
1da177e4 | 2528 | |
557ed1fa NP |
2529 | /* Allocate our own private page. */ |
2530 | pte_unmap(page_table); | |
8f4e2101 | 2531 | |
557ed1fa NP |
2532 | if (unlikely(anon_vma_prepare(vma))) |
2533 | goto oom; | |
2534 | page = alloc_zeroed_user_highpage_movable(vma, address); | |
2535 | if (!page) | |
2536 | goto oom; | |
0ed361de | 2537 | __SetPageUptodate(page); |
8f4e2101 | 2538 | |
2c26fdd7 | 2539 | if (mem_cgroup_newpage_charge(page, mm, GFP_KERNEL)) |
8a9f3ccd BS |
2540 | goto oom_free_page; |
2541 | ||
557ed1fa NP |
2542 | entry = mk_pte(page, vma->vm_page_prot); |
2543 | entry = maybe_mkwrite(pte_mkdirty(entry), vma); | |
1da177e4 | 2544 | |
557ed1fa NP |
2545 | page_table = pte_offset_map_lock(mm, pmd, address, &ptl); |
2546 | if (!pte_none(*page_table)) | |
2547 | goto release; | |
2548 | inc_mm_counter(mm, anon_rss); | |
557ed1fa | 2549 | page_add_new_anon_rmap(page, vma, address); |
65500d23 | 2550 | set_pte_at(mm, address, page_table, entry); |
1da177e4 LT |
2551 | |
2552 | /* No need to invalidate - it was non-present before */ | |
65500d23 | 2553 | update_mmu_cache(vma, address, entry); |
65500d23 | 2554 | unlock: |
8f4e2101 | 2555 | pte_unmap_unlock(page_table, ptl); |
83c54070 | 2556 | return 0; |
8f4e2101 | 2557 | release: |
8a9f3ccd | 2558 | mem_cgroup_uncharge_page(page); |
8f4e2101 HD |
2559 | page_cache_release(page); |
2560 | goto unlock; | |
8a9f3ccd | 2561 | oom_free_page: |
6dbf6d3b | 2562 | page_cache_release(page); |
65500d23 | 2563 | oom: |
1da177e4 LT |
2564 | return VM_FAULT_OOM; |
2565 | } | |
2566 | ||
2567 | /* | |
54cb8821 | 2568 | * __do_fault() tries to create a new page mapping. It aggressively |
1da177e4 | 2569 | * tries to share with existing pages, but makes a separate copy if |
54cb8821 NP |
2570 | * the FAULT_FLAG_WRITE is set in the flags parameter in order to avoid |
2571 | * the next page fault. | |
1da177e4 LT |
2572 | * |
2573 | * As this is called only for pages that do not currently exist, we | |
2574 | * do not need to flush old virtual caches or the TLB. | |
2575 | * | |
8f4e2101 | 2576 | * We enter with non-exclusive mmap_sem (to exclude vma changes, |
16abfa08 | 2577 | * but allow concurrent faults), and pte neither mapped nor locked. |
8f4e2101 | 2578 | * We return with mmap_sem still held, but pte unmapped and unlocked. |
1da177e4 | 2579 | */ |
54cb8821 | 2580 | static int __do_fault(struct mm_struct *mm, struct vm_area_struct *vma, |
16abfa08 | 2581 | unsigned long address, pmd_t *pmd, |
54cb8821 | 2582 | pgoff_t pgoff, unsigned int flags, pte_t orig_pte) |
1da177e4 | 2583 | { |
16abfa08 | 2584 | pte_t *page_table; |
8f4e2101 | 2585 | spinlock_t *ptl; |
d0217ac0 | 2586 | struct page *page; |
1da177e4 | 2587 | pte_t entry; |
1da177e4 | 2588 | int anon = 0; |
5b4e655e | 2589 | int charged = 0; |
d08b3851 | 2590 | struct page *dirty_page = NULL; |
d0217ac0 NP |
2591 | struct vm_fault vmf; |
2592 | int ret; | |
a200ee18 | 2593 | int page_mkwrite = 0; |
54cb8821 | 2594 | |
d0217ac0 NP |
2595 | vmf.virtual_address = (void __user *)(address & PAGE_MASK); |
2596 | vmf.pgoff = pgoff; | |
2597 | vmf.flags = flags; | |
2598 | vmf.page = NULL; | |
1da177e4 | 2599 | |
3c18ddd1 NP |
2600 | ret = vma->vm_ops->fault(vma, &vmf); |
2601 | if (unlikely(ret & (VM_FAULT_ERROR | VM_FAULT_NOPAGE))) | |
2602 | return ret; | |
1da177e4 | 2603 | |
d00806b1 | 2604 | /* |
d0217ac0 | 2605 | * For consistency in subsequent calls, make the faulted page always |
d00806b1 NP |
2606 | * locked. |
2607 | */ | |
83c54070 | 2608 | if (unlikely(!(ret & VM_FAULT_LOCKED))) |
d0217ac0 | 2609 | lock_page(vmf.page); |
54cb8821 | 2610 | else |
d0217ac0 | 2611 | VM_BUG_ON(!PageLocked(vmf.page)); |
d00806b1 | 2612 | |
1da177e4 LT |
2613 | /* |
2614 | * Should we do an early C-O-W break? | |
2615 | */ | |
d0217ac0 | 2616 | page = vmf.page; |
54cb8821 | 2617 | if (flags & FAULT_FLAG_WRITE) { |
9637a5ef | 2618 | if (!(vma->vm_flags & VM_SHARED)) { |
54cb8821 | 2619 | anon = 1; |
d00806b1 | 2620 | if (unlikely(anon_vma_prepare(vma))) { |
d0217ac0 | 2621 | ret = VM_FAULT_OOM; |
54cb8821 | 2622 | goto out; |
d00806b1 | 2623 | } |
83c54070 NP |
2624 | page = alloc_page_vma(GFP_HIGHUSER_MOVABLE, |
2625 | vma, address); | |
d00806b1 | 2626 | if (!page) { |
d0217ac0 | 2627 | ret = VM_FAULT_OOM; |
54cb8821 | 2628 | goto out; |
d00806b1 | 2629 | } |
2c26fdd7 | 2630 | if (mem_cgroup_newpage_charge(page, mm, GFP_KERNEL)) { |
5b4e655e KH |
2631 | ret = VM_FAULT_OOM; |
2632 | page_cache_release(page); | |
2633 | goto out; | |
2634 | } | |
2635 | charged = 1; | |
b291f000 NP |
2636 | /* |
2637 | * Don't let another task, with possibly unlocked vma, | |
2638 | * keep the mlocked page. | |
2639 | */ | |
2640 | if (vma->vm_flags & VM_LOCKED) | |
2641 | clear_page_mlock(vmf.page); | |
d0217ac0 | 2642 | copy_user_highpage(page, vmf.page, address, vma); |
0ed361de | 2643 | __SetPageUptodate(page); |
9637a5ef | 2644 | } else { |
54cb8821 NP |
2645 | /* |
2646 | * If the page will be shareable, see if the backing | |
9637a5ef | 2647 | * address space wants to know that the page is about |
54cb8821 NP |
2648 | * to become writable |
2649 | */ | |
69676147 MF |
2650 | if (vma->vm_ops->page_mkwrite) { |
2651 | unlock_page(page); | |
2652 | if (vma->vm_ops->page_mkwrite(vma, page) < 0) { | |
d0217ac0 NP |
2653 | ret = VM_FAULT_SIGBUS; |
2654 | anon = 1; /* no anon but release vmf.page */ | |
69676147 MF |
2655 | goto out_unlocked; |
2656 | } | |
2657 | lock_page(page); | |
d0217ac0 NP |
2658 | /* |
2659 | * XXX: this is not quite right (racy vs | |
2660 | * invalidate) to unlock and relock the page | |
2661 | * like this, however a better fix requires | |
2662 | * reworking page_mkwrite locking API, which | |
2663 | * is better done later. | |
2664 | */ | |
2665 | if (!page->mapping) { | |
83c54070 | 2666 | ret = 0; |
d0217ac0 NP |
2667 | anon = 1; /* no anon but release vmf.page */ |
2668 | goto out; | |
2669 | } | |
a200ee18 | 2670 | page_mkwrite = 1; |
9637a5ef DH |
2671 | } |
2672 | } | |
54cb8821 | 2673 | |
1da177e4 LT |
2674 | } |
2675 | ||
8f4e2101 | 2676 | page_table = pte_offset_map_lock(mm, pmd, address, &ptl); |
1da177e4 LT |
2677 | |
2678 | /* | |
2679 | * This silly early PAGE_DIRTY setting removes a race | |
2680 | * due to the bad i386 page protection. But it's valid | |
2681 | * for other architectures too. | |
2682 | * | |
2683 | * Note that if write_access is true, we either now have | |
2684 | * an exclusive copy of the page, or this is a shared mapping, | |
2685 | * so we can make it writable and dirty to avoid having to | |
2686 | * handle that later. | |
2687 | */ | |
2688 | /* Only go through if we didn't race with anybody else... */ | |
54cb8821 | 2689 | if (likely(pte_same(*page_table, orig_pte))) { |
d00806b1 NP |
2690 | flush_icache_page(vma, page); |
2691 | entry = mk_pte(page, vma->vm_page_prot); | |
54cb8821 | 2692 | if (flags & FAULT_FLAG_WRITE) |
1da177e4 | 2693 | entry = maybe_mkwrite(pte_mkdirty(entry), vma); |
1da177e4 | 2694 | if (anon) { |
64d6519d | 2695 | inc_mm_counter(mm, anon_rss); |
64d6519d | 2696 | page_add_new_anon_rmap(page, vma, address); |
f57e88a8 | 2697 | } else { |
4294621f | 2698 | inc_mm_counter(mm, file_rss); |
d00806b1 | 2699 | page_add_file_rmap(page); |
54cb8821 | 2700 | if (flags & FAULT_FLAG_WRITE) { |
d00806b1 | 2701 | dirty_page = page; |
d08b3851 PZ |
2702 | get_page(dirty_page); |
2703 | } | |
4294621f | 2704 | } |
64d6519d | 2705 | set_pte_at(mm, address, page_table, entry); |
d00806b1 NP |
2706 | |
2707 | /* no need to invalidate: a not-present page won't be cached */ | |
2708 | update_mmu_cache(vma, address, entry); | |
1da177e4 | 2709 | } else { |
5b4e655e KH |
2710 | if (charged) |
2711 | mem_cgroup_uncharge_page(page); | |
d00806b1 NP |
2712 | if (anon) |
2713 | page_cache_release(page); | |
2714 | else | |
54cb8821 | 2715 | anon = 1; /* no anon but release faulted_page */ |
1da177e4 LT |
2716 | } |
2717 | ||
8f4e2101 | 2718 | pte_unmap_unlock(page_table, ptl); |
d00806b1 NP |
2719 | |
2720 | out: | |
d0217ac0 | 2721 | unlock_page(vmf.page); |
69676147 | 2722 | out_unlocked: |
d00806b1 | 2723 | if (anon) |
d0217ac0 | 2724 | page_cache_release(vmf.page); |
d00806b1 | 2725 | else if (dirty_page) { |
8f7b3d15 AS |
2726 | if (vma->vm_file) |
2727 | file_update_time(vma->vm_file); | |
2728 | ||
a200ee18 | 2729 | set_page_dirty_balance(dirty_page, page_mkwrite); |
d08b3851 PZ |
2730 | put_page(dirty_page); |
2731 | } | |
d00806b1 | 2732 | |
83c54070 | 2733 | return ret; |
54cb8821 | 2734 | } |
d00806b1 | 2735 | |
54cb8821 NP |
2736 | static int do_linear_fault(struct mm_struct *mm, struct vm_area_struct *vma, |
2737 | unsigned long address, pte_t *page_table, pmd_t *pmd, | |
2738 | int write_access, pte_t orig_pte) | |
2739 | { | |
2740 | pgoff_t pgoff = (((address & PAGE_MASK) | |
0da7e01f | 2741 | - vma->vm_start) >> PAGE_SHIFT) + vma->vm_pgoff; |
54cb8821 NP |
2742 | unsigned int flags = (write_access ? FAULT_FLAG_WRITE : 0); |
2743 | ||
16abfa08 HD |
2744 | pte_unmap(page_table); |
2745 | return __do_fault(mm, vma, address, pmd, pgoff, flags, orig_pte); | |
54cb8821 NP |
2746 | } |
2747 | ||
1da177e4 LT |
2748 | /* |
2749 | * Fault of a previously existing named mapping. Repopulate the pte | |
2750 | * from the encoded file_pte if possible. This enables swappable | |
2751 | * nonlinear vmas. | |
8f4e2101 HD |
2752 | * |
2753 | * We enter with non-exclusive mmap_sem (to exclude vma changes, | |
2754 | * but allow concurrent faults), and pte mapped but not yet locked. | |
2755 | * We return with mmap_sem still held, but pte unmapped and unlocked. | |
1da177e4 | 2756 | */ |
d0217ac0 | 2757 | static int do_nonlinear_fault(struct mm_struct *mm, struct vm_area_struct *vma, |
65500d23 HD |
2758 | unsigned long address, pte_t *page_table, pmd_t *pmd, |
2759 | int write_access, pte_t orig_pte) | |
1da177e4 | 2760 | { |
d0217ac0 NP |
2761 | unsigned int flags = FAULT_FLAG_NONLINEAR | |
2762 | (write_access ? FAULT_FLAG_WRITE : 0); | |
65500d23 | 2763 | pgoff_t pgoff; |
1da177e4 | 2764 | |
4c21e2f2 | 2765 | if (!pte_unmap_same(mm, pmd, page_table, orig_pte)) |
83c54070 | 2766 | return 0; |
1da177e4 | 2767 | |
2509ef26 | 2768 | if (unlikely(!(vma->vm_flags & VM_NONLINEAR))) { |
65500d23 HD |
2769 | /* |
2770 | * Page table corrupted: show pte and kill process. | |
2771 | */ | |
3dc14741 | 2772 | print_bad_pte(vma, address, orig_pte, NULL); |
65500d23 HD |
2773 | return VM_FAULT_OOM; |
2774 | } | |
65500d23 HD |
2775 | |
2776 | pgoff = pte_to_pgoff(orig_pte); | |
16abfa08 | 2777 | return __do_fault(mm, vma, address, pmd, pgoff, flags, orig_pte); |
1da177e4 LT |
2778 | } |
2779 | ||
2780 | /* | |
2781 | * These routines also need to handle stuff like marking pages dirty | |
2782 | * and/or accessed for architectures that don't do it in hardware (most | |
2783 | * RISC architectures). The early dirtying is also good on the i386. | |
2784 | * | |
2785 | * There is also a hook called "update_mmu_cache()" that architectures | |
2786 | * with external mmu caches can use to update those (ie the Sparc or | |
2787 | * PowerPC hashed page tables that act as extended TLBs). | |
2788 | * | |
c74df32c HD |
2789 | * We enter with non-exclusive mmap_sem (to exclude vma changes, |
2790 | * but allow concurrent faults), and pte mapped but not yet locked. | |
2791 | * We return with mmap_sem still held, but pte unmapped and unlocked. | |
1da177e4 LT |
2792 | */ |
2793 | static inline int handle_pte_fault(struct mm_struct *mm, | |
65500d23 HD |
2794 | struct vm_area_struct *vma, unsigned long address, |
2795 | pte_t *pte, pmd_t *pmd, int write_access) | |
1da177e4 LT |
2796 | { |
2797 | pte_t entry; | |
8f4e2101 | 2798 | spinlock_t *ptl; |
1da177e4 | 2799 | |
8dab5241 | 2800 | entry = *pte; |
1da177e4 | 2801 | if (!pte_present(entry)) { |
65500d23 | 2802 | if (pte_none(entry)) { |
f4b81804 | 2803 | if (vma->vm_ops) { |
3c18ddd1 | 2804 | if (likely(vma->vm_ops->fault)) |
54cb8821 NP |
2805 | return do_linear_fault(mm, vma, address, |
2806 | pte, pmd, write_access, entry); | |
f4b81804 JS |
2807 | } |
2808 | return do_anonymous_page(mm, vma, address, | |
2809 | pte, pmd, write_access); | |
65500d23 | 2810 | } |
1da177e4 | 2811 | if (pte_file(entry)) |
d0217ac0 | 2812 | return do_nonlinear_fault(mm, vma, address, |
65500d23 HD |
2813 | pte, pmd, write_access, entry); |
2814 | return do_swap_page(mm, vma, address, | |
2815 | pte, pmd, write_access, entry); | |
1da177e4 LT |
2816 | } |
2817 | ||
4c21e2f2 | 2818 | ptl = pte_lockptr(mm, pmd); |
8f4e2101 HD |
2819 | spin_lock(ptl); |
2820 | if (unlikely(!pte_same(*pte, entry))) | |
2821 | goto unlock; | |
1da177e4 LT |
2822 | if (write_access) { |
2823 | if (!pte_write(entry)) | |
8f4e2101 HD |
2824 | return do_wp_page(mm, vma, address, |
2825 | pte, pmd, ptl, entry); | |
1da177e4 LT |
2826 | entry = pte_mkdirty(entry); |
2827 | } | |
2828 | entry = pte_mkyoung(entry); | |
8dab5241 | 2829 | if (ptep_set_access_flags(vma, address, pte, entry, write_access)) { |
1a44e149 | 2830 | update_mmu_cache(vma, address, entry); |
1a44e149 AA |
2831 | } else { |
2832 | /* | |
2833 | * This is needed only for protection faults but the arch code | |
2834 | * is not yet telling us if this is a protection fault or not. | |
2835 | * This still avoids useless tlb flushes for .text page faults | |
2836 | * with threads. | |
2837 | */ | |
2838 | if (write_access) | |
2839 | flush_tlb_page(vma, address); | |
2840 | } | |
8f4e2101 HD |
2841 | unlock: |
2842 | pte_unmap_unlock(pte, ptl); | |
83c54070 | 2843 | return 0; |
1da177e4 LT |
2844 | } |
2845 | ||
2846 | /* | |
2847 | * By the time we get here, we already hold the mm semaphore | |
2848 | */ | |
83c54070 | 2849 | int handle_mm_fault(struct mm_struct *mm, struct vm_area_struct *vma, |
1da177e4 LT |
2850 | unsigned long address, int write_access) |
2851 | { | |
2852 | pgd_t *pgd; | |
2853 | pud_t *pud; | |
2854 | pmd_t *pmd; | |
2855 | pte_t *pte; | |
2856 | ||
2857 | __set_current_state(TASK_RUNNING); | |
2858 | ||
f8891e5e | 2859 | count_vm_event(PGFAULT); |
1da177e4 | 2860 | |
ac9b9c66 HD |
2861 | if (unlikely(is_vm_hugetlb_page(vma))) |
2862 | return hugetlb_fault(mm, vma, address, write_access); | |
1da177e4 | 2863 | |
1da177e4 | 2864 | pgd = pgd_offset(mm, address); |
1da177e4 LT |
2865 | pud = pud_alloc(mm, pgd, address); |
2866 | if (!pud) | |
c74df32c | 2867 | return VM_FAULT_OOM; |
1da177e4 LT |
2868 | pmd = pmd_alloc(mm, pud, address); |
2869 | if (!pmd) | |
c74df32c | 2870 | return VM_FAULT_OOM; |
1da177e4 LT |
2871 | pte = pte_alloc_map(mm, pmd, address); |
2872 | if (!pte) | |
c74df32c | 2873 | return VM_FAULT_OOM; |
1da177e4 | 2874 | |
c74df32c | 2875 | return handle_pte_fault(mm, vma, address, pte, pmd, write_access); |
1da177e4 LT |
2876 | } |
2877 | ||
2878 | #ifndef __PAGETABLE_PUD_FOLDED | |
2879 | /* | |
2880 | * Allocate page upper directory. | |
872fec16 | 2881 | * We've already handled the fast-path in-line. |
1da177e4 | 2882 | */ |
1bb3630e | 2883 | int __pud_alloc(struct mm_struct *mm, pgd_t *pgd, unsigned long address) |
1da177e4 | 2884 | { |
c74df32c HD |
2885 | pud_t *new = pud_alloc_one(mm, address); |
2886 | if (!new) | |
1bb3630e | 2887 | return -ENOMEM; |
1da177e4 | 2888 | |
362a61ad NP |
2889 | smp_wmb(); /* See comment in __pte_alloc */ |
2890 | ||
872fec16 | 2891 | spin_lock(&mm->page_table_lock); |
1bb3630e | 2892 | if (pgd_present(*pgd)) /* Another has populated it */ |
5e541973 | 2893 | pud_free(mm, new); |
1bb3630e HD |
2894 | else |
2895 | pgd_populate(mm, pgd, new); | |
c74df32c | 2896 | spin_unlock(&mm->page_table_lock); |
1bb3630e | 2897 | return 0; |
1da177e4 LT |
2898 | } |
2899 | #endif /* __PAGETABLE_PUD_FOLDED */ | |
2900 | ||
2901 | #ifndef __PAGETABLE_PMD_FOLDED | |
2902 | /* | |
2903 | * Allocate page middle directory. | |
872fec16 | 2904 | * We've already handled the fast-path in-line. |
1da177e4 | 2905 | */ |
1bb3630e | 2906 | int __pmd_alloc(struct mm_struct *mm, pud_t *pud, unsigned long address) |
1da177e4 | 2907 | { |
c74df32c HD |
2908 | pmd_t *new = pmd_alloc_one(mm, address); |
2909 | if (!new) | |
1bb3630e | 2910 | return -ENOMEM; |
1da177e4 | 2911 | |
362a61ad NP |
2912 | smp_wmb(); /* See comment in __pte_alloc */ |
2913 | ||
872fec16 | 2914 | spin_lock(&mm->page_table_lock); |
1da177e4 | 2915 | #ifndef __ARCH_HAS_4LEVEL_HACK |
1bb3630e | 2916 | if (pud_present(*pud)) /* Another has populated it */ |
5e541973 | 2917 | pmd_free(mm, new); |
1bb3630e HD |
2918 | else |
2919 | pud_populate(mm, pud, new); | |
1da177e4 | 2920 | #else |
1bb3630e | 2921 | if (pgd_present(*pud)) /* Another has populated it */ |
5e541973 | 2922 | pmd_free(mm, new); |
1bb3630e HD |
2923 | else |
2924 | pgd_populate(mm, pud, new); | |
1da177e4 | 2925 | #endif /* __ARCH_HAS_4LEVEL_HACK */ |
c74df32c | 2926 | spin_unlock(&mm->page_table_lock); |
1bb3630e | 2927 | return 0; |
e0f39591 | 2928 | } |
1da177e4 LT |
2929 | #endif /* __PAGETABLE_PMD_FOLDED */ |
2930 | ||
2931 | int make_pages_present(unsigned long addr, unsigned long end) | |
2932 | { | |
2933 | int ret, len, write; | |
2934 | struct vm_area_struct * vma; | |
2935 | ||
2936 | vma = find_vma(current->mm, addr); | |
2937 | if (!vma) | |
a477097d | 2938 | return -ENOMEM; |
1da177e4 | 2939 | write = (vma->vm_flags & VM_WRITE) != 0; |
5bcb28b1 ES |
2940 | BUG_ON(addr >= end); |
2941 | BUG_ON(end > vma->vm_end); | |
68e116a3 | 2942 | len = DIV_ROUND_UP(end, PAGE_SIZE) - addr/PAGE_SIZE; |
1da177e4 LT |
2943 | ret = get_user_pages(current, current->mm, addr, |
2944 | len, write, 0, NULL, NULL); | |
c11d69d8 | 2945 | if (ret < 0) |
1da177e4 | 2946 | return ret; |
9978ad58 | 2947 | return ret == len ? 0 : -EFAULT; |
1da177e4 LT |
2948 | } |
2949 | ||
1da177e4 LT |
2950 | #if !defined(__HAVE_ARCH_GATE_AREA) |
2951 | ||
2952 | #if defined(AT_SYSINFO_EHDR) | |
5ce7852c | 2953 | static struct vm_area_struct gate_vma; |
1da177e4 LT |
2954 | |
2955 | static int __init gate_vma_init(void) | |
2956 | { | |
2957 | gate_vma.vm_mm = NULL; | |
2958 | gate_vma.vm_start = FIXADDR_USER_START; | |
2959 | gate_vma.vm_end = FIXADDR_USER_END; | |
b6558c4a RM |
2960 | gate_vma.vm_flags = VM_READ | VM_MAYREAD | VM_EXEC | VM_MAYEXEC; |
2961 | gate_vma.vm_page_prot = __P101; | |
f47aef55 RM |
2962 | /* |
2963 | * Make sure the vDSO gets into every core dump. | |
2964 | * Dumping its contents makes post-mortem fully interpretable later | |
2965 | * without matching up the same kernel and hardware config to see | |
2966 | * what PC values meant. | |
2967 | */ | |
2968 | gate_vma.vm_flags |= VM_ALWAYSDUMP; | |
1da177e4 LT |
2969 | return 0; |
2970 | } | |
2971 | __initcall(gate_vma_init); | |
2972 | #endif | |
2973 | ||
2974 | struct vm_area_struct *get_gate_vma(struct task_struct *tsk) | |
2975 | { | |
2976 | #ifdef AT_SYSINFO_EHDR | |
2977 | return &gate_vma; | |
2978 | #else | |
2979 | return NULL; | |
2980 | #endif | |
2981 | } | |
2982 | ||
2983 | int in_gate_area_no_task(unsigned long addr) | |
2984 | { | |
2985 | #ifdef AT_SYSINFO_EHDR | |
2986 | if ((addr >= FIXADDR_USER_START) && (addr < FIXADDR_USER_END)) | |
2987 | return 1; | |
2988 | #endif | |
2989 | return 0; | |
2990 | } | |
2991 | ||
2992 | #endif /* __HAVE_ARCH_GATE_AREA */ | |
0ec76a11 | 2993 | |
28b2ee20 | 2994 | #ifdef CONFIG_HAVE_IOREMAP_PROT |
d87fe660 | 2995 | int follow_phys(struct vm_area_struct *vma, |
2996 | unsigned long address, unsigned int flags, | |
2997 | unsigned long *prot, resource_size_t *phys) | |
28b2ee20 RR |
2998 | { |
2999 | pgd_t *pgd; | |
3000 | pud_t *pud; | |
3001 | pmd_t *pmd; | |
3002 | pte_t *ptep, pte; | |
3003 | spinlock_t *ptl; | |
3004 | resource_size_t phys_addr = 0; | |
3005 | struct mm_struct *mm = vma->vm_mm; | |
d87fe660 | 3006 | int ret = -EINVAL; |
28b2ee20 | 3007 | |
d87fe660 | 3008 | if (!(vma->vm_flags & (VM_IO | VM_PFNMAP))) |
3009 | goto out; | |
28b2ee20 RR |
3010 | |
3011 | pgd = pgd_offset(mm, address); | |
3012 | if (pgd_none(*pgd) || unlikely(pgd_bad(*pgd))) | |
d87fe660 | 3013 | goto out; |
28b2ee20 RR |
3014 | |
3015 | pud = pud_offset(pgd, address); | |
3016 | if (pud_none(*pud) || unlikely(pud_bad(*pud))) | |
d87fe660 | 3017 | goto out; |
28b2ee20 RR |
3018 | |
3019 | pmd = pmd_offset(pud, address); | |
3020 | if (pmd_none(*pmd) || unlikely(pmd_bad(*pmd))) | |
d87fe660 | 3021 | goto out; |
28b2ee20 RR |
3022 | |
3023 | /* We cannot handle huge page PFN maps. Luckily they don't exist. */ | |
3024 | if (pmd_huge(*pmd)) | |
d87fe660 | 3025 | goto out; |
28b2ee20 RR |
3026 | |
3027 | ptep = pte_offset_map_lock(mm, pmd, address, &ptl); | |
3028 | if (!ptep) | |
3029 | goto out; | |
3030 | ||
3031 | pte = *ptep; | |
3032 | if (!pte_present(pte)) | |
3033 | goto unlock; | |
3034 | if ((flags & FOLL_WRITE) && !pte_write(pte)) | |
3035 | goto unlock; | |
3036 | phys_addr = pte_pfn(pte); | |
3037 | phys_addr <<= PAGE_SHIFT; /* Shift here to avoid overflow on PAE */ | |
3038 | ||
3039 | *prot = pgprot_val(pte_pgprot(pte)); | |
d87fe660 | 3040 | *phys = phys_addr; |
3041 | ret = 0; | |
28b2ee20 RR |
3042 | |
3043 | unlock: | |
3044 | pte_unmap_unlock(ptep, ptl); | |
3045 | out: | |
d87fe660 | 3046 | return ret; |
28b2ee20 RR |
3047 | } |
3048 | ||
3049 | int generic_access_phys(struct vm_area_struct *vma, unsigned long addr, | |
3050 | void *buf, int len, int write) | |
3051 | { | |
3052 | resource_size_t phys_addr; | |
3053 | unsigned long prot = 0; | |
2bc7273b | 3054 | void __iomem *maddr; |
28b2ee20 RR |
3055 | int offset = addr & (PAGE_SIZE-1); |
3056 | ||
d87fe660 | 3057 | if (follow_phys(vma, addr, write, &prot, &phys_addr)) |
28b2ee20 RR |
3058 | return -EINVAL; |
3059 | ||
3060 | maddr = ioremap_prot(phys_addr, PAGE_SIZE, prot); | |
3061 | if (write) | |
3062 | memcpy_toio(maddr + offset, buf, len); | |
3063 | else | |
3064 | memcpy_fromio(buf, maddr + offset, len); | |
3065 | iounmap(maddr); | |
3066 | ||
3067 | return len; | |
3068 | } | |
3069 | #endif | |
3070 | ||
0ec76a11 DH |
3071 | /* |
3072 | * Access another process' address space. | |
3073 | * Source/target buffer must be kernel space, | |
3074 | * Do not walk the page table directly, use get_user_pages | |
3075 | */ | |
3076 | int access_process_vm(struct task_struct *tsk, unsigned long addr, void *buf, int len, int write) | |
3077 | { | |
3078 | struct mm_struct *mm; | |
3079 | struct vm_area_struct *vma; | |
0ec76a11 DH |
3080 | void *old_buf = buf; |
3081 | ||
3082 | mm = get_task_mm(tsk); | |
3083 | if (!mm) | |
3084 | return 0; | |
3085 | ||
3086 | down_read(&mm->mmap_sem); | |
183ff22b | 3087 | /* ignore errors, just check how much was successfully transferred */ |
0ec76a11 DH |
3088 | while (len) { |
3089 | int bytes, ret, offset; | |
3090 | void *maddr; | |
28b2ee20 | 3091 | struct page *page = NULL; |
0ec76a11 DH |
3092 | |
3093 | ret = get_user_pages(tsk, mm, addr, 1, | |
3094 | write, 1, &page, &vma); | |
28b2ee20 RR |
3095 | if (ret <= 0) { |
3096 | /* | |
3097 | * Check if this is a VM_IO | VM_PFNMAP VMA, which | |
3098 | * we can access using slightly different code. | |
3099 | */ | |
3100 | #ifdef CONFIG_HAVE_IOREMAP_PROT | |
3101 | vma = find_vma(mm, addr); | |
3102 | if (!vma) | |
3103 | break; | |
3104 | if (vma->vm_ops && vma->vm_ops->access) | |
3105 | ret = vma->vm_ops->access(vma, addr, buf, | |
3106 | len, write); | |
3107 | if (ret <= 0) | |
3108 | #endif | |
3109 | break; | |
3110 | bytes = ret; | |
0ec76a11 | 3111 | } else { |
28b2ee20 RR |
3112 | bytes = len; |
3113 | offset = addr & (PAGE_SIZE-1); | |
3114 | if (bytes > PAGE_SIZE-offset) | |
3115 | bytes = PAGE_SIZE-offset; | |
3116 | ||
3117 | maddr = kmap(page); | |
3118 | if (write) { | |
3119 | copy_to_user_page(vma, page, addr, | |
3120 | maddr + offset, buf, bytes); | |
3121 | set_page_dirty_lock(page); | |
3122 | } else { | |
3123 | copy_from_user_page(vma, page, addr, | |
3124 | buf, maddr + offset, bytes); | |
3125 | } | |
3126 | kunmap(page); | |
3127 | page_cache_release(page); | |
0ec76a11 | 3128 | } |
0ec76a11 DH |
3129 | len -= bytes; |
3130 | buf += bytes; | |
3131 | addr += bytes; | |
3132 | } | |
3133 | up_read(&mm->mmap_sem); | |
3134 | mmput(mm); | |
3135 | ||
3136 | return buf - old_buf; | |
3137 | } | |
03252919 AK |
3138 | |
3139 | /* | |
3140 | * Print the name of a VMA. | |
3141 | */ | |
3142 | void print_vma_addr(char *prefix, unsigned long ip) | |
3143 | { | |
3144 | struct mm_struct *mm = current->mm; | |
3145 | struct vm_area_struct *vma; | |
3146 | ||
e8bff74a IM |
3147 | /* |
3148 | * Do not print if we are in atomic | |
3149 | * contexts (in exception stacks, etc.): | |
3150 | */ | |
3151 | if (preempt_count()) | |
3152 | return; | |
3153 | ||
03252919 AK |
3154 | down_read(&mm->mmap_sem); |
3155 | vma = find_vma(mm, ip); | |
3156 | if (vma && vma->vm_file) { | |
3157 | struct file *f = vma->vm_file; | |
3158 | char *buf = (char *)__get_free_page(GFP_KERNEL); | |
3159 | if (buf) { | |
3160 | char *p, *s; | |
3161 | ||
cf28b486 | 3162 | p = d_path(&f->f_path, buf, PAGE_SIZE); |
03252919 AK |
3163 | if (IS_ERR(p)) |
3164 | p = "?"; | |
3165 | s = strrchr(p, '/'); | |
3166 | if (s) | |
3167 | p = s+1; | |
3168 | printk("%s%s[%lx+%lx]", prefix, p, | |
3169 | vma->vm_start, | |
3170 | vma->vm_end - vma->vm_start); | |
3171 | free_page((unsigned long)buf); | |
3172 | } | |
3173 | } | |
3174 | up_read(¤t->mm->mmap_sem); | |
3175 | } | |
3ee1afa3 NP |
3176 | |
3177 | #ifdef CONFIG_PROVE_LOCKING | |
3178 | void might_fault(void) | |
3179 | { | |
95156f00 PZ |
3180 | /* |
3181 | * Some code (nfs/sunrpc) uses socket ops on kernel memory while | |
3182 | * holding the mmap_sem, this is safe because kernel memory doesn't | |
3183 | * get paged out, therefore we'll never actually fault, and the | |
3184 | * below annotations will generate false positives. | |
3185 | */ | |
3186 | if (segment_eq(get_fs(), KERNEL_DS)) | |
3187 | return; | |
3188 | ||
3ee1afa3 NP |
3189 | might_sleep(); |
3190 | /* | |
3191 | * it would be nicer only to annotate paths which are not under | |
3192 | * pagefault_disable, however that requires a larger audit and | |
3193 | * providing helpers like get_user_atomic. | |
3194 | */ | |
3195 | if (!in_atomic() && current->mm) | |
3196 | might_lock_read(¤t->mm->mmap_sem); | |
3197 | } | |
3198 | EXPORT_SYMBOL(might_fault); | |
3199 | #endif |