2 * Generic hugetlb support.
3 * (C) William Irwin, April 2004
5 #include <linux/list.h>
6 #include <linux/init.h>
7 #include <linux/module.h>
9 #include <linux/seq_file.h>
10 #include <linux/sysctl.h>
11 #include <linux/highmem.h>
12 #include <linux/mmu_notifier.h>
13 #include <linux/nodemask.h>
14 #include <linux/pagemap.h>
15 #include <linux/mempolicy.h>
16 #include <linux/cpuset.h>
17 #include <linux/mutex.h>
18 #include <linux/bootmem.h>
19 #include <linux/sysfs.h>
20 #include <linux/slab.h>
21 #include <linux/rmap.h>
22 #include <linux/swap.h>
23 #include <linux/swapops.h>
26 #include <asm/pgtable.h>
29 #include <linux/hugetlb.h>
30 #include <linux/node.h>
33 const unsigned long hugetlb_zero = 0, hugetlb_infinity = ~0UL;
34 static gfp_t htlb_alloc_mask = GFP_HIGHUSER;
35 unsigned long hugepages_treat_as_movable;
37 static int max_hstate;
38 unsigned int default_hstate_idx;
39 struct hstate hstates[HUGE_MAX_HSTATE];
41 __initdata LIST_HEAD(huge_boot_pages);
43 /* for command line parsing */
44 static struct hstate * __initdata parsed_hstate;
45 static unsigned long __initdata default_hstate_max_huge_pages;
46 static unsigned long __initdata default_hstate_size;
48 #define for_each_hstate(h) \
49 for ((h) = hstates; (h) < &hstates[max_hstate]; (h)++)
52 * Protects updates to hugepage_freelists, nr_huge_pages, and free_huge_pages
54 static DEFINE_SPINLOCK(hugetlb_lock);
57 * Region tracking -- allows tracking of reservations and instantiated pages
58 * across the pages in a mapping.
60 * The region data structures are protected by a combination of the mmap_sem
61 * and the hugetlb_instantion_mutex. To access or modify a region the caller
62 * must either hold the mmap_sem for write, or the mmap_sem for read and
63 * the hugetlb_instantiation mutex:
65 * down_write(&mm->mmap_sem);
67 * down_read(&mm->mmap_sem);
68 * mutex_lock(&hugetlb_instantiation_mutex);
71 struct list_head link;
76 static long region_add(struct list_head *head, long f, long t)
78 struct file_region *rg, *nrg, *trg;
80 /* Locate the region we are either in or before. */
81 list_for_each_entry(rg, head, link)
85 /* Round our left edge to the current segment if it encloses us. */
89 /* Check for and consume any regions we now overlap with. */
91 list_for_each_entry_safe(rg, trg, rg->link.prev, link) {
92 if (&rg->link == head)
97 /* If this area reaches higher then extend our area to
98 * include it completely. If this is not the first area
99 * which we intend to reuse, free it. */
112 static long region_chg(struct list_head *head, long f, long t)
114 struct file_region *rg, *nrg;
117 /* Locate the region we are before or in. */
118 list_for_each_entry(rg, head, link)
122 /* If we are below the current region then a new region is required.
123 * Subtle, allocate a new region at the position but make it zero
124 * size such that we can guarantee to record the reservation. */
125 if (&rg->link == head || t < rg->from) {
126 nrg = kmalloc(sizeof(*nrg), GFP_KERNEL);
131 INIT_LIST_HEAD(&nrg->link);
132 list_add(&nrg->link, rg->link.prev);
137 /* Round our left edge to the current segment if it encloses us. */
142 /* Check for and consume any regions we now overlap with. */
143 list_for_each_entry(rg, rg->link.prev, link) {
144 if (&rg->link == head)
149 /* We overlap with this area, if it extends further than
150 * us then we must extend ourselves. Account for its
151 * existing reservation. */
156 chg -= rg->to - rg->from;
161 static long region_truncate(struct list_head *head, long end)
163 struct file_region *rg, *trg;
166 /* Locate the region we are either in or before. */
167 list_for_each_entry(rg, head, link)
170 if (&rg->link == head)
173 /* If we are in the middle of a region then adjust it. */
174 if (end > rg->from) {
177 rg = list_entry(rg->link.next, typeof(*rg), link);
180 /* Drop any remaining regions. */
181 list_for_each_entry_safe(rg, trg, rg->link.prev, link) {
182 if (&rg->link == head)
184 chg += rg->to - rg->from;
191 static long region_count(struct list_head *head, long f, long t)
193 struct file_region *rg;
196 /* Locate each segment we overlap with, and count that overlap. */
197 list_for_each_entry(rg, head, link) {
206 seg_from = max(rg->from, f);
207 seg_to = min(rg->to, t);
209 chg += seg_to - seg_from;
216 * Convert the address within this vma to the page offset within
217 * the mapping, in pagecache page units; huge pages here.
219 static pgoff_t vma_hugecache_offset(struct hstate *h,
220 struct vm_area_struct *vma, unsigned long address)
222 return ((address - vma->vm_start) >> huge_page_shift(h)) +
223 (vma->vm_pgoff >> huge_page_order(h));
226 pgoff_t linear_hugepage_index(struct vm_area_struct *vma,
227 unsigned long address)
229 return vma_hugecache_offset(hstate_vma(vma), vma, address);
233 * Return the size of the pages allocated when backing a VMA. In the majority
234 * cases this will be same size as used by the page table entries.
236 unsigned long vma_kernel_pagesize(struct vm_area_struct *vma)
238 struct hstate *hstate;
240 if (!is_vm_hugetlb_page(vma))
243 hstate = hstate_vma(vma);
245 return 1UL << (hstate->order + PAGE_SHIFT);
247 EXPORT_SYMBOL_GPL(vma_kernel_pagesize);
250 * Return the page size being used by the MMU to back a VMA. In the majority
251 * of cases, the page size used by the kernel matches the MMU size. On
252 * architectures where it differs, an architecture-specific version of this
253 * function is required.
255 #ifndef vma_mmu_pagesize
256 unsigned long vma_mmu_pagesize(struct vm_area_struct *vma)
258 return vma_kernel_pagesize(vma);
263 * Flags for MAP_PRIVATE reservations. These are stored in the bottom
264 * bits of the reservation map pointer, which are always clear due to
267 #define HPAGE_RESV_OWNER (1UL << 0)
268 #define HPAGE_RESV_UNMAPPED (1UL << 1)
269 #define HPAGE_RESV_MASK (HPAGE_RESV_OWNER | HPAGE_RESV_UNMAPPED)
272 * These helpers are used to track how many pages are reserved for
273 * faults in a MAP_PRIVATE mapping. Only the process that called mmap()
274 * is guaranteed to have their future faults succeed.
276 * With the exception of reset_vma_resv_huge_pages() which is called at fork(),
277 * the reserve counters are updated with the hugetlb_lock held. It is safe
278 * to reset the VMA at fork() time as it is not in use yet and there is no
279 * chance of the global counters getting corrupted as a result of the values.
281 * The private mapping reservation is represented in a subtly different
282 * manner to a shared mapping. A shared mapping has a region map associated
283 * with the underlying file, this region map represents the backing file
284 * pages which have ever had a reservation assigned which this persists even
285 * after the page is instantiated. A private mapping has a region map
286 * associated with the original mmap which is attached to all VMAs which
287 * reference it, this region map represents those offsets which have consumed
288 * reservation ie. where pages have been instantiated.
290 static unsigned long get_vma_private_data(struct vm_area_struct *vma)
292 return (unsigned long)vma->vm_private_data;
295 static void set_vma_private_data(struct vm_area_struct *vma,
298 vma->vm_private_data = (void *)value;
303 struct list_head regions;
306 static struct resv_map *resv_map_alloc(void)
308 struct resv_map *resv_map = kmalloc(sizeof(*resv_map), GFP_KERNEL);
312 kref_init(&resv_map->refs);
313 INIT_LIST_HEAD(&resv_map->regions);
318 static void resv_map_release(struct kref *ref)
320 struct resv_map *resv_map = container_of(ref, struct resv_map, refs);
322 /* Clear out any active regions before we release the map. */
323 region_truncate(&resv_map->regions, 0);
327 static struct resv_map *vma_resv_map(struct vm_area_struct *vma)
329 VM_BUG_ON(!is_vm_hugetlb_page(vma));
330 if (!(vma->vm_flags & VM_MAYSHARE))
331 return (struct resv_map *)(get_vma_private_data(vma) &
336 static void set_vma_resv_map(struct vm_area_struct *vma, struct resv_map *map)
338 VM_BUG_ON(!is_vm_hugetlb_page(vma));
339 VM_BUG_ON(vma->vm_flags & VM_MAYSHARE);
341 set_vma_private_data(vma, (get_vma_private_data(vma) &
342 HPAGE_RESV_MASK) | (unsigned long)map);
345 static void set_vma_resv_flags(struct vm_area_struct *vma, unsigned long flags)
347 VM_BUG_ON(!is_vm_hugetlb_page(vma));
348 VM_BUG_ON(vma->vm_flags & VM_MAYSHARE);
350 set_vma_private_data(vma, get_vma_private_data(vma) | flags);
353 static int is_vma_resv_set(struct vm_area_struct *vma, unsigned long flag)
355 VM_BUG_ON(!is_vm_hugetlb_page(vma));
357 return (get_vma_private_data(vma) & flag) != 0;
360 /* Decrement the reserved pages in the hugepage pool by one */
361 static void decrement_hugepage_resv_vma(struct hstate *h,
362 struct vm_area_struct *vma)
364 if (vma->vm_flags & VM_NORESERVE)
367 if (vma->vm_flags & VM_MAYSHARE) {
368 /* Shared mappings always use reserves */
369 h->resv_huge_pages--;
370 } else if (is_vma_resv_set(vma, HPAGE_RESV_OWNER)) {
372 * Only the process that called mmap() has reserves for
375 h->resv_huge_pages--;
379 /* Reset counters to 0 and clear all HPAGE_RESV_* flags */
380 void reset_vma_resv_huge_pages(struct vm_area_struct *vma)
382 VM_BUG_ON(!is_vm_hugetlb_page(vma));
383 if (!(vma->vm_flags & VM_MAYSHARE))
384 vma->vm_private_data = (void *)0;
387 /* Returns true if the VMA has associated reserve pages */
388 static int vma_has_reserves(struct vm_area_struct *vma)
390 if (vma->vm_flags & VM_MAYSHARE)
392 if (is_vma_resv_set(vma, HPAGE_RESV_OWNER))
397 static void copy_gigantic_page(struct page *dst, struct page *src)
400 struct hstate *h = page_hstate(src);
401 struct page *dst_base = dst;
402 struct page *src_base = src;
404 for (i = 0; i < pages_per_huge_page(h); ) {
406 copy_highpage(dst, src);
409 dst = mem_map_next(dst, dst_base, i);
410 src = mem_map_next(src, src_base, i);
414 void copy_huge_page(struct page *dst, struct page *src)
417 struct hstate *h = page_hstate(src);
419 if (unlikely(pages_per_huge_page(h) > MAX_ORDER_NR_PAGES)) {
420 copy_gigantic_page(dst, src);
425 for (i = 0; i < pages_per_huge_page(h); i++) {
427 copy_highpage(dst + i, src + i);
431 static void enqueue_huge_page(struct hstate *h, struct page *page)
433 int nid = page_to_nid(page);
434 list_add(&page->lru, &h->hugepage_freelists[nid]);
435 h->free_huge_pages++;
436 h->free_huge_pages_node[nid]++;
439 static struct page *dequeue_huge_page_node(struct hstate *h, int nid)
443 if (list_empty(&h->hugepage_freelists[nid]))
445 page = list_entry(h->hugepage_freelists[nid].next, struct page, lru);
446 list_del(&page->lru);
447 set_page_refcounted(page);
448 h->free_huge_pages--;
449 h->free_huge_pages_node[nid]--;
453 static struct page *dequeue_huge_page_vma(struct hstate *h,
454 struct vm_area_struct *vma,
455 unsigned long address, int avoid_reserve)
457 struct page *page = NULL;
458 struct mempolicy *mpol;
459 nodemask_t *nodemask;
460 struct zonelist *zonelist;
463 unsigned int cpuset_mems_cookie;
466 cpuset_mems_cookie = get_mems_allowed();
467 zonelist = huge_zonelist(vma, address,
468 htlb_alloc_mask, &mpol, &nodemask);
470 * A child process with MAP_PRIVATE mappings created by their parent
471 * have no page reserves. This check ensures that reservations are
472 * not "stolen". The child may still get SIGKILLed
474 if (!vma_has_reserves(vma) &&
475 h->free_huge_pages - h->resv_huge_pages == 0)
478 /* If reserves cannot be used, ensure enough pages are in the pool */
479 if (avoid_reserve && h->free_huge_pages - h->resv_huge_pages == 0)
482 for_each_zone_zonelist_nodemask(zone, z, zonelist,
483 MAX_NR_ZONES - 1, nodemask) {
484 if (cpuset_zone_allowed_softwall(zone, htlb_alloc_mask)) {
485 page = dequeue_huge_page_node(h, zone_to_nid(zone));
488 decrement_hugepage_resv_vma(h, vma);
495 if (unlikely(!put_mems_allowed(cpuset_mems_cookie) && !page))
504 static void update_and_free_page(struct hstate *h, struct page *page)
508 VM_BUG_ON(h->order >= MAX_ORDER);
511 h->nr_huge_pages_node[page_to_nid(page)]--;
512 for (i = 0; i < pages_per_huge_page(h); i++) {
513 page[i].flags &= ~(1 << PG_locked | 1 << PG_error | 1 << PG_referenced |
514 1 << PG_dirty | 1 << PG_active | 1 << PG_reserved |
515 1 << PG_private | 1<< PG_writeback);
517 set_compound_page_dtor(page, NULL);
518 set_page_refcounted(page);
519 arch_release_hugepage(page);
520 __free_pages(page, huge_page_order(h));
523 struct hstate *size_to_hstate(unsigned long size)
528 if (huge_page_size(h) == size)
534 static void free_huge_page(struct page *page)
537 * Can't pass hstate in here because it is called from the
538 * compound page destructor.
540 struct hstate *h = page_hstate(page);
541 int nid = page_to_nid(page);
542 struct address_space *mapping;
544 mapping = (struct address_space *) page_private(page);
545 set_page_private(page, 0);
546 page->mapping = NULL;
547 BUG_ON(page_count(page));
548 BUG_ON(page_mapcount(page));
549 INIT_LIST_HEAD(&page->lru);
551 spin_lock(&hugetlb_lock);
552 if (h->surplus_huge_pages_node[nid] && huge_page_order(h) < MAX_ORDER) {
553 update_and_free_page(h, page);
554 h->surplus_huge_pages--;
555 h->surplus_huge_pages_node[nid]--;
557 enqueue_huge_page(h, page);
559 spin_unlock(&hugetlb_lock);
561 hugetlb_put_quota(mapping, 1);
564 static void prep_new_huge_page(struct hstate *h, struct page *page, int nid)
566 set_compound_page_dtor(page, free_huge_page);
567 spin_lock(&hugetlb_lock);
569 h->nr_huge_pages_node[nid]++;
570 spin_unlock(&hugetlb_lock);
571 put_page(page); /* free it into the hugepage allocator */
574 static void prep_compound_gigantic_page(struct page *page, unsigned long order)
577 int nr_pages = 1 << order;
578 struct page *p = page + 1;
580 /* we rely on prep_new_huge_page to set the destructor */
581 set_compound_order(page, order);
583 for (i = 1; i < nr_pages; i++, p = mem_map_next(p, page, i)) {
585 set_page_count(p, 0);
586 p->first_page = page;
590 int PageHuge(struct page *page)
592 compound_page_dtor *dtor;
594 if (!PageCompound(page))
597 page = compound_head(page);
598 dtor = get_compound_page_dtor(page);
600 return dtor == free_huge_page;
603 EXPORT_SYMBOL_GPL(PageHuge);
605 static struct page *alloc_fresh_huge_page_node(struct hstate *h, int nid)
609 if (h->order >= MAX_ORDER)
612 page = alloc_pages_exact_node(nid,
613 htlb_alloc_mask|__GFP_COMP|__GFP_THISNODE|
614 __GFP_REPEAT|__GFP_NOWARN,
617 if (arch_prepare_hugepage(page)) {
618 __free_pages(page, huge_page_order(h));
621 prep_new_huge_page(h, page, nid);
628 * common helper functions for hstate_next_node_to_{alloc|free}.
629 * We may have allocated or freed a huge page based on a different
630 * nodes_allowed previously, so h->next_node_to_{alloc|free} might
631 * be outside of *nodes_allowed. Ensure that we use an allowed
632 * node for alloc or free.
634 static int next_node_allowed(int nid, nodemask_t *nodes_allowed)
636 nid = next_node(nid, *nodes_allowed);
637 if (nid == MAX_NUMNODES)
638 nid = first_node(*nodes_allowed);
639 VM_BUG_ON(nid >= MAX_NUMNODES);
644 static int get_valid_node_allowed(int nid, nodemask_t *nodes_allowed)
646 if (!node_isset(nid, *nodes_allowed))
647 nid = next_node_allowed(nid, nodes_allowed);
652 * returns the previously saved node ["this node"] from which to
653 * allocate a persistent huge page for the pool and advance the
654 * next node from which to allocate, handling wrap at end of node
657 static int hstate_next_node_to_alloc(struct hstate *h,
658 nodemask_t *nodes_allowed)
662 VM_BUG_ON(!nodes_allowed);
664 nid = get_valid_node_allowed(h->next_nid_to_alloc, nodes_allowed);
665 h->next_nid_to_alloc = next_node_allowed(nid, nodes_allowed);
670 static int alloc_fresh_huge_page(struct hstate *h, nodemask_t *nodes_allowed)
677 start_nid = hstate_next_node_to_alloc(h, nodes_allowed);
678 next_nid = start_nid;
681 page = alloc_fresh_huge_page_node(h, next_nid);
686 next_nid = hstate_next_node_to_alloc(h, nodes_allowed);
687 } while (next_nid != start_nid);
690 count_vm_event(HTLB_BUDDY_PGALLOC);
692 count_vm_event(HTLB_BUDDY_PGALLOC_FAIL);
698 * helper for free_pool_huge_page() - return the previously saved
699 * node ["this node"] from which to free a huge page. Advance the
700 * next node id whether or not we find a free huge page to free so
701 * that the next attempt to free addresses the next node.
703 static int hstate_next_node_to_free(struct hstate *h, nodemask_t *nodes_allowed)
707 VM_BUG_ON(!nodes_allowed);
709 nid = get_valid_node_allowed(h->next_nid_to_free, nodes_allowed);
710 h->next_nid_to_free = next_node_allowed(nid, nodes_allowed);
716 * Free huge page from pool from next node to free.
717 * Attempt to keep persistent huge pages more or less
718 * balanced over allowed nodes.
719 * Called with hugetlb_lock locked.
721 static int free_pool_huge_page(struct hstate *h, nodemask_t *nodes_allowed,
728 start_nid = hstate_next_node_to_free(h, nodes_allowed);
729 next_nid = start_nid;
733 * If we're returning unused surplus pages, only examine
734 * nodes with surplus pages.
736 if ((!acct_surplus || h->surplus_huge_pages_node[next_nid]) &&
737 !list_empty(&h->hugepage_freelists[next_nid])) {
739 list_entry(h->hugepage_freelists[next_nid].next,
741 list_del(&page->lru);
742 h->free_huge_pages--;
743 h->free_huge_pages_node[next_nid]--;
745 h->surplus_huge_pages--;
746 h->surplus_huge_pages_node[next_nid]--;
748 update_and_free_page(h, page);
752 next_nid = hstate_next_node_to_free(h, nodes_allowed);
753 } while (next_nid != start_nid);
758 static struct page *alloc_buddy_huge_page(struct hstate *h, int nid)
763 if (h->order >= MAX_ORDER)
767 * Assume we will successfully allocate the surplus page to
768 * prevent racing processes from causing the surplus to exceed
771 * This however introduces a different race, where a process B
772 * tries to grow the static hugepage pool while alloc_pages() is
773 * called by process A. B will only examine the per-node
774 * counters in determining if surplus huge pages can be
775 * converted to normal huge pages in adjust_pool_surplus(). A
776 * won't be able to increment the per-node counter, until the
777 * lock is dropped by B, but B doesn't drop hugetlb_lock until
778 * no more huge pages can be converted from surplus to normal
779 * state (and doesn't try to convert again). Thus, we have a
780 * case where a surplus huge page exists, the pool is grown, and
781 * the surplus huge page still exists after, even though it
782 * should just have been converted to a normal huge page. This
783 * does not leak memory, though, as the hugepage will be freed
784 * once it is out of use. It also does not allow the counters to
785 * go out of whack in adjust_pool_surplus() as we don't modify
786 * the node values until we've gotten the hugepage and only the
787 * per-node value is checked there.
789 spin_lock(&hugetlb_lock);
790 if (h->surplus_huge_pages >= h->nr_overcommit_huge_pages) {
791 spin_unlock(&hugetlb_lock);
795 h->surplus_huge_pages++;
797 spin_unlock(&hugetlb_lock);
799 if (nid == NUMA_NO_NODE)
800 page = alloc_pages(htlb_alloc_mask|__GFP_COMP|
801 __GFP_REPEAT|__GFP_NOWARN,
804 page = alloc_pages_exact_node(nid,
805 htlb_alloc_mask|__GFP_COMP|__GFP_THISNODE|
806 __GFP_REPEAT|__GFP_NOWARN, huge_page_order(h));
808 if (page && arch_prepare_hugepage(page)) {
809 __free_pages(page, huge_page_order(h));
813 spin_lock(&hugetlb_lock);
815 r_nid = page_to_nid(page);
816 set_compound_page_dtor(page, free_huge_page);
818 * We incremented the global counters already
820 h->nr_huge_pages_node[r_nid]++;
821 h->surplus_huge_pages_node[r_nid]++;
822 __count_vm_event(HTLB_BUDDY_PGALLOC);
825 h->surplus_huge_pages--;
826 __count_vm_event(HTLB_BUDDY_PGALLOC_FAIL);
828 spin_unlock(&hugetlb_lock);
834 * This allocation function is useful in the context where vma is irrelevant.
835 * E.g. soft-offlining uses this function because it only cares physical
836 * address of error page.
838 struct page *alloc_huge_page_node(struct hstate *h, int nid)
842 spin_lock(&hugetlb_lock);
843 page = dequeue_huge_page_node(h, nid);
844 spin_unlock(&hugetlb_lock);
847 page = alloc_buddy_huge_page(h, nid);
853 * Increase the hugetlb pool such that it can accommodate a reservation
856 static int gather_surplus_pages(struct hstate *h, int delta)
858 struct list_head surplus_list;
859 struct page *page, *tmp;
861 int needed, allocated;
863 needed = (h->resv_huge_pages + delta) - h->free_huge_pages;
865 h->resv_huge_pages += delta;
870 INIT_LIST_HEAD(&surplus_list);
874 spin_unlock(&hugetlb_lock);
875 for (i = 0; i < needed; i++) {
876 page = alloc_buddy_huge_page(h, NUMA_NO_NODE);
879 * We were not able to allocate enough pages to
880 * satisfy the entire reservation so we free what
881 * we've allocated so far.
885 list_add(&page->lru, &surplus_list);
890 * After retaking hugetlb_lock, we need to recalculate 'needed'
891 * because either resv_huge_pages or free_huge_pages may have changed.
893 spin_lock(&hugetlb_lock);
894 needed = (h->resv_huge_pages + delta) -
895 (h->free_huge_pages + allocated);
900 * The surplus_list now contains _at_least_ the number of extra pages
901 * needed to accommodate the reservation. Add the appropriate number
902 * of pages to the hugetlb pool and free the extras back to the buddy
903 * allocator. Commit the entire reservation here to prevent another
904 * process from stealing the pages as they are added to the pool but
905 * before they are reserved.
908 h->resv_huge_pages += delta;
911 /* Free the needed pages to the hugetlb pool */
912 list_for_each_entry_safe(page, tmp, &surplus_list, lru) {
915 list_del(&page->lru);
917 * This page is now managed by the hugetlb allocator and has
918 * no users -- drop the buddy allocator's reference.
920 put_page_testzero(page);
921 VM_BUG_ON(page_count(page));
922 enqueue_huge_page(h, page);
924 spin_unlock(&hugetlb_lock);
926 /* Free unnecessary surplus pages to the buddy allocator */
928 if (!list_empty(&surplus_list)) {
929 list_for_each_entry_safe(page, tmp, &surplus_list, lru) {
930 list_del(&page->lru);
934 spin_lock(&hugetlb_lock);
940 * When releasing a hugetlb pool reservation, any surplus pages that were
941 * allocated to satisfy the reservation must be explicitly freed if they were
943 * Called with hugetlb_lock held.
945 static void return_unused_surplus_pages(struct hstate *h,
946 unsigned long unused_resv_pages)
948 unsigned long nr_pages;
950 /* Uncommit the reservation */
951 h->resv_huge_pages -= unused_resv_pages;
953 /* Cannot return gigantic pages currently */
954 if (h->order >= MAX_ORDER)
957 nr_pages = min(unused_resv_pages, h->surplus_huge_pages);
960 * We want to release as many surplus pages as possible, spread
961 * evenly across all nodes with memory. Iterate across these nodes
962 * until we can no longer free unreserved surplus pages. This occurs
963 * when the nodes with surplus pages have no free pages.
964 * free_pool_huge_page() will balance the the freed pages across the
965 * on-line nodes with memory and will handle the hstate accounting.
968 if (!free_pool_huge_page(h, &node_states[N_HIGH_MEMORY], 1))
974 * Determine if the huge page at addr within the vma has an associated
975 * reservation. Where it does not we will need to logically increase
976 * reservation and actually increase quota before an allocation can occur.
977 * Where any new reservation would be required the reservation change is
978 * prepared, but not committed. Once the page has been quota'd allocated
979 * an instantiated the change should be committed via vma_commit_reservation.
980 * No action is required on failure.
982 static long vma_needs_reservation(struct hstate *h,
983 struct vm_area_struct *vma, unsigned long addr)
985 struct address_space *mapping = vma->vm_file->f_mapping;
986 struct inode *inode = mapping->host;
988 if (vma->vm_flags & VM_MAYSHARE) {
989 pgoff_t idx = vma_hugecache_offset(h, vma, addr);
990 return region_chg(&inode->i_mapping->private_list,
993 } else if (!is_vma_resv_set(vma, HPAGE_RESV_OWNER)) {
998 pgoff_t idx = vma_hugecache_offset(h, vma, addr);
999 struct resv_map *reservations = vma_resv_map(vma);
1001 err = region_chg(&reservations->regions, idx, idx + 1);
1007 static void vma_commit_reservation(struct hstate *h,
1008 struct vm_area_struct *vma, unsigned long addr)
1010 struct address_space *mapping = vma->vm_file->f_mapping;
1011 struct inode *inode = mapping->host;
1013 if (vma->vm_flags & VM_MAYSHARE) {
1014 pgoff_t idx = vma_hugecache_offset(h, vma, addr);
1015 region_add(&inode->i_mapping->private_list, idx, idx + 1);
1017 } else if (is_vma_resv_set(vma, HPAGE_RESV_OWNER)) {
1018 pgoff_t idx = vma_hugecache_offset(h, vma, addr);
1019 struct resv_map *reservations = vma_resv_map(vma);
1021 /* Mark this page used in the map. */
1022 region_add(&reservations->regions, idx, idx + 1);
1026 static struct page *alloc_huge_page(struct vm_area_struct *vma,
1027 unsigned long addr, int avoid_reserve)
1029 struct hstate *h = hstate_vma(vma);
1031 struct address_space *mapping = vma->vm_file->f_mapping;
1032 struct inode *inode = mapping->host;
1036 * Processes that did not create the mapping will have no reserves and
1037 * will not have accounted against quota. Check that the quota can be
1038 * made before satisfying the allocation
1039 * MAP_NORESERVE mappings may also need pages and quota allocated
1040 * if no reserve mapping overlaps.
1042 chg = vma_needs_reservation(h, vma, addr);
1044 return ERR_PTR(-VM_FAULT_OOM);
1046 if (hugetlb_get_quota(inode->i_mapping, chg))
1047 return ERR_PTR(-VM_FAULT_SIGBUS);
1049 spin_lock(&hugetlb_lock);
1050 page = dequeue_huge_page_vma(h, vma, addr, avoid_reserve);
1051 spin_unlock(&hugetlb_lock);
1054 page = alloc_buddy_huge_page(h, NUMA_NO_NODE);
1056 hugetlb_put_quota(inode->i_mapping, chg);
1057 return ERR_PTR(-VM_FAULT_SIGBUS);
1061 set_page_private(page, (unsigned long) mapping);
1063 vma_commit_reservation(h, vma, addr);
1068 int __weak alloc_bootmem_huge_page(struct hstate *h)
1070 struct huge_bootmem_page *m;
1071 int nr_nodes = nodes_weight(node_states[N_HIGH_MEMORY]);
1076 addr = __alloc_bootmem_node_nopanic(
1077 NODE_DATA(hstate_next_node_to_alloc(h,
1078 &node_states[N_HIGH_MEMORY])),
1079 huge_page_size(h), huge_page_size(h), 0);
1083 * Use the beginning of the huge page to store the
1084 * huge_bootmem_page struct (until gather_bootmem
1085 * puts them into the mem_map).
1095 BUG_ON((unsigned long)virt_to_phys(m) & (huge_page_size(h) - 1));
1096 /* Put them into a private list first because mem_map is not up yet */
1097 list_add(&m->list, &huge_boot_pages);
1102 static void prep_compound_huge_page(struct page *page, int order)
1104 if (unlikely(order > (MAX_ORDER - 1)))
1105 prep_compound_gigantic_page(page, order);
1107 prep_compound_page(page, order);
1110 /* Put bootmem huge pages into the standard lists after mem_map is up */
1111 static void __init gather_bootmem_prealloc(void)
1113 struct huge_bootmem_page *m;
1115 list_for_each_entry(m, &huge_boot_pages, list) {
1116 struct page *page = virt_to_page(m);
1117 struct hstate *h = m->hstate;
1118 __ClearPageReserved(page);
1119 WARN_ON(page_count(page) != 1);
1120 prep_compound_huge_page(page, h->order);
1121 prep_new_huge_page(h, page, page_to_nid(page));
1123 * If we had gigantic hugepages allocated at boot time, we need
1124 * to restore the 'stolen' pages to totalram_pages in order to
1125 * fix confusing memory reports from free(1) and another
1126 * side-effects, like CommitLimit going negative.
1128 if (h->order > (MAX_ORDER - 1))
1129 totalram_pages += 1 << h->order;
1133 static void __init hugetlb_hstate_alloc_pages(struct hstate *h)
1137 for (i = 0; i < h->max_huge_pages; ++i) {
1138 if (h->order >= MAX_ORDER) {
1139 if (!alloc_bootmem_huge_page(h))
1141 } else if (!alloc_fresh_huge_page(h,
1142 &node_states[N_HIGH_MEMORY]))
1145 h->max_huge_pages = i;
1148 static void __init hugetlb_init_hstates(void)
1152 for_each_hstate(h) {
1153 /* oversize hugepages were init'ed in early boot */
1154 if (h->order < MAX_ORDER)
1155 hugetlb_hstate_alloc_pages(h);
1159 static char * __init memfmt(char *buf, unsigned long n)
1161 if (n >= (1UL << 30))
1162 sprintf(buf, "%lu GB", n >> 30);
1163 else if (n >= (1UL << 20))
1164 sprintf(buf, "%lu MB", n >> 20);
1166 sprintf(buf, "%lu KB", n >> 10);
1170 static void __init report_hugepages(void)
1174 for_each_hstate(h) {
1176 printk(KERN_INFO "HugeTLB registered %s page size, "
1177 "pre-allocated %ld pages\n",
1178 memfmt(buf, huge_page_size(h)),
1179 h->free_huge_pages);
1183 #ifdef CONFIG_HIGHMEM
1184 static void try_to_free_low(struct hstate *h, unsigned long count,
1185 nodemask_t *nodes_allowed)
1189 if (h->order >= MAX_ORDER)
1192 for_each_node_mask(i, *nodes_allowed) {
1193 struct page *page, *next;
1194 struct list_head *freel = &h->hugepage_freelists[i];
1195 list_for_each_entry_safe(page, next, freel, lru) {
1196 if (count >= h->nr_huge_pages)
1198 if (PageHighMem(page))
1200 list_del(&page->lru);
1201 update_and_free_page(h, page);
1202 h->free_huge_pages--;
1203 h->free_huge_pages_node[page_to_nid(page)]--;
1208 static inline void try_to_free_low(struct hstate *h, unsigned long count,
1209 nodemask_t *nodes_allowed)
1215 * Increment or decrement surplus_huge_pages. Keep node-specific counters
1216 * balanced by operating on them in a round-robin fashion.
1217 * Returns 1 if an adjustment was made.
1219 static int adjust_pool_surplus(struct hstate *h, nodemask_t *nodes_allowed,
1222 int start_nid, next_nid;
1225 VM_BUG_ON(delta != -1 && delta != 1);
1228 start_nid = hstate_next_node_to_alloc(h, nodes_allowed);
1230 start_nid = hstate_next_node_to_free(h, nodes_allowed);
1231 next_nid = start_nid;
1237 * To shrink on this node, there must be a surplus page
1239 if (!h->surplus_huge_pages_node[nid]) {
1240 next_nid = hstate_next_node_to_alloc(h,
1247 * Surplus cannot exceed the total number of pages
1249 if (h->surplus_huge_pages_node[nid] >=
1250 h->nr_huge_pages_node[nid]) {
1251 next_nid = hstate_next_node_to_free(h,
1257 h->surplus_huge_pages += delta;
1258 h->surplus_huge_pages_node[nid] += delta;
1261 } while (next_nid != start_nid);
1266 #define persistent_huge_pages(h) (h->nr_huge_pages - h->surplus_huge_pages)
1267 static unsigned long set_max_huge_pages(struct hstate *h, unsigned long count,
1268 nodemask_t *nodes_allowed)
1270 unsigned long min_count, ret;
1272 if (h->order >= MAX_ORDER)
1273 return h->max_huge_pages;
1276 * Increase the pool size
1277 * First take pages out of surplus state. Then make up the
1278 * remaining difference by allocating fresh huge pages.
1280 * We might race with alloc_buddy_huge_page() here and be unable
1281 * to convert a surplus huge page to a normal huge page. That is
1282 * not critical, though, it just means the overall size of the
1283 * pool might be one hugepage larger than it needs to be, but
1284 * within all the constraints specified by the sysctls.
1286 spin_lock(&hugetlb_lock);
1287 while (h->surplus_huge_pages && count > persistent_huge_pages(h)) {
1288 if (!adjust_pool_surplus(h, nodes_allowed, -1))
1292 while (count > persistent_huge_pages(h)) {
1294 * If this allocation races such that we no longer need the
1295 * page, free_huge_page will handle it by freeing the page
1296 * and reducing the surplus.
1298 spin_unlock(&hugetlb_lock);
1299 ret = alloc_fresh_huge_page(h, nodes_allowed);
1300 spin_lock(&hugetlb_lock);
1304 /* Bail for signals. Probably ctrl-c from user */
1305 if (signal_pending(current))
1310 * Decrease the pool size
1311 * First return free pages to the buddy allocator (being careful
1312 * to keep enough around to satisfy reservations). Then place
1313 * pages into surplus state as needed so the pool will shrink
1314 * to the desired size as pages become free.
1316 * By placing pages into the surplus state independent of the
1317 * overcommit value, we are allowing the surplus pool size to
1318 * exceed overcommit. There are few sane options here. Since
1319 * alloc_buddy_huge_page() is checking the global counter,
1320 * though, we'll note that we're not allowed to exceed surplus
1321 * and won't grow the pool anywhere else. Not until one of the
1322 * sysctls are changed, or the surplus pages go out of use.
1324 min_count = h->resv_huge_pages + h->nr_huge_pages - h->free_huge_pages;
1325 min_count = max(count, min_count);
1326 try_to_free_low(h, min_count, nodes_allowed);
1327 while (min_count < persistent_huge_pages(h)) {
1328 if (!free_pool_huge_page(h, nodes_allowed, 0))
1331 while (count < persistent_huge_pages(h)) {
1332 if (!adjust_pool_surplus(h, nodes_allowed, 1))
1336 ret = persistent_huge_pages(h);
1337 spin_unlock(&hugetlb_lock);
1341 #define HSTATE_ATTR_RO(_name) \
1342 static struct kobj_attribute _name##_attr = __ATTR_RO(_name)
1344 #define HSTATE_ATTR(_name) \
1345 static struct kobj_attribute _name##_attr = \
1346 __ATTR(_name, 0644, _name##_show, _name##_store)
1348 static struct kobject *hugepages_kobj;
1349 static struct kobject *hstate_kobjs[HUGE_MAX_HSTATE];
1351 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp);
1353 static struct hstate *kobj_to_hstate(struct kobject *kobj, int *nidp)
1357 for (i = 0; i < HUGE_MAX_HSTATE; i++)
1358 if (hstate_kobjs[i] == kobj) {
1360 *nidp = NUMA_NO_NODE;
1364 return kobj_to_node_hstate(kobj, nidp);
1367 static ssize_t nr_hugepages_show_common(struct kobject *kobj,
1368 struct kobj_attribute *attr, char *buf)
1371 unsigned long nr_huge_pages;
1374 h = kobj_to_hstate(kobj, &nid);
1375 if (nid == NUMA_NO_NODE)
1376 nr_huge_pages = h->nr_huge_pages;
1378 nr_huge_pages = h->nr_huge_pages_node[nid];
1380 return sprintf(buf, "%lu\n", nr_huge_pages);
1383 static ssize_t nr_hugepages_store_common(bool obey_mempolicy,
1384 struct kobject *kobj, struct kobj_attribute *attr,
1385 const char *buf, size_t len)
1389 unsigned long count;
1391 NODEMASK_ALLOC(nodemask_t, nodes_allowed, GFP_KERNEL | __GFP_NORETRY);
1393 err = strict_strtoul(buf, 10, &count);
1397 h = kobj_to_hstate(kobj, &nid);
1398 if (h->order >= MAX_ORDER) {
1403 if (nid == NUMA_NO_NODE) {
1405 * global hstate attribute
1407 if (!(obey_mempolicy &&
1408 init_nodemask_of_mempolicy(nodes_allowed))) {
1409 NODEMASK_FREE(nodes_allowed);
1410 nodes_allowed = &node_states[N_HIGH_MEMORY];
1412 } else if (nodes_allowed) {
1414 * per node hstate attribute: adjust count to global,
1415 * but restrict alloc/free to the specified node.
1417 count += h->nr_huge_pages - h->nr_huge_pages_node[nid];
1418 init_nodemask_of_node(nodes_allowed, nid);
1420 nodes_allowed = &node_states[N_HIGH_MEMORY];
1422 h->max_huge_pages = set_max_huge_pages(h, count, nodes_allowed);
1424 if (nodes_allowed != &node_states[N_HIGH_MEMORY])
1425 NODEMASK_FREE(nodes_allowed);
1429 NODEMASK_FREE(nodes_allowed);
1433 static ssize_t nr_hugepages_show(struct kobject *kobj,
1434 struct kobj_attribute *attr, char *buf)
1436 return nr_hugepages_show_common(kobj, attr, buf);
1439 static ssize_t nr_hugepages_store(struct kobject *kobj,
1440 struct kobj_attribute *attr, const char *buf, size_t len)
1442 return nr_hugepages_store_common(false, kobj, attr, buf, len);
1444 HSTATE_ATTR(nr_hugepages);
1449 * hstate attribute for optionally mempolicy-based constraint on persistent
1450 * huge page alloc/free.
1452 static ssize_t nr_hugepages_mempolicy_show(struct kobject *kobj,
1453 struct kobj_attribute *attr, char *buf)
1455 return nr_hugepages_show_common(kobj, attr, buf);
1458 static ssize_t nr_hugepages_mempolicy_store(struct kobject *kobj,
1459 struct kobj_attribute *attr, const char *buf, size_t len)
1461 return nr_hugepages_store_common(true, kobj, attr, buf, len);
1463 HSTATE_ATTR(nr_hugepages_mempolicy);
1467 static ssize_t nr_overcommit_hugepages_show(struct kobject *kobj,
1468 struct kobj_attribute *attr, char *buf)
1470 struct hstate *h = kobj_to_hstate(kobj, NULL);
1471 return sprintf(buf, "%lu\n", h->nr_overcommit_huge_pages);
1474 static ssize_t nr_overcommit_hugepages_store(struct kobject *kobj,
1475 struct kobj_attribute *attr, const char *buf, size_t count)
1478 unsigned long input;
1479 struct hstate *h = kobj_to_hstate(kobj, NULL);
1481 if (h->order >= MAX_ORDER)
1484 err = strict_strtoul(buf, 10, &input);
1488 spin_lock(&hugetlb_lock);
1489 h->nr_overcommit_huge_pages = input;
1490 spin_unlock(&hugetlb_lock);
1494 HSTATE_ATTR(nr_overcommit_hugepages);
1496 static ssize_t free_hugepages_show(struct kobject *kobj,
1497 struct kobj_attribute *attr, char *buf)
1500 unsigned long free_huge_pages;
1503 h = kobj_to_hstate(kobj, &nid);
1504 if (nid == NUMA_NO_NODE)
1505 free_huge_pages = h->free_huge_pages;
1507 free_huge_pages = h->free_huge_pages_node[nid];
1509 return sprintf(buf, "%lu\n", free_huge_pages);
1511 HSTATE_ATTR_RO(free_hugepages);
1513 static ssize_t resv_hugepages_show(struct kobject *kobj,
1514 struct kobj_attribute *attr, char *buf)
1516 struct hstate *h = kobj_to_hstate(kobj, NULL);
1517 return sprintf(buf, "%lu\n", h->resv_huge_pages);
1519 HSTATE_ATTR_RO(resv_hugepages);
1521 static ssize_t surplus_hugepages_show(struct kobject *kobj,
1522 struct kobj_attribute *attr, char *buf)
1525 unsigned long surplus_huge_pages;
1528 h = kobj_to_hstate(kobj, &nid);
1529 if (nid == NUMA_NO_NODE)
1530 surplus_huge_pages = h->surplus_huge_pages;
1532 surplus_huge_pages = h->surplus_huge_pages_node[nid];
1534 return sprintf(buf, "%lu\n", surplus_huge_pages);
1536 HSTATE_ATTR_RO(surplus_hugepages);
1538 static struct attribute *hstate_attrs[] = {
1539 &nr_hugepages_attr.attr,
1540 &nr_overcommit_hugepages_attr.attr,
1541 &free_hugepages_attr.attr,
1542 &resv_hugepages_attr.attr,
1543 &surplus_hugepages_attr.attr,
1545 &nr_hugepages_mempolicy_attr.attr,
1550 static struct attribute_group hstate_attr_group = {
1551 .attrs = hstate_attrs,
1554 static int hugetlb_sysfs_add_hstate(struct hstate *h, struct kobject *parent,
1555 struct kobject **hstate_kobjs,
1556 struct attribute_group *hstate_attr_group)
1559 int hi = h - hstates;
1561 hstate_kobjs[hi] = kobject_create_and_add(h->name, parent);
1562 if (!hstate_kobjs[hi])
1565 retval = sysfs_create_group(hstate_kobjs[hi], hstate_attr_group);
1567 kobject_put(hstate_kobjs[hi]);
1572 static void __init hugetlb_sysfs_init(void)
1577 hugepages_kobj = kobject_create_and_add("hugepages", mm_kobj);
1578 if (!hugepages_kobj)
1581 for_each_hstate(h) {
1582 err = hugetlb_sysfs_add_hstate(h, hugepages_kobj,
1583 hstate_kobjs, &hstate_attr_group);
1585 printk(KERN_ERR "Hugetlb: Unable to add hstate %s",
1593 * node_hstate/s - associate per node hstate attributes, via their kobjects,
1594 * with node sysdevs in node_devices[] using a parallel array. The array
1595 * index of a node sysdev or _hstate == node id.
1596 * This is here to avoid any static dependency of the node sysdev driver, in
1597 * the base kernel, on the hugetlb module.
1599 struct node_hstate {
1600 struct kobject *hugepages_kobj;
1601 struct kobject *hstate_kobjs[HUGE_MAX_HSTATE];
1603 struct node_hstate node_hstates[MAX_NUMNODES];
1606 * A subset of global hstate attributes for node sysdevs
1608 static struct attribute *per_node_hstate_attrs[] = {
1609 &nr_hugepages_attr.attr,
1610 &free_hugepages_attr.attr,
1611 &surplus_hugepages_attr.attr,
1615 static struct attribute_group per_node_hstate_attr_group = {
1616 .attrs = per_node_hstate_attrs,
1620 * kobj_to_node_hstate - lookup global hstate for node sysdev hstate attr kobj.
1621 * Returns node id via non-NULL nidp.
1623 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp)
1627 for (nid = 0; nid < nr_node_ids; nid++) {
1628 struct node_hstate *nhs = &node_hstates[nid];
1630 for (i = 0; i < HUGE_MAX_HSTATE; i++)
1631 if (nhs->hstate_kobjs[i] == kobj) {
1643 * Unregister hstate attributes from a single node sysdev.
1644 * No-op if no hstate attributes attached.
1646 void hugetlb_unregister_node(struct node *node)
1649 struct node_hstate *nhs = &node_hstates[node->sysdev.id];
1651 if (!nhs->hugepages_kobj)
1652 return; /* no hstate attributes */
1655 if (nhs->hstate_kobjs[h - hstates]) {
1656 kobject_put(nhs->hstate_kobjs[h - hstates]);
1657 nhs->hstate_kobjs[h - hstates] = NULL;
1660 kobject_put(nhs->hugepages_kobj);
1661 nhs->hugepages_kobj = NULL;
1665 * hugetlb module exit: unregister hstate attributes from node sysdevs
1668 static void hugetlb_unregister_all_nodes(void)
1673 * disable node sysdev registrations.
1675 register_hugetlbfs_with_node(NULL, NULL);
1678 * remove hstate attributes from any nodes that have them.
1680 for (nid = 0; nid < nr_node_ids; nid++)
1681 hugetlb_unregister_node(&node_devices[nid]);
1685 * Register hstate attributes for a single node sysdev.
1686 * No-op if attributes already registered.
1688 void hugetlb_register_node(struct node *node)
1691 struct node_hstate *nhs = &node_hstates[node->sysdev.id];
1694 if (nhs->hugepages_kobj)
1695 return; /* already allocated */
1697 nhs->hugepages_kobj = kobject_create_and_add("hugepages",
1698 &node->sysdev.kobj);
1699 if (!nhs->hugepages_kobj)
1702 for_each_hstate(h) {
1703 err = hugetlb_sysfs_add_hstate(h, nhs->hugepages_kobj,
1705 &per_node_hstate_attr_group);
1707 printk(KERN_ERR "Hugetlb: Unable to add hstate %s"
1709 h->name, node->sysdev.id);
1710 hugetlb_unregister_node(node);
1717 * hugetlb init time: register hstate attributes for all registered node
1718 * sysdevs of nodes that have memory. All on-line nodes should have
1719 * registered their associated sysdev by this time.
1721 static void hugetlb_register_all_nodes(void)
1725 for_each_node_state(nid, N_HIGH_MEMORY) {
1726 struct node *node = &node_devices[nid];
1727 if (node->sysdev.id == nid)
1728 hugetlb_register_node(node);
1732 * Let the node sysdev driver know we're here so it can
1733 * [un]register hstate attributes on node hotplug.
1735 register_hugetlbfs_with_node(hugetlb_register_node,
1736 hugetlb_unregister_node);
1738 #else /* !CONFIG_NUMA */
1740 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp)
1748 static void hugetlb_unregister_all_nodes(void) { }
1750 static void hugetlb_register_all_nodes(void) { }
1754 static void __exit hugetlb_exit(void)
1758 hugetlb_unregister_all_nodes();
1760 for_each_hstate(h) {
1761 kobject_put(hstate_kobjs[h - hstates]);
1764 kobject_put(hugepages_kobj);
1766 module_exit(hugetlb_exit);
1768 static int __init hugetlb_init(void)
1770 /* Some platform decide whether they support huge pages at boot
1771 * time. On these, such as powerpc, HPAGE_SHIFT is set to 0 when
1772 * there is no such support
1774 if (HPAGE_SHIFT == 0)
1777 if (!size_to_hstate(default_hstate_size)) {
1778 default_hstate_size = HPAGE_SIZE;
1779 if (!size_to_hstate(default_hstate_size))
1780 hugetlb_add_hstate(HUGETLB_PAGE_ORDER);
1782 default_hstate_idx = size_to_hstate(default_hstate_size) - hstates;
1783 if (default_hstate_max_huge_pages)
1784 default_hstate.max_huge_pages = default_hstate_max_huge_pages;
1786 hugetlb_init_hstates();
1788 gather_bootmem_prealloc();
1792 hugetlb_sysfs_init();
1794 hugetlb_register_all_nodes();
1798 module_init(hugetlb_init);
1800 /* Should be called on processing a hugepagesz=... option */
1801 void __init hugetlb_add_hstate(unsigned order)
1806 if (size_to_hstate(PAGE_SIZE << order)) {
1807 printk(KERN_WARNING "hugepagesz= specified twice, ignoring\n");
1810 BUG_ON(max_hstate >= HUGE_MAX_HSTATE);
1812 h = &hstates[max_hstate++];
1814 h->mask = ~((1ULL << (order + PAGE_SHIFT)) - 1);
1815 h->nr_huge_pages = 0;
1816 h->free_huge_pages = 0;
1817 for (i = 0; i < MAX_NUMNODES; ++i)
1818 INIT_LIST_HEAD(&h->hugepage_freelists[i]);
1819 h->next_nid_to_alloc = first_node(node_states[N_HIGH_MEMORY]);
1820 h->next_nid_to_free = first_node(node_states[N_HIGH_MEMORY]);
1821 snprintf(h->name, HSTATE_NAME_LEN, "hugepages-%lukB",
1822 huge_page_size(h)/1024);
1827 static int __init hugetlb_nrpages_setup(char *s)
1830 static unsigned long *last_mhp;
1833 * !max_hstate means we haven't parsed a hugepagesz= parameter yet,
1834 * so this hugepages= parameter goes to the "default hstate".
1837 mhp = &default_hstate_max_huge_pages;
1839 mhp = &parsed_hstate->max_huge_pages;
1841 if (mhp == last_mhp) {
1842 printk(KERN_WARNING "hugepages= specified twice without "
1843 "interleaving hugepagesz=, ignoring\n");
1847 if (sscanf(s, "%lu", mhp) <= 0)
1851 * Global state is always initialized later in hugetlb_init.
1852 * But we need to allocate >= MAX_ORDER hstates here early to still
1853 * use the bootmem allocator.
1855 if (max_hstate && parsed_hstate->order >= MAX_ORDER)
1856 hugetlb_hstate_alloc_pages(parsed_hstate);
1862 __setup("hugepages=", hugetlb_nrpages_setup);
1864 static int __init hugetlb_default_setup(char *s)
1866 default_hstate_size = memparse(s, &s);
1869 __setup("default_hugepagesz=", hugetlb_default_setup);
1871 static unsigned int cpuset_mems_nr(unsigned int *array)
1874 unsigned int nr = 0;
1876 for_each_node_mask(node, cpuset_current_mems_allowed)
1882 #ifdef CONFIG_SYSCTL
1883 static int hugetlb_sysctl_handler_common(bool obey_mempolicy,
1884 struct ctl_table *table, int write,
1885 void __user *buffer, size_t *length, loff_t *ppos)
1887 struct hstate *h = &default_hstate;
1891 tmp = h->max_huge_pages;
1893 if (write && h->order >= MAX_ORDER)
1897 table->maxlen = sizeof(unsigned long);
1898 ret = proc_doulongvec_minmax(table, write, buffer, length, ppos);
1903 NODEMASK_ALLOC(nodemask_t, nodes_allowed,
1904 GFP_KERNEL | __GFP_NORETRY);
1905 if (!(obey_mempolicy &&
1906 init_nodemask_of_mempolicy(nodes_allowed))) {
1907 NODEMASK_FREE(nodes_allowed);
1908 nodes_allowed = &node_states[N_HIGH_MEMORY];
1910 h->max_huge_pages = set_max_huge_pages(h, tmp, nodes_allowed);
1912 if (nodes_allowed != &node_states[N_HIGH_MEMORY])
1913 NODEMASK_FREE(nodes_allowed);
1919 int hugetlb_sysctl_handler(struct ctl_table *table, int write,
1920 void __user *buffer, size_t *length, loff_t *ppos)
1923 return hugetlb_sysctl_handler_common(false, table, write,
1924 buffer, length, ppos);
1928 int hugetlb_mempolicy_sysctl_handler(struct ctl_table *table, int write,
1929 void __user *buffer, size_t *length, loff_t *ppos)
1931 return hugetlb_sysctl_handler_common(true, table, write,
1932 buffer, length, ppos);
1934 #endif /* CONFIG_NUMA */
1936 int hugetlb_treat_movable_handler(struct ctl_table *table, int write,
1937 void __user *buffer,
1938 size_t *length, loff_t *ppos)
1940 proc_dointvec(table, write, buffer, length, ppos);
1941 if (hugepages_treat_as_movable)
1942 htlb_alloc_mask = GFP_HIGHUSER_MOVABLE;
1944 htlb_alloc_mask = GFP_HIGHUSER;
1948 int hugetlb_overcommit_handler(struct ctl_table *table, int write,
1949 void __user *buffer,
1950 size_t *length, loff_t *ppos)
1952 struct hstate *h = &default_hstate;
1956 tmp = h->nr_overcommit_huge_pages;
1958 if (write && h->order >= MAX_ORDER)
1962 table->maxlen = sizeof(unsigned long);
1963 ret = proc_doulongvec_minmax(table, write, buffer, length, ppos);
1968 spin_lock(&hugetlb_lock);
1969 h->nr_overcommit_huge_pages = tmp;
1970 spin_unlock(&hugetlb_lock);
1976 #endif /* CONFIG_SYSCTL */
1978 void hugetlb_report_meminfo(struct seq_file *m)
1980 struct hstate *h = &default_hstate;
1982 "HugePages_Total: %5lu\n"
1983 "HugePages_Free: %5lu\n"
1984 "HugePages_Rsvd: %5lu\n"
1985 "HugePages_Surp: %5lu\n"
1986 "Hugepagesize: %8lu kB\n",
1990 h->surplus_huge_pages,
1991 1UL << (huge_page_order(h) + PAGE_SHIFT - 10));
1994 int hugetlb_report_node_meminfo(int nid, char *buf)
1996 struct hstate *h = &default_hstate;
1998 "Node %d HugePages_Total: %5u\n"
1999 "Node %d HugePages_Free: %5u\n"
2000 "Node %d HugePages_Surp: %5u\n",
2001 nid, h->nr_huge_pages_node[nid],
2002 nid, h->free_huge_pages_node[nid],
2003 nid, h->surplus_huge_pages_node[nid]);
2006 /* Return the number pages of memory we physically have, in PAGE_SIZE units. */
2007 unsigned long hugetlb_total_pages(void)
2009 struct hstate *h = &default_hstate;
2010 return h->nr_huge_pages * pages_per_huge_page(h);
2013 static int hugetlb_acct_memory(struct hstate *h, long delta)
2017 spin_lock(&hugetlb_lock);
2019 * When cpuset is configured, it breaks the strict hugetlb page
2020 * reservation as the accounting is done on a global variable. Such
2021 * reservation is completely rubbish in the presence of cpuset because
2022 * the reservation is not checked against page availability for the
2023 * current cpuset. Application can still potentially OOM'ed by kernel
2024 * with lack of free htlb page in cpuset that the task is in.
2025 * Attempt to enforce strict accounting with cpuset is almost
2026 * impossible (or too ugly) because cpuset is too fluid that
2027 * task or memory node can be dynamically moved between cpusets.
2029 * The change of semantics for shared hugetlb mapping with cpuset is
2030 * undesirable. However, in order to preserve some of the semantics,
2031 * we fall back to check against current free page availability as
2032 * a best attempt and hopefully to minimize the impact of changing
2033 * semantics that cpuset has.
2036 if (gather_surplus_pages(h, delta) < 0)
2039 if (delta > cpuset_mems_nr(h->free_huge_pages_node)) {
2040 return_unused_surplus_pages(h, delta);
2047 return_unused_surplus_pages(h, (unsigned long) -delta);
2050 spin_unlock(&hugetlb_lock);
2054 static void hugetlb_vm_op_open(struct vm_area_struct *vma)
2056 struct resv_map *reservations = vma_resv_map(vma);
2059 * This new VMA should share its siblings reservation map if present.
2060 * The VMA will only ever have a valid reservation map pointer where
2061 * it is being copied for another still existing VMA. As that VMA
2062 * has a reference to the reservation map it cannot disappear until
2063 * after this open call completes. It is therefore safe to take a
2064 * new reference here without additional locking.
2067 kref_get(&reservations->refs);
2070 static void resv_map_put(struct vm_area_struct *vma)
2072 struct resv_map *reservations = vma_resv_map(vma);
2076 kref_put(&reservations->refs, resv_map_release);
2079 static void hugetlb_vm_op_close(struct vm_area_struct *vma)
2081 struct hstate *h = hstate_vma(vma);
2082 struct resv_map *reservations = vma_resv_map(vma);
2083 unsigned long reserve;
2084 unsigned long start;
2088 start = vma_hugecache_offset(h, vma, vma->vm_start);
2089 end = vma_hugecache_offset(h, vma, vma->vm_end);
2091 reserve = (end - start) -
2092 region_count(&reservations->regions, start, end);
2097 hugetlb_acct_memory(h, -reserve);
2098 hugetlb_put_quota(vma->vm_file->f_mapping, reserve);
2104 * We cannot handle pagefaults against hugetlb pages at all. They cause
2105 * handle_mm_fault() to try to instantiate regular-sized pages in the
2106 * hugegpage VMA. do_page_fault() is supposed to trap this, so BUG is we get
2109 static int hugetlb_vm_op_fault(struct vm_area_struct *vma, struct vm_fault *vmf)
2115 const struct vm_operations_struct hugetlb_vm_ops = {
2116 .fault = hugetlb_vm_op_fault,
2117 .open = hugetlb_vm_op_open,
2118 .close = hugetlb_vm_op_close,
2121 static pte_t make_huge_pte(struct vm_area_struct *vma, struct page *page,
2128 pte_mkwrite(pte_mkdirty(mk_pte(page, vma->vm_page_prot)));
2130 entry = huge_pte_wrprotect(mk_pte(page, vma->vm_page_prot));
2132 entry = pte_mkyoung(entry);
2133 entry = pte_mkhuge(entry);
2138 static void set_huge_ptep_writable(struct vm_area_struct *vma,
2139 unsigned long address, pte_t *ptep)
2143 entry = pte_mkwrite(pte_mkdirty(huge_ptep_get(ptep)));
2144 if (huge_ptep_set_access_flags(vma, address, ptep, entry, 1)) {
2145 update_mmu_cache(vma, address, ptep);
2150 int copy_hugetlb_page_range(struct mm_struct *dst, struct mm_struct *src,
2151 struct vm_area_struct *vma)
2153 pte_t *src_pte, *dst_pte, entry;
2154 struct page *ptepage;
2157 struct hstate *h = hstate_vma(vma);
2158 unsigned long sz = huge_page_size(h);
2160 cow = (vma->vm_flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
2162 for (addr = vma->vm_start; addr < vma->vm_end; addr += sz) {
2163 src_pte = huge_pte_offset(src, addr);
2166 dst_pte = huge_pte_alloc(dst, addr, sz);
2170 /* If the pagetables are shared don't copy or take references */
2171 if (dst_pte == src_pte)
2174 spin_lock(&dst->page_table_lock);
2175 spin_lock_nested(&src->page_table_lock, SINGLE_DEPTH_NESTING);
2176 if (!huge_pte_none(huge_ptep_get(src_pte))) {
2178 huge_ptep_set_wrprotect(src, addr, src_pte);
2179 entry = huge_ptep_get(src_pte);
2180 ptepage = pte_page(entry);
2182 page_dup_rmap(ptepage);
2183 set_huge_pte_at(dst, addr, dst_pte, entry);
2185 spin_unlock(&src->page_table_lock);
2186 spin_unlock(&dst->page_table_lock);
2194 static int is_hugetlb_entry_migration(pte_t pte)
2198 if (huge_pte_none(pte) || pte_present(pte))
2200 swp = pte_to_swp_entry(pte);
2201 if (non_swap_entry(swp) && is_migration_entry(swp)) {
2207 static int is_hugetlb_entry_hwpoisoned(pte_t pte)
2211 if (huge_pte_none(pte) || pte_present(pte))
2213 swp = pte_to_swp_entry(pte);
2214 if (non_swap_entry(swp) && is_hwpoison_entry(swp)) {
2220 void __unmap_hugepage_range(struct vm_area_struct *vma, unsigned long start,
2221 unsigned long end, struct page *ref_page)
2223 struct mm_struct *mm = vma->vm_mm;
2224 unsigned long address;
2229 struct hstate *h = hstate_vma(vma);
2230 unsigned long sz = huge_page_size(h);
2233 * A page gathering list, protected by per file i_mmap_mutex. The
2234 * lock is used to avoid list corruption from multiple unmapping
2235 * of the same page since we are using page->lru.
2237 LIST_HEAD(page_list);
2239 WARN_ON(!is_vm_hugetlb_page(vma));
2240 BUG_ON(start & ~huge_page_mask(h));
2241 BUG_ON(end & ~huge_page_mask(h));
2243 mmu_notifier_invalidate_range_start(mm, start, end);
2244 spin_lock(&mm->page_table_lock);
2245 for (address = start; address < end; address += sz) {
2246 ptep = huge_pte_offset(mm, address);
2250 if (huge_pmd_unshare(mm, &address, ptep))
2254 * If a reference page is supplied, it is because a specific
2255 * page is being unmapped, not a range. Ensure the page we
2256 * are about to unmap is the actual page of interest.
2259 pte = huge_ptep_get(ptep);
2260 if (huge_pte_none(pte))
2262 page = pte_page(pte);
2263 if (page != ref_page)
2267 * Mark the VMA as having unmapped its page so that
2268 * future faults in this VMA will fail rather than
2269 * looking like data was lost
2271 set_vma_resv_flags(vma, HPAGE_RESV_UNMAPPED);
2274 pte = huge_ptep_get_and_clear(mm, address, ptep);
2275 if (huge_pte_none(pte))
2279 * HWPoisoned hugepage is already unmapped and dropped reference
2281 if (unlikely(is_hugetlb_entry_hwpoisoned(pte)))
2284 page = pte_page(pte);
2286 set_page_dirty(page);
2287 list_add(&page->lru, &page_list);
2289 spin_unlock(&mm->page_table_lock);
2290 flush_tlb_range(vma, start, end);
2291 mmu_notifier_invalidate_range_end(mm, start, end);
2292 list_for_each_entry_safe(page, tmp, &page_list, lru) {
2293 page_remove_rmap(page);
2294 list_del(&page->lru);
2299 void unmap_hugepage_range(struct vm_area_struct *vma, unsigned long start,
2300 unsigned long end, struct page *ref_page)
2302 mutex_lock(&vma->vm_file->f_mapping->i_mmap_mutex);
2303 __unmap_hugepage_range(vma, start, end, ref_page);
2305 * Clear this flag so that x86's huge_pmd_share page_table_shareable
2306 * test will fail on a vma being torn down, and not grab a page table
2307 * on its way out. We're lucky that the flag has such an appropriate
2308 * name, and can in fact be safely cleared here. We could clear it
2309 * before the __unmap_hugepage_range above, but all that's necessary
2310 * is to clear it before releasing the i_mmap_mutex below.
2312 * This works because in the contexts this is called, the VMA is
2313 * going to be destroyed. It is not vunerable to madvise(DONTNEED)
2314 * because madvise is not supported on hugetlbfs. The same applies
2315 * for direct IO. unmap_hugepage_range() is only being called just
2316 * before free_pgtables() so clearing VM_MAYSHARE will not cause
2319 vma->vm_flags &= ~VM_MAYSHARE;
2320 mutex_unlock(&vma->vm_file->f_mapping->i_mmap_mutex);
2324 * This is called when the original mapper is failing to COW a MAP_PRIVATE
2325 * mappping it owns the reserve page for. The intention is to unmap the page
2326 * from other VMAs and let the children be SIGKILLed if they are faulting the
2329 static int unmap_ref_private(struct mm_struct *mm, struct vm_area_struct *vma,
2330 struct page *page, unsigned long address)
2332 struct hstate *h = hstate_vma(vma);
2333 struct vm_area_struct *iter_vma;
2334 struct address_space *mapping;
2335 struct prio_tree_iter iter;
2339 * vm_pgoff is in PAGE_SIZE units, hence the different calculation
2340 * from page cache lookup which is in HPAGE_SIZE units.
2342 address = address & huge_page_mask(h);
2343 pgoff = ((address - vma->vm_start) >> PAGE_SHIFT)
2344 + (vma->vm_pgoff >> PAGE_SHIFT);
2345 mapping = (struct address_space *)page_private(page);
2348 * Take the mapping lock for the duration of the table walk. As
2349 * this mapping should be shared between all the VMAs,
2350 * __unmap_hugepage_range() is called as the lock is already held
2352 mutex_lock(&mapping->i_mmap_mutex);
2353 vma_prio_tree_foreach(iter_vma, &iter, &mapping->i_mmap, pgoff, pgoff) {
2354 /* Do not unmap the current VMA */
2355 if (iter_vma == vma)
2359 * Unmap the page from other VMAs without their own reserves.
2360 * They get marked to be SIGKILLed if they fault in these
2361 * areas. This is because a future no-page fault on this VMA
2362 * could insert a zeroed page instead of the data existing
2363 * from the time of fork. This would look like data corruption
2365 if (!is_vma_resv_set(iter_vma, HPAGE_RESV_OWNER))
2366 __unmap_hugepage_range(iter_vma,
2367 address, address + huge_page_size(h),
2370 mutex_unlock(&mapping->i_mmap_mutex);
2376 * Hugetlb_cow() should be called with page lock of the original hugepage held.
2378 static int hugetlb_cow(struct mm_struct *mm, struct vm_area_struct *vma,
2379 unsigned long address, pte_t *ptep, pte_t pte,
2380 struct page *pagecache_page)
2382 struct hstate *h = hstate_vma(vma);
2383 struct page *old_page, *new_page;
2385 int outside_reserve = 0;
2387 old_page = pte_page(pte);
2390 /* If no-one else is actually using this page, avoid the copy
2391 * and just make the page writable */
2392 avoidcopy = (page_mapcount(old_page) == 1);
2394 if (PageAnon(old_page))
2395 page_move_anon_rmap(old_page, vma, address);
2396 set_huge_ptep_writable(vma, address, ptep);
2401 * If the process that created a MAP_PRIVATE mapping is about to
2402 * perform a COW due to a shared page count, attempt to satisfy
2403 * the allocation without using the existing reserves. The pagecache
2404 * page is used to determine if the reserve at this address was
2405 * consumed or not. If reserves were used, a partial faulted mapping
2406 * at the time of fork() could consume its reserves on COW instead
2407 * of the full address range.
2409 if (!(vma->vm_flags & VM_MAYSHARE) &&
2410 is_vma_resv_set(vma, HPAGE_RESV_OWNER) &&
2411 old_page != pagecache_page)
2412 outside_reserve = 1;
2414 page_cache_get(old_page);
2416 /* Drop page_table_lock as buddy allocator may be called */
2417 spin_unlock(&mm->page_table_lock);
2418 new_page = alloc_huge_page(vma, address, outside_reserve);
2420 if (IS_ERR(new_page)) {
2421 page_cache_release(old_page);
2424 * If a process owning a MAP_PRIVATE mapping fails to COW,
2425 * it is due to references held by a child and an insufficient
2426 * huge page pool. To guarantee the original mappers
2427 * reliability, unmap the page from child processes. The child
2428 * may get SIGKILLed if it later faults.
2430 if (outside_reserve) {
2431 BUG_ON(huge_pte_none(pte));
2432 if (unmap_ref_private(mm, vma, old_page, address)) {
2433 BUG_ON(huge_pte_none(pte));
2434 spin_lock(&mm->page_table_lock);
2435 goto retry_avoidcopy;
2440 /* Caller expects lock to be held */
2441 spin_lock(&mm->page_table_lock);
2442 return -PTR_ERR(new_page);
2446 * When the original hugepage is shared one, it does not have
2447 * anon_vma prepared.
2449 if (unlikely(anon_vma_prepare(vma))) {
2450 page_cache_release(new_page);
2451 page_cache_release(old_page);
2452 /* Caller expects lock to be held */
2453 spin_lock(&mm->page_table_lock);
2454 return VM_FAULT_OOM;
2457 copy_user_huge_page(new_page, old_page, address, vma,
2458 pages_per_huge_page(h));
2459 __SetPageUptodate(new_page);
2462 * Retake the page_table_lock to check for racing updates
2463 * before the page tables are altered
2465 spin_lock(&mm->page_table_lock);
2466 ptep = huge_pte_offset(mm, address & huge_page_mask(h));
2467 if (likely(pte_same(huge_ptep_get(ptep), pte))) {
2469 mmu_notifier_invalidate_range_start(mm,
2470 address & huge_page_mask(h),
2471 (address & huge_page_mask(h)) + huge_page_size(h));
2472 huge_ptep_clear_flush(vma, address, ptep);
2473 set_huge_pte_at(mm, address, ptep,
2474 make_huge_pte(vma, new_page, 1));
2475 page_remove_rmap(old_page);
2476 hugepage_add_new_anon_rmap(new_page, vma, address);
2477 /* Make the old page be freed below */
2478 new_page = old_page;
2479 mmu_notifier_invalidate_range_end(mm,
2480 address & huge_page_mask(h),
2481 (address & huge_page_mask(h)) + huge_page_size(h));
2483 page_cache_release(new_page);
2484 page_cache_release(old_page);
2488 /* Return the pagecache page at a given address within a VMA */
2489 static struct page *hugetlbfs_pagecache_page(struct hstate *h,
2490 struct vm_area_struct *vma, unsigned long address)
2492 struct address_space *mapping;
2495 mapping = vma->vm_file->f_mapping;
2496 idx = vma_hugecache_offset(h, vma, address);
2498 return find_lock_page(mapping, idx);
2502 * Return whether there is a pagecache page to back given address within VMA.
2503 * Caller follow_hugetlb_page() holds page_table_lock so we cannot lock_page.
2505 static bool hugetlbfs_pagecache_present(struct hstate *h,
2506 struct vm_area_struct *vma, unsigned long address)
2508 struct address_space *mapping;
2512 mapping = vma->vm_file->f_mapping;
2513 idx = vma_hugecache_offset(h, vma, address);
2515 page = find_get_page(mapping, idx);
2518 return page != NULL;
2521 static int hugetlb_no_page(struct mm_struct *mm, struct vm_area_struct *vma,
2522 unsigned long address, pte_t *ptep, unsigned int flags)
2524 struct hstate *h = hstate_vma(vma);
2525 int ret = VM_FAULT_SIGBUS;
2529 struct address_space *mapping;
2533 * Currently, we are forced to kill the process in the event the
2534 * original mapper has unmapped pages from the child due to a failed
2535 * COW. Warn that such a situation has occurred as it may not be obvious
2537 if (is_vma_resv_set(vma, HPAGE_RESV_UNMAPPED)) {
2539 "PID %d killed due to inadequate hugepage pool\n",
2544 mapping = vma->vm_file->f_mapping;
2545 idx = vma_hugecache_offset(h, vma, address);
2548 * Use page lock to guard against racing truncation
2549 * before we get page_table_lock.
2552 page = find_lock_page(mapping, idx);
2554 size = i_size_read(mapping->host) >> huge_page_shift(h);
2557 page = alloc_huge_page(vma, address, 0);
2559 ret = -PTR_ERR(page);
2562 clear_huge_page(page, address, pages_per_huge_page(h));
2563 __SetPageUptodate(page);
2565 if (vma->vm_flags & VM_MAYSHARE) {
2567 struct inode *inode = mapping->host;
2569 err = add_to_page_cache(page, mapping, idx, GFP_KERNEL);
2577 spin_lock(&inode->i_lock);
2578 inode->i_blocks += blocks_per_huge_page(h);
2579 spin_unlock(&inode->i_lock);
2580 page_dup_rmap(page);
2583 if (unlikely(anon_vma_prepare(vma))) {
2585 goto backout_unlocked;
2587 hugepage_add_new_anon_rmap(page, vma, address);
2591 * If memory error occurs between mmap() and fault, some process
2592 * don't have hwpoisoned swap entry for errored virtual address.
2593 * So we need to block hugepage fault by PG_hwpoison bit check.
2595 if (unlikely(PageHWPoison(page))) {
2596 ret = VM_FAULT_HWPOISON |
2597 VM_FAULT_SET_HINDEX(h - hstates);
2598 goto backout_unlocked;
2600 page_dup_rmap(page);
2604 * If we are going to COW a private mapping later, we examine the
2605 * pending reservations for this page now. This will ensure that
2606 * any allocations necessary to record that reservation occur outside
2609 if ((flags & FAULT_FLAG_WRITE) && !(vma->vm_flags & VM_SHARED))
2610 if (vma_needs_reservation(h, vma, address) < 0) {
2612 goto backout_unlocked;
2615 spin_lock(&mm->page_table_lock);
2616 size = i_size_read(mapping->host) >> huge_page_shift(h);
2621 if (!huge_pte_none(huge_ptep_get(ptep)))
2624 new_pte = make_huge_pte(vma, page, ((vma->vm_flags & VM_WRITE)
2625 && (vma->vm_flags & VM_SHARED)));
2626 set_huge_pte_at(mm, address, ptep, new_pte);
2628 if ((flags & FAULT_FLAG_WRITE) && !(vma->vm_flags & VM_SHARED)) {
2629 /* Optimization, do the COW without a second fault */
2630 ret = hugetlb_cow(mm, vma, address, ptep, new_pte, page);
2633 spin_unlock(&mm->page_table_lock);
2639 spin_unlock(&mm->page_table_lock);
2646 int hugetlb_fault(struct mm_struct *mm, struct vm_area_struct *vma,
2647 unsigned long address, unsigned int flags)
2652 struct page *page = NULL;
2653 struct page *pagecache_page = NULL;
2654 static DEFINE_MUTEX(hugetlb_instantiation_mutex);
2655 struct hstate *h = hstate_vma(vma);
2657 ptep = huge_pte_offset(mm, address);
2659 entry = huge_ptep_get(ptep);
2660 if (unlikely(is_hugetlb_entry_migration(entry))) {
2661 migration_entry_wait(mm, (pmd_t *)ptep, address);
2663 } else if (unlikely(is_hugetlb_entry_hwpoisoned(entry)))
2664 return VM_FAULT_HWPOISON_LARGE |
2665 VM_FAULT_SET_HINDEX(h - hstates);
2668 ptep = huge_pte_alloc(mm, address, huge_page_size(h));
2670 return VM_FAULT_OOM;
2673 * Serialize hugepage allocation and instantiation, so that we don't
2674 * get spurious allocation failures if two CPUs race to instantiate
2675 * the same page in the page cache.
2677 mutex_lock(&hugetlb_instantiation_mutex);
2678 entry = huge_ptep_get(ptep);
2679 if (huge_pte_none(entry)) {
2680 ret = hugetlb_no_page(mm, vma, address, ptep, flags);
2687 * If we are going to COW the mapping later, we examine the pending
2688 * reservations for this page now. This will ensure that any
2689 * allocations necessary to record that reservation occur outside the
2690 * spinlock. For private mappings, we also lookup the pagecache
2691 * page now as it is used to determine if a reservation has been
2694 if ((flags & FAULT_FLAG_WRITE) && !pte_write(entry)) {
2695 if (vma_needs_reservation(h, vma, address) < 0) {
2700 if (!(vma->vm_flags & VM_MAYSHARE))
2701 pagecache_page = hugetlbfs_pagecache_page(h,
2706 * hugetlb_cow() requires page locks of pte_page(entry) and
2707 * pagecache_page, so here we need take the former one
2708 * when page != pagecache_page or !pagecache_page.
2709 * Note that locking order is always pagecache_page -> page,
2710 * so no worry about deadlock.
2712 page = pte_page(entry);
2714 if (page != pagecache_page)
2717 spin_lock(&mm->page_table_lock);
2718 /* Check for a racing update before calling hugetlb_cow */
2719 if (unlikely(!pte_same(entry, huge_ptep_get(ptep))))
2720 goto out_page_table_lock;
2723 if (flags & FAULT_FLAG_WRITE) {
2724 if (!pte_write(entry)) {
2725 ret = hugetlb_cow(mm, vma, address, ptep, entry,
2727 goto out_page_table_lock;
2729 entry = pte_mkdirty(entry);
2731 entry = pte_mkyoung(entry);
2732 if (huge_ptep_set_access_flags(vma, address, ptep, entry,
2733 flags & FAULT_FLAG_WRITE))
2734 update_mmu_cache(vma, address, ptep);
2736 out_page_table_lock:
2737 spin_unlock(&mm->page_table_lock);
2739 if (pagecache_page) {
2740 unlock_page(pagecache_page);
2741 put_page(pagecache_page);
2743 if (page != pagecache_page)
2748 mutex_unlock(&hugetlb_instantiation_mutex);
2753 /* Can be overriden by architectures */
2754 __attribute__((weak)) struct page *
2755 follow_huge_pud(struct mm_struct *mm, unsigned long address,
2756 pud_t *pud, int write)
2762 int follow_hugetlb_page(struct mm_struct *mm, struct vm_area_struct *vma,
2763 struct page **pages, struct vm_area_struct **vmas,
2764 unsigned long *position, int *length, int i,
2767 unsigned long pfn_offset;
2768 unsigned long vaddr = *position;
2769 int remainder = *length;
2770 struct hstate *h = hstate_vma(vma);
2772 spin_lock(&mm->page_table_lock);
2773 while (vaddr < vma->vm_end && remainder) {
2779 * Some archs (sparc64, sh*) have multiple pte_ts to
2780 * each hugepage. We have to make sure we get the
2781 * first, for the page indexing below to work.
2783 pte = huge_pte_offset(mm, vaddr & huge_page_mask(h));
2784 absent = !pte || huge_pte_none(huge_ptep_get(pte));
2787 * When coredumping, it suits get_dump_page if we just return
2788 * an error where there's an empty slot with no huge pagecache
2789 * to back it. This way, we avoid allocating a hugepage, and
2790 * the sparse dumpfile avoids allocating disk blocks, but its
2791 * huge holes still show up with zeroes where they need to be.
2793 if (absent && (flags & FOLL_DUMP) &&
2794 !hugetlbfs_pagecache_present(h, vma, vaddr)) {
2800 ((flags & FOLL_WRITE) && !pte_write(huge_ptep_get(pte)))) {
2803 spin_unlock(&mm->page_table_lock);
2804 ret = hugetlb_fault(mm, vma, vaddr,
2805 (flags & FOLL_WRITE) ? FAULT_FLAG_WRITE : 0);
2806 spin_lock(&mm->page_table_lock);
2807 if (!(ret & VM_FAULT_ERROR))
2814 pfn_offset = (vaddr & ~huge_page_mask(h)) >> PAGE_SHIFT;
2815 page = pte_page(huge_ptep_get(pte));
2818 pages[i] = mem_map_offset(page, pfn_offset);
2829 if (vaddr < vma->vm_end && remainder &&
2830 pfn_offset < pages_per_huge_page(h)) {
2832 * We use pfn_offset to avoid touching the pageframes
2833 * of this compound page.
2838 spin_unlock(&mm->page_table_lock);
2839 *length = remainder;
2842 return i ? i : -EFAULT;
2845 void hugetlb_change_protection(struct vm_area_struct *vma,
2846 unsigned long address, unsigned long end, pgprot_t newprot)
2848 struct mm_struct *mm = vma->vm_mm;
2849 unsigned long start = address;
2852 struct hstate *h = hstate_vma(vma);
2854 BUG_ON(address >= end);
2855 flush_cache_range(vma, address, end);
2857 mutex_lock(&vma->vm_file->f_mapping->i_mmap_mutex);
2858 spin_lock(&mm->page_table_lock);
2859 for (; address < end; address += huge_page_size(h)) {
2860 ptep = huge_pte_offset(mm, address);
2863 if (huge_pmd_unshare(mm, &address, ptep))
2865 if (!huge_pte_none(huge_ptep_get(ptep))) {
2866 pte = huge_ptep_get_and_clear(mm, address, ptep);
2867 pte = pte_mkhuge(pte_modify(pte, newprot));
2868 set_huge_pte_at(mm, address, ptep, pte);
2871 spin_unlock(&mm->page_table_lock);
2873 * Must flush TLB before releasing i_mmap_mutex: x86's huge_pmd_unshare
2874 * may have cleared our pud entry and done put_page on the page table:
2875 * once we release i_mmap_mutex, another task can do the final put_page
2876 * and that page table be reused and filled with junk.
2878 flush_tlb_range(vma, start, end);
2879 mutex_unlock(&vma->vm_file->f_mapping->i_mmap_mutex);
2882 int hugetlb_reserve_pages(struct inode *inode,
2884 struct vm_area_struct *vma,
2885 vm_flags_t vm_flags)
2888 struct hstate *h = hstate_inode(inode);
2891 * Only apply hugepage reservation if asked. At fault time, an
2892 * attempt will be made for VM_NORESERVE to allocate a page
2893 * and filesystem quota without using reserves
2895 if (vm_flags & VM_NORESERVE)
2899 * Shared mappings base their reservation on the number of pages that
2900 * are already allocated on behalf of the file. Private mappings need
2901 * to reserve the full area even if read-only as mprotect() may be
2902 * called to make the mapping read-write. Assume !vma is a shm mapping
2904 if (!vma || vma->vm_flags & VM_MAYSHARE)
2905 chg = region_chg(&inode->i_mapping->private_list, from, to);
2907 struct resv_map *resv_map = resv_map_alloc();
2913 set_vma_resv_map(vma, resv_map);
2914 set_vma_resv_flags(vma, HPAGE_RESV_OWNER);
2922 /* There must be enough filesystem quota for the mapping */
2923 if (hugetlb_get_quota(inode->i_mapping, chg)) {
2929 * Check enough hugepages are available for the reservation.
2930 * Hand back the quota if there are not
2932 ret = hugetlb_acct_memory(h, chg);
2934 hugetlb_put_quota(inode->i_mapping, chg);
2939 * Account for the reservations made. Shared mappings record regions
2940 * that have reservations as they are shared by multiple VMAs.
2941 * When the last VMA disappears, the region map says how much
2942 * the reservation was and the page cache tells how much of
2943 * the reservation was consumed. Private mappings are per-VMA and
2944 * only the consumed reservations are tracked. When the VMA
2945 * disappears, the original reservation is the VMA size and the
2946 * consumed reservations are stored in the map. Hence, nothing
2947 * else has to be done for private mappings here
2949 if (!vma || vma->vm_flags & VM_MAYSHARE)
2950 region_add(&inode->i_mapping->private_list, from, to);
2958 void hugetlb_unreserve_pages(struct inode *inode, long offset, long freed)
2960 struct hstate *h = hstate_inode(inode);
2961 long chg = region_truncate(&inode->i_mapping->private_list, offset);
2963 spin_lock(&inode->i_lock);
2964 inode->i_blocks -= (blocks_per_huge_page(h) * freed);
2965 spin_unlock(&inode->i_lock);
2967 hugetlb_put_quota(inode->i_mapping, (chg - freed));
2968 hugetlb_acct_memory(h, -(chg - freed));
2971 #ifdef CONFIG_MEMORY_FAILURE
2973 /* Should be called in hugetlb_lock */
2974 static int is_hugepage_on_freelist(struct page *hpage)
2978 struct hstate *h = page_hstate(hpage);
2979 int nid = page_to_nid(hpage);
2981 list_for_each_entry_safe(page, tmp, &h->hugepage_freelists[nid], lru)
2988 * This function is called from memory failure code.
2989 * Assume the caller holds page lock of the head page.
2991 int dequeue_hwpoisoned_huge_page(struct page *hpage)
2993 struct hstate *h = page_hstate(hpage);
2994 int nid = page_to_nid(hpage);
2997 spin_lock(&hugetlb_lock);
2998 if (is_hugepage_on_freelist(hpage)) {
2999 list_del(&hpage->lru);
3000 set_page_refcounted(hpage);
3001 h->free_huge_pages--;
3002 h->free_huge_pages_node[nid]--;
3005 spin_unlock(&hugetlb_lock);