]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Generic hugetlb support. | |
3 | * (C) William Irwin, April 2004 | |
4 | */ | |
5 | #include <linux/gfp.h> | |
6 | #include <linux/list.h> | |
7 | #include <linux/init.h> | |
8 | #include <linux/module.h> | |
9 | #include <linux/mm.h> | |
1da177e4 LT |
10 | #include <linux/sysctl.h> |
11 | #include <linux/highmem.h> | |
12 | #include <linux/nodemask.h> | |
63551ae0 | 13 | #include <linux/pagemap.h> |
5da7ca86 | 14 | #include <linux/mempolicy.h> |
aea47ff3 | 15 | #include <linux/cpuset.h> |
3935baa9 | 16 | #include <linux/mutex.h> |
5da7ca86 | 17 | |
63551ae0 DG |
18 | #include <asm/page.h> |
19 | #include <asm/pgtable.h> | |
20 | ||
21 | #include <linux/hugetlb.h> | |
7835e98b | 22 | #include "internal.h" |
1da177e4 LT |
23 | |
24 | const unsigned long hugetlb_zero = 0, hugetlb_infinity = ~0UL; | |
a43a8c39 | 25 | static unsigned long nr_huge_pages, free_huge_pages, resv_huge_pages; |
1da177e4 LT |
26 | unsigned long max_huge_pages; |
27 | static struct list_head hugepage_freelists[MAX_NUMNODES]; | |
28 | static unsigned int nr_huge_pages_node[MAX_NUMNODES]; | |
29 | static unsigned int free_huge_pages_node[MAX_NUMNODES]; | |
3935baa9 DG |
30 | /* |
31 | * Protects updates to hugepage_freelists, nr_huge_pages, and free_huge_pages | |
32 | */ | |
33 | static DEFINE_SPINLOCK(hugetlb_lock); | |
0bd0f9fb | 34 | |
79ac6ba4 DG |
35 | static void clear_huge_page(struct page *page, unsigned long addr) |
36 | { | |
37 | int i; | |
38 | ||
39 | might_sleep(); | |
40 | for (i = 0; i < (HPAGE_SIZE/PAGE_SIZE); i++) { | |
41 | cond_resched(); | |
42 | clear_user_highpage(page + i, addr); | |
43 | } | |
44 | } | |
45 | ||
46 | static void copy_huge_page(struct page *dst, struct page *src, | |
47 | unsigned long addr) | |
48 | { | |
49 | int i; | |
50 | ||
51 | might_sleep(); | |
52 | for (i = 0; i < HPAGE_SIZE/PAGE_SIZE; i++) { | |
53 | cond_resched(); | |
54 | copy_user_highpage(dst + i, src + i, addr + i*PAGE_SIZE); | |
55 | } | |
56 | } | |
57 | ||
1da177e4 LT |
58 | static void enqueue_huge_page(struct page *page) |
59 | { | |
60 | int nid = page_to_nid(page); | |
61 | list_add(&page->lru, &hugepage_freelists[nid]); | |
62 | free_huge_pages++; | |
63 | free_huge_pages_node[nid]++; | |
64 | } | |
65 | ||
5da7ca86 CL |
66 | static struct page *dequeue_huge_page(struct vm_area_struct *vma, |
67 | unsigned long address) | |
1da177e4 LT |
68 | { |
69 | int nid = numa_node_id(); | |
70 | struct page *page = NULL; | |
5da7ca86 | 71 | struct zonelist *zonelist = huge_zonelist(vma, address); |
96df9333 | 72 | struct zone **z; |
1da177e4 | 73 | |
96df9333 | 74 | for (z = zonelist->zones; *z; z++) { |
89fa3024 | 75 | nid = zone_to_nid(*z); |
aea47ff3 CL |
76 | if (cpuset_zone_allowed(*z, GFP_HIGHUSER) && |
77 | !list_empty(&hugepage_freelists[nid])) | |
96df9333 | 78 | break; |
1da177e4 | 79 | } |
96df9333 CL |
80 | |
81 | if (*z) { | |
1da177e4 LT |
82 | page = list_entry(hugepage_freelists[nid].next, |
83 | struct page, lru); | |
84 | list_del(&page->lru); | |
85 | free_huge_pages--; | |
86 | free_huge_pages_node[nid]--; | |
87 | } | |
88 | return page; | |
89 | } | |
90 | ||
27a85ef1 DG |
91 | static void free_huge_page(struct page *page) |
92 | { | |
93 | BUG_ON(page_count(page)); | |
94 | ||
95 | INIT_LIST_HEAD(&page->lru); | |
96 | ||
97 | spin_lock(&hugetlb_lock); | |
98 | enqueue_huge_page(page); | |
99 | spin_unlock(&hugetlb_lock); | |
100 | } | |
101 | ||
a482289d | 102 | static int alloc_fresh_huge_page(void) |
1da177e4 LT |
103 | { |
104 | static int nid = 0; | |
105 | struct page *page; | |
106 | page = alloc_pages_node(nid, GFP_HIGHUSER|__GFP_COMP|__GFP_NOWARN, | |
107 | HUGETLB_PAGE_ORDER); | |
fdb7cc59 PJ |
108 | nid = next_node(nid, node_online_map); |
109 | if (nid == MAX_NUMNODES) | |
110 | nid = first_node(node_online_map); | |
1da177e4 | 111 | if (page) { |
a482289d | 112 | page[1].lru.next = (void *)free_huge_page; /* dtor */ |
0bd0f9fb | 113 | spin_lock(&hugetlb_lock); |
1da177e4 LT |
114 | nr_huge_pages++; |
115 | nr_huge_pages_node[page_to_nid(page)]++; | |
0bd0f9fb | 116 | spin_unlock(&hugetlb_lock); |
a482289d NP |
117 | put_page(page); /* free it into the hugepage allocator */ |
118 | return 1; | |
1da177e4 | 119 | } |
a482289d | 120 | return 0; |
1da177e4 LT |
121 | } |
122 | ||
27a85ef1 DG |
123 | static struct page *alloc_huge_page(struct vm_area_struct *vma, |
124 | unsigned long addr) | |
1da177e4 LT |
125 | { |
126 | struct page *page; | |
1da177e4 LT |
127 | |
128 | spin_lock(&hugetlb_lock); | |
a43a8c39 KC |
129 | if (vma->vm_flags & VM_MAYSHARE) |
130 | resv_huge_pages--; | |
131 | else if (free_huge_pages <= resv_huge_pages) | |
132 | goto fail; | |
b45b5bd6 DG |
133 | |
134 | page = dequeue_huge_page(vma, addr); | |
135 | if (!page) | |
136 | goto fail; | |
137 | ||
1da177e4 | 138 | spin_unlock(&hugetlb_lock); |
7835e98b | 139 | set_page_refcounted(page); |
1da177e4 | 140 | return page; |
b45b5bd6 | 141 | |
a43a8c39 | 142 | fail: |
b45b5bd6 DG |
143 | spin_unlock(&hugetlb_lock); |
144 | return NULL; | |
145 | } | |
146 | ||
1da177e4 LT |
147 | static int __init hugetlb_init(void) |
148 | { | |
149 | unsigned long i; | |
1da177e4 | 150 | |
3c726f8d BH |
151 | if (HPAGE_SHIFT == 0) |
152 | return 0; | |
153 | ||
1da177e4 LT |
154 | for (i = 0; i < MAX_NUMNODES; ++i) |
155 | INIT_LIST_HEAD(&hugepage_freelists[i]); | |
156 | ||
157 | for (i = 0; i < max_huge_pages; ++i) { | |
a482289d | 158 | if (!alloc_fresh_huge_page()) |
1da177e4 | 159 | break; |
1da177e4 LT |
160 | } |
161 | max_huge_pages = free_huge_pages = nr_huge_pages = i; | |
162 | printk("Total HugeTLB memory allocated, %ld\n", free_huge_pages); | |
163 | return 0; | |
164 | } | |
165 | module_init(hugetlb_init); | |
166 | ||
167 | static int __init hugetlb_setup(char *s) | |
168 | { | |
169 | if (sscanf(s, "%lu", &max_huge_pages) <= 0) | |
170 | max_huge_pages = 0; | |
171 | return 1; | |
172 | } | |
173 | __setup("hugepages=", hugetlb_setup); | |
174 | ||
175 | #ifdef CONFIG_SYSCTL | |
176 | static void update_and_free_page(struct page *page) | |
177 | { | |
178 | int i; | |
179 | nr_huge_pages--; | |
4415cc8d | 180 | nr_huge_pages_node[page_to_nid(page)]--; |
1da177e4 LT |
181 | for (i = 0; i < (HPAGE_SIZE / PAGE_SIZE); i++) { |
182 | page[i].flags &= ~(1 << PG_locked | 1 << PG_error | 1 << PG_referenced | | |
183 | 1 << PG_dirty | 1 << PG_active | 1 << PG_reserved | | |
184 | 1 << PG_private | 1<< PG_writeback); | |
1da177e4 | 185 | } |
a482289d | 186 | page[1].lru.next = NULL; |
7835e98b | 187 | set_page_refcounted(page); |
1da177e4 LT |
188 | __free_pages(page, HUGETLB_PAGE_ORDER); |
189 | } | |
190 | ||
191 | #ifdef CONFIG_HIGHMEM | |
192 | static void try_to_free_low(unsigned long count) | |
193 | { | |
4415cc8d CL |
194 | int i; |
195 | ||
1da177e4 LT |
196 | for (i = 0; i < MAX_NUMNODES; ++i) { |
197 | struct page *page, *next; | |
198 | list_for_each_entry_safe(page, next, &hugepage_freelists[i], lru) { | |
199 | if (PageHighMem(page)) | |
200 | continue; | |
201 | list_del(&page->lru); | |
202 | update_and_free_page(page); | |
1da177e4 | 203 | free_huge_pages--; |
4415cc8d | 204 | free_huge_pages_node[page_to_nid(page)]--; |
1da177e4 LT |
205 | if (count >= nr_huge_pages) |
206 | return; | |
207 | } | |
208 | } | |
209 | } | |
210 | #else | |
211 | static inline void try_to_free_low(unsigned long count) | |
212 | { | |
213 | } | |
214 | #endif | |
215 | ||
216 | static unsigned long set_max_huge_pages(unsigned long count) | |
217 | { | |
218 | while (count > nr_huge_pages) { | |
a482289d | 219 | if (!alloc_fresh_huge_page()) |
1da177e4 | 220 | return nr_huge_pages; |
1da177e4 LT |
221 | } |
222 | if (count >= nr_huge_pages) | |
223 | return nr_huge_pages; | |
224 | ||
225 | spin_lock(&hugetlb_lock); | |
a43a8c39 | 226 | count = max(count, resv_huge_pages); |
1da177e4 LT |
227 | try_to_free_low(count); |
228 | while (count < nr_huge_pages) { | |
5da7ca86 | 229 | struct page *page = dequeue_huge_page(NULL, 0); |
1da177e4 LT |
230 | if (!page) |
231 | break; | |
232 | update_and_free_page(page); | |
233 | } | |
234 | spin_unlock(&hugetlb_lock); | |
235 | return nr_huge_pages; | |
236 | } | |
237 | ||
238 | int hugetlb_sysctl_handler(struct ctl_table *table, int write, | |
239 | struct file *file, void __user *buffer, | |
240 | size_t *length, loff_t *ppos) | |
241 | { | |
242 | proc_doulongvec_minmax(table, write, file, buffer, length, ppos); | |
243 | max_huge_pages = set_max_huge_pages(max_huge_pages); | |
244 | return 0; | |
245 | } | |
246 | #endif /* CONFIG_SYSCTL */ | |
247 | ||
248 | int hugetlb_report_meminfo(char *buf) | |
249 | { | |
250 | return sprintf(buf, | |
251 | "HugePages_Total: %5lu\n" | |
252 | "HugePages_Free: %5lu\n" | |
a43a8c39 | 253 | "HugePages_Rsvd: %5lu\n" |
1da177e4 LT |
254 | "Hugepagesize: %5lu kB\n", |
255 | nr_huge_pages, | |
256 | free_huge_pages, | |
a43a8c39 | 257 | resv_huge_pages, |
1da177e4 LT |
258 | HPAGE_SIZE/1024); |
259 | } | |
260 | ||
261 | int hugetlb_report_node_meminfo(int nid, char *buf) | |
262 | { | |
263 | return sprintf(buf, | |
264 | "Node %d HugePages_Total: %5u\n" | |
265 | "Node %d HugePages_Free: %5u\n", | |
266 | nid, nr_huge_pages_node[nid], | |
267 | nid, free_huge_pages_node[nid]); | |
268 | } | |
269 | ||
1da177e4 LT |
270 | /* Return the number pages of memory we physically have, in PAGE_SIZE units. */ |
271 | unsigned long hugetlb_total_pages(void) | |
272 | { | |
273 | return nr_huge_pages * (HPAGE_SIZE / PAGE_SIZE); | |
274 | } | |
1da177e4 LT |
275 | |
276 | /* | |
277 | * We cannot handle pagefaults against hugetlb pages at all. They cause | |
278 | * handle_mm_fault() to try to instantiate regular-sized pages in the | |
279 | * hugegpage VMA. do_page_fault() is supposed to trap this, so BUG is we get | |
280 | * this far. | |
281 | */ | |
282 | static struct page *hugetlb_nopage(struct vm_area_struct *vma, | |
283 | unsigned long address, int *unused) | |
284 | { | |
285 | BUG(); | |
286 | return NULL; | |
287 | } | |
288 | ||
289 | struct vm_operations_struct hugetlb_vm_ops = { | |
290 | .nopage = hugetlb_nopage, | |
291 | }; | |
292 | ||
1e8f889b DG |
293 | static pte_t make_huge_pte(struct vm_area_struct *vma, struct page *page, |
294 | int writable) | |
63551ae0 DG |
295 | { |
296 | pte_t entry; | |
297 | ||
1e8f889b | 298 | if (writable) { |
63551ae0 DG |
299 | entry = |
300 | pte_mkwrite(pte_mkdirty(mk_pte(page, vma->vm_page_prot))); | |
301 | } else { | |
302 | entry = pte_wrprotect(mk_pte(page, vma->vm_page_prot)); | |
303 | } | |
304 | entry = pte_mkyoung(entry); | |
305 | entry = pte_mkhuge(entry); | |
306 | ||
307 | return entry; | |
308 | } | |
309 | ||
1e8f889b DG |
310 | static void set_huge_ptep_writable(struct vm_area_struct *vma, |
311 | unsigned long address, pte_t *ptep) | |
312 | { | |
313 | pte_t entry; | |
314 | ||
315 | entry = pte_mkwrite(pte_mkdirty(*ptep)); | |
316 | ptep_set_access_flags(vma, address, ptep, entry, 1); | |
317 | update_mmu_cache(vma, address, entry); | |
318 | lazy_mmu_prot_update(entry); | |
319 | } | |
320 | ||
321 | ||
63551ae0 DG |
322 | int copy_hugetlb_page_range(struct mm_struct *dst, struct mm_struct *src, |
323 | struct vm_area_struct *vma) | |
324 | { | |
325 | pte_t *src_pte, *dst_pte, entry; | |
326 | struct page *ptepage; | |
1c59827d | 327 | unsigned long addr; |
1e8f889b DG |
328 | int cow; |
329 | ||
330 | cow = (vma->vm_flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE; | |
63551ae0 | 331 | |
1c59827d | 332 | for (addr = vma->vm_start; addr < vma->vm_end; addr += HPAGE_SIZE) { |
c74df32c HD |
333 | src_pte = huge_pte_offset(src, addr); |
334 | if (!src_pte) | |
335 | continue; | |
63551ae0 DG |
336 | dst_pte = huge_pte_alloc(dst, addr); |
337 | if (!dst_pte) | |
338 | goto nomem; | |
c74df32c | 339 | spin_lock(&dst->page_table_lock); |
1c59827d | 340 | spin_lock(&src->page_table_lock); |
c74df32c | 341 | if (!pte_none(*src_pte)) { |
1e8f889b DG |
342 | if (cow) |
343 | ptep_set_wrprotect(src, addr, src_pte); | |
1c59827d HD |
344 | entry = *src_pte; |
345 | ptepage = pte_page(entry); | |
346 | get_page(ptepage); | |
4294621f | 347 | add_mm_counter(dst, file_rss, HPAGE_SIZE / PAGE_SIZE); |
1c59827d HD |
348 | set_huge_pte_at(dst, addr, dst_pte, entry); |
349 | } | |
350 | spin_unlock(&src->page_table_lock); | |
c74df32c | 351 | spin_unlock(&dst->page_table_lock); |
63551ae0 DG |
352 | } |
353 | return 0; | |
354 | ||
355 | nomem: | |
356 | return -ENOMEM; | |
357 | } | |
358 | ||
359 | void unmap_hugepage_range(struct vm_area_struct *vma, unsigned long start, | |
360 | unsigned long end) | |
361 | { | |
362 | struct mm_struct *mm = vma->vm_mm; | |
363 | unsigned long address; | |
c7546f8f | 364 | pte_t *ptep; |
63551ae0 DG |
365 | pte_t pte; |
366 | struct page *page; | |
fe1668ae KC |
367 | struct page *tmp; |
368 | LIST_HEAD(page_list); | |
63551ae0 DG |
369 | |
370 | WARN_ON(!is_vm_hugetlb_page(vma)); | |
371 | BUG_ON(start & ~HPAGE_MASK); | |
372 | BUG_ON(end & ~HPAGE_MASK); | |
373 | ||
508034a3 HD |
374 | spin_lock(&mm->page_table_lock); |
375 | ||
365e9c87 HD |
376 | /* Update high watermark before we lower rss */ |
377 | update_hiwater_rss(mm); | |
378 | ||
63551ae0 | 379 | for (address = start; address < end; address += HPAGE_SIZE) { |
c7546f8f | 380 | ptep = huge_pte_offset(mm, address); |
4c887265 | 381 | if (!ptep) |
c7546f8f DG |
382 | continue; |
383 | ||
384 | pte = huge_ptep_get_and_clear(mm, address, ptep); | |
63551ae0 DG |
385 | if (pte_none(pte)) |
386 | continue; | |
c7546f8f | 387 | |
63551ae0 | 388 | page = pte_page(pte); |
fe1668ae | 389 | list_add(&page->lru, &page_list); |
4294621f | 390 | add_mm_counter(mm, file_rss, (int) -(HPAGE_SIZE / PAGE_SIZE)); |
63551ae0 | 391 | } |
63551ae0 | 392 | |
1da177e4 | 393 | spin_unlock(&mm->page_table_lock); |
508034a3 | 394 | flush_tlb_range(vma, start, end); |
fe1668ae KC |
395 | list_for_each_entry_safe(page, tmp, &page_list, lru) { |
396 | list_del(&page->lru); | |
397 | put_page(page); | |
398 | } | |
1da177e4 | 399 | } |
63551ae0 | 400 | |
1e8f889b DG |
401 | static int hugetlb_cow(struct mm_struct *mm, struct vm_area_struct *vma, |
402 | unsigned long address, pte_t *ptep, pte_t pte) | |
403 | { | |
404 | struct page *old_page, *new_page; | |
79ac6ba4 | 405 | int avoidcopy; |
1e8f889b DG |
406 | |
407 | old_page = pte_page(pte); | |
408 | ||
409 | /* If no-one else is actually using this page, avoid the copy | |
410 | * and just make the page writable */ | |
411 | avoidcopy = (page_count(old_page) == 1); | |
412 | if (avoidcopy) { | |
413 | set_huge_ptep_writable(vma, address, ptep); | |
414 | return VM_FAULT_MINOR; | |
415 | } | |
416 | ||
417 | page_cache_get(old_page); | |
5da7ca86 | 418 | new_page = alloc_huge_page(vma, address); |
1e8f889b DG |
419 | |
420 | if (!new_page) { | |
421 | page_cache_release(old_page); | |
0df420d8 | 422 | return VM_FAULT_OOM; |
1e8f889b DG |
423 | } |
424 | ||
425 | spin_unlock(&mm->page_table_lock); | |
79ac6ba4 | 426 | copy_huge_page(new_page, old_page, address); |
1e8f889b DG |
427 | spin_lock(&mm->page_table_lock); |
428 | ||
429 | ptep = huge_pte_offset(mm, address & HPAGE_MASK); | |
430 | if (likely(pte_same(*ptep, pte))) { | |
431 | /* Break COW */ | |
432 | set_huge_pte_at(mm, address, ptep, | |
433 | make_huge_pte(vma, new_page, 1)); | |
434 | /* Make the old page be freed below */ | |
435 | new_page = old_page; | |
436 | } | |
437 | page_cache_release(new_page); | |
438 | page_cache_release(old_page); | |
439 | return VM_FAULT_MINOR; | |
440 | } | |
441 | ||
86e5216f | 442 | int hugetlb_no_page(struct mm_struct *mm, struct vm_area_struct *vma, |
1e8f889b | 443 | unsigned long address, pte_t *ptep, int write_access) |
ac9b9c66 HD |
444 | { |
445 | int ret = VM_FAULT_SIGBUS; | |
4c887265 AL |
446 | unsigned long idx; |
447 | unsigned long size; | |
4c887265 AL |
448 | struct page *page; |
449 | struct address_space *mapping; | |
1e8f889b | 450 | pte_t new_pte; |
4c887265 | 451 | |
4c887265 AL |
452 | mapping = vma->vm_file->f_mapping; |
453 | idx = ((address - vma->vm_start) >> HPAGE_SHIFT) | |
454 | + (vma->vm_pgoff >> (HPAGE_SHIFT - PAGE_SHIFT)); | |
455 | ||
456 | /* | |
457 | * Use page lock to guard against racing truncation | |
458 | * before we get page_table_lock. | |
459 | */ | |
6bda666a CL |
460 | retry: |
461 | page = find_lock_page(mapping, idx); | |
462 | if (!page) { | |
463 | if (hugetlb_get_quota(mapping)) | |
464 | goto out; | |
465 | page = alloc_huge_page(vma, address); | |
466 | if (!page) { | |
467 | hugetlb_put_quota(mapping); | |
0df420d8 | 468 | ret = VM_FAULT_OOM; |
6bda666a CL |
469 | goto out; |
470 | } | |
79ac6ba4 | 471 | clear_huge_page(page, address); |
ac9b9c66 | 472 | |
6bda666a CL |
473 | if (vma->vm_flags & VM_SHARED) { |
474 | int err; | |
475 | ||
476 | err = add_to_page_cache(page, mapping, idx, GFP_KERNEL); | |
477 | if (err) { | |
478 | put_page(page); | |
479 | hugetlb_put_quota(mapping); | |
480 | if (err == -EEXIST) | |
481 | goto retry; | |
482 | goto out; | |
483 | } | |
484 | } else | |
485 | lock_page(page); | |
486 | } | |
1e8f889b | 487 | |
ac9b9c66 | 488 | spin_lock(&mm->page_table_lock); |
4c887265 AL |
489 | size = i_size_read(mapping->host) >> HPAGE_SHIFT; |
490 | if (idx >= size) | |
491 | goto backout; | |
492 | ||
493 | ret = VM_FAULT_MINOR; | |
86e5216f | 494 | if (!pte_none(*ptep)) |
4c887265 AL |
495 | goto backout; |
496 | ||
497 | add_mm_counter(mm, file_rss, HPAGE_SIZE / PAGE_SIZE); | |
1e8f889b DG |
498 | new_pte = make_huge_pte(vma, page, ((vma->vm_flags & VM_WRITE) |
499 | && (vma->vm_flags & VM_SHARED))); | |
500 | set_huge_pte_at(mm, address, ptep, new_pte); | |
501 | ||
502 | if (write_access && !(vma->vm_flags & VM_SHARED)) { | |
503 | /* Optimization, do the COW without a second fault */ | |
504 | ret = hugetlb_cow(mm, vma, address, ptep, new_pte); | |
505 | } | |
506 | ||
ac9b9c66 | 507 | spin_unlock(&mm->page_table_lock); |
4c887265 AL |
508 | unlock_page(page); |
509 | out: | |
ac9b9c66 | 510 | return ret; |
4c887265 AL |
511 | |
512 | backout: | |
513 | spin_unlock(&mm->page_table_lock); | |
514 | hugetlb_put_quota(mapping); | |
515 | unlock_page(page); | |
516 | put_page(page); | |
517 | goto out; | |
ac9b9c66 HD |
518 | } |
519 | ||
86e5216f AL |
520 | int hugetlb_fault(struct mm_struct *mm, struct vm_area_struct *vma, |
521 | unsigned long address, int write_access) | |
522 | { | |
523 | pte_t *ptep; | |
524 | pte_t entry; | |
1e8f889b | 525 | int ret; |
3935baa9 | 526 | static DEFINE_MUTEX(hugetlb_instantiation_mutex); |
86e5216f AL |
527 | |
528 | ptep = huge_pte_alloc(mm, address); | |
529 | if (!ptep) | |
530 | return VM_FAULT_OOM; | |
531 | ||
3935baa9 DG |
532 | /* |
533 | * Serialize hugepage allocation and instantiation, so that we don't | |
534 | * get spurious allocation failures if two CPUs race to instantiate | |
535 | * the same page in the page cache. | |
536 | */ | |
537 | mutex_lock(&hugetlb_instantiation_mutex); | |
86e5216f | 538 | entry = *ptep; |
3935baa9 DG |
539 | if (pte_none(entry)) { |
540 | ret = hugetlb_no_page(mm, vma, address, ptep, write_access); | |
541 | mutex_unlock(&hugetlb_instantiation_mutex); | |
542 | return ret; | |
543 | } | |
86e5216f | 544 | |
1e8f889b DG |
545 | ret = VM_FAULT_MINOR; |
546 | ||
547 | spin_lock(&mm->page_table_lock); | |
548 | /* Check for a racing update before calling hugetlb_cow */ | |
549 | if (likely(pte_same(entry, *ptep))) | |
550 | if (write_access && !pte_write(entry)) | |
551 | ret = hugetlb_cow(mm, vma, address, ptep, entry); | |
552 | spin_unlock(&mm->page_table_lock); | |
3935baa9 | 553 | mutex_unlock(&hugetlb_instantiation_mutex); |
1e8f889b DG |
554 | |
555 | return ret; | |
86e5216f AL |
556 | } |
557 | ||
63551ae0 DG |
558 | int follow_hugetlb_page(struct mm_struct *mm, struct vm_area_struct *vma, |
559 | struct page **pages, struct vm_area_struct **vmas, | |
560 | unsigned long *position, int *length, int i) | |
561 | { | |
d5d4b0aa KC |
562 | unsigned long pfn_offset; |
563 | unsigned long vaddr = *position; | |
63551ae0 DG |
564 | int remainder = *length; |
565 | ||
1c59827d | 566 | spin_lock(&mm->page_table_lock); |
63551ae0 | 567 | while (vaddr < vma->vm_end && remainder) { |
4c887265 AL |
568 | pte_t *pte; |
569 | struct page *page; | |
63551ae0 | 570 | |
4c887265 AL |
571 | /* |
572 | * Some archs (sparc64, sh*) have multiple pte_ts to | |
573 | * each hugepage. We have to make * sure we get the | |
574 | * first, for the page indexing below to work. | |
575 | */ | |
576 | pte = huge_pte_offset(mm, vaddr & HPAGE_MASK); | |
63551ae0 | 577 | |
4c887265 AL |
578 | if (!pte || pte_none(*pte)) { |
579 | int ret; | |
63551ae0 | 580 | |
4c887265 AL |
581 | spin_unlock(&mm->page_table_lock); |
582 | ret = hugetlb_fault(mm, vma, vaddr, 0); | |
583 | spin_lock(&mm->page_table_lock); | |
584 | if (ret == VM_FAULT_MINOR) | |
585 | continue; | |
63551ae0 | 586 | |
4c887265 AL |
587 | remainder = 0; |
588 | if (!i) | |
589 | i = -EFAULT; | |
590 | break; | |
591 | } | |
592 | ||
d5d4b0aa KC |
593 | pfn_offset = (vaddr & ~HPAGE_MASK) >> PAGE_SHIFT; |
594 | page = pte_page(*pte); | |
595 | same_page: | |
d6692183 KC |
596 | if (pages) { |
597 | get_page(page); | |
d5d4b0aa | 598 | pages[i] = page + pfn_offset; |
d6692183 | 599 | } |
63551ae0 DG |
600 | |
601 | if (vmas) | |
602 | vmas[i] = vma; | |
603 | ||
604 | vaddr += PAGE_SIZE; | |
d5d4b0aa | 605 | ++pfn_offset; |
63551ae0 DG |
606 | --remainder; |
607 | ++i; | |
d5d4b0aa KC |
608 | if (vaddr < vma->vm_end && remainder && |
609 | pfn_offset < HPAGE_SIZE/PAGE_SIZE) { | |
610 | /* | |
611 | * We use pfn_offset to avoid touching the pageframes | |
612 | * of this compound page. | |
613 | */ | |
614 | goto same_page; | |
615 | } | |
63551ae0 | 616 | } |
1c59827d | 617 | spin_unlock(&mm->page_table_lock); |
63551ae0 DG |
618 | *length = remainder; |
619 | *position = vaddr; | |
620 | ||
621 | return i; | |
622 | } | |
8f860591 ZY |
623 | |
624 | void hugetlb_change_protection(struct vm_area_struct *vma, | |
625 | unsigned long address, unsigned long end, pgprot_t newprot) | |
626 | { | |
627 | struct mm_struct *mm = vma->vm_mm; | |
628 | unsigned long start = address; | |
629 | pte_t *ptep; | |
630 | pte_t pte; | |
631 | ||
632 | BUG_ON(address >= end); | |
633 | flush_cache_range(vma, address, end); | |
634 | ||
635 | spin_lock(&mm->page_table_lock); | |
636 | for (; address < end; address += HPAGE_SIZE) { | |
637 | ptep = huge_pte_offset(mm, address); | |
638 | if (!ptep) | |
639 | continue; | |
640 | if (!pte_none(*ptep)) { | |
641 | pte = huge_ptep_get_and_clear(mm, address, ptep); | |
642 | pte = pte_mkhuge(pte_modify(pte, newprot)); | |
643 | set_huge_pte_at(mm, address, ptep, pte); | |
644 | lazy_mmu_prot_update(pte); | |
645 | } | |
646 | } | |
647 | spin_unlock(&mm->page_table_lock); | |
648 | ||
649 | flush_tlb_range(vma, start, end); | |
650 | } | |
651 | ||
a43a8c39 KC |
652 | struct file_region { |
653 | struct list_head link; | |
654 | long from; | |
655 | long to; | |
656 | }; | |
657 | ||
658 | static long region_add(struct list_head *head, long f, long t) | |
659 | { | |
660 | struct file_region *rg, *nrg, *trg; | |
661 | ||
662 | /* Locate the region we are either in or before. */ | |
663 | list_for_each_entry(rg, head, link) | |
664 | if (f <= rg->to) | |
665 | break; | |
666 | ||
667 | /* Round our left edge to the current segment if it encloses us. */ | |
668 | if (f > rg->from) | |
669 | f = rg->from; | |
670 | ||
671 | /* Check for and consume any regions we now overlap with. */ | |
672 | nrg = rg; | |
673 | list_for_each_entry_safe(rg, trg, rg->link.prev, link) { | |
674 | if (&rg->link == head) | |
675 | break; | |
676 | if (rg->from > t) | |
677 | break; | |
678 | ||
679 | /* If this area reaches higher then extend our area to | |
680 | * include it completely. If this is not the first area | |
681 | * which we intend to reuse, free it. */ | |
682 | if (rg->to > t) | |
683 | t = rg->to; | |
684 | if (rg != nrg) { | |
685 | list_del(&rg->link); | |
686 | kfree(rg); | |
687 | } | |
688 | } | |
689 | nrg->from = f; | |
690 | nrg->to = t; | |
691 | return 0; | |
692 | } | |
693 | ||
694 | static long region_chg(struct list_head *head, long f, long t) | |
695 | { | |
696 | struct file_region *rg, *nrg; | |
697 | long chg = 0; | |
698 | ||
699 | /* Locate the region we are before or in. */ | |
700 | list_for_each_entry(rg, head, link) | |
701 | if (f <= rg->to) | |
702 | break; | |
703 | ||
704 | /* If we are below the current region then a new region is required. | |
705 | * Subtle, allocate a new region at the position but make it zero | |
706 | * size such that we can guarentee to record the reservation. */ | |
707 | if (&rg->link == head || t < rg->from) { | |
708 | nrg = kmalloc(sizeof(*nrg), GFP_KERNEL); | |
709 | if (nrg == 0) | |
710 | return -ENOMEM; | |
711 | nrg->from = f; | |
712 | nrg->to = f; | |
713 | INIT_LIST_HEAD(&nrg->link); | |
714 | list_add(&nrg->link, rg->link.prev); | |
715 | ||
716 | return t - f; | |
717 | } | |
718 | ||
719 | /* Round our left edge to the current segment if it encloses us. */ | |
720 | if (f > rg->from) | |
721 | f = rg->from; | |
722 | chg = t - f; | |
723 | ||
724 | /* Check for and consume any regions we now overlap with. */ | |
725 | list_for_each_entry(rg, rg->link.prev, link) { | |
726 | if (&rg->link == head) | |
727 | break; | |
728 | if (rg->from > t) | |
729 | return chg; | |
730 | ||
731 | /* We overlap with this area, if it extends futher than | |
732 | * us then we must extend ourselves. Account for its | |
733 | * existing reservation. */ | |
734 | if (rg->to > t) { | |
735 | chg += rg->to - t; | |
736 | t = rg->to; | |
737 | } | |
738 | chg -= rg->to - rg->from; | |
739 | } | |
740 | return chg; | |
741 | } | |
742 | ||
743 | static long region_truncate(struct list_head *head, long end) | |
744 | { | |
745 | struct file_region *rg, *trg; | |
746 | long chg = 0; | |
747 | ||
748 | /* Locate the region we are either in or before. */ | |
749 | list_for_each_entry(rg, head, link) | |
750 | if (end <= rg->to) | |
751 | break; | |
752 | if (&rg->link == head) | |
753 | return 0; | |
754 | ||
755 | /* If we are in the middle of a region then adjust it. */ | |
756 | if (end > rg->from) { | |
757 | chg = rg->to - end; | |
758 | rg->to = end; | |
759 | rg = list_entry(rg->link.next, typeof(*rg), link); | |
760 | } | |
761 | ||
762 | /* Drop any remaining regions. */ | |
763 | list_for_each_entry_safe(rg, trg, rg->link.prev, link) { | |
764 | if (&rg->link == head) | |
765 | break; | |
766 | chg += rg->to - rg->from; | |
767 | list_del(&rg->link); | |
768 | kfree(rg); | |
769 | } | |
770 | return chg; | |
771 | } | |
772 | ||
773 | static int hugetlb_acct_memory(long delta) | |
774 | { | |
775 | int ret = -ENOMEM; | |
776 | ||
777 | spin_lock(&hugetlb_lock); | |
778 | if ((delta + resv_huge_pages) <= free_huge_pages) { | |
779 | resv_huge_pages += delta; | |
780 | ret = 0; | |
781 | } | |
782 | spin_unlock(&hugetlb_lock); | |
783 | return ret; | |
784 | } | |
785 | ||
786 | int hugetlb_reserve_pages(struct inode *inode, long from, long to) | |
787 | { | |
788 | long ret, chg; | |
789 | ||
790 | chg = region_chg(&inode->i_mapping->private_list, from, to); | |
791 | if (chg < 0) | |
792 | return chg; | |
793 | ret = hugetlb_acct_memory(chg); | |
794 | if (ret < 0) | |
795 | return ret; | |
796 | region_add(&inode->i_mapping->private_list, from, to); | |
797 | return 0; | |
798 | } | |
799 | ||
800 | void hugetlb_unreserve_pages(struct inode *inode, long offset, long freed) | |
801 | { | |
802 | long chg = region_truncate(&inode->i_mapping->private_list, offset); | |
803 | hugetlb_acct_memory(freed - chg); | |
804 | } |