2 * Generic hugetlb support.
3 * (C) Nadia Yvette Chambers, 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>
24 #include <linux/page-isolation.h>
27 #include <asm/pgtable.h>
31 #include <linux/hugetlb.h>
32 #include <linux/hugetlb_cgroup.h>
33 #include <linux/node.h>
36 const unsigned long hugetlb_zero = 0, hugetlb_infinity = ~0UL;
37 static gfp_t htlb_alloc_mask = GFP_HIGHUSER;
38 unsigned long hugepages_treat_as_movable;
40 int hugetlb_max_hstate __read_mostly;
41 unsigned int default_hstate_idx;
42 struct hstate hstates[HUGE_MAX_HSTATE];
44 __initdata LIST_HEAD(huge_boot_pages);
46 /* for command line parsing */
47 static struct hstate * __initdata parsed_hstate;
48 static unsigned long __initdata default_hstate_max_huge_pages;
49 static unsigned long __initdata default_hstate_size;
52 * Protects updates to hugepage_freelists, nr_huge_pages, and free_huge_pages
54 DEFINE_SPINLOCK(hugetlb_lock);
56 static inline void unlock_or_release_subpool(struct hugepage_subpool *spool)
58 bool free = (spool->count == 0) && (spool->used_hpages == 0);
60 spin_unlock(&spool->lock);
62 /* If no pages are used, and no other handles to the subpool
63 * remain, free the subpool the subpool remain */
68 struct hugepage_subpool *hugepage_new_subpool(long nr_blocks)
70 struct hugepage_subpool *spool;
72 spool = kmalloc(sizeof(*spool), GFP_KERNEL);
76 spin_lock_init(&spool->lock);
78 spool->max_hpages = nr_blocks;
79 spool->used_hpages = 0;
84 void hugepage_put_subpool(struct hugepage_subpool *spool)
86 spin_lock(&spool->lock);
87 BUG_ON(!spool->count);
89 unlock_or_release_subpool(spool);
92 static int hugepage_subpool_get_pages(struct hugepage_subpool *spool,
100 spin_lock(&spool->lock);
101 if ((spool->used_hpages + delta) <= spool->max_hpages) {
102 spool->used_hpages += delta;
106 spin_unlock(&spool->lock);
111 static void hugepage_subpool_put_pages(struct hugepage_subpool *spool,
117 spin_lock(&spool->lock);
118 spool->used_hpages -= delta;
119 /* If hugetlbfs_put_super couldn't free spool due to
120 * an outstanding quota reference, free it now. */
121 unlock_or_release_subpool(spool);
124 static inline struct hugepage_subpool *subpool_inode(struct inode *inode)
126 return HUGETLBFS_SB(inode->i_sb)->spool;
129 static inline struct hugepage_subpool *subpool_vma(struct vm_area_struct *vma)
131 return subpool_inode(file_inode(vma->vm_file));
135 * Region tracking -- allows tracking of reservations and instantiated pages
136 * across the pages in a mapping.
138 * The region data structures are protected by a combination of the mmap_sem
139 * and the hugetlb_instantion_mutex. To access or modify a region the caller
140 * must either hold the mmap_sem for write, or the mmap_sem for read and
141 * the hugetlb_instantiation mutex:
143 * down_write(&mm->mmap_sem);
145 * down_read(&mm->mmap_sem);
146 * mutex_lock(&hugetlb_instantiation_mutex);
149 struct list_head link;
154 static long region_add(struct list_head *head, long f, long t)
156 struct file_region *rg, *nrg, *trg;
158 /* Locate the region we are either in or before. */
159 list_for_each_entry(rg, head, link)
163 /* Round our left edge to the current segment if it encloses us. */
167 /* Check for and consume any regions we now overlap with. */
169 list_for_each_entry_safe(rg, trg, rg->link.prev, link) {
170 if (&rg->link == head)
175 /* If this area reaches higher then extend our area to
176 * include it completely. If this is not the first area
177 * which we intend to reuse, free it. */
190 static long region_chg(struct list_head *head, long f, long t)
192 struct file_region *rg, *nrg;
195 /* Locate the region we are before or in. */
196 list_for_each_entry(rg, head, link)
200 /* If we are below the current region then a new region is required.
201 * Subtle, allocate a new region at the position but make it zero
202 * size such that we can guarantee to record the reservation. */
203 if (&rg->link == head || t < rg->from) {
204 nrg = kmalloc(sizeof(*nrg), GFP_KERNEL);
209 INIT_LIST_HEAD(&nrg->link);
210 list_add(&nrg->link, rg->link.prev);
215 /* Round our left edge to the current segment if it encloses us. */
220 /* Check for and consume any regions we now overlap with. */
221 list_for_each_entry(rg, rg->link.prev, link) {
222 if (&rg->link == head)
227 /* We overlap with this area, if it extends further than
228 * us then we must extend ourselves. Account for its
229 * existing reservation. */
234 chg -= rg->to - rg->from;
239 static long region_truncate(struct list_head *head, long end)
241 struct file_region *rg, *trg;
244 /* Locate the region we are either in or before. */
245 list_for_each_entry(rg, head, link)
248 if (&rg->link == head)
251 /* If we are in the middle of a region then adjust it. */
252 if (end > rg->from) {
255 rg = list_entry(rg->link.next, typeof(*rg), link);
258 /* Drop any remaining regions. */
259 list_for_each_entry_safe(rg, trg, rg->link.prev, link) {
260 if (&rg->link == head)
262 chg += rg->to - rg->from;
269 static long region_count(struct list_head *head, long f, long t)
271 struct file_region *rg;
274 /* Locate each segment we overlap with, and count that overlap. */
275 list_for_each_entry(rg, head, link) {
284 seg_from = max(rg->from, f);
285 seg_to = min(rg->to, t);
287 chg += seg_to - seg_from;
294 * Convert the address within this vma to the page offset within
295 * the mapping, in pagecache page units; huge pages here.
297 static pgoff_t vma_hugecache_offset(struct hstate *h,
298 struct vm_area_struct *vma, unsigned long address)
300 return ((address - vma->vm_start) >> huge_page_shift(h)) +
301 (vma->vm_pgoff >> huge_page_order(h));
304 pgoff_t linear_hugepage_index(struct vm_area_struct *vma,
305 unsigned long address)
307 return vma_hugecache_offset(hstate_vma(vma), vma, address);
311 * Return the size of the pages allocated when backing a VMA. In the majority
312 * cases this will be same size as used by the page table entries.
314 unsigned long vma_kernel_pagesize(struct vm_area_struct *vma)
316 struct hstate *hstate;
318 if (!is_vm_hugetlb_page(vma))
321 hstate = hstate_vma(vma);
323 return 1UL << (hstate->order + PAGE_SHIFT);
325 EXPORT_SYMBOL_GPL(vma_kernel_pagesize);
328 * Return the page size being used by the MMU to back a VMA. In the majority
329 * of cases, the page size used by the kernel matches the MMU size. On
330 * architectures where it differs, an architecture-specific version of this
331 * function is required.
333 #ifndef vma_mmu_pagesize
334 unsigned long vma_mmu_pagesize(struct vm_area_struct *vma)
336 return vma_kernel_pagesize(vma);
341 * Flags for MAP_PRIVATE reservations. These are stored in the bottom
342 * bits of the reservation map pointer, which are always clear due to
345 #define HPAGE_RESV_OWNER (1UL << 0)
346 #define HPAGE_RESV_UNMAPPED (1UL << 1)
347 #define HPAGE_RESV_MASK (HPAGE_RESV_OWNER | HPAGE_RESV_UNMAPPED)
350 * These helpers are used to track how many pages are reserved for
351 * faults in a MAP_PRIVATE mapping. Only the process that called mmap()
352 * is guaranteed to have their future faults succeed.
354 * With the exception of reset_vma_resv_huge_pages() which is called at fork(),
355 * the reserve counters are updated with the hugetlb_lock held. It is safe
356 * to reset the VMA at fork() time as it is not in use yet and there is no
357 * chance of the global counters getting corrupted as a result of the values.
359 * The private mapping reservation is represented in a subtly different
360 * manner to a shared mapping. A shared mapping has a region map associated
361 * with the underlying file, this region map represents the backing file
362 * pages which have ever had a reservation assigned which this persists even
363 * after the page is instantiated. A private mapping has a region map
364 * associated with the original mmap which is attached to all VMAs which
365 * reference it, this region map represents those offsets which have consumed
366 * reservation ie. where pages have been instantiated.
368 static unsigned long get_vma_private_data(struct vm_area_struct *vma)
370 return (unsigned long)vma->vm_private_data;
373 static void set_vma_private_data(struct vm_area_struct *vma,
376 vma->vm_private_data = (void *)value;
381 struct list_head regions;
384 static struct resv_map *resv_map_alloc(void)
386 struct resv_map *resv_map = kmalloc(sizeof(*resv_map), GFP_KERNEL);
390 kref_init(&resv_map->refs);
391 INIT_LIST_HEAD(&resv_map->regions);
396 static void resv_map_release(struct kref *ref)
398 struct resv_map *resv_map = container_of(ref, struct resv_map, refs);
400 /* Clear out any active regions before we release the map. */
401 region_truncate(&resv_map->regions, 0);
405 static struct resv_map *vma_resv_map(struct vm_area_struct *vma)
407 VM_BUG_ON(!is_vm_hugetlb_page(vma));
408 if (!(vma->vm_flags & VM_MAYSHARE))
409 return (struct resv_map *)(get_vma_private_data(vma) &
414 static void set_vma_resv_map(struct vm_area_struct *vma, struct resv_map *map)
416 VM_BUG_ON(!is_vm_hugetlb_page(vma));
417 VM_BUG_ON(vma->vm_flags & VM_MAYSHARE);
419 set_vma_private_data(vma, (get_vma_private_data(vma) &
420 HPAGE_RESV_MASK) | (unsigned long)map);
423 static void set_vma_resv_flags(struct vm_area_struct *vma, unsigned long flags)
425 VM_BUG_ON(!is_vm_hugetlb_page(vma));
426 VM_BUG_ON(vma->vm_flags & VM_MAYSHARE);
428 set_vma_private_data(vma, get_vma_private_data(vma) | flags);
431 static int is_vma_resv_set(struct vm_area_struct *vma, unsigned long flag)
433 VM_BUG_ON(!is_vm_hugetlb_page(vma));
435 return (get_vma_private_data(vma) & flag) != 0;
438 /* Decrement the reserved pages in the hugepage pool by one */
439 static void decrement_hugepage_resv_vma(struct hstate *h,
440 struct vm_area_struct *vma)
442 if (vma->vm_flags & VM_NORESERVE)
445 if (vma->vm_flags & VM_MAYSHARE) {
446 /* Shared mappings always use reserves */
447 h->resv_huge_pages--;
448 } else if (is_vma_resv_set(vma, HPAGE_RESV_OWNER)) {
450 * Only the process that called mmap() has reserves for
453 h->resv_huge_pages--;
457 /* Reset counters to 0 and clear all HPAGE_RESV_* flags */
458 void reset_vma_resv_huge_pages(struct vm_area_struct *vma)
460 VM_BUG_ON(!is_vm_hugetlb_page(vma));
461 if (!(vma->vm_flags & VM_MAYSHARE))
462 vma->vm_private_data = (void *)0;
465 /* Returns true if the VMA has associated reserve pages */
466 static int vma_has_reserves(struct vm_area_struct *vma)
468 if (vma->vm_flags & VM_MAYSHARE)
470 if (is_vma_resv_set(vma, HPAGE_RESV_OWNER))
475 static void copy_gigantic_page(struct page *dst, struct page *src)
478 struct hstate *h = page_hstate(src);
479 struct page *dst_base = dst;
480 struct page *src_base = src;
482 for (i = 0; i < pages_per_huge_page(h); ) {
484 copy_highpage(dst, src);
487 dst = mem_map_next(dst, dst_base, i);
488 src = mem_map_next(src, src_base, i);
492 void copy_huge_page(struct page *dst, struct page *src)
495 struct hstate *h = page_hstate(src);
497 if (unlikely(pages_per_huge_page(h) > MAX_ORDER_NR_PAGES)) {
498 copy_gigantic_page(dst, src);
503 for (i = 0; i < pages_per_huge_page(h); i++) {
505 copy_highpage(dst + i, src + i);
509 static void enqueue_huge_page(struct hstate *h, struct page *page)
511 int nid = page_to_nid(page);
512 list_move(&page->lru, &h->hugepage_freelists[nid]);
513 h->free_huge_pages++;
514 h->free_huge_pages_node[nid]++;
517 static struct page *dequeue_huge_page_node(struct hstate *h, int nid)
521 list_for_each_entry(page, &h->hugepage_freelists[nid], lru)
522 if (!is_migrate_isolate_page(page))
525 * if 'non-isolated free hugepage' not found on the list,
526 * the allocation fails.
528 if (&h->hugepage_freelists[nid] == &page->lru)
530 list_move(&page->lru, &h->hugepage_activelist);
531 set_page_refcounted(page);
532 h->free_huge_pages--;
533 h->free_huge_pages_node[nid]--;
537 static struct page *dequeue_huge_page_vma(struct hstate *h,
538 struct vm_area_struct *vma,
539 unsigned long address, int avoid_reserve)
541 struct page *page = NULL;
542 struct mempolicy *mpol;
543 nodemask_t *nodemask;
544 struct zonelist *zonelist;
547 unsigned int cpuset_mems_cookie;
550 cpuset_mems_cookie = get_mems_allowed();
551 zonelist = huge_zonelist(vma, address,
552 htlb_alloc_mask, &mpol, &nodemask);
554 * A child process with MAP_PRIVATE mappings created by their parent
555 * have no page reserves. This check ensures that reservations are
556 * not "stolen". The child may still get SIGKILLed
558 if (!vma_has_reserves(vma) &&
559 h->free_huge_pages - h->resv_huge_pages == 0)
562 /* If reserves cannot be used, ensure enough pages are in the pool */
563 if (avoid_reserve && h->free_huge_pages - h->resv_huge_pages == 0)
566 for_each_zone_zonelist_nodemask(zone, z, zonelist,
567 MAX_NR_ZONES - 1, nodemask) {
568 if (cpuset_zone_allowed_softwall(zone, htlb_alloc_mask)) {
569 page = dequeue_huge_page_node(h, zone_to_nid(zone));
572 decrement_hugepage_resv_vma(h, vma);
579 if (unlikely(!put_mems_allowed(cpuset_mems_cookie) && !page))
588 static void update_and_free_page(struct hstate *h, struct page *page)
592 VM_BUG_ON(h->order >= MAX_ORDER);
595 h->nr_huge_pages_node[page_to_nid(page)]--;
596 for (i = 0; i < pages_per_huge_page(h); i++) {
597 page[i].flags &= ~(1 << PG_locked | 1 << PG_error |
598 1 << PG_referenced | 1 << PG_dirty |
599 1 << PG_active | 1 << PG_reserved |
600 1 << PG_private | 1 << PG_writeback);
602 VM_BUG_ON(hugetlb_cgroup_from_page(page));
603 set_compound_page_dtor(page, NULL);
604 set_page_refcounted(page);
605 arch_release_hugepage(page);
606 __free_pages(page, huge_page_order(h));
609 struct hstate *size_to_hstate(unsigned long size)
614 if (huge_page_size(h) == size)
620 static void free_huge_page(struct page *page)
623 * Can't pass hstate in here because it is called from the
624 * compound page destructor.
626 struct hstate *h = page_hstate(page);
627 int nid = page_to_nid(page);
628 struct hugepage_subpool *spool =
629 (struct hugepage_subpool *)page_private(page);
631 set_page_private(page, 0);
632 page->mapping = NULL;
633 BUG_ON(page_count(page));
634 BUG_ON(page_mapcount(page));
636 spin_lock(&hugetlb_lock);
637 hugetlb_cgroup_uncharge_page(hstate_index(h),
638 pages_per_huge_page(h), page);
639 if (h->surplus_huge_pages_node[nid] && huge_page_order(h) < MAX_ORDER) {
640 /* remove the page from active list */
641 list_del(&page->lru);
642 update_and_free_page(h, page);
643 h->surplus_huge_pages--;
644 h->surplus_huge_pages_node[nid]--;
646 arch_clear_hugepage_flags(page);
647 enqueue_huge_page(h, page);
649 spin_unlock(&hugetlb_lock);
650 hugepage_subpool_put_pages(spool, 1);
653 static void prep_new_huge_page(struct hstate *h, struct page *page, int nid)
655 INIT_LIST_HEAD(&page->lru);
656 set_compound_page_dtor(page, free_huge_page);
657 spin_lock(&hugetlb_lock);
658 set_hugetlb_cgroup(page, NULL);
660 h->nr_huge_pages_node[nid]++;
661 spin_unlock(&hugetlb_lock);
662 put_page(page); /* free it into the hugepage allocator */
665 static void prep_compound_gigantic_page(struct page *page, unsigned long order)
668 int nr_pages = 1 << order;
669 struct page *p = page + 1;
671 /* we rely on prep_new_huge_page to set the destructor */
672 set_compound_order(page, order);
674 for (i = 1; i < nr_pages; i++, p = mem_map_next(p, page, i)) {
676 set_page_count(p, 0);
677 p->first_page = page;
682 * PageHuge() only returns true for hugetlbfs pages, but not for normal or
683 * transparent huge pages. See the PageTransHuge() documentation for more
686 int PageHuge(struct page *page)
688 compound_page_dtor *dtor;
690 if (!PageCompound(page))
693 page = compound_head(page);
694 dtor = get_compound_page_dtor(page);
696 return dtor == free_huge_page;
698 EXPORT_SYMBOL_GPL(PageHuge);
701 * PageHeadHuge() only returns true for hugetlbfs head page, but not for
702 * normal or transparent huge pages.
704 int PageHeadHuge(struct page *page_head)
706 compound_page_dtor *dtor;
708 if (!PageHead(page_head))
711 dtor = get_compound_page_dtor(page_head);
713 return dtor == free_huge_page;
715 EXPORT_SYMBOL_GPL(PageHeadHuge);
717 pgoff_t __basepage_index(struct page *page)
719 struct page *page_head = compound_head(page);
720 pgoff_t index = page_index(page_head);
721 unsigned long compound_idx;
723 if (!PageHuge(page_head))
724 return page_index(page);
726 if (compound_order(page_head) >= MAX_ORDER)
727 compound_idx = page_to_pfn(page) - page_to_pfn(page_head);
729 compound_idx = page - page_head;
731 return (index << compound_order(page_head)) + compound_idx;
734 static struct page *alloc_fresh_huge_page_node(struct hstate *h, int nid)
738 if (h->order >= MAX_ORDER)
741 page = alloc_pages_exact_node(nid,
742 htlb_alloc_mask|__GFP_COMP|__GFP_THISNODE|
743 __GFP_REPEAT|__GFP_NOWARN,
746 if (arch_prepare_hugepage(page)) {
747 __free_pages(page, huge_page_order(h));
750 prep_new_huge_page(h, page, nid);
757 * common helper functions for hstate_next_node_to_{alloc|free}.
758 * We may have allocated or freed a huge page based on a different
759 * nodes_allowed previously, so h->next_node_to_{alloc|free} might
760 * be outside of *nodes_allowed. Ensure that we use an allowed
761 * node for alloc or free.
763 static int next_node_allowed(int nid, nodemask_t *nodes_allowed)
765 nid = next_node(nid, *nodes_allowed);
766 if (nid == MAX_NUMNODES)
767 nid = first_node(*nodes_allowed);
768 VM_BUG_ON(nid >= MAX_NUMNODES);
773 static int get_valid_node_allowed(int nid, nodemask_t *nodes_allowed)
775 if (!node_isset(nid, *nodes_allowed))
776 nid = next_node_allowed(nid, nodes_allowed);
781 * returns the previously saved node ["this node"] from which to
782 * allocate a persistent huge page for the pool and advance the
783 * next node from which to allocate, handling wrap at end of node
786 static int hstate_next_node_to_alloc(struct hstate *h,
787 nodemask_t *nodes_allowed)
791 VM_BUG_ON(!nodes_allowed);
793 nid = get_valid_node_allowed(h->next_nid_to_alloc, nodes_allowed);
794 h->next_nid_to_alloc = next_node_allowed(nid, nodes_allowed);
799 static int alloc_fresh_huge_page(struct hstate *h, nodemask_t *nodes_allowed)
806 start_nid = hstate_next_node_to_alloc(h, nodes_allowed);
807 next_nid = start_nid;
810 page = alloc_fresh_huge_page_node(h, next_nid);
815 next_nid = hstate_next_node_to_alloc(h, nodes_allowed);
816 } while (next_nid != start_nid);
819 count_vm_event(HTLB_BUDDY_PGALLOC);
821 count_vm_event(HTLB_BUDDY_PGALLOC_FAIL);
827 * helper for free_pool_huge_page() - return the previously saved
828 * node ["this node"] from which to free a huge page. Advance the
829 * next node id whether or not we find a free huge page to free so
830 * that the next attempt to free addresses the next node.
832 static int hstate_next_node_to_free(struct hstate *h, nodemask_t *nodes_allowed)
836 VM_BUG_ON(!nodes_allowed);
838 nid = get_valid_node_allowed(h->next_nid_to_free, nodes_allowed);
839 h->next_nid_to_free = next_node_allowed(nid, nodes_allowed);
845 * Free huge page from pool from next node to free.
846 * Attempt to keep persistent huge pages more or less
847 * balanced over allowed nodes.
848 * Called with hugetlb_lock locked.
850 static int free_pool_huge_page(struct hstate *h, nodemask_t *nodes_allowed,
857 start_nid = hstate_next_node_to_free(h, nodes_allowed);
858 next_nid = start_nid;
862 * If we're returning unused surplus pages, only examine
863 * nodes with surplus pages.
865 if ((!acct_surplus || h->surplus_huge_pages_node[next_nid]) &&
866 !list_empty(&h->hugepage_freelists[next_nid])) {
868 list_entry(h->hugepage_freelists[next_nid].next,
870 list_del(&page->lru);
871 h->free_huge_pages--;
872 h->free_huge_pages_node[next_nid]--;
874 h->surplus_huge_pages--;
875 h->surplus_huge_pages_node[next_nid]--;
877 update_and_free_page(h, page);
881 next_nid = hstate_next_node_to_free(h, nodes_allowed);
882 } while (next_nid != start_nid);
887 static struct page *alloc_buddy_huge_page(struct hstate *h, int nid)
892 if (h->order >= MAX_ORDER)
896 * Assume we will successfully allocate the surplus page to
897 * prevent racing processes from causing the surplus to exceed
900 * This however introduces a different race, where a process B
901 * tries to grow the static hugepage pool while alloc_pages() is
902 * called by process A. B will only examine the per-node
903 * counters in determining if surplus huge pages can be
904 * converted to normal huge pages in adjust_pool_surplus(). A
905 * won't be able to increment the per-node counter, until the
906 * lock is dropped by B, but B doesn't drop hugetlb_lock until
907 * no more huge pages can be converted from surplus to normal
908 * state (and doesn't try to convert again). Thus, we have a
909 * case where a surplus huge page exists, the pool is grown, and
910 * the surplus huge page still exists after, even though it
911 * should just have been converted to a normal huge page. This
912 * does not leak memory, though, as the hugepage will be freed
913 * once it is out of use. It also does not allow the counters to
914 * go out of whack in adjust_pool_surplus() as we don't modify
915 * the node values until we've gotten the hugepage and only the
916 * per-node value is checked there.
918 spin_lock(&hugetlb_lock);
919 if (h->surplus_huge_pages >= h->nr_overcommit_huge_pages) {
920 spin_unlock(&hugetlb_lock);
924 h->surplus_huge_pages++;
926 spin_unlock(&hugetlb_lock);
928 if (nid == NUMA_NO_NODE)
929 page = alloc_pages(htlb_alloc_mask|__GFP_COMP|
930 __GFP_REPEAT|__GFP_NOWARN,
933 page = alloc_pages_exact_node(nid,
934 htlb_alloc_mask|__GFP_COMP|__GFP_THISNODE|
935 __GFP_REPEAT|__GFP_NOWARN, huge_page_order(h));
937 if (page && arch_prepare_hugepage(page)) {
938 __free_pages(page, huge_page_order(h));
942 spin_lock(&hugetlb_lock);
944 INIT_LIST_HEAD(&page->lru);
945 r_nid = page_to_nid(page);
946 set_compound_page_dtor(page, free_huge_page);
947 set_hugetlb_cgroup(page, NULL);
949 * We incremented the global counters already
951 h->nr_huge_pages_node[r_nid]++;
952 h->surplus_huge_pages_node[r_nid]++;
953 __count_vm_event(HTLB_BUDDY_PGALLOC);
956 h->surplus_huge_pages--;
957 __count_vm_event(HTLB_BUDDY_PGALLOC_FAIL);
959 spin_unlock(&hugetlb_lock);
965 * This allocation function is useful in the context where vma is irrelevant.
966 * E.g. soft-offlining uses this function because it only cares physical
967 * address of error page.
969 struct page *alloc_huge_page_node(struct hstate *h, int nid)
973 spin_lock(&hugetlb_lock);
974 page = dequeue_huge_page_node(h, nid);
975 spin_unlock(&hugetlb_lock);
978 page = alloc_buddy_huge_page(h, nid);
984 * Increase the hugetlb pool such that it can accommodate a reservation
987 static int gather_surplus_pages(struct hstate *h, int delta)
989 struct list_head surplus_list;
990 struct page *page, *tmp;
992 int needed, allocated;
993 bool alloc_ok = true;
995 needed = (h->resv_huge_pages + delta) - h->free_huge_pages;
997 h->resv_huge_pages += delta;
1002 INIT_LIST_HEAD(&surplus_list);
1006 spin_unlock(&hugetlb_lock);
1007 for (i = 0; i < needed; i++) {
1008 page = alloc_buddy_huge_page(h, NUMA_NO_NODE);
1013 list_add(&page->lru, &surplus_list);
1018 * After retaking hugetlb_lock, we need to recalculate 'needed'
1019 * because either resv_huge_pages or free_huge_pages may have changed.
1021 spin_lock(&hugetlb_lock);
1022 needed = (h->resv_huge_pages + delta) -
1023 (h->free_huge_pages + allocated);
1028 * We were not able to allocate enough pages to
1029 * satisfy the entire reservation so we free what
1030 * we've allocated so far.
1035 * The surplus_list now contains _at_least_ the number of extra pages
1036 * needed to accommodate the reservation. Add the appropriate number
1037 * of pages to the hugetlb pool and free the extras back to the buddy
1038 * allocator. Commit the entire reservation here to prevent another
1039 * process from stealing the pages as they are added to the pool but
1040 * before they are reserved.
1042 needed += allocated;
1043 h->resv_huge_pages += delta;
1046 /* Free the needed pages to the hugetlb pool */
1047 list_for_each_entry_safe(page, tmp, &surplus_list, lru) {
1051 * This page is now managed by the hugetlb allocator and has
1052 * no users -- drop the buddy allocator's reference.
1054 put_page_testzero(page);
1055 VM_BUG_ON(page_count(page));
1056 enqueue_huge_page(h, page);
1059 spin_unlock(&hugetlb_lock);
1061 /* Free unnecessary surplus pages to the buddy allocator */
1062 if (!list_empty(&surplus_list)) {
1063 list_for_each_entry_safe(page, tmp, &surplus_list, lru) {
1067 spin_lock(&hugetlb_lock);
1073 * When releasing a hugetlb pool reservation, any surplus pages that were
1074 * allocated to satisfy the reservation must be explicitly freed if they were
1076 * Called with hugetlb_lock held.
1078 static void return_unused_surplus_pages(struct hstate *h,
1079 unsigned long unused_resv_pages)
1081 unsigned long nr_pages;
1083 /* Uncommit the reservation */
1084 h->resv_huge_pages -= unused_resv_pages;
1086 /* Cannot return gigantic pages currently */
1087 if (h->order >= MAX_ORDER)
1090 nr_pages = min(unused_resv_pages, h->surplus_huge_pages);
1093 * We want to release as many surplus pages as possible, spread
1094 * evenly across all nodes with memory. Iterate across these nodes
1095 * until we can no longer free unreserved surplus pages. This occurs
1096 * when the nodes with surplus pages have no free pages.
1097 * free_pool_huge_page() will balance the the freed pages across the
1098 * on-line nodes with memory and will handle the hstate accounting.
1100 while (nr_pages--) {
1101 if (!free_pool_huge_page(h, &node_states[N_MEMORY], 1))
1107 * Determine if the huge page at addr within the vma has an associated
1108 * reservation. Where it does not we will need to logically increase
1109 * reservation and actually increase subpool usage before an allocation
1110 * can occur. Where any new reservation would be required the
1111 * reservation change is prepared, but not committed. Once the page
1112 * has been allocated from the subpool and instantiated the change should
1113 * be committed via vma_commit_reservation. No action is required on
1116 static long vma_needs_reservation(struct hstate *h,
1117 struct vm_area_struct *vma, unsigned long addr)
1119 struct address_space *mapping = vma->vm_file->f_mapping;
1120 struct inode *inode = mapping->host;
1122 if (vma->vm_flags & VM_MAYSHARE) {
1123 pgoff_t idx = vma_hugecache_offset(h, vma, addr);
1124 return region_chg(&inode->i_mapping->private_list,
1127 } else if (!is_vma_resv_set(vma, HPAGE_RESV_OWNER)) {
1132 pgoff_t idx = vma_hugecache_offset(h, vma, addr);
1133 struct resv_map *reservations = vma_resv_map(vma);
1135 err = region_chg(&reservations->regions, idx, idx + 1);
1141 static void vma_commit_reservation(struct hstate *h,
1142 struct vm_area_struct *vma, unsigned long addr)
1144 struct address_space *mapping = vma->vm_file->f_mapping;
1145 struct inode *inode = mapping->host;
1147 if (vma->vm_flags & VM_MAYSHARE) {
1148 pgoff_t idx = vma_hugecache_offset(h, vma, addr);
1149 region_add(&inode->i_mapping->private_list, idx, idx + 1);
1151 } else if (is_vma_resv_set(vma, HPAGE_RESV_OWNER)) {
1152 pgoff_t idx = vma_hugecache_offset(h, vma, addr);
1153 struct resv_map *reservations = vma_resv_map(vma);
1155 /* Mark this page used in the map. */
1156 region_add(&reservations->regions, idx, idx + 1);
1160 static struct page *alloc_huge_page(struct vm_area_struct *vma,
1161 unsigned long addr, int avoid_reserve)
1163 struct hugepage_subpool *spool = subpool_vma(vma);
1164 struct hstate *h = hstate_vma(vma);
1168 struct hugetlb_cgroup *h_cg;
1170 idx = hstate_index(h);
1172 * Processes that did not create the mapping will have no
1173 * reserves and will not have accounted against subpool
1174 * limit. Check that the subpool limit can be made before
1175 * satisfying the allocation MAP_NORESERVE mappings may also
1176 * need pages and subpool limit allocated allocated if no reserve
1179 chg = vma_needs_reservation(h, vma, addr);
1181 return ERR_PTR(-ENOMEM);
1183 if (hugepage_subpool_get_pages(spool, chg))
1184 return ERR_PTR(-ENOSPC);
1186 ret = hugetlb_cgroup_charge_cgroup(idx, pages_per_huge_page(h), &h_cg);
1188 hugepage_subpool_put_pages(spool, chg);
1189 return ERR_PTR(-ENOSPC);
1191 spin_lock(&hugetlb_lock);
1192 page = dequeue_huge_page_vma(h, vma, addr, avoid_reserve);
1194 /* update page cgroup details */
1195 hugetlb_cgroup_commit_charge(idx, pages_per_huge_page(h),
1197 spin_unlock(&hugetlb_lock);
1199 spin_unlock(&hugetlb_lock);
1200 page = alloc_buddy_huge_page(h, NUMA_NO_NODE);
1202 hugetlb_cgroup_uncharge_cgroup(idx,
1203 pages_per_huge_page(h),
1205 hugepage_subpool_put_pages(spool, chg);
1206 return ERR_PTR(-ENOSPC);
1208 spin_lock(&hugetlb_lock);
1209 hugetlb_cgroup_commit_charge(idx, pages_per_huge_page(h),
1211 list_move(&page->lru, &h->hugepage_activelist);
1212 spin_unlock(&hugetlb_lock);
1215 set_page_private(page, (unsigned long)spool);
1217 vma_commit_reservation(h, vma, addr);
1221 int __weak alloc_bootmem_huge_page(struct hstate *h)
1223 struct huge_bootmem_page *m;
1224 int nr_nodes = nodes_weight(node_states[N_MEMORY]);
1229 addr = __alloc_bootmem_node_nopanic(
1230 NODE_DATA(hstate_next_node_to_alloc(h,
1231 &node_states[N_MEMORY])),
1232 huge_page_size(h), huge_page_size(h), 0);
1236 * Use the beginning of the huge page to store the
1237 * huge_bootmem_page struct (until gather_bootmem
1238 * puts them into the mem_map).
1248 BUG_ON((unsigned long)virt_to_phys(m) & (huge_page_size(h) - 1));
1249 /* Put them into a private list first because mem_map is not up yet */
1250 list_add(&m->list, &huge_boot_pages);
1255 static void prep_compound_huge_page(struct page *page, int order)
1257 if (unlikely(order > (MAX_ORDER - 1)))
1258 prep_compound_gigantic_page(page, order);
1260 prep_compound_page(page, order);
1263 /* Put bootmem huge pages into the standard lists after mem_map is up */
1264 static void __init gather_bootmem_prealloc(void)
1266 struct huge_bootmem_page *m;
1268 list_for_each_entry(m, &huge_boot_pages, list) {
1269 struct hstate *h = m->hstate;
1272 #ifdef CONFIG_HIGHMEM
1273 page = pfn_to_page(m->phys >> PAGE_SHIFT);
1274 free_bootmem_late((unsigned long)m,
1275 sizeof(struct huge_bootmem_page));
1277 page = virt_to_page(m);
1279 __ClearPageReserved(page);
1280 WARN_ON(page_count(page) != 1);
1281 prep_compound_huge_page(page, h->order);
1282 prep_new_huge_page(h, page, page_to_nid(page));
1284 * If we had gigantic hugepages allocated at boot time, we need
1285 * to restore the 'stolen' pages to totalram_pages in order to
1286 * fix confusing memory reports from free(1) and another
1287 * side-effects, like CommitLimit going negative.
1289 if (h->order > (MAX_ORDER - 1))
1290 totalram_pages += 1 << h->order;
1294 static void __init hugetlb_hstate_alloc_pages(struct hstate *h)
1298 for (i = 0; i < h->max_huge_pages; ++i) {
1299 if (h->order >= MAX_ORDER) {
1300 if (!alloc_bootmem_huge_page(h))
1302 } else if (!alloc_fresh_huge_page(h,
1303 &node_states[N_MEMORY]))
1306 h->max_huge_pages = i;
1309 static void __init hugetlb_init_hstates(void)
1313 for_each_hstate(h) {
1314 /* oversize hugepages were init'ed in early boot */
1315 if (h->order < MAX_ORDER)
1316 hugetlb_hstate_alloc_pages(h);
1320 static char * __init memfmt(char *buf, unsigned long n)
1322 if (n >= (1UL << 30))
1323 sprintf(buf, "%lu GB", n >> 30);
1324 else if (n >= (1UL << 20))
1325 sprintf(buf, "%lu MB", n >> 20);
1327 sprintf(buf, "%lu KB", n >> 10);
1331 static void __init report_hugepages(void)
1335 for_each_hstate(h) {
1337 pr_info("HugeTLB registered %s page size, pre-allocated %ld pages\n",
1338 memfmt(buf, huge_page_size(h)),
1339 h->free_huge_pages);
1343 #ifdef CONFIG_HIGHMEM
1344 static void try_to_free_low(struct hstate *h, unsigned long count,
1345 nodemask_t *nodes_allowed)
1349 if (h->order >= MAX_ORDER)
1352 for_each_node_mask(i, *nodes_allowed) {
1353 struct page *page, *next;
1354 struct list_head *freel = &h->hugepage_freelists[i];
1355 list_for_each_entry_safe(page, next, freel, lru) {
1356 if (count >= h->nr_huge_pages)
1358 if (PageHighMem(page))
1360 list_del(&page->lru);
1361 update_and_free_page(h, page);
1362 h->free_huge_pages--;
1363 h->free_huge_pages_node[page_to_nid(page)]--;
1368 static inline void try_to_free_low(struct hstate *h, unsigned long count,
1369 nodemask_t *nodes_allowed)
1375 * Increment or decrement surplus_huge_pages. Keep node-specific counters
1376 * balanced by operating on them in a round-robin fashion.
1377 * Returns 1 if an adjustment was made.
1379 static int adjust_pool_surplus(struct hstate *h, nodemask_t *nodes_allowed,
1382 int start_nid, next_nid;
1385 VM_BUG_ON(delta != -1 && delta != 1);
1388 start_nid = hstate_next_node_to_alloc(h, nodes_allowed);
1390 start_nid = hstate_next_node_to_free(h, nodes_allowed);
1391 next_nid = start_nid;
1397 * To shrink on this node, there must be a surplus page
1399 if (!h->surplus_huge_pages_node[nid]) {
1400 next_nid = hstate_next_node_to_alloc(h,
1407 * Surplus cannot exceed the total number of pages
1409 if (h->surplus_huge_pages_node[nid] >=
1410 h->nr_huge_pages_node[nid]) {
1411 next_nid = hstate_next_node_to_free(h,
1417 h->surplus_huge_pages += delta;
1418 h->surplus_huge_pages_node[nid] += delta;
1421 } while (next_nid != start_nid);
1426 #define persistent_huge_pages(h) (h->nr_huge_pages - h->surplus_huge_pages)
1427 static unsigned long set_max_huge_pages(struct hstate *h, unsigned long count,
1428 nodemask_t *nodes_allowed)
1430 unsigned long min_count, ret;
1432 if (h->order >= MAX_ORDER)
1433 return h->max_huge_pages;
1436 * Increase the pool size
1437 * First take pages out of surplus state. Then make up the
1438 * remaining difference by allocating fresh huge pages.
1440 * We might race with alloc_buddy_huge_page() here and be unable
1441 * to convert a surplus huge page to a normal huge page. That is
1442 * not critical, though, it just means the overall size of the
1443 * pool might be one hugepage larger than it needs to be, but
1444 * within all the constraints specified by the sysctls.
1446 spin_lock(&hugetlb_lock);
1447 while (h->surplus_huge_pages && count > persistent_huge_pages(h)) {
1448 if (!adjust_pool_surplus(h, nodes_allowed, -1))
1452 while (count > persistent_huge_pages(h)) {
1454 * If this allocation races such that we no longer need the
1455 * page, free_huge_page will handle it by freeing the page
1456 * and reducing the surplus.
1458 spin_unlock(&hugetlb_lock);
1459 ret = alloc_fresh_huge_page(h, nodes_allowed);
1460 spin_lock(&hugetlb_lock);
1464 /* Bail for signals. Probably ctrl-c from user */
1465 if (signal_pending(current))
1470 * Decrease the pool size
1471 * First return free pages to the buddy allocator (being careful
1472 * to keep enough around to satisfy reservations). Then place
1473 * pages into surplus state as needed so the pool will shrink
1474 * to the desired size as pages become free.
1476 * By placing pages into the surplus state independent of the
1477 * overcommit value, we are allowing the surplus pool size to
1478 * exceed overcommit. There are few sane options here. Since
1479 * alloc_buddy_huge_page() is checking the global counter,
1480 * though, we'll note that we're not allowed to exceed surplus
1481 * and won't grow the pool anywhere else. Not until one of the
1482 * sysctls are changed, or the surplus pages go out of use.
1484 min_count = h->resv_huge_pages + h->nr_huge_pages - h->free_huge_pages;
1485 min_count = max(count, min_count);
1486 try_to_free_low(h, min_count, nodes_allowed);
1487 while (min_count < persistent_huge_pages(h)) {
1488 if (!free_pool_huge_page(h, nodes_allowed, 0))
1491 while (count < persistent_huge_pages(h)) {
1492 if (!adjust_pool_surplus(h, nodes_allowed, 1))
1496 ret = persistent_huge_pages(h);
1497 spin_unlock(&hugetlb_lock);
1501 #define HSTATE_ATTR_RO(_name) \
1502 static struct kobj_attribute _name##_attr = __ATTR_RO(_name)
1504 #define HSTATE_ATTR(_name) \
1505 static struct kobj_attribute _name##_attr = \
1506 __ATTR(_name, 0644, _name##_show, _name##_store)
1508 static struct kobject *hugepages_kobj;
1509 static struct kobject *hstate_kobjs[HUGE_MAX_HSTATE];
1511 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp);
1513 static struct hstate *kobj_to_hstate(struct kobject *kobj, int *nidp)
1517 for (i = 0; i < HUGE_MAX_HSTATE; i++)
1518 if (hstate_kobjs[i] == kobj) {
1520 *nidp = NUMA_NO_NODE;
1524 return kobj_to_node_hstate(kobj, nidp);
1527 static ssize_t nr_hugepages_show_common(struct kobject *kobj,
1528 struct kobj_attribute *attr, char *buf)
1531 unsigned long nr_huge_pages;
1534 h = kobj_to_hstate(kobj, &nid);
1535 if (nid == NUMA_NO_NODE)
1536 nr_huge_pages = h->nr_huge_pages;
1538 nr_huge_pages = h->nr_huge_pages_node[nid];
1540 return sprintf(buf, "%lu\n", nr_huge_pages);
1543 static ssize_t nr_hugepages_store_common(bool obey_mempolicy,
1544 struct kobject *kobj, struct kobj_attribute *attr,
1545 const char *buf, size_t len)
1549 unsigned long count;
1551 NODEMASK_ALLOC(nodemask_t, nodes_allowed, GFP_KERNEL | __GFP_NORETRY);
1553 err = strict_strtoul(buf, 10, &count);
1557 h = kobj_to_hstate(kobj, &nid);
1558 if (h->order >= MAX_ORDER) {
1563 if (nid == NUMA_NO_NODE) {
1565 * global hstate attribute
1567 if (!(obey_mempolicy &&
1568 init_nodemask_of_mempolicy(nodes_allowed))) {
1569 NODEMASK_FREE(nodes_allowed);
1570 nodes_allowed = &node_states[N_MEMORY];
1572 } else if (nodes_allowed) {
1574 * per node hstate attribute: adjust count to global,
1575 * but restrict alloc/free to the specified node.
1577 count += h->nr_huge_pages - h->nr_huge_pages_node[nid];
1578 init_nodemask_of_node(nodes_allowed, nid);
1580 nodes_allowed = &node_states[N_MEMORY];
1582 h->max_huge_pages = set_max_huge_pages(h, count, nodes_allowed);
1584 if (nodes_allowed != &node_states[N_MEMORY])
1585 NODEMASK_FREE(nodes_allowed);
1589 NODEMASK_FREE(nodes_allowed);
1593 static ssize_t nr_hugepages_show(struct kobject *kobj,
1594 struct kobj_attribute *attr, char *buf)
1596 return nr_hugepages_show_common(kobj, attr, buf);
1599 static ssize_t nr_hugepages_store(struct kobject *kobj,
1600 struct kobj_attribute *attr, const char *buf, size_t len)
1602 return nr_hugepages_store_common(false, kobj, attr, buf, len);
1604 HSTATE_ATTR(nr_hugepages);
1609 * hstate attribute for optionally mempolicy-based constraint on persistent
1610 * huge page alloc/free.
1612 static ssize_t nr_hugepages_mempolicy_show(struct kobject *kobj,
1613 struct kobj_attribute *attr, char *buf)
1615 return nr_hugepages_show_common(kobj, attr, buf);
1618 static ssize_t nr_hugepages_mempolicy_store(struct kobject *kobj,
1619 struct kobj_attribute *attr, const char *buf, size_t len)
1621 return nr_hugepages_store_common(true, kobj, attr, buf, len);
1623 HSTATE_ATTR(nr_hugepages_mempolicy);
1627 static ssize_t nr_overcommit_hugepages_show(struct kobject *kobj,
1628 struct kobj_attribute *attr, char *buf)
1630 struct hstate *h = kobj_to_hstate(kobj, NULL);
1631 return sprintf(buf, "%lu\n", h->nr_overcommit_huge_pages);
1634 static ssize_t nr_overcommit_hugepages_store(struct kobject *kobj,
1635 struct kobj_attribute *attr, const char *buf, size_t count)
1638 unsigned long input;
1639 struct hstate *h = kobj_to_hstate(kobj, NULL);
1641 if (h->order >= MAX_ORDER)
1644 err = strict_strtoul(buf, 10, &input);
1648 spin_lock(&hugetlb_lock);
1649 h->nr_overcommit_huge_pages = input;
1650 spin_unlock(&hugetlb_lock);
1654 HSTATE_ATTR(nr_overcommit_hugepages);
1656 static ssize_t free_hugepages_show(struct kobject *kobj,
1657 struct kobj_attribute *attr, char *buf)
1660 unsigned long free_huge_pages;
1663 h = kobj_to_hstate(kobj, &nid);
1664 if (nid == NUMA_NO_NODE)
1665 free_huge_pages = h->free_huge_pages;
1667 free_huge_pages = h->free_huge_pages_node[nid];
1669 return sprintf(buf, "%lu\n", free_huge_pages);
1671 HSTATE_ATTR_RO(free_hugepages);
1673 static ssize_t resv_hugepages_show(struct kobject *kobj,
1674 struct kobj_attribute *attr, char *buf)
1676 struct hstate *h = kobj_to_hstate(kobj, NULL);
1677 return sprintf(buf, "%lu\n", h->resv_huge_pages);
1679 HSTATE_ATTR_RO(resv_hugepages);
1681 static ssize_t surplus_hugepages_show(struct kobject *kobj,
1682 struct kobj_attribute *attr, char *buf)
1685 unsigned long surplus_huge_pages;
1688 h = kobj_to_hstate(kobj, &nid);
1689 if (nid == NUMA_NO_NODE)
1690 surplus_huge_pages = h->surplus_huge_pages;
1692 surplus_huge_pages = h->surplus_huge_pages_node[nid];
1694 return sprintf(buf, "%lu\n", surplus_huge_pages);
1696 HSTATE_ATTR_RO(surplus_hugepages);
1698 static struct attribute *hstate_attrs[] = {
1699 &nr_hugepages_attr.attr,
1700 &nr_overcommit_hugepages_attr.attr,
1701 &free_hugepages_attr.attr,
1702 &resv_hugepages_attr.attr,
1703 &surplus_hugepages_attr.attr,
1705 &nr_hugepages_mempolicy_attr.attr,
1710 static struct attribute_group hstate_attr_group = {
1711 .attrs = hstate_attrs,
1714 static int hugetlb_sysfs_add_hstate(struct hstate *h, struct kobject *parent,
1715 struct kobject **hstate_kobjs,
1716 struct attribute_group *hstate_attr_group)
1719 int hi = hstate_index(h);
1721 hstate_kobjs[hi] = kobject_create_and_add(h->name, parent);
1722 if (!hstate_kobjs[hi])
1725 retval = sysfs_create_group(hstate_kobjs[hi], hstate_attr_group);
1727 kobject_put(hstate_kobjs[hi]);
1732 static void __init hugetlb_sysfs_init(void)
1737 hugepages_kobj = kobject_create_and_add("hugepages", mm_kobj);
1738 if (!hugepages_kobj)
1741 for_each_hstate(h) {
1742 err = hugetlb_sysfs_add_hstate(h, hugepages_kobj,
1743 hstate_kobjs, &hstate_attr_group);
1745 pr_err("Hugetlb: Unable to add hstate %s", h->name);
1752 * node_hstate/s - associate per node hstate attributes, via their kobjects,
1753 * with node devices in node_devices[] using a parallel array. The array
1754 * index of a node device or _hstate == node id.
1755 * This is here to avoid any static dependency of the node device driver, in
1756 * the base kernel, on the hugetlb module.
1758 struct node_hstate {
1759 struct kobject *hugepages_kobj;
1760 struct kobject *hstate_kobjs[HUGE_MAX_HSTATE];
1762 struct node_hstate node_hstates[MAX_NUMNODES];
1765 * A subset of global hstate attributes for node devices
1767 static struct attribute *per_node_hstate_attrs[] = {
1768 &nr_hugepages_attr.attr,
1769 &free_hugepages_attr.attr,
1770 &surplus_hugepages_attr.attr,
1774 static struct attribute_group per_node_hstate_attr_group = {
1775 .attrs = per_node_hstate_attrs,
1779 * kobj_to_node_hstate - lookup global hstate for node device hstate attr kobj.
1780 * Returns node id via non-NULL nidp.
1782 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp)
1786 for (nid = 0; nid < nr_node_ids; nid++) {
1787 struct node_hstate *nhs = &node_hstates[nid];
1789 for (i = 0; i < HUGE_MAX_HSTATE; i++)
1790 if (nhs->hstate_kobjs[i] == kobj) {
1802 * Unregister hstate attributes from a single node device.
1803 * No-op if no hstate attributes attached.
1805 static void hugetlb_unregister_node(struct node *node)
1808 struct node_hstate *nhs = &node_hstates[node->dev.id];
1810 if (!nhs->hugepages_kobj)
1811 return; /* no hstate attributes */
1813 for_each_hstate(h) {
1814 int idx = hstate_index(h);
1815 if (nhs->hstate_kobjs[idx]) {
1816 kobject_put(nhs->hstate_kobjs[idx]);
1817 nhs->hstate_kobjs[idx] = NULL;
1821 kobject_put(nhs->hugepages_kobj);
1822 nhs->hugepages_kobj = NULL;
1826 * hugetlb module exit: unregister hstate attributes from node devices
1829 static void hugetlb_unregister_all_nodes(void)
1834 * disable node device registrations.
1836 register_hugetlbfs_with_node(NULL, NULL);
1839 * remove hstate attributes from any nodes that have them.
1841 for (nid = 0; nid < nr_node_ids; nid++)
1842 hugetlb_unregister_node(node_devices[nid]);
1846 * Register hstate attributes for a single node device.
1847 * No-op if attributes already registered.
1849 static void hugetlb_register_node(struct node *node)
1852 struct node_hstate *nhs = &node_hstates[node->dev.id];
1855 if (nhs->hugepages_kobj)
1856 return; /* already allocated */
1858 nhs->hugepages_kobj = kobject_create_and_add("hugepages",
1860 if (!nhs->hugepages_kobj)
1863 for_each_hstate(h) {
1864 err = hugetlb_sysfs_add_hstate(h, nhs->hugepages_kobj,
1866 &per_node_hstate_attr_group);
1868 pr_err("Hugetlb: Unable to add hstate %s for node %d\n",
1869 h->name, node->dev.id);
1870 hugetlb_unregister_node(node);
1877 * hugetlb init time: register hstate attributes for all registered node
1878 * devices of nodes that have memory. All on-line nodes should have
1879 * registered their associated device by this time.
1881 static void hugetlb_register_all_nodes(void)
1885 for_each_node_state(nid, N_MEMORY) {
1886 struct node *node = node_devices[nid];
1887 if (node->dev.id == nid)
1888 hugetlb_register_node(node);
1892 * Let the node device driver know we're here so it can
1893 * [un]register hstate attributes on node hotplug.
1895 register_hugetlbfs_with_node(hugetlb_register_node,
1896 hugetlb_unregister_node);
1898 #else /* !CONFIG_NUMA */
1900 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp)
1908 static void hugetlb_unregister_all_nodes(void) { }
1910 static void hugetlb_register_all_nodes(void) { }
1914 static void __exit hugetlb_exit(void)
1918 hugetlb_unregister_all_nodes();
1920 for_each_hstate(h) {
1921 kobject_put(hstate_kobjs[hstate_index(h)]);
1924 kobject_put(hugepages_kobj);
1926 module_exit(hugetlb_exit);
1928 static int __init hugetlb_init(void)
1930 /* Some platform decide whether they support huge pages at boot
1931 * time. On these, such as powerpc, HPAGE_SHIFT is set to 0 when
1932 * there is no such support
1934 if (HPAGE_SHIFT == 0)
1937 if (!size_to_hstate(default_hstate_size)) {
1938 default_hstate_size = HPAGE_SIZE;
1939 if (!size_to_hstate(default_hstate_size))
1940 hugetlb_add_hstate(HUGETLB_PAGE_ORDER);
1942 default_hstate_idx = hstate_index(size_to_hstate(default_hstate_size));
1943 if (default_hstate_max_huge_pages)
1944 default_hstate.max_huge_pages = default_hstate_max_huge_pages;
1946 hugetlb_init_hstates();
1947 gather_bootmem_prealloc();
1950 hugetlb_sysfs_init();
1951 hugetlb_register_all_nodes();
1952 hugetlb_cgroup_file_init();
1956 module_init(hugetlb_init);
1958 /* Should be called on processing a hugepagesz=... option */
1959 void __init hugetlb_add_hstate(unsigned order)
1964 if (size_to_hstate(PAGE_SIZE << order)) {
1965 pr_warning("hugepagesz= specified twice, ignoring\n");
1968 BUG_ON(hugetlb_max_hstate >= HUGE_MAX_HSTATE);
1970 h = &hstates[hugetlb_max_hstate++];
1972 h->mask = ~((1ULL << (order + PAGE_SHIFT)) - 1);
1973 h->nr_huge_pages = 0;
1974 h->free_huge_pages = 0;
1975 for (i = 0; i < MAX_NUMNODES; ++i)
1976 INIT_LIST_HEAD(&h->hugepage_freelists[i]);
1977 INIT_LIST_HEAD(&h->hugepage_activelist);
1978 h->next_nid_to_alloc = first_node(node_states[N_MEMORY]);
1979 h->next_nid_to_free = first_node(node_states[N_MEMORY]);
1980 snprintf(h->name, HSTATE_NAME_LEN, "hugepages-%lukB",
1981 huge_page_size(h)/1024);
1986 static int __init hugetlb_nrpages_setup(char *s)
1989 static unsigned long *last_mhp;
1992 * !hugetlb_max_hstate means we haven't parsed a hugepagesz= parameter yet,
1993 * so this hugepages= parameter goes to the "default hstate".
1995 if (!hugetlb_max_hstate)
1996 mhp = &default_hstate_max_huge_pages;
1998 mhp = &parsed_hstate->max_huge_pages;
2000 if (mhp == last_mhp) {
2001 pr_warning("hugepages= specified twice without "
2002 "interleaving hugepagesz=, ignoring\n");
2006 if (sscanf(s, "%lu", mhp) <= 0)
2010 * Global state is always initialized later in hugetlb_init.
2011 * But we need to allocate >= MAX_ORDER hstates here early to still
2012 * use the bootmem allocator.
2014 if (hugetlb_max_hstate && parsed_hstate->order >= MAX_ORDER)
2015 hugetlb_hstate_alloc_pages(parsed_hstate);
2021 __setup("hugepages=", hugetlb_nrpages_setup);
2023 static int __init hugetlb_default_setup(char *s)
2025 default_hstate_size = memparse(s, &s);
2028 __setup("default_hugepagesz=", hugetlb_default_setup);
2030 static unsigned int cpuset_mems_nr(unsigned int *array)
2033 unsigned int nr = 0;
2035 for_each_node_mask(node, cpuset_current_mems_allowed)
2041 #ifdef CONFIG_SYSCTL
2042 static int hugetlb_sysctl_handler_common(bool obey_mempolicy,
2043 struct ctl_table *table, int write,
2044 void __user *buffer, size_t *length, loff_t *ppos)
2046 struct hstate *h = &default_hstate;
2050 tmp = h->max_huge_pages;
2052 if (write && h->order >= MAX_ORDER)
2056 table->maxlen = sizeof(unsigned long);
2057 ret = proc_doulongvec_minmax(table, write, buffer, length, ppos);
2062 NODEMASK_ALLOC(nodemask_t, nodes_allowed,
2063 GFP_KERNEL | __GFP_NORETRY);
2064 if (!(obey_mempolicy &&
2065 init_nodemask_of_mempolicy(nodes_allowed))) {
2066 NODEMASK_FREE(nodes_allowed);
2067 nodes_allowed = &node_states[N_MEMORY];
2069 h->max_huge_pages = set_max_huge_pages(h, tmp, nodes_allowed);
2071 if (nodes_allowed != &node_states[N_MEMORY])
2072 NODEMASK_FREE(nodes_allowed);
2078 int hugetlb_sysctl_handler(struct ctl_table *table, int write,
2079 void __user *buffer, size_t *length, loff_t *ppos)
2082 return hugetlb_sysctl_handler_common(false, table, write,
2083 buffer, length, ppos);
2087 int hugetlb_mempolicy_sysctl_handler(struct ctl_table *table, int write,
2088 void __user *buffer, size_t *length, loff_t *ppos)
2090 return hugetlb_sysctl_handler_common(true, table, write,
2091 buffer, length, ppos);
2093 #endif /* CONFIG_NUMA */
2095 int hugetlb_treat_movable_handler(struct ctl_table *table, int write,
2096 void __user *buffer,
2097 size_t *length, loff_t *ppos)
2099 proc_dointvec(table, write, buffer, length, ppos);
2100 if (hugepages_treat_as_movable)
2101 htlb_alloc_mask = GFP_HIGHUSER_MOVABLE;
2103 htlb_alloc_mask = GFP_HIGHUSER;
2107 int hugetlb_overcommit_handler(struct ctl_table *table, int write,
2108 void __user *buffer,
2109 size_t *length, loff_t *ppos)
2111 struct hstate *h = &default_hstate;
2115 tmp = h->nr_overcommit_huge_pages;
2117 if (write && h->order >= MAX_ORDER)
2121 table->maxlen = sizeof(unsigned long);
2122 ret = proc_doulongvec_minmax(table, write, buffer, length, ppos);
2127 spin_lock(&hugetlb_lock);
2128 h->nr_overcommit_huge_pages = tmp;
2129 spin_unlock(&hugetlb_lock);
2135 #endif /* CONFIG_SYSCTL */
2137 void hugetlb_report_meminfo(struct seq_file *m)
2139 struct hstate *h = &default_hstate;
2141 "HugePages_Total: %5lu\n"
2142 "HugePages_Free: %5lu\n"
2143 "HugePages_Rsvd: %5lu\n"
2144 "HugePages_Surp: %5lu\n"
2145 "Hugepagesize: %8lu kB\n",
2149 h->surplus_huge_pages,
2150 1UL << (huge_page_order(h) + PAGE_SHIFT - 10));
2153 int hugetlb_report_node_meminfo(int nid, char *buf)
2155 struct hstate *h = &default_hstate;
2157 "Node %d HugePages_Total: %5u\n"
2158 "Node %d HugePages_Free: %5u\n"
2159 "Node %d HugePages_Surp: %5u\n",
2160 nid, h->nr_huge_pages_node[nid],
2161 nid, h->free_huge_pages_node[nid],
2162 nid, h->surplus_huge_pages_node[nid]);
2165 void hugetlb_show_meminfo(void)
2170 for_each_node_state(nid, N_MEMORY)
2172 pr_info("Node %d hugepages_total=%u hugepages_free=%u hugepages_surp=%u hugepages_size=%lukB\n",
2174 h->nr_huge_pages_node[nid],
2175 h->free_huge_pages_node[nid],
2176 h->surplus_huge_pages_node[nid],
2177 1UL << (huge_page_order(h) + PAGE_SHIFT - 10));
2180 /* Return the number pages of memory we physically have, in PAGE_SIZE units. */
2181 unsigned long hugetlb_total_pages(void)
2184 unsigned long nr_total_pages = 0;
2187 nr_total_pages += h->nr_huge_pages * pages_per_huge_page(h);
2188 return nr_total_pages;
2191 static int hugetlb_acct_memory(struct hstate *h, long delta)
2195 spin_lock(&hugetlb_lock);
2197 * When cpuset is configured, it breaks the strict hugetlb page
2198 * reservation as the accounting is done on a global variable. Such
2199 * reservation is completely rubbish in the presence of cpuset because
2200 * the reservation is not checked against page availability for the
2201 * current cpuset. Application can still potentially OOM'ed by kernel
2202 * with lack of free htlb page in cpuset that the task is in.
2203 * Attempt to enforce strict accounting with cpuset is almost
2204 * impossible (or too ugly) because cpuset is too fluid that
2205 * task or memory node can be dynamically moved between cpusets.
2207 * The change of semantics for shared hugetlb mapping with cpuset is
2208 * undesirable. However, in order to preserve some of the semantics,
2209 * we fall back to check against current free page availability as
2210 * a best attempt and hopefully to minimize the impact of changing
2211 * semantics that cpuset has.
2214 if (gather_surplus_pages(h, delta) < 0)
2217 if (delta > cpuset_mems_nr(h->free_huge_pages_node)) {
2218 return_unused_surplus_pages(h, delta);
2225 return_unused_surplus_pages(h, (unsigned long) -delta);
2228 spin_unlock(&hugetlb_lock);
2232 static void hugetlb_vm_op_open(struct vm_area_struct *vma)
2234 struct resv_map *reservations = vma_resv_map(vma);
2237 * This new VMA should share its siblings reservation map if present.
2238 * The VMA will only ever have a valid reservation map pointer where
2239 * it is being copied for another still existing VMA. As that VMA
2240 * has a reference to the reservation map it cannot disappear until
2241 * after this open call completes. It is therefore safe to take a
2242 * new reference here without additional locking.
2245 kref_get(&reservations->refs);
2248 static void resv_map_put(struct vm_area_struct *vma)
2250 struct resv_map *reservations = vma_resv_map(vma);
2254 kref_put(&reservations->refs, resv_map_release);
2257 static void hugetlb_vm_op_close(struct vm_area_struct *vma)
2259 struct hstate *h = hstate_vma(vma);
2260 struct resv_map *reservations = vma_resv_map(vma);
2261 struct hugepage_subpool *spool = subpool_vma(vma);
2262 unsigned long reserve;
2263 unsigned long start;
2267 start = vma_hugecache_offset(h, vma, vma->vm_start);
2268 end = vma_hugecache_offset(h, vma, vma->vm_end);
2270 reserve = (end - start) -
2271 region_count(&reservations->regions, start, end);
2276 hugetlb_acct_memory(h, -reserve);
2277 hugepage_subpool_put_pages(spool, reserve);
2283 * We cannot handle pagefaults against hugetlb pages at all. They cause
2284 * handle_mm_fault() to try to instantiate regular-sized pages in the
2285 * hugegpage VMA. do_page_fault() is supposed to trap this, so BUG is we get
2288 static int hugetlb_vm_op_fault(struct vm_area_struct *vma, struct vm_fault *vmf)
2294 const struct vm_operations_struct hugetlb_vm_ops = {
2295 .fault = hugetlb_vm_op_fault,
2296 .open = hugetlb_vm_op_open,
2297 .close = hugetlb_vm_op_close,
2300 static pte_t make_huge_pte(struct vm_area_struct *vma, struct page *page,
2306 entry = huge_pte_mkwrite(huge_pte_mkdirty(mk_huge_pte(page,
2307 vma->vm_page_prot)));
2309 entry = huge_pte_wrprotect(mk_huge_pte(page,
2310 vma->vm_page_prot));
2312 entry = pte_mkyoung(entry);
2313 entry = pte_mkhuge(entry);
2314 entry = arch_make_huge_pte(entry, vma, page, writable);
2319 static void set_huge_ptep_writable(struct vm_area_struct *vma,
2320 unsigned long address, pte_t *ptep)
2324 entry = huge_pte_mkwrite(huge_pte_mkdirty(huge_ptep_get(ptep)));
2325 if (huge_ptep_set_access_flags(vma, address, ptep, entry, 1))
2326 update_mmu_cache(vma, address, ptep);
2330 int copy_hugetlb_page_range(struct mm_struct *dst, struct mm_struct *src,
2331 struct vm_area_struct *vma)
2333 pte_t *src_pte, *dst_pte, entry;
2334 struct page *ptepage;
2337 struct hstate *h = hstate_vma(vma);
2338 unsigned long sz = huge_page_size(h);
2339 unsigned long mmun_start; /* For mmu_notifiers */
2340 unsigned long mmun_end; /* For mmu_notifiers */
2343 cow = (vma->vm_flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
2345 mmun_start = vma->vm_start;
2346 mmun_end = vma->vm_end;
2348 mmu_notifier_invalidate_range_start(src, mmun_start, mmun_end);
2350 for (addr = vma->vm_start; addr < vma->vm_end; addr += sz) {
2351 src_pte = huge_pte_offset(src, addr);
2354 dst_pte = huge_pte_alloc(dst, addr, sz);
2360 /* If the pagetables are shared don't copy or take references */
2361 if (dst_pte == src_pte)
2364 spin_lock(&dst->page_table_lock);
2365 spin_lock_nested(&src->page_table_lock, SINGLE_DEPTH_NESTING);
2366 if (!huge_pte_none(huge_ptep_get(src_pte))) {
2368 huge_ptep_set_wrprotect(src, addr, src_pte);
2369 entry = huge_ptep_get(src_pte);
2370 ptepage = pte_page(entry);
2372 page_dup_rmap(ptepage);
2373 set_huge_pte_at(dst, addr, dst_pte, entry);
2375 spin_unlock(&src->page_table_lock);
2376 spin_unlock(&dst->page_table_lock);
2380 mmu_notifier_invalidate_range_end(src, mmun_start, mmun_end);
2385 static int is_hugetlb_entry_migration(pte_t pte)
2389 if (huge_pte_none(pte) || pte_present(pte))
2391 swp = pte_to_swp_entry(pte);
2392 if (non_swap_entry(swp) && is_migration_entry(swp))
2398 static int is_hugetlb_entry_hwpoisoned(pte_t pte)
2402 if (huge_pte_none(pte) || pte_present(pte))
2404 swp = pte_to_swp_entry(pte);
2405 if (non_swap_entry(swp) && is_hwpoison_entry(swp))
2411 void __unmap_hugepage_range(struct mmu_gather *tlb, struct vm_area_struct *vma,
2412 unsigned long start, unsigned long end,
2413 struct page *ref_page)
2415 int force_flush = 0;
2416 struct mm_struct *mm = vma->vm_mm;
2417 unsigned long address;
2421 struct hstate *h = hstate_vma(vma);
2422 unsigned long sz = huge_page_size(h);
2423 const unsigned long mmun_start = start; /* For mmu_notifiers */
2424 const unsigned long mmun_end = end; /* For mmu_notifiers */
2426 WARN_ON(!is_vm_hugetlb_page(vma));
2427 BUG_ON(start & ~huge_page_mask(h));
2428 BUG_ON(end & ~huge_page_mask(h));
2430 tlb_start_vma(tlb, vma);
2431 mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end);
2433 spin_lock(&mm->page_table_lock);
2434 for (address = start; address < end; address += sz) {
2435 ptep = huge_pte_offset(mm, address);
2439 if (huge_pmd_unshare(mm, &address, ptep))
2442 pte = huge_ptep_get(ptep);
2443 if (huge_pte_none(pte))
2447 * HWPoisoned hugepage is already unmapped and dropped reference
2449 if (unlikely(is_hugetlb_entry_hwpoisoned(pte))) {
2450 huge_pte_clear(mm, address, ptep);
2454 page = pte_page(pte);
2456 * If a reference page is supplied, it is because a specific
2457 * page is being unmapped, not a range. Ensure the page we
2458 * are about to unmap is the actual page of interest.
2461 if (page != ref_page)
2465 * Mark the VMA as having unmapped its page so that
2466 * future faults in this VMA will fail rather than
2467 * looking like data was lost
2469 set_vma_resv_flags(vma, HPAGE_RESV_UNMAPPED);
2472 pte = huge_ptep_get_and_clear(mm, address, ptep);
2473 tlb_remove_tlb_entry(tlb, ptep, address);
2474 if (huge_pte_dirty(pte))
2475 set_page_dirty(page);
2477 page_remove_rmap(page);
2478 force_flush = !__tlb_remove_page(tlb, page);
2481 /* Bail out after unmapping reference page if supplied */
2485 spin_unlock(&mm->page_table_lock);
2487 * mmu_gather ran out of room to batch pages, we break out of
2488 * the PTE lock to avoid doing the potential expensive TLB invalidate
2489 * and page-free while holding it.
2494 if (address < end && !ref_page)
2497 mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end);
2498 tlb_end_vma(tlb, vma);
2501 void __unmap_hugepage_range_final(struct mmu_gather *tlb,
2502 struct vm_area_struct *vma, unsigned long start,
2503 unsigned long end, struct page *ref_page)
2505 __unmap_hugepage_range(tlb, vma, start, end, ref_page);
2508 * Clear this flag so that x86's huge_pmd_share page_table_shareable
2509 * test will fail on a vma being torn down, and not grab a page table
2510 * on its way out. We're lucky that the flag has such an appropriate
2511 * name, and can in fact be safely cleared here. We could clear it
2512 * before the __unmap_hugepage_range above, but all that's necessary
2513 * is to clear it before releasing the i_mmap_mutex. This works
2514 * because in the context this is called, the VMA is about to be
2515 * destroyed and the i_mmap_mutex is held.
2517 vma->vm_flags &= ~VM_MAYSHARE;
2520 void unmap_hugepage_range(struct vm_area_struct *vma, unsigned long start,
2521 unsigned long end, struct page *ref_page)
2523 struct mm_struct *mm;
2524 struct mmu_gather tlb;
2528 tlb_gather_mmu(&tlb, mm, start, end);
2529 __unmap_hugepage_range(&tlb, vma, start, end, ref_page);
2530 tlb_finish_mmu(&tlb, start, end);
2534 * This is called when the original mapper is failing to COW a MAP_PRIVATE
2535 * mappping it owns the reserve page for. The intention is to unmap the page
2536 * from other VMAs and let the children be SIGKILLed if they are faulting the
2539 static int unmap_ref_private(struct mm_struct *mm, struct vm_area_struct *vma,
2540 struct page *page, unsigned long address)
2542 struct hstate *h = hstate_vma(vma);
2543 struct vm_area_struct *iter_vma;
2544 struct address_space *mapping;
2548 * vm_pgoff is in PAGE_SIZE units, hence the different calculation
2549 * from page cache lookup which is in HPAGE_SIZE units.
2551 address = address & huge_page_mask(h);
2552 pgoff = ((address - vma->vm_start) >> PAGE_SHIFT) +
2554 mapping = file_inode(vma->vm_file)->i_mapping;
2557 * Take the mapping lock for the duration of the table walk. As
2558 * this mapping should be shared between all the VMAs,
2559 * __unmap_hugepage_range() is called as the lock is already held
2561 mutex_lock(&mapping->i_mmap_mutex);
2562 vma_interval_tree_foreach(iter_vma, &mapping->i_mmap, pgoff, pgoff) {
2563 /* Do not unmap the current VMA */
2564 if (iter_vma == vma)
2568 * Unmap the page from other VMAs without their own reserves.
2569 * They get marked to be SIGKILLed if they fault in these
2570 * areas. This is because a future no-page fault on this VMA
2571 * could insert a zeroed page instead of the data existing
2572 * from the time of fork. This would look like data corruption
2574 if (!is_vma_resv_set(iter_vma, HPAGE_RESV_OWNER))
2575 unmap_hugepage_range(iter_vma, address,
2576 address + huge_page_size(h), page);
2578 mutex_unlock(&mapping->i_mmap_mutex);
2584 * Hugetlb_cow() should be called with page lock of the original hugepage held.
2585 * Called with hugetlb_instantiation_mutex held and pte_page locked so we
2586 * cannot race with other handlers or page migration.
2587 * Keep the pte_same checks anyway to make transition from the mutex easier.
2589 static int hugetlb_cow(struct mm_struct *mm, struct vm_area_struct *vma,
2590 unsigned long address, pte_t *ptep, pte_t pte,
2591 struct page *pagecache_page)
2593 struct hstate *h = hstate_vma(vma);
2594 struct page *old_page, *new_page;
2596 int outside_reserve = 0;
2597 unsigned long mmun_start; /* For mmu_notifiers */
2598 unsigned long mmun_end; /* For mmu_notifiers */
2600 old_page = pte_page(pte);
2603 /* If no-one else is actually using this page, avoid the copy
2604 * and just make the page writable */
2605 avoidcopy = (page_mapcount(old_page) == 1);
2607 if (PageAnon(old_page))
2608 page_move_anon_rmap(old_page, vma, address);
2609 set_huge_ptep_writable(vma, address, ptep);
2614 * If the process that created a MAP_PRIVATE mapping is about to
2615 * perform a COW due to a shared page count, attempt to satisfy
2616 * the allocation without using the existing reserves. The pagecache
2617 * page is used to determine if the reserve at this address was
2618 * consumed or not. If reserves were used, a partial faulted mapping
2619 * at the time of fork() could consume its reserves on COW instead
2620 * of the full address range.
2622 if (!(vma->vm_flags & VM_MAYSHARE) &&
2623 is_vma_resv_set(vma, HPAGE_RESV_OWNER) &&
2624 old_page != pagecache_page)
2625 outside_reserve = 1;
2627 page_cache_get(old_page);
2629 /* Drop page_table_lock as buddy allocator may be called */
2630 spin_unlock(&mm->page_table_lock);
2631 new_page = alloc_huge_page(vma, address, outside_reserve);
2633 if (IS_ERR(new_page)) {
2634 long err = PTR_ERR(new_page);
2635 page_cache_release(old_page);
2638 * If a process owning a MAP_PRIVATE mapping fails to COW,
2639 * it is due to references held by a child and an insufficient
2640 * huge page pool. To guarantee the original mappers
2641 * reliability, unmap the page from child processes. The child
2642 * may get SIGKILLed if it later faults.
2644 if (outside_reserve) {
2645 BUG_ON(huge_pte_none(pte));
2646 if (unmap_ref_private(mm, vma, old_page, address)) {
2647 BUG_ON(huge_pte_none(pte));
2648 spin_lock(&mm->page_table_lock);
2649 ptep = huge_pte_offset(mm, address & huge_page_mask(h));
2650 if (likely(pte_same(huge_ptep_get(ptep), pte)))
2651 goto retry_avoidcopy;
2653 * race occurs while re-acquiring page_table_lock, and
2661 /* Caller expects lock to be held */
2662 spin_lock(&mm->page_table_lock);
2664 return VM_FAULT_OOM;
2666 return VM_FAULT_SIGBUS;
2670 * When the original hugepage is shared one, it does not have
2671 * anon_vma prepared.
2673 if (unlikely(anon_vma_prepare(vma))) {
2674 page_cache_release(new_page);
2675 page_cache_release(old_page);
2676 /* Caller expects lock to be held */
2677 spin_lock(&mm->page_table_lock);
2678 return VM_FAULT_OOM;
2681 copy_user_huge_page(new_page, old_page, address, vma,
2682 pages_per_huge_page(h));
2683 __SetPageUptodate(new_page);
2685 mmun_start = address & huge_page_mask(h);
2686 mmun_end = mmun_start + huge_page_size(h);
2687 mmu_notifier_invalidate_range_start(mm, mmun_start, mmun_end);
2689 * Retake the page_table_lock to check for racing updates
2690 * before the page tables are altered
2692 spin_lock(&mm->page_table_lock);
2693 ptep = huge_pte_offset(mm, address & huge_page_mask(h));
2694 if (likely(pte_same(huge_ptep_get(ptep), pte))) {
2696 huge_ptep_clear_flush(vma, address, ptep);
2697 set_huge_pte_at(mm, address, ptep,
2698 make_huge_pte(vma, new_page, 1));
2699 page_remove_rmap(old_page);
2700 hugepage_add_new_anon_rmap(new_page, vma, address);
2701 /* Make the old page be freed below */
2702 new_page = old_page;
2704 spin_unlock(&mm->page_table_lock);
2705 mmu_notifier_invalidate_range_end(mm, mmun_start, mmun_end);
2706 /* Caller expects lock to be held */
2707 spin_lock(&mm->page_table_lock);
2708 page_cache_release(new_page);
2709 page_cache_release(old_page);
2713 /* Return the pagecache page at a given address within a VMA */
2714 static struct page *hugetlbfs_pagecache_page(struct hstate *h,
2715 struct vm_area_struct *vma, unsigned long address)
2717 struct address_space *mapping;
2720 mapping = vma->vm_file->f_mapping;
2721 idx = vma_hugecache_offset(h, vma, address);
2723 return find_lock_page(mapping, idx);
2727 * Return whether there is a pagecache page to back given address within VMA.
2728 * Caller follow_hugetlb_page() holds page_table_lock so we cannot lock_page.
2730 static bool hugetlbfs_pagecache_present(struct hstate *h,
2731 struct vm_area_struct *vma, unsigned long address)
2733 struct address_space *mapping;
2737 mapping = vma->vm_file->f_mapping;
2738 idx = vma_hugecache_offset(h, vma, address);
2740 page = find_get_page(mapping, idx);
2743 return page != NULL;
2746 static int hugetlb_no_page(struct mm_struct *mm, struct vm_area_struct *vma,
2747 unsigned long address, pte_t *ptep, unsigned int flags)
2749 struct hstate *h = hstate_vma(vma);
2750 int ret = VM_FAULT_SIGBUS;
2755 struct address_space *mapping;
2759 * Currently, we are forced to kill the process in the event the
2760 * original mapper has unmapped pages from the child due to a failed
2761 * COW. Warn that such a situation has occurred as it may not be obvious
2763 if (is_vma_resv_set(vma, HPAGE_RESV_UNMAPPED)) {
2764 pr_warning("PID %d killed due to inadequate hugepage pool\n",
2769 mapping = vma->vm_file->f_mapping;
2770 idx = vma_hugecache_offset(h, vma, address);
2773 * Use page lock to guard against racing truncation
2774 * before we get page_table_lock.
2777 page = find_lock_page(mapping, idx);
2779 size = i_size_read(mapping->host) >> huge_page_shift(h);
2782 page = alloc_huge_page(vma, address, 0);
2784 ret = PTR_ERR(page);
2788 ret = VM_FAULT_SIGBUS;
2791 clear_huge_page(page, address, pages_per_huge_page(h));
2792 __SetPageUptodate(page);
2794 if (vma->vm_flags & VM_MAYSHARE) {
2796 struct inode *inode = mapping->host;
2798 err = add_to_page_cache(page, mapping, idx, GFP_KERNEL);
2806 spin_lock(&inode->i_lock);
2807 inode->i_blocks += blocks_per_huge_page(h);
2808 spin_unlock(&inode->i_lock);
2811 if (unlikely(anon_vma_prepare(vma))) {
2813 goto backout_unlocked;
2819 * If memory error occurs between mmap() and fault, some process
2820 * don't have hwpoisoned swap entry for errored virtual address.
2821 * So we need to block hugepage fault by PG_hwpoison bit check.
2823 if (unlikely(PageHWPoison(page))) {
2824 ret = VM_FAULT_HWPOISON |
2825 VM_FAULT_SET_HINDEX(hstate_index(h));
2826 goto backout_unlocked;
2831 * If we are going to COW a private mapping later, we examine the
2832 * pending reservations for this page now. This will ensure that
2833 * any allocations necessary to record that reservation occur outside
2836 if ((flags & FAULT_FLAG_WRITE) && !(vma->vm_flags & VM_SHARED))
2837 if (vma_needs_reservation(h, vma, address) < 0) {
2839 goto backout_unlocked;
2842 spin_lock(&mm->page_table_lock);
2843 size = i_size_read(mapping->host) >> huge_page_shift(h);
2848 if (!huge_pte_none(huge_ptep_get(ptep)))
2852 hugepage_add_new_anon_rmap(page, vma, address);
2854 page_dup_rmap(page);
2855 new_pte = make_huge_pte(vma, page, ((vma->vm_flags & VM_WRITE)
2856 && (vma->vm_flags & VM_SHARED)));
2857 set_huge_pte_at(mm, address, ptep, new_pte);
2859 if ((flags & FAULT_FLAG_WRITE) && !(vma->vm_flags & VM_SHARED)) {
2860 /* Optimization, do the COW without a second fault */
2861 ret = hugetlb_cow(mm, vma, address, ptep, new_pte, page);
2864 spin_unlock(&mm->page_table_lock);
2870 spin_unlock(&mm->page_table_lock);
2877 int hugetlb_fault(struct mm_struct *mm, struct vm_area_struct *vma,
2878 unsigned long address, unsigned int flags)
2883 struct page *page = NULL;
2884 struct page *pagecache_page = NULL;
2885 static DEFINE_MUTEX(hugetlb_instantiation_mutex);
2886 struct hstate *h = hstate_vma(vma);
2888 address &= huge_page_mask(h);
2890 ptep = huge_pte_offset(mm, address);
2892 entry = huge_ptep_get(ptep);
2893 if (unlikely(is_hugetlb_entry_migration(entry))) {
2894 migration_entry_wait_huge(mm, ptep);
2896 } else if (unlikely(is_hugetlb_entry_hwpoisoned(entry)))
2897 return VM_FAULT_HWPOISON_LARGE |
2898 VM_FAULT_SET_HINDEX(hstate_index(h));
2901 ptep = huge_pte_alloc(mm, address, huge_page_size(h));
2903 return VM_FAULT_OOM;
2906 * Serialize hugepage allocation and instantiation, so that we don't
2907 * get spurious allocation failures if two CPUs race to instantiate
2908 * the same page in the page cache.
2910 mutex_lock(&hugetlb_instantiation_mutex);
2911 entry = huge_ptep_get(ptep);
2912 if (huge_pte_none(entry)) {
2913 ret = hugetlb_no_page(mm, vma, address, ptep, flags);
2920 * If we are going to COW the mapping later, we examine the pending
2921 * reservations for this page now. This will ensure that any
2922 * allocations necessary to record that reservation occur outside the
2923 * spinlock. For private mappings, we also lookup the pagecache
2924 * page now as it is used to determine if a reservation has been
2927 if ((flags & FAULT_FLAG_WRITE) && !huge_pte_write(entry)) {
2928 if (vma_needs_reservation(h, vma, address) < 0) {
2933 if (!(vma->vm_flags & VM_MAYSHARE))
2934 pagecache_page = hugetlbfs_pagecache_page(h,
2939 * hugetlb_cow() requires page locks of pte_page(entry) and
2940 * pagecache_page, so here we need take the former one
2941 * when page != pagecache_page or !pagecache_page.
2942 * Note that locking order is always pagecache_page -> page,
2943 * so no worry about deadlock.
2945 page = pte_page(entry);
2947 if (page != pagecache_page)
2950 spin_lock(&mm->page_table_lock);
2951 /* Check for a racing update before calling hugetlb_cow */
2952 if (unlikely(!pte_same(entry, huge_ptep_get(ptep))))
2953 goto out_page_table_lock;
2956 if (flags & FAULT_FLAG_WRITE) {
2957 if (!huge_pte_write(entry)) {
2958 ret = hugetlb_cow(mm, vma, address, ptep, entry,
2960 goto out_page_table_lock;
2962 entry = huge_pte_mkdirty(entry);
2964 entry = pte_mkyoung(entry);
2965 if (huge_ptep_set_access_flags(vma, address, ptep, entry,
2966 flags & FAULT_FLAG_WRITE))
2967 update_mmu_cache(vma, address, ptep);
2969 out_page_table_lock:
2970 spin_unlock(&mm->page_table_lock);
2972 if (pagecache_page) {
2973 unlock_page(pagecache_page);
2974 put_page(pagecache_page);
2976 if (page != pagecache_page)
2981 mutex_unlock(&hugetlb_instantiation_mutex);
2986 long follow_hugetlb_page(struct mm_struct *mm, struct vm_area_struct *vma,
2987 struct page **pages, struct vm_area_struct **vmas,
2988 unsigned long *position, unsigned long *nr_pages,
2989 long i, unsigned int flags)
2991 unsigned long pfn_offset;
2992 unsigned long vaddr = *position;
2993 unsigned long remainder = *nr_pages;
2994 struct hstate *h = hstate_vma(vma);
2996 spin_lock(&mm->page_table_lock);
2997 while (vaddr < vma->vm_end && remainder) {
3003 * Some archs (sparc64, sh*) have multiple pte_ts to
3004 * each hugepage. We have to make sure we get the
3005 * first, for the page indexing below to work.
3007 pte = huge_pte_offset(mm, vaddr & huge_page_mask(h));
3008 absent = !pte || huge_pte_none(huge_ptep_get(pte));
3011 * When coredumping, it suits get_dump_page if we just return
3012 * an error where there's an empty slot with no huge pagecache
3013 * to back it. This way, we avoid allocating a hugepage, and
3014 * the sparse dumpfile avoids allocating disk blocks, but its
3015 * huge holes still show up with zeroes where they need to be.
3017 if (absent && (flags & FOLL_DUMP) &&
3018 !hugetlbfs_pagecache_present(h, vma, vaddr)) {
3024 * We need call hugetlb_fault for both hugepages under migration
3025 * (in which case hugetlb_fault waits for the migration,) and
3026 * hwpoisoned hugepages (in which case we need to prevent the
3027 * caller from accessing to them.) In order to do this, we use
3028 * here is_swap_pte instead of is_hugetlb_entry_migration and
3029 * is_hugetlb_entry_hwpoisoned. This is because it simply covers
3030 * both cases, and because we can't follow correct pages
3031 * directly from any kind of swap entries.
3033 if (absent || is_swap_pte(huge_ptep_get(pte)) ||
3034 ((flags & FOLL_WRITE) &&
3035 !huge_pte_write(huge_ptep_get(pte)))) {
3038 spin_unlock(&mm->page_table_lock);
3039 ret = hugetlb_fault(mm, vma, vaddr,
3040 (flags & FOLL_WRITE) ? FAULT_FLAG_WRITE : 0);
3041 spin_lock(&mm->page_table_lock);
3042 if (!(ret & VM_FAULT_ERROR))
3049 pfn_offset = (vaddr & ~huge_page_mask(h)) >> PAGE_SHIFT;
3050 page = pte_page(huge_ptep_get(pte));
3053 pages[i] = mem_map_offset(page, pfn_offset);
3064 if (vaddr < vma->vm_end && remainder &&
3065 pfn_offset < pages_per_huge_page(h)) {
3067 * We use pfn_offset to avoid touching the pageframes
3068 * of this compound page.
3073 spin_unlock(&mm->page_table_lock);
3074 *nr_pages = remainder;
3077 return i ? i : -EFAULT;
3080 unsigned long hugetlb_change_protection(struct vm_area_struct *vma,
3081 unsigned long address, unsigned long end, pgprot_t newprot)
3083 struct mm_struct *mm = vma->vm_mm;
3084 unsigned long start = address;
3087 struct hstate *h = hstate_vma(vma);
3088 unsigned long pages = 0;
3090 BUG_ON(address >= end);
3091 flush_cache_range(vma, address, end);
3093 mutex_lock(&vma->vm_file->f_mapping->i_mmap_mutex);
3094 spin_lock(&mm->page_table_lock);
3095 for (; address < end; address += huge_page_size(h)) {
3096 ptep = huge_pte_offset(mm, address);
3099 if (huge_pmd_unshare(mm, &address, ptep)) {
3103 if (!huge_pte_none(huge_ptep_get(ptep))) {
3104 pte = huge_ptep_get_and_clear(mm, address, ptep);
3105 pte = pte_mkhuge(huge_pte_modify(pte, newprot));
3106 pte = arch_make_huge_pte(pte, vma, NULL, 0);
3107 set_huge_pte_at(mm, address, ptep, pte);
3111 spin_unlock(&mm->page_table_lock);
3113 * Must flush TLB before releasing i_mmap_mutex: x86's huge_pmd_unshare
3114 * may have cleared our pud entry and done put_page on the page table:
3115 * once we release i_mmap_mutex, another task can do the final put_page
3116 * and that page table be reused and filled with junk.
3118 flush_tlb_range(vma, start, end);
3119 mutex_unlock(&vma->vm_file->f_mapping->i_mmap_mutex);
3121 return pages << h->order;
3124 int hugetlb_reserve_pages(struct inode *inode,
3126 struct vm_area_struct *vma,
3127 vm_flags_t vm_flags)
3130 struct hstate *h = hstate_inode(inode);
3131 struct hugepage_subpool *spool = subpool_inode(inode);
3134 * Only apply hugepage reservation if asked. At fault time, an
3135 * attempt will be made for VM_NORESERVE to allocate a page
3136 * without using reserves
3138 if (vm_flags & VM_NORESERVE)
3142 * Shared mappings base their reservation on the number of pages that
3143 * are already allocated on behalf of the file. Private mappings need
3144 * to reserve the full area even if read-only as mprotect() may be
3145 * called to make the mapping read-write. Assume !vma is a shm mapping
3147 if (!vma || vma->vm_flags & VM_MAYSHARE)
3148 chg = region_chg(&inode->i_mapping->private_list, from, to);
3150 struct resv_map *resv_map = resv_map_alloc();
3156 set_vma_resv_map(vma, resv_map);
3157 set_vma_resv_flags(vma, HPAGE_RESV_OWNER);
3165 /* There must be enough pages in the subpool for the mapping */
3166 if (hugepage_subpool_get_pages(spool, chg)) {
3172 * Check enough hugepages are available for the reservation.
3173 * Hand the pages back to the subpool if there are not
3175 ret = hugetlb_acct_memory(h, chg);
3177 hugepage_subpool_put_pages(spool, chg);
3182 * Account for the reservations made. Shared mappings record regions
3183 * that have reservations as they are shared by multiple VMAs.
3184 * When the last VMA disappears, the region map says how much
3185 * the reservation was and the page cache tells how much of
3186 * the reservation was consumed. Private mappings are per-VMA and
3187 * only the consumed reservations are tracked. When the VMA
3188 * disappears, the original reservation is the VMA size and the
3189 * consumed reservations are stored in the map. Hence, nothing
3190 * else has to be done for private mappings here
3192 if (!vma || vma->vm_flags & VM_MAYSHARE)
3193 region_add(&inode->i_mapping->private_list, from, to);
3201 void hugetlb_unreserve_pages(struct inode *inode, long offset, long freed)
3203 struct hstate *h = hstate_inode(inode);
3204 long chg = region_truncate(&inode->i_mapping->private_list, offset);
3205 struct hugepage_subpool *spool = subpool_inode(inode);
3207 spin_lock(&inode->i_lock);
3208 inode->i_blocks -= (blocks_per_huge_page(h) * freed);
3209 spin_unlock(&inode->i_lock);
3211 hugepage_subpool_put_pages(spool, (chg - freed));
3212 hugetlb_acct_memory(h, -(chg - freed));
3215 #ifdef CONFIG_ARCH_WANT_HUGE_PMD_SHARE
3216 static unsigned long page_table_shareable(struct vm_area_struct *svma,
3217 struct vm_area_struct *vma,
3218 unsigned long addr, pgoff_t idx)
3220 unsigned long saddr = ((idx - svma->vm_pgoff) << PAGE_SHIFT) +
3222 unsigned long sbase = saddr & PUD_MASK;
3223 unsigned long s_end = sbase + PUD_SIZE;
3225 /* Allow segments to share if only one is marked locked */
3226 unsigned long vm_flags = vma->vm_flags & ~VM_LOCKED;
3227 unsigned long svm_flags = svma->vm_flags & ~VM_LOCKED;
3230 * match the virtual addresses, permission and the alignment of the
3233 if (pmd_index(addr) != pmd_index(saddr) ||
3234 vm_flags != svm_flags ||
3235 sbase < svma->vm_start || svma->vm_end < s_end)
3241 static int vma_shareable(struct vm_area_struct *vma, unsigned long addr)
3243 unsigned long base = addr & PUD_MASK;
3244 unsigned long end = base + PUD_SIZE;
3247 * check on proper vm_flags and page table alignment
3249 if (vma->vm_flags & VM_MAYSHARE &&
3250 vma->vm_start <= base && end <= vma->vm_end)
3256 * Search for a shareable pmd page for hugetlb. In any case calls pmd_alloc()
3257 * and returns the corresponding pte. While this is not necessary for the
3258 * !shared pmd case because we can allocate the pmd later as well, it makes the
3259 * code much cleaner. pmd allocation is essential for the shared case because
3260 * pud has to be populated inside the same i_mmap_mutex section - otherwise
3261 * racing tasks could either miss the sharing (see huge_pte_offset) or select a
3262 * bad pmd for sharing.
3264 pte_t *huge_pmd_share(struct mm_struct *mm, unsigned long addr, pud_t *pud)
3266 struct vm_area_struct *vma = find_vma(mm, addr);
3267 struct address_space *mapping = vma->vm_file->f_mapping;
3268 pgoff_t idx = ((addr - vma->vm_start) >> PAGE_SHIFT) +
3270 struct vm_area_struct *svma;
3271 unsigned long saddr;
3275 if (!vma_shareable(vma, addr))
3276 return (pte_t *)pmd_alloc(mm, pud, addr);
3278 mutex_lock(&mapping->i_mmap_mutex);
3279 vma_interval_tree_foreach(svma, &mapping->i_mmap, idx, idx) {
3283 saddr = page_table_shareable(svma, vma, addr, idx);
3285 spte = huge_pte_offset(svma->vm_mm, saddr);
3287 get_page(virt_to_page(spte));
3296 spin_lock(&mm->page_table_lock);
3298 pud_populate(mm, pud,
3299 (pmd_t *)((unsigned long)spte & PAGE_MASK));
3301 put_page(virt_to_page(spte));
3302 spin_unlock(&mm->page_table_lock);
3304 pte = (pte_t *)pmd_alloc(mm, pud, addr);
3305 mutex_unlock(&mapping->i_mmap_mutex);
3310 * unmap huge page backed by shared pte.
3312 * Hugetlb pte page is ref counted at the time of mapping. If pte is shared
3313 * indicated by page_count > 1, unmap is achieved by clearing pud and
3314 * decrementing the ref count. If count == 1, the pte page is not shared.
3316 * called with vma->vm_mm->page_table_lock held.
3318 * returns: 1 successfully unmapped a shared pte page
3319 * 0 the underlying pte page is not shared, or it is the last user
3321 int huge_pmd_unshare(struct mm_struct *mm, unsigned long *addr, pte_t *ptep)
3323 pgd_t *pgd = pgd_offset(mm, *addr);
3324 pud_t *pud = pud_offset(pgd, *addr);
3326 BUG_ON(page_count(virt_to_page(ptep)) == 0);
3327 if (page_count(virt_to_page(ptep)) == 1)
3331 put_page(virt_to_page(ptep));
3332 *addr = ALIGN(*addr, HPAGE_SIZE * PTRS_PER_PTE) - HPAGE_SIZE;
3335 #define want_pmd_share() (1)
3336 #else /* !CONFIG_ARCH_WANT_HUGE_PMD_SHARE */
3337 pte_t *huge_pmd_share(struct mm_struct *mm, unsigned long addr, pud_t *pud)
3341 #define want_pmd_share() (0)
3342 #endif /* CONFIG_ARCH_WANT_HUGE_PMD_SHARE */
3344 #ifdef CONFIG_ARCH_WANT_GENERAL_HUGETLB
3345 pte_t *huge_pte_alloc(struct mm_struct *mm,
3346 unsigned long addr, unsigned long sz)
3352 pgd = pgd_offset(mm, addr);
3353 pud = pud_alloc(mm, pgd, addr);
3355 if (sz == PUD_SIZE) {
3358 BUG_ON(sz != PMD_SIZE);
3359 if (want_pmd_share() && pud_none(*pud))
3360 pte = huge_pmd_share(mm, addr, pud);
3362 pte = (pte_t *)pmd_alloc(mm, pud, addr);
3365 BUG_ON(pte && !pte_none(*pte) && !pte_huge(*pte));
3370 pte_t *huge_pte_offset(struct mm_struct *mm, unsigned long addr)
3376 pgd = pgd_offset(mm, addr);
3377 if (pgd_present(*pgd)) {
3378 pud = pud_offset(pgd, addr);
3379 if (pud_present(*pud)) {
3381 return (pte_t *)pud;
3382 pmd = pmd_offset(pud, addr);
3385 return (pte_t *) pmd;
3389 follow_huge_pmd(struct mm_struct *mm, unsigned long address,
3390 pmd_t *pmd, int write)
3394 page = pte_page(*(pte_t *)pmd);
3396 page += ((address & ~PMD_MASK) >> PAGE_SHIFT);
3401 follow_huge_pud(struct mm_struct *mm, unsigned long address,
3402 pud_t *pud, int write)
3406 page = pte_page(*(pte_t *)pud);
3408 page += ((address & ~PUD_MASK) >> PAGE_SHIFT);
3412 #else /* !CONFIG_ARCH_WANT_GENERAL_HUGETLB */
3414 /* Can be overriden by architectures */
3415 __attribute__((weak)) struct page *
3416 follow_huge_pud(struct mm_struct *mm, unsigned long address,
3417 pud_t *pud, int write)
3423 #endif /* CONFIG_ARCH_WANT_GENERAL_HUGETLB */
3425 #ifdef CONFIG_MEMORY_FAILURE
3427 /* Should be called in hugetlb_lock */
3428 static int is_hugepage_on_freelist(struct page *hpage)
3432 struct hstate *h = page_hstate(hpage);
3433 int nid = page_to_nid(hpage);
3435 list_for_each_entry_safe(page, tmp, &h->hugepage_freelists[nid], lru)
3442 * This function is called from memory failure code.
3443 * Assume the caller holds page lock of the head page.
3445 int dequeue_hwpoisoned_huge_page(struct page *hpage)
3447 struct hstate *h = page_hstate(hpage);
3448 int nid = page_to_nid(hpage);
3451 spin_lock(&hugetlb_lock);
3452 if (is_hugepage_on_freelist(hpage)) {
3454 * Hwpoisoned hugepage isn't linked to activelist or freelist,
3455 * but dangling hpage->lru can trigger list-debug warnings
3456 * (this happens when we call unpoison_memory() on it),
3457 * so let it point to itself with list_del_init().
3459 list_del_init(&hpage->lru);
3460 set_page_refcounted(hpage);
3461 h->free_huge_pages--;
3462 h->free_huge_pages_node[nid]--;
3465 spin_unlock(&hugetlb_lock);