1 // SPDX-License-Identifier: GPL-2.0-only
3 * Generic hugetlb support.
4 * (C) Nadia Yvette Chambers, April 2004
6 #include <linux/list.h>
7 #include <linux/init.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/compiler.h>
17 #include <linux/cpuset.h>
18 #include <linux/mutex.h>
19 #include <linux/memblock.h>
20 #include <linux/sysfs.h>
21 #include <linux/slab.h>
22 #include <linux/mmdebug.h>
23 #include <linux/sched/signal.h>
24 #include <linux/rmap.h>
25 #include <linux/string_helpers.h>
26 #include <linux/swap.h>
27 #include <linux/swapops.h>
28 #include <linux/jhash.h>
29 #include <linux/numa.h>
32 #include <asm/pgtable.h>
36 #include <linux/hugetlb.h>
37 #include <linux/hugetlb_cgroup.h>
38 #include <linux/node.h>
39 #include <linux/userfaultfd_k.h>
40 #include <linux/page_owner.h>
43 int hugetlb_max_hstate __read_mostly;
44 unsigned int default_hstate_idx;
45 struct hstate hstates[HUGE_MAX_HSTATE];
47 * Minimum page order among possible hugepage sizes, set to a proper value
50 static unsigned int minimum_order __read_mostly = UINT_MAX;
52 __initdata LIST_HEAD(huge_boot_pages);
54 /* for command line parsing */
55 static struct hstate * __initdata parsed_hstate;
56 static unsigned long __initdata default_hstate_max_huge_pages;
57 static unsigned long __initdata default_hstate_size;
58 static bool __initdata parsed_valid_hugepagesz = true;
61 * Protects updates to hugepage_freelists, hugepage_activelist, nr_huge_pages,
62 * free_huge_pages, and surplus_huge_pages.
64 DEFINE_SPINLOCK(hugetlb_lock);
67 * Serializes faults on the same logical page. This is used to
68 * prevent spurious OOMs when the hugepage pool is fully utilized.
70 static int num_fault_mutexes;
71 struct mutex *hugetlb_fault_mutex_table ____cacheline_aligned_in_smp;
73 /* Forward declaration */
74 static int hugetlb_acct_memory(struct hstate *h, long delta);
76 static inline void unlock_or_release_subpool(struct hugepage_subpool *spool)
78 bool free = (spool->count == 0) && (spool->used_hpages == 0);
80 spin_unlock(&spool->lock);
82 /* If no pages are used, and no other handles to the subpool
83 * remain, give up any reservations mased on minimum size and
86 if (spool->min_hpages != -1)
87 hugetlb_acct_memory(spool->hstate,
93 struct hugepage_subpool *hugepage_new_subpool(struct hstate *h, long max_hpages,
96 struct hugepage_subpool *spool;
98 spool = kzalloc(sizeof(*spool), GFP_KERNEL);
102 spin_lock_init(&spool->lock);
104 spool->max_hpages = max_hpages;
106 spool->min_hpages = min_hpages;
108 if (min_hpages != -1 && hugetlb_acct_memory(h, min_hpages)) {
112 spool->rsv_hpages = min_hpages;
117 void hugepage_put_subpool(struct hugepage_subpool *spool)
119 spin_lock(&spool->lock);
120 BUG_ON(!spool->count);
122 unlock_or_release_subpool(spool);
126 * Subpool accounting for allocating and reserving pages.
127 * Return -ENOMEM if there are not enough resources to satisfy the
128 * the request. Otherwise, return the number of pages by which the
129 * global pools must be adjusted (upward). The returned value may
130 * only be different than the passed value (delta) in the case where
131 * a subpool minimum size must be manitained.
133 static long hugepage_subpool_get_pages(struct hugepage_subpool *spool,
141 spin_lock(&spool->lock);
143 if (spool->max_hpages != -1) { /* maximum size accounting */
144 if ((spool->used_hpages + delta) <= spool->max_hpages)
145 spool->used_hpages += delta;
152 /* minimum size accounting */
153 if (spool->min_hpages != -1 && spool->rsv_hpages) {
154 if (delta > spool->rsv_hpages) {
156 * Asking for more reserves than those already taken on
157 * behalf of subpool. Return difference.
159 ret = delta - spool->rsv_hpages;
160 spool->rsv_hpages = 0;
162 ret = 0; /* reserves already accounted for */
163 spool->rsv_hpages -= delta;
168 spin_unlock(&spool->lock);
173 * Subpool accounting for freeing and unreserving pages.
174 * Return the number of global page reservations that must be dropped.
175 * The return value may only be different than the passed value (delta)
176 * in the case where a subpool minimum size must be maintained.
178 static long hugepage_subpool_put_pages(struct hugepage_subpool *spool,
186 spin_lock(&spool->lock);
188 if (spool->max_hpages != -1) /* maximum size accounting */
189 spool->used_hpages -= delta;
191 /* minimum size accounting */
192 if (spool->min_hpages != -1 && spool->used_hpages < spool->min_hpages) {
193 if (spool->rsv_hpages + delta <= spool->min_hpages)
196 ret = spool->rsv_hpages + delta - spool->min_hpages;
198 spool->rsv_hpages += delta;
199 if (spool->rsv_hpages > spool->min_hpages)
200 spool->rsv_hpages = spool->min_hpages;
204 * If hugetlbfs_put_super couldn't free spool due to an outstanding
205 * quota reference, free it now.
207 unlock_or_release_subpool(spool);
212 static inline struct hugepage_subpool *subpool_inode(struct inode *inode)
214 return HUGETLBFS_SB(inode->i_sb)->spool;
217 static inline struct hugepage_subpool *subpool_vma(struct vm_area_struct *vma)
219 return subpool_inode(file_inode(vma->vm_file));
223 * Region tracking -- allows tracking of reservations and instantiated pages
224 * across the pages in a mapping.
226 * The region data structures are embedded into a resv_map and protected
227 * by a resv_map's lock. The set of regions within the resv_map represent
228 * reservations for huge pages, or huge pages that have already been
229 * instantiated within the map. The from and to elements are huge page
230 * indicies into the associated mapping. from indicates the starting index
231 * of the region. to represents the first index past the end of the region.
233 * For example, a file region structure with from == 0 and to == 4 represents
234 * four huge pages in a mapping. It is important to note that the to element
235 * represents the first element past the end of the region. This is used in
236 * arithmetic as 4(to) - 0(from) = 4 huge pages in the region.
238 * Interval notation of the form [from, to) will be used to indicate that
239 * the endpoint from is inclusive and to is exclusive.
242 struct list_head link;
248 * Add the huge page range represented by [f, t) to the reserve
249 * map. In the normal case, existing regions will be expanded
250 * to accommodate the specified range. Sufficient regions should
251 * exist for expansion due to the previous call to region_chg
252 * with the same range. However, it is possible that region_del
253 * could have been called after region_chg and modifed the map
254 * in such a way that no region exists to be expanded. In this
255 * case, pull a region descriptor from the cache associated with
256 * the map and use that for the new range.
258 * Return the number of new huge pages added to the map. This
259 * number is greater than or equal to zero.
261 static long region_add(struct resv_map *resv, long f, long t)
263 struct list_head *head = &resv->regions;
264 struct file_region *rg, *nrg, *trg;
267 spin_lock(&resv->lock);
268 /* Locate the region we are either in or before. */
269 list_for_each_entry(rg, head, link)
274 * If no region exists which can be expanded to include the
275 * specified range, the list must have been modified by an
276 * interleving call to region_del(). Pull a region descriptor
277 * from the cache and use it for this range.
279 if (&rg->link == head || t < rg->from) {
280 VM_BUG_ON(resv->region_cache_count <= 0);
282 resv->region_cache_count--;
283 nrg = list_first_entry(&resv->region_cache, struct file_region,
285 list_del(&nrg->link);
289 list_add(&nrg->link, rg->link.prev);
295 /* Round our left edge to the current segment if it encloses us. */
299 /* Check for and consume any regions we now overlap with. */
301 list_for_each_entry_safe(rg, trg, rg->link.prev, link) {
302 if (&rg->link == head)
307 /* If this area reaches higher then extend our area to
308 * include it completely. If this is not the first area
309 * which we intend to reuse, free it. */
313 /* Decrement return value by the deleted range.
314 * Another range will span this area so that by
315 * end of routine add will be >= zero
317 add -= (rg->to - rg->from);
323 add += (nrg->from - f); /* Added to beginning of region */
325 add += t - nrg->to; /* Added to end of region */
329 resv->adds_in_progress--;
330 spin_unlock(&resv->lock);
336 * Examine the existing reserve map and determine how many
337 * huge pages in the specified range [f, t) are NOT currently
338 * represented. This routine is called before a subsequent
339 * call to region_add that will actually modify the reserve
340 * map to add the specified range [f, t). region_chg does
341 * not change the number of huge pages represented by the
342 * map. However, if the existing regions in the map can not
343 * be expanded to represent the new range, a new file_region
344 * structure is added to the map as a placeholder. This is
345 * so that the subsequent region_add call will have all the
346 * regions it needs and will not fail.
348 * Upon entry, region_chg will also examine the cache of region descriptors
349 * associated with the map. If there are not enough descriptors cached, one
350 * will be allocated for the in progress add operation.
352 * Returns the number of huge pages that need to be added to the existing
353 * reservation map for the range [f, t). This number is greater or equal to
354 * zero. -ENOMEM is returned if a new file_region structure or cache entry
355 * is needed and can not be allocated.
357 static long region_chg(struct resv_map *resv, long f, long t)
359 struct list_head *head = &resv->regions;
360 struct file_region *rg, *nrg = NULL;
364 spin_lock(&resv->lock);
366 resv->adds_in_progress++;
369 * Check for sufficient descriptors in the cache to accommodate
370 * the number of in progress add operations.
372 if (resv->adds_in_progress > resv->region_cache_count) {
373 struct file_region *trg;
375 VM_BUG_ON(resv->adds_in_progress - resv->region_cache_count > 1);
376 /* Must drop lock to allocate a new descriptor. */
377 resv->adds_in_progress--;
378 spin_unlock(&resv->lock);
380 trg = kmalloc(sizeof(*trg), GFP_KERNEL);
386 spin_lock(&resv->lock);
387 list_add(&trg->link, &resv->region_cache);
388 resv->region_cache_count++;
392 /* Locate the region we are before or in. */
393 list_for_each_entry(rg, head, link)
397 /* If we are below the current region then a new region is required.
398 * Subtle, allocate a new region at the position but make it zero
399 * size such that we can guarantee to record the reservation. */
400 if (&rg->link == head || t < rg->from) {
402 resv->adds_in_progress--;
403 spin_unlock(&resv->lock);
404 nrg = kmalloc(sizeof(*nrg), GFP_KERNEL);
410 INIT_LIST_HEAD(&nrg->link);
414 list_add(&nrg->link, rg->link.prev);
419 /* Round our left edge to the current segment if it encloses us. */
424 /* Check for and consume any regions we now overlap with. */
425 list_for_each_entry(rg, rg->link.prev, link) {
426 if (&rg->link == head)
431 /* We overlap with this area, if it extends further than
432 * us then we must extend ourselves. Account for its
433 * existing reservation. */
438 chg -= rg->to - rg->from;
442 spin_unlock(&resv->lock);
443 /* We already know we raced and no longer need the new region */
447 spin_unlock(&resv->lock);
452 * Abort the in progress add operation. The adds_in_progress field
453 * of the resv_map keeps track of the operations in progress between
454 * calls to region_chg and region_add. Operations are sometimes
455 * aborted after the call to region_chg. In such cases, region_abort
456 * is called to decrement the adds_in_progress counter.
458 * NOTE: The range arguments [f, t) are not needed or used in this
459 * routine. They are kept to make reading the calling code easier as
460 * arguments will match the associated region_chg call.
462 static void region_abort(struct resv_map *resv, long f, long t)
464 spin_lock(&resv->lock);
465 VM_BUG_ON(!resv->region_cache_count);
466 resv->adds_in_progress--;
467 spin_unlock(&resv->lock);
471 * Delete the specified range [f, t) from the reserve map. If the
472 * t parameter is LONG_MAX, this indicates that ALL regions after f
473 * should be deleted. Locate the regions which intersect [f, t)
474 * and either trim, delete or split the existing regions.
476 * Returns the number of huge pages deleted from the reserve map.
477 * In the normal case, the return value is zero or more. In the
478 * case where a region must be split, a new region descriptor must
479 * be allocated. If the allocation fails, -ENOMEM will be returned.
480 * NOTE: If the parameter t == LONG_MAX, then we will never split
481 * a region and possibly return -ENOMEM. Callers specifying
482 * t == LONG_MAX do not need to check for -ENOMEM error.
484 static long region_del(struct resv_map *resv, long f, long t)
486 struct list_head *head = &resv->regions;
487 struct file_region *rg, *trg;
488 struct file_region *nrg = NULL;
492 spin_lock(&resv->lock);
493 list_for_each_entry_safe(rg, trg, head, link) {
495 * Skip regions before the range to be deleted. file_region
496 * ranges are normally of the form [from, to). However, there
497 * may be a "placeholder" entry in the map which is of the form
498 * (from, to) with from == to. Check for placeholder entries
499 * at the beginning of the range to be deleted.
501 if (rg->to <= f && (rg->to != rg->from || rg->to != f))
507 if (f > rg->from && t < rg->to) { /* Must split region */
509 * Check for an entry in the cache before dropping
510 * lock and attempting allocation.
513 resv->region_cache_count > resv->adds_in_progress) {
514 nrg = list_first_entry(&resv->region_cache,
517 list_del(&nrg->link);
518 resv->region_cache_count--;
522 spin_unlock(&resv->lock);
523 nrg = kmalloc(sizeof(*nrg), GFP_KERNEL);
531 /* New entry for end of split region */
534 INIT_LIST_HEAD(&nrg->link);
536 /* Original entry is trimmed */
539 list_add(&nrg->link, &rg->link);
544 if (f <= rg->from && t >= rg->to) { /* Remove entire region */
545 del += rg->to - rg->from;
551 if (f <= rg->from) { /* Trim beginning of region */
554 } else { /* Trim end of region */
560 spin_unlock(&resv->lock);
566 * A rare out of memory error was encountered which prevented removal of
567 * the reserve map region for a page. The huge page itself was free'ed
568 * and removed from the page cache. This routine will adjust the subpool
569 * usage count, and the global reserve count if needed. By incrementing
570 * these counts, the reserve map entry which could not be deleted will
571 * appear as a "reserved" entry instead of simply dangling with incorrect
574 void hugetlb_fix_reserve_counts(struct inode *inode)
576 struct hugepage_subpool *spool = subpool_inode(inode);
579 rsv_adjust = hugepage_subpool_get_pages(spool, 1);
581 struct hstate *h = hstate_inode(inode);
583 hugetlb_acct_memory(h, 1);
588 * Count and return the number of huge pages in the reserve map
589 * that intersect with the range [f, t).
591 static long region_count(struct resv_map *resv, long f, long t)
593 struct list_head *head = &resv->regions;
594 struct file_region *rg;
597 spin_lock(&resv->lock);
598 /* Locate each segment we overlap with, and count that overlap. */
599 list_for_each_entry(rg, head, link) {
608 seg_from = max(rg->from, f);
609 seg_to = min(rg->to, t);
611 chg += seg_to - seg_from;
613 spin_unlock(&resv->lock);
619 * Convert the address within this vma to the page offset within
620 * the mapping, in pagecache page units; huge pages here.
622 static pgoff_t vma_hugecache_offset(struct hstate *h,
623 struct vm_area_struct *vma, unsigned long address)
625 return ((address - vma->vm_start) >> huge_page_shift(h)) +
626 (vma->vm_pgoff >> huge_page_order(h));
629 pgoff_t linear_hugepage_index(struct vm_area_struct *vma,
630 unsigned long address)
632 return vma_hugecache_offset(hstate_vma(vma), vma, address);
634 EXPORT_SYMBOL_GPL(linear_hugepage_index);
637 * Return the size of the pages allocated when backing a VMA. In the majority
638 * cases this will be same size as used by the page table entries.
640 unsigned long vma_kernel_pagesize(struct vm_area_struct *vma)
642 if (vma->vm_ops && vma->vm_ops->pagesize)
643 return vma->vm_ops->pagesize(vma);
646 EXPORT_SYMBOL_GPL(vma_kernel_pagesize);
649 * Return the page size being used by the MMU to back a VMA. In the majority
650 * of cases, the page size used by the kernel matches the MMU size. On
651 * architectures where it differs, an architecture-specific 'strong'
652 * version of this symbol is required.
654 __weak unsigned long vma_mmu_pagesize(struct vm_area_struct *vma)
656 return vma_kernel_pagesize(vma);
660 * Flags for MAP_PRIVATE reservations. These are stored in the bottom
661 * bits of the reservation map pointer, which are always clear due to
664 #define HPAGE_RESV_OWNER (1UL << 0)
665 #define HPAGE_RESV_UNMAPPED (1UL << 1)
666 #define HPAGE_RESV_MASK (HPAGE_RESV_OWNER | HPAGE_RESV_UNMAPPED)
669 * These helpers are used to track how many pages are reserved for
670 * faults in a MAP_PRIVATE mapping. Only the process that called mmap()
671 * is guaranteed to have their future faults succeed.
673 * With the exception of reset_vma_resv_huge_pages() which is called at fork(),
674 * the reserve counters are updated with the hugetlb_lock held. It is safe
675 * to reset the VMA at fork() time as it is not in use yet and there is no
676 * chance of the global counters getting corrupted as a result of the values.
678 * The private mapping reservation is represented in a subtly different
679 * manner to a shared mapping. A shared mapping has a region map associated
680 * with the underlying file, this region map represents the backing file
681 * pages which have ever had a reservation assigned which this persists even
682 * after the page is instantiated. A private mapping has a region map
683 * associated with the original mmap which is attached to all VMAs which
684 * reference it, this region map represents those offsets which have consumed
685 * reservation ie. where pages have been instantiated.
687 static unsigned long get_vma_private_data(struct vm_area_struct *vma)
689 return (unsigned long)vma->vm_private_data;
692 static void set_vma_private_data(struct vm_area_struct *vma,
695 vma->vm_private_data = (void *)value;
698 struct resv_map *resv_map_alloc(void)
700 struct resv_map *resv_map = kmalloc(sizeof(*resv_map), GFP_KERNEL);
701 struct file_region *rg = kmalloc(sizeof(*rg), GFP_KERNEL);
703 if (!resv_map || !rg) {
709 kref_init(&resv_map->refs);
710 spin_lock_init(&resv_map->lock);
711 INIT_LIST_HEAD(&resv_map->regions);
713 resv_map->adds_in_progress = 0;
715 INIT_LIST_HEAD(&resv_map->region_cache);
716 list_add(&rg->link, &resv_map->region_cache);
717 resv_map->region_cache_count = 1;
722 void resv_map_release(struct kref *ref)
724 struct resv_map *resv_map = container_of(ref, struct resv_map, refs);
725 struct list_head *head = &resv_map->region_cache;
726 struct file_region *rg, *trg;
728 /* Clear out any active regions before we release the map. */
729 region_del(resv_map, 0, LONG_MAX);
731 /* ... and any entries left in the cache */
732 list_for_each_entry_safe(rg, trg, head, link) {
737 VM_BUG_ON(resv_map->adds_in_progress);
742 static inline struct resv_map *inode_resv_map(struct inode *inode)
745 * At inode evict time, i_mapping may not point to the original
746 * address space within the inode. This original address space
747 * contains the pointer to the resv_map. So, always use the
748 * address space embedded within the inode.
749 * The VERY common case is inode->mapping == &inode->i_data but,
750 * this may not be true for device special inodes.
752 return (struct resv_map *)(&inode->i_data)->private_data;
755 static struct resv_map *vma_resv_map(struct vm_area_struct *vma)
757 VM_BUG_ON_VMA(!is_vm_hugetlb_page(vma), vma);
758 if (vma->vm_flags & VM_MAYSHARE) {
759 struct address_space *mapping = vma->vm_file->f_mapping;
760 struct inode *inode = mapping->host;
762 return inode_resv_map(inode);
765 return (struct resv_map *)(get_vma_private_data(vma) &
770 static void set_vma_resv_map(struct vm_area_struct *vma, struct resv_map *map)
772 VM_BUG_ON_VMA(!is_vm_hugetlb_page(vma), vma);
773 VM_BUG_ON_VMA(vma->vm_flags & VM_MAYSHARE, vma);
775 set_vma_private_data(vma, (get_vma_private_data(vma) &
776 HPAGE_RESV_MASK) | (unsigned long)map);
779 static void set_vma_resv_flags(struct vm_area_struct *vma, unsigned long flags)
781 VM_BUG_ON_VMA(!is_vm_hugetlb_page(vma), vma);
782 VM_BUG_ON_VMA(vma->vm_flags & VM_MAYSHARE, vma);
784 set_vma_private_data(vma, get_vma_private_data(vma) | flags);
787 static int is_vma_resv_set(struct vm_area_struct *vma, unsigned long flag)
789 VM_BUG_ON_VMA(!is_vm_hugetlb_page(vma), vma);
791 return (get_vma_private_data(vma) & flag) != 0;
794 /* Reset counters to 0 and clear all HPAGE_RESV_* flags */
795 void reset_vma_resv_huge_pages(struct vm_area_struct *vma)
797 VM_BUG_ON_VMA(!is_vm_hugetlb_page(vma), vma);
798 if (!(vma->vm_flags & VM_MAYSHARE))
799 vma->vm_private_data = (void *)0;
802 /* Returns true if the VMA has associated reserve pages */
803 static bool vma_has_reserves(struct vm_area_struct *vma, long chg)
805 if (vma->vm_flags & VM_NORESERVE) {
807 * This address is already reserved by other process(chg == 0),
808 * so, we should decrement reserved count. Without decrementing,
809 * reserve count remains after releasing inode, because this
810 * allocated page will go into page cache and is regarded as
811 * coming from reserved pool in releasing step. Currently, we
812 * don't have any other solution to deal with this situation
813 * properly, so add work-around here.
815 if (vma->vm_flags & VM_MAYSHARE && chg == 0)
821 /* Shared mappings always use reserves */
822 if (vma->vm_flags & VM_MAYSHARE) {
824 * We know VM_NORESERVE is not set. Therefore, there SHOULD
825 * be a region map for all pages. The only situation where
826 * there is no region map is if a hole was punched via
827 * fallocate. In this case, there really are no reverves to
828 * use. This situation is indicated if chg != 0.
837 * Only the process that called mmap() has reserves for
840 if (is_vma_resv_set(vma, HPAGE_RESV_OWNER)) {
842 * Like the shared case above, a hole punch or truncate
843 * could have been performed on the private mapping.
844 * Examine the value of chg to determine if reserves
845 * actually exist or were previously consumed.
846 * Very Subtle - The value of chg comes from a previous
847 * call to vma_needs_reserves(). The reserve map for
848 * private mappings has different (opposite) semantics
849 * than that of shared mappings. vma_needs_reserves()
850 * has already taken this difference in semantics into
851 * account. Therefore, the meaning of chg is the same
852 * as in the shared case above. Code could easily be
853 * combined, but keeping it separate draws attention to
854 * subtle differences.
865 static void enqueue_huge_page(struct hstate *h, struct page *page)
867 int nid = page_to_nid(page);
868 list_move(&page->lru, &h->hugepage_freelists[nid]);
869 h->free_huge_pages++;
870 h->free_huge_pages_node[nid]++;
873 static struct page *dequeue_huge_page_node_exact(struct hstate *h, int nid)
877 list_for_each_entry(page, &h->hugepage_freelists[nid], lru)
878 if (!PageHWPoison(page))
881 * if 'non-isolated free hugepage' not found on the list,
882 * the allocation fails.
884 if (&h->hugepage_freelists[nid] == &page->lru)
886 list_move(&page->lru, &h->hugepage_activelist);
887 set_page_refcounted(page);
888 h->free_huge_pages--;
889 h->free_huge_pages_node[nid]--;
893 static struct page *dequeue_huge_page_nodemask(struct hstate *h, gfp_t gfp_mask, int nid,
896 unsigned int cpuset_mems_cookie;
897 struct zonelist *zonelist;
900 int node = NUMA_NO_NODE;
902 zonelist = node_zonelist(nid, gfp_mask);
905 cpuset_mems_cookie = read_mems_allowed_begin();
906 for_each_zone_zonelist_nodemask(zone, z, zonelist, gfp_zone(gfp_mask), nmask) {
909 if (!cpuset_zone_allowed(zone, gfp_mask))
912 * no need to ask again on the same node. Pool is node rather than
915 if (zone_to_nid(zone) == node)
917 node = zone_to_nid(zone);
919 page = dequeue_huge_page_node_exact(h, node);
923 if (unlikely(read_mems_allowed_retry(cpuset_mems_cookie)))
929 /* Movability of hugepages depends on migration support. */
930 static inline gfp_t htlb_alloc_mask(struct hstate *h)
932 if (hugepage_movable_supported(h))
933 return GFP_HIGHUSER_MOVABLE;
938 static struct page *dequeue_huge_page_vma(struct hstate *h,
939 struct vm_area_struct *vma,
940 unsigned long address, int avoid_reserve,
944 struct mempolicy *mpol;
946 nodemask_t *nodemask;
950 * A child process with MAP_PRIVATE mappings created by their parent
951 * have no page reserves. This check ensures that reservations are
952 * not "stolen". The child may still get SIGKILLed
954 if (!vma_has_reserves(vma, chg) &&
955 h->free_huge_pages - h->resv_huge_pages == 0)
958 /* If reserves cannot be used, ensure enough pages are in the pool */
959 if (avoid_reserve && h->free_huge_pages - h->resv_huge_pages == 0)
962 gfp_mask = htlb_alloc_mask(h);
963 nid = huge_node(vma, address, gfp_mask, &mpol, &nodemask);
964 page = dequeue_huge_page_nodemask(h, gfp_mask, nid, nodemask);
965 if (page && !avoid_reserve && vma_has_reserves(vma, chg)) {
966 SetPagePrivate(page);
967 h->resv_huge_pages--;
978 * common helper functions for hstate_next_node_to_{alloc|free}.
979 * We may have allocated or freed a huge page based on a different
980 * nodes_allowed previously, so h->next_node_to_{alloc|free} might
981 * be outside of *nodes_allowed. Ensure that we use an allowed
982 * node for alloc or free.
984 static int next_node_allowed(int nid, nodemask_t *nodes_allowed)
986 nid = next_node_in(nid, *nodes_allowed);
987 VM_BUG_ON(nid >= MAX_NUMNODES);
992 static int get_valid_node_allowed(int nid, nodemask_t *nodes_allowed)
994 if (!node_isset(nid, *nodes_allowed))
995 nid = next_node_allowed(nid, nodes_allowed);
1000 * returns the previously saved node ["this node"] from which to
1001 * allocate a persistent huge page for the pool and advance the
1002 * next node from which to allocate, handling wrap at end of node
1005 static int hstate_next_node_to_alloc(struct hstate *h,
1006 nodemask_t *nodes_allowed)
1010 VM_BUG_ON(!nodes_allowed);
1012 nid = get_valid_node_allowed(h->next_nid_to_alloc, nodes_allowed);
1013 h->next_nid_to_alloc = next_node_allowed(nid, nodes_allowed);
1019 * helper for free_pool_huge_page() - return the previously saved
1020 * node ["this node"] from which to free a huge page. Advance the
1021 * next node id whether or not we find a free huge page to free so
1022 * that the next attempt to free addresses the next node.
1024 static int hstate_next_node_to_free(struct hstate *h, nodemask_t *nodes_allowed)
1028 VM_BUG_ON(!nodes_allowed);
1030 nid = get_valid_node_allowed(h->next_nid_to_free, nodes_allowed);
1031 h->next_nid_to_free = next_node_allowed(nid, nodes_allowed);
1036 #define for_each_node_mask_to_alloc(hs, nr_nodes, node, mask) \
1037 for (nr_nodes = nodes_weight(*mask); \
1039 ((node = hstate_next_node_to_alloc(hs, mask)) || 1); \
1042 #define for_each_node_mask_to_free(hs, nr_nodes, node, mask) \
1043 for (nr_nodes = nodes_weight(*mask); \
1045 ((node = hstate_next_node_to_free(hs, mask)) || 1); \
1048 #ifdef CONFIG_ARCH_HAS_GIGANTIC_PAGE
1049 static void destroy_compound_gigantic_page(struct page *page,
1053 int nr_pages = 1 << order;
1054 struct page *p = page + 1;
1056 atomic_set(compound_mapcount_ptr(page), 0);
1057 for (i = 1; i < nr_pages; i++, p = mem_map_next(p, page, i)) {
1058 clear_compound_head(p);
1059 set_page_refcounted(p);
1062 set_compound_order(page, 0);
1063 __ClearPageHead(page);
1066 static void free_gigantic_page(struct page *page, unsigned int order)
1068 free_contig_range(page_to_pfn(page), 1 << order);
1071 #ifdef CONFIG_CONTIG_ALLOC
1072 static int __alloc_gigantic_page(unsigned long start_pfn,
1073 unsigned long nr_pages, gfp_t gfp_mask)
1075 unsigned long end_pfn = start_pfn + nr_pages;
1076 return alloc_contig_range(start_pfn, end_pfn, MIGRATE_MOVABLE,
1080 static bool pfn_range_valid_gigantic(struct zone *z,
1081 unsigned long start_pfn, unsigned long nr_pages)
1083 unsigned long i, end_pfn = start_pfn + nr_pages;
1086 for (i = start_pfn; i < end_pfn; i++) {
1087 page = pfn_to_online_page(i);
1091 if (page_zone(page) != z)
1094 if (PageReserved(page))
1097 if (page_count(page) > 0)
1107 static bool zone_spans_last_pfn(const struct zone *zone,
1108 unsigned long start_pfn, unsigned long nr_pages)
1110 unsigned long last_pfn = start_pfn + nr_pages - 1;
1111 return zone_spans_pfn(zone, last_pfn);
1114 static struct page *alloc_gigantic_page(struct hstate *h, gfp_t gfp_mask,
1115 int nid, nodemask_t *nodemask)
1117 unsigned int order = huge_page_order(h);
1118 unsigned long nr_pages = 1 << order;
1119 unsigned long ret, pfn, flags;
1120 struct zonelist *zonelist;
1124 zonelist = node_zonelist(nid, gfp_mask);
1125 for_each_zone_zonelist_nodemask(zone, z, zonelist, gfp_zone(gfp_mask), nodemask) {
1126 spin_lock_irqsave(&zone->lock, flags);
1128 pfn = ALIGN(zone->zone_start_pfn, nr_pages);
1129 while (zone_spans_last_pfn(zone, pfn, nr_pages)) {
1130 if (pfn_range_valid_gigantic(zone, pfn, nr_pages)) {
1132 * We release the zone lock here because
1133 * alloc_contig_range() will also lock the zone
1134 * at some point. If there's an allocation
1135 * spinning on this lock, it may win the race
1136 * and cause alloc_contig_range() to fail...
1138 spin_unlock_irqrestore(&zone->lock, flags);
1139 ret = __alloc_gigantic_page(pfn, nr_pages, gfp_mask);
1141 return pfn_to_page(pfn);
1142 spin_lock_irqsave(&zone->lock, flags);
1147 spin_unlock_irqrestore(&zone->lock, flags);
1153 static void prep_new_huge_page(struct hstate *h, struct page *page, int nid);
1154 static void prep_compound_gigantic_page(struct page *page, unsigned int order);
1155 #else /* !CONFIG_CONTIG_ALLOC */
1156 static struct page *alloc_gigantic_page(struct hstate *h, gfp_t gfp_mask,
1157 int nid, nodemask_t *nodemask)
1161 #endif /* CONFIG_CONTIG_ALLOC */
1163 #else /* !CONFIG_ARCH_HAS_GIGANTIC_PAGE */
1164 static struct page *alloc_gigantic_page(struct hstate *h, gfp_t gfp_mask,
1165 int nid, nodemask_t *nodemask)
1169 static inline void free_gigantic_page(struct page *page, unsigned int order) { }
1170 static inline void destroy_compound_gigantic_page(struct page *page,
1171 unsigned int order) { }
1174 static void update_and_free_page(struct hstate *h, struct page *page)
1178 if (hstate_is_gigantic(h) && !gigantic_page_runtime_supported())
1182 h->nr_huge_pages_node[page_to_nid(page)]--;
1183 for (i = 0; i < pages_per_huge_page(h); i++) {
1184 page[i].flags &= ~(1 << PG_locked | 1 << PG_error |
1185 1 << PG_referenced | 1 << PG_dirty |
1186 1 << PG_active | 1 << PG_private |
1189 VM_BUG_ON_PAGE(hugetlb_cgroup_from_page(page), page);
1190 set_compound_page_dtor(page, NULL_COMPOUND_DTOR);
1191 set_page_refcounted(page);
1192 if (hstate_is_gigantic(h)) {
1193 destroy_compound_gigantic_page(page, huge_page_order(h));
1194 free_gigantic_page(page, huge_page_order(h));
1196 __free_pages(page, huge_page_order(h));
1200 struct hstate *size_to_hstate(unsigned long size)
1204 for_each_hstate(h) {
1205 if (huge_page_size(h) == size)
1212 * Test to determine whether the hugepage is "active/in-use" (i.e. being linked
1213 * to hstate->hugepage_activelist.)
1215 * This function can be called for tail pages, but never returns true for them.
1217 bool page_huge_active(struct page *page)
1219 VM_BUG_ON_PAGE(!PageHuge(page), page);
1220 return PageHead(page) && PagePrivate(&page[1]);
1223 /* never called for tail page */
1224 static void set_page_huge_active(struct page *page)
1226 VM_BUG_ON_PAGE(!PageHeadHuge(page), page);
1227 SetPagePrivate(&page[1]);
1230 static void clear_page_huge_active(struct page *page)
1232 VM_BUG_ON_PAGE(!PageHeadHuge(page), page);
1233 ClearPagePrivate(&page[1]);
1237 * Internal hugetlb specific page flag. Do not use outside of the hugetlb
1240 static inline bool PageHugeTemporary(struct page *page)
1242 if (!PageHuge(page))
1245 return (unsigned long)page[2].mapping == -1U;
1248 static inline void SetPageHugeTemporary(struct page *page)
1250 page[2].mapping = (void *)-1U;
1253 static inline void ClearPageHugeTemporary(struct page *page)
1255 page[2].mapping = NULL;
1258 void free_huge_page(struct page *page)
1261 * Can't pass hstate in here because it is called from the
1262 * compound page destructor.
1264 struct hstate *h = page_hstate(page);
1265 int nid = page_to_nid(page);
1266 struct hugepage_subpool *spool =
1267 (struct hugepage_subpool *)page_private(page);
1268 bool restore_reserve;
1270 VM_BUG_ON_PAGE(page_count(page), page);
1271 VM_BUG_ON_PAGE(page_mapcount(page), page);
1273 set_page_private(page, 0);
1274 page->mapping = NULL;
1275 restore_reserve = PagePrivate(page);
1276 ClearPagePrivate(page);
1279 * If PagePrivate() was set on page, page allocation consumed a
1280 * reservation. If the page was associated with a subpool, there
1281 * would have been a page reserved in the subpool before allocation
1282 * via hugepage_subpool_get_pages(). Since we are 'restoring' the
1283 * reservtion, do not call hugepage_subpool_put_pages() as this will
1284 * remove the reserved page from the subpool.
1286 if (!restore_reserve) {
1288 * A return code of zero implies that the subpool will be
1289 * under its minimum size if the reservation is not restored
1290 * after page is free. Therefore, force restore_reserve
1293 if (hugepage_subpool_put_pages(spool, 1) == 0)
1294 restore_reserve = true;
1297 spin_lock(&hugetlb_lock);
1298 clear_page_huge_active(page);
1299 hugetlb_cgroup_uncharge_page(hstate_index(h),
1300 pages_per_huge_page(h), page);
1301 if (restore_reserve)
1302 h->resv_huge_pages++;
1304 if (PageHugeTemporary(page)) {
1305 list_del(&page->lru);
1306 ClearPageHugeTemporary(page);
1307 update_and_free_page(h, page);
1308 } else if (h->surplus_huge_pages_node[nid]) {
1309 /* remove the page from active list */
1310 list_del(&page->lru);
1311 update_and_free_page(h, page);
1312 h->surplus_huge_pages--;
1313 h->surplus_huge_pages_node[nid]--;
1315 arch_clear_hugepage_flags(page);
1316 enqueue_huge_page(h, page);
1318 spin_unlock(&hugetlb_lock);
1321 static void prep_new_huge_page(struct hstate *h, struct page *page, int nid)
1323 INIT_LIST_HEAD(&page->lru);
1324 set_compound_page_dtor(page, HUGETLB_PAGE_DTOR);
1325 spin_lock(&hugetlb_lock);
1326 set_hugetlb_cgroup(page, NULL);
1328 h->nr_huge_pages_node[nid]++;
1329 spin_unlock(&hugetlb_lock);
1332 static void prep_compound_gigantic_page(struct page *page, unsigned int order)
1335 int nr_pages = 1 << order;
1336 struct page *p = page + 1;
1338 /* we rely on prep_new_huge_page to set the destructor */
1339 set_compound_order(page, order);
1340 __ClearPageReserved(page);
1341 __SetPageHead(page);
1342 for (i = 1; i < nr_pages; i++, p = mem_map_next(p, page, i)) {
1344 * For gigantic hugepages allocated through bootmem at
1345 * boot, it's safer to be consistent with the not-gigantic
1346 * hugepages and clear the PG_reserved bit from all tail pages
1347 * too. Otherwse drivers using get_user_pages() to access tail
1348 * pages may get the reference counting wrong if they see
1349 * PG_reserved set on a tail page (despite the head page not
1350 * having PG_reserved set). Enforcing this consistency between
1351 * head and tail pages allows drivers to optimize away a check
1352 * on the head page when they need know if put_page() is needed
1353 * after get_user_pages().
1355 __ClearPageReserved(p);
1356 set_page_count(p, 0);
1357 set_compound_head(p, page);
1359 atomic_set(compound_mapcount_ptr(page), -1);
1363 * PageHuge() only returns true for hugetlbfs pages, but not for normal or
1364 * transparent huge pages. See the PageTransHuge() documentation for more
1367 int PageHuge(struct page *page)
1369 if (!PageCompound(page))
1372 page = compound_head(page);
1373 return page[1].compound_dtor == HUGETLB_PAGE_DTOR;
1375 EXPORT_SYMBOL_GPL(PageHuge);
1378 * PageHeadHuge() only returns true for hugetlbfs head page, but not for
1379 * normal or transparent huge pages.
1381 int PageHeadHuge(struct page *page_head)
1383 if (!PageHead(page_head))
1386 return get_compound_page_dtor(page_head) == free_huge_page;
1389 pgoff_t __basepage_index(struct page *page)
1391 struct page *page_head = compound_head(page);
1392 pgoff_t index = page_index(page_head);
1393 unsigned long compound_idx;
1395 if (!PageHuge(page_head))
1396 return page_index(page);
1398 if (compound_order(page_head) >= MAX_ORDER)
1399 compound_idx = page_to_pfn(page) - page_to_pfn(page_head);
1401 compound_idx = page - page_head;
1403 return (index << compound_order(page_head)) + compound_idx;
1406 static struct page *alloc_buddy_huge_page(struct hstate *h,
1407 gfp_t gfp_mask, int nid, nodemask_t *nmask)
1409 int order = huge_page_order(h);
1412 gfp_mask |= __GFP_COMP|__GFP_RETRY_MAYFAIL|__GFP_NOWARN;
1413 if (nid == NUMA_NO_NODE)
1414 nid = numa_mem_id();
1415 page = __alloc_pages_nodemask(gfp_mask, order, nid, nmask);
1417 __count_vm_event(HTLB_BUDDY_PGALLOC);
1419 __count_vm_event(HTLB_BUDDY_PGALLOC_FAIL);
1425 * Common helper to allocate a fresh hugetlb page. All specific allocators
1426 * should use this function to get new hugetlb pages
1428 static struct page *alloc_fresh_huge_page(struct hstate *h,
1429 gfp_t gfp_mask, int nid, nodemask_t *nmask)
1433 if (hstate_is_gigantic(h))
1434 page = alloc_gigantic_page(h, gfp_mask, nid, nmask);
1436 page = alloc_buddy_huge_page(h, gfp_mask,
1441 if (hstate_is_gigantic(h))
1442 prep_compound_gigantic_page(page, huge_page_order(h));
1443 prep_new_huge_page(h, page, page_to_nid(page));
1449 * Allocates a fresh page to the hugetlb allocator pool in the node interleaved
1452 static int alloc_pool_huge_page(struct hstate *h, nodemask_t *nodes_allowed)
1456 gfp_t gfp_mask = htlb_alloc_mask(h) | __GFP_THISNODE;
1458 for_each_node_mask_to_alloc(h, nr_nodes, node, nodes_allowed) {
1459 page = alloc_fresh_huge_page(h, gfp_mask, node, nodes_allowed);
1467 put_page(page); /* free it into the hugepage allocator */
1473 * Free huge page from pool from next node to free.
1474 * Attempt to keep persistent huge pages more or less
1475 * balanced over allowed nodes.
1476 * Called with hugetlb_lock locked.
1478 static int free_pool_huge_page(struct hstate *h, nodemask_t *nodes_allowed,
1484 for_each_node_mask_to_free(h, nr_nodes, node, nodes_allowed) {
1486 * If we're returning unused surplus pages, only examine
1487 * nodes with surplus pages.
1489 if ((!acct_surplus || h->surplus_huge_pages_node[node]) &&
1490 !list_empty(&h->hugepage_freelists[node])) {
1492 list_entry(h->hugepage_freelists[node].next,
1494 list_del(&page->lru);
1495 h->free_huge_pages--;
1496 h->free_huge_pages_node[node]--;
1498 h->surplus_huge_pages--;
1499 h->surplus_huge_pages_node[node]--;
1501 update_and_free_page(h, page);
1511 * Dissolve a given free hugepage into free buddy pages. This function does
1512 * nothing for in-use hugepages and non-hugepages.
1513 * This function returns values like below:
1515 * -EBUSY: failed to dissolved free hugepages or the hugepage is in-use
1516 * (allocated or reserved.)
1517 * 0: successfully dissolved free hugepages or the page is not a
1518 * hugepage (considered as already dissolved)
1520 int dissolve_free_huge_page(struct page *page)
1524 /* Not to disrupt normal path by vainly holding hugetlb_lock */
1525 if (!PageHuge(page))
1528 spin_lock(&hugetlb_lock);
1529 if (!PageHuge(page)) {
1534 if (!page_count(page)) {
1535 struct page *head = compound_head(page);
1536 struct hstate *h = page_hstate(head);
1537 int nid = page_to_nid(head);
1538 if (h->free_huge_pages - h->resv_huge_pages == 0)
1541 * Move PageHWPoison flag from head page to the raw error page,
1542 * which makes any subpages rather than the error page reusable.
1544 if (PageHWPoison(head) && page != head) {
1545 SetPageHWPoison(page);
1546 ClearPageHWPoison(head);
1548 list_del(&head->lru);
1549 h->free_huge_pages--;
1550 h->free_huge_pages_node[nid]--;
1551 h->max_huge_pages--;
1552 update_and_free_page(h, head);
1556 spin_unlock(&hugetlb_lock);
1561 * Dissolve free hugepages in a given pfn range. Used by memory hotplug to
1562 * make specified memory blocks removable from the system.
1563 * Note that this will dissolve a free gigantic hugepage completely, if any
1564 * part of it lies within the given range.
1565 * Also note that if dissolve_free_huge_page() returns with an error, all
1566 * free hugepages that were dissolved before that error are lost.
1568 int dissolve_free_huge_pages(unsigned long start_pfn, unsigned long end_pfn)
1574 if (!hugepages_supported())
1577 for (pfn = start_pfn; pfn < end_pfn; pfn += 1 << minimum_order) {
1578 page = pfn_to_page(pfn);
1579 rc = dissolve_free_huge_page(page);
1588 * Allocates a fresh surplus page from the page allocator.
1590 static struct page *alloc_surplus_huge_page(struct hstate *h, gfp_t gfp_mask,
1591 int nid, nodemask_t *nmask)
1593 struct page *page = NULL;
1595 if (hstate_is_gigantic(h))
1598 spin_lock(&hugetlb_lock);
1599 if (h->surplus_huge_pages >= h->nr_overcommit_huge_pages)
1601 spin_unlock(&hugetlb_lock);
1603 page = alloc_fresh_huge_page(h, gfp_mask, nid, nmask);
1607 spin_lock(&hugetlb_lock);
1609 * We could have raced with the pool size change.
1610 * Double check that and simply deallocate the new page
1611 * if we would end up overcommiting the surpluses. Abuse
1612 * temporary page to workaround the nasty free_huge_page
1615 if (h->surplus_huge_pages >= h->nr_overcommit_huge_pages) {
1616 SetPageHugeTemporary(page);
1617 spin_unlock(&hugetlb_lock);
1621 h->surplus_huge_pages++;
1622 h->surplus_huge_pages_node[page_to_nid(page)]++;
1626 spin_unlock(&hugetlb_lock);
1631 struct page *alloc_migrate_huge_page(struct hstate *h, gfp_t gfp_mask,
1632 int nid, nodemask_t *nmask)
1636 if (hstate_is_gigantic(h))
1639 page = alloc_fresh_huge_page(h, gfp_mask, nid, nmask);
1644 * We do not account these pages as surplus because they are only
1645 * temporary and will be released properly on the last reference
1647 SetPageHugeTemporary(page);
1653 * Use the VMA's mpolicy to allocate a huge page from the buddy.
1656 struct page *alloc_buddy_huge_page_with_mpol(struct hstate *h,
1657 struct vm_area_struct *vma, unsigned long addr)
1660 struct mempolicy *mpol;
1661 gfp_t gfp_mask = htlb_alloc_mask(h);
1663 nodemask_t *nodemask;
1665 nid = huge_node(vma, addr, gfp_mask, &mpol, &nodemask);
1666 page = alloc_surplus_huge_page(h, gfp_mask, nid, nodemask);
1667 mpol_cond_put(mpol);
1672 /* page migration callback function */
1673 struct page *alloc_huge_page_node(struct hstate *h, int nid)
1675 gfp_t gfp_mask = htlb_alloc_mask(h);
1676 struct page *page = NULL;
1678 if (nid != NUMA_NO_NODE)
1679 gfp_mask |= __GFP_THISNODE;
1681 spin_lock(&hugetlb_lock);
1682 if (h->free_huge_pages - h->resv_huge_pages > 0)
1683 page = dequeue_huge_page_nodemask(h, gfp_mask, nid, NULL);
1684 spin_unlock(&hugetlb_lock);
1687 page = alloc_migrate_huge_page(h, gfp_mask, nid, NULL);
1692 /* page migration callback function */
1693 struct page *alloc_huge_page_nodemask(struct hstate *h, int preferred_nid,
1696 gfp_t gfp_mask = htlb_alloc_mask(h);
1698 spin_lock(&hugetlb_lock);
1699 if (h->free_huge_pages - h->resv_huge_pages > 0) {
1702 page = dequeue_huge_page_nodemask(h, gfp_mask, preferred_nid, nmask);
1704 spin_unlock(&hugetlb_lock);
1708 spin_unlock(&hugetlb_lock);
1710 return alloc_migrate_huge_page(h, gfp_mask, preferred_nid, nmask);
1713 /* mempolicy aware migration callback */
1714 struct page *alloc_huge_page_vma(struct hstate *h, struct vm_area_struct *vma,
1715 unsigned long address)
1717 struct mempolicy *mpol;
1718 nodemask_t *nodemask;
1723 gfp_mask = htlb_alloc_mask(h);
1724 node = huge_node(vma, address, gfp_mask, &mpol, &nodemask);
1725 page = alloc_huge_page_nodemask(h, node, nodemask);
1726 mpol_cond_put(mpol);
1732 * Increase the hugetlb pool such that it can accommodate a reservation
1735 static int gather_surplus_pages(struct hstate *h, int delta)
1737 struct list_head surplus_list;
1738 struct page *page, *tmp;
1740 int needed, allocated;
1741 bool alloc_ok = true;
1743 needed = (h->resv_huge_pages + delta) - h->free_huge_pages;
1745 h->resv_huge_pages += delta;
1750 INIT_LIST_HEAD(&surplus_list);
1754 spin_unlock(&hugetlb_lock);
1755 for (i = 0; i < needed; i++) {
1756 page = alloc_surplus_huge_page(h, htlb_alloc_mask(h),
1757 NUMA_NO_NODE, NULL);
1762 list_add(&page->lru, &surplus_list);
1768 * After retaking hugetlb_lock, we need to recalculate 'needed'
1769 * because either resv_huge_pages or free_huge_pages may have changed.
1771 spin_lock(&hugetlb_lock);
1772 needed = (h->resv_huge_pages + delta) -
1773 (h->free_huge_pages + allocated);
1778 * We were not able to allocate enough pages to
1779 * satisfy the entire reservation so we free what
1780 * we've allocated so far.
1785 * The surplus_list now contains _at_least_ the number of extra pages
1786 * needed to accommodate the reservation. Add the appropriate number
1787 * of pages to the hugetlb pool and free the extras back to the buddy
1788 * allocator. Commit the entire reservation here to prevent another
1789 * process from stealing the pages as they are added to the pool but
1790 * before they are reserved.
1792 needed += allocated;
1793 h->resv_huge_pages += delta;
1796 /* Free the needed pages to the hugetlb pool */
1797 list_for_each_entry_safe(page, tmp, &surplus_list, lru) {
1801 * This page is now managed by the hugetlb allocator and has
1802 * no users -- drop the buddy allocator's reference.
1804 put_page_testzero(page);
1805 VM_BUG_ON_PAGE(page_count(page), page);
1806 enqueue_huge_page(h, page);
1809 spin_unlock(&hugetlb_lock);
1811 /* Free unnecessary surplus pages to the buddy allocator */
1812 list_for_each_entry_safe(page, tmp, &surplus_list, lru)
1814 spin_lock(&hugetlb_lock);
1820 * This routine has two main purposes:
1821 * 1) Decrement the reservation count (resv_huge_pages) by the value passed
1822 * in unused_resv_pages. This corresponds to the prior adjustments made
1823 * to the associated reservation map.
1824 * 2) Free any unused surplus pages that may have been allocated to satisfy
1825 * the reservation. As many as unused_resv_pages may be freed.
1827 * Called with hugetlb_lock held. However, the lock could be dropped (and
1828 * reacquired) during calls to cond_resched_lock. Whenever dropping the lock,
1829 * we must make sure nobody else can claim pages we are in the process of
1830 * freeing. Do this by ensuring resv_huge_page always is greater than the
1831 * number of huge pages we plan to free when dropping the lock.
1833 static void return_unused_surplus_pages(struct hstate *h,
1834 unsigned long unused_resv_pages)
1836 unsigned long nr_pages;
1838 /* Cannot return gigantic pages currently */
1839 if (hstate_is_gigantic(h))
1843 * Part (or even all) of the reservation could have been backed
1844 * by pre-allocated pages. Only free surplus pages.
1846 nr_pages = min(unused_resv_pages, h->surplus_huge_pages);
1849 * We want to release as many surplus pages as possible, spread
1850 * evenly across all nodes with memory. Iterate across these nodes
1851 * until we can no longer free unreserved surplus pages. This occurs
1852 * when the nodes with surplus pages have no free pages.
1853 * free_pool_huge_page() will balance the the freed pages across the
1854 * on-line nodes with memory and will handle the hstate accounting.
1856 * Note that we decrement resv_huge_pages as we free the pages. If
1857 * we drop the lock, resv_huge_pages will still be sufficiently large
1858 * to cover subsequent pages we may free.
1860 while (nr_pages--) {
1861 h->resv_huge_pages--;
1862 unused_resv_pages--;
1863 if (!free_pool_huge_page(h, &node_states[N_MEMORY], 1))
1865 cond_resched_lock(&hugetlb_lock);
1869 /* Fully uncommit the reservation */
1870 h->resv_huge_pages -= unused_resv_pages;
1875 * vma_needs_reservation, vma_commit_reservation and vma_end_reservation
1876 * are used by the huge page allocation routines to manage reservations.
1878 * vma_needs_reservation is called to determine if the huge page at addr
1879 * within the vma has an associated reservation. If a reservation is
1880 * needed, the value 1 is returned. The caller is then responsible for
1881 * managing the global reservation and subpool usage counts. After
1882 * the huge page has been allocated, vma_commit_reservation is called
1883 * to add the page to the reservation map. If the page allocation fails,
1884 * the reservation must be ended instead of committed. vma_end_reservation
1885 * is called in such cases.
1887 * In the normal case, vma_commit_reservation returns the same value
1888 * as the preceding vma_needs_reservation call. The only time this
1889 * is not the case is if a reserve map was changed between calls. It
1890 * is the responsibility of the caller to notice the difference and
1891 * take appropriate action.
1893 * vma_add_reservation is used in error paths where a reservation must
1894 * be restored when a newly allocated huge page must be freed. It is
1895 * to be called after calling vma_needs_reservation to determine if a
1896 * reservation exists.
1898 enum vma_resv_mode {
1904 static long __vma_reservation_common(struct hstate *h,
1905 struct vm_area_struct *vma, unsigned long addr,
1906 enum vma_resv_mode mode)
1908 struct resv_map *resv;
1912 resv = vma_resv_map(vma);
1916 idx = vma_hugecache_offset(h, vma, addr);
1918 case VMA_NEEDS_RESV:
1919 ret = region_chg(resv, idx, idx + 1);
1921 case VMA_COMMIT_RESV:
1922 ret = region_add(resv, idx, idx + 1);
1925 region_abort(resv, idx, idx + 1);
1929 if (vma->vm_flags & VM_MAYSHARE)
1930 ret = region_add(resv, idx, idx + 1);
1932 region_abort(resv, idx, idx + 1);
1933 ret = region_del(resv, idx, idx + 1);
1940 if (vma->vm_flags & VM_MAYSHARE)
1942 else if (is_vma_resv_set(vma, HPAGE_RESV_OWNER) && ret >= 0) {
1944 * In most cases, reserves always exist for private mappings.
1945 * However, a file associated with mapping could have been
1946 * hole punched or truncated after reserves were consumed.
1947 * As subsequent fault on such a range will not use reserves.
1948 * Subtle - The reserve map for private mappings has the
1949 * opposite meaning than that of shared mappings. If NO
1950 * entry is in the reserve map, it means a reservation exists.
1951 * If an entry exists in the reserve map, it means the
1952 * reservation has already been consumed. As a result, the
1953 * return value of this routine is the opposite of the
1954 * value returned from reserve map manipulation routines above.
1962 return ret < 0 ? ret : 0;
1965 static long vma_needs_reservation(struct hstate *h,
1966 struct vm_area_struct *vma, unsigned long addr)
1968 return __vma_reservation_common(h, vma, addr, VMA_NEEDS_RESV);
1971 static long vma_commit_reservation(struct hstate *h,
1972 struct vm_area_struct *vma, unsigned long addr)
1974 return __vma_reservation_common(h, vma, addr, VMA_COMMIT_RESV);
1977 static void vma_end_reservation(struct hstate *h,
1978 struct vm_area_struct *vma, unsigned long addr)
1980 (void)__vma_reservation_common(h, vma, addr, VMA_END_RESV);
1983 static long vma_add_reservation(struct hstate *h,
1984 struct vm_area_struct *vma, unsigned long addr)
1986 return __vma_reservation_common(h, vma, addr, VMA_ADD_RESV);
1990 * This routine is called to restore a reservation on error paths. In the
1991 * specific error paths, a huge page was allocated (via alloc_huge_page)
1992 * and is about to be freed. If a reservation for the page existed,
1993 * alloc_huge_page would have consumed the reservation and set PagePrivate
1994 * in the newly allocated page. When the page is freed via free_huge_page,
1995 * the global reservation count will be incremented if PagePrivate is set.
1996 * However, free_huge_page can not adjust the reserve map. Adjust the
1997 * reserve map here to be consistent with global reserve count adjustments
1998 * to be made by free_huge_page.
2000 static void restore_reserve_on_error(struct hstate *h,
2001 struct vm_area_struct *vma, unsigned long address,
2004 if (unlikely(PagePrivate(page))) {
2005 long rc = vma_needs_reservation(h, vma, address);
2007 if (unlikely(rc < 0)) {
2009 * Rare out of memory condition in reserve map
2010 * manipulation. Clear PagePrivate so that
2011 * global reserve count will not be incremented
2012 * by free_huge_page. This will make it appear
2013 * as though the reservation for this page was
2014 * consumed. This may prevent the task from
2015 * faulting in the page at a later time. This
2016 * is better than inconsistent global huge page
2017 * accounting of reserve counts.
2019 ClearPagePrivate(page);
2021 rc = vma_add_reservation(h, vma, address);
2022 if (unlikely(rc < 0))
2024 * See above comment about rare out of
2027 ClearPagePrivate(page);
2029 vma_end_reservation(h, vma, address);
2033 struct page *alloc_huge_page(struct vm_area_struct *vma,
2034 unsigned long addr, int avoid_reserve)
2036 struct hugepage_subpool *spool = subpool_vma(vma);
2037 struct hstate *h = hstate_vma(vma);
2039 long map_chg, map_commit;
2042 struct hugetlb_cgroup *h_cg;
2044 idx = hstate_index(h);
2046 * Examine the region/reserve map to determine if the process
2047 * has a reservation for the page to be allocated. A return
2048 * code of zero indicates a reservation exists (no change).
2050 map_chg = gbl_chg = vma_needs_reservation(h, vma, addr);
2052 return ERR_PTR(-ENOMEM);
2055 * Processes that did not create the mapping will have no
2056 * reserves as indicated by the region/reserve map. Check
2057 * that the allocation will not exceed the subpool limit.
2058 * Allocations for MAP_NORESERVE mappings also need to be
2059 * checked against any subpool limit.
2061 if (map_chg || avoid_reserve) {
2062 gbl_chg = hugepage_subpool_get_pages(spool, 1);
2064 vma_end_reservation(h, vma, addr);
2065 return ERR_PTR(-ENOSPC);
2069 * Even though there was no reservation in the region/reserve
2070 * map, there could be reservations associated with the
2071 * subpool that can be used. This would be indicated if the
2072 * return value of hugepage_subpool_get_pages() is zero.
2073 * However, if avoid_reserve is specified we still avoid even
2074 * the subpool reservations.
2080 ret = hugetlb_cgroup_charge_cgroup(idx, pages_per_huge_page(h), &h_cg);
2082 goto out_subpool_put;
2084 spin_lock(&hugetlb_lock);
2086 * glb_chg is passed to indicate whether or not a page must be taken
2087 * from the global free pool (global change). gbl_chg == 0 indicates
2088 * a reservation exists for the allocation.
2090 page = dequeue_huge_page_vma(h, vma, addr, avoid_reserve, gbl_chg);
2092 spin_unlock(&hugetlb_lock);
2093 page = alloc_buddy_huge_page_with_mpol(h, vma, addr);
2095 goto out_uncharge_cgroup;
2096 if (!avoid_reserve && vma_has_reserves(vma, gbl_chg)) {
2097 SetPagePrivate(page);
2098 h->resv_huge_pages--;
2100 spin_lock(&hugetlb_lock);
2101 list_move(&page->lru, &h->hugepage_activelist);
2104 hugetlb_cgroup_commit_charge(idx, pages_per_huge_page(h), h_cg, page);
2105 spin_unlock(&hugetlb_lock);
2107 set_page_private(page, (unsigned long)spool);
2109 map_commit = vma_commit_reservation(h, vma, addr);
2110 if (unlikely(map_chg > map_commit)) {
2112 * The page was added to the reservation map between
2113 * vma_needs_reservation and vma_commit_reservation.
2114 * This indicates a race with hugetlb_reserve_pages.
2115 * Adjust for the subpool count incremented above AND
2116 * in hugetlb_reserve_pages for the same page. Also,
2117 * the reservation count added in hugetlb_reserve_pages
2118 * no longer applies.
2122 rsv_adjust = hugepage_subpool_put_pages(spool, 1);
2123 hugetlb_acct_memory(h, -rsv_adjust);
2127 out_uncharge_cgroup:
2128 hugetlb_cgroup_uncharge_cgroup(idx, pages_per_huge_page(h), h_cg);
2130 if (map_chg || avoid_reserve)
2131 hugepage_subpool_put_pages(spool, 1);
2132 vma_end_reservation(h, vma, addr);
2133 return ERR_PTR(-ENOSPC);
2136 int alloc_bootmem_huge_page(struct hstate *h)
2137 __attribute__ ((weak, alias("__alloc_bootmem_huge_page")));
2138 int __alloc_bootmem_huge_page(struct hstate *h)
2140 struct huge_bootmem_page *m;
2143 for_each_node_mask_to_alloc(h, nr_nodes, node, &node_states[N_MEMORY]) {
2146 addr = memblock_alloc_try_nid_raw(
2147 huge_page_size(h), huge_page_size(h),
2148 0, MEMBLOCK_ALLOC_ACCESSIBLE, node);
2151 * Use the beginning of the huge page to store the
2152 * huge_bootmem_page struct (until gather_bootmem
2153 * puts them into the mem_map).
2162 BUG_ON(!IS_ALIGNED(virt_to_phys(m), huge_page_size(h)));
2163 /* Put them into a private list first because mem_map is not up yet */
2164 INIT_LIST_HEAD(&m->list);
2165 list_add(&m->list, &huge_boot_pages);
2170 static void __init prep_compound_huge_page(struct page *page,
2173 if (unlikely(order > (MAX_ORDER - 1)))
2174 prep_compound_gigantic_page(page, order);
2176 prep_compound_page(page, order);
2179 /* Put bootmem huge pages into the standard lists after mem_map is up */
2180 static void __init gather_bootmem_prealloc(void)
2182 struct huge_bootmem_page *m;
2184 list_for_each_entry(m, &huge_boot_pages, list) {
2185 struct page *page = virt_to_page(m);
2186 struct hstate *h = m->hstate;
2188 WARN_ON(page_count(page) != 1);
2189 prep_compound_huge_page(page, h->order);
2190 WARN_ON(PageReserved(page));
2191 prep_new_huge_page(h, page, page_to_nid(page));
2192 put_page(page); /* free it into the hugepage allocator */
2195 * If we had gigantic hugepages allocated at boot time, we need
2196 * to restore the 'stolen' pages to totalram_pages in order to
2197 * fix confusing memory reports from free(1) and another
2198 * side-effects, like CommitLimit going negative.
2200 if (hstate_is_gigantic(h))
2201 adjust_managed_page_count(page, 1 << h->order);
2206 static void __init hugetlb_hstate_alloc_pages(struct hstate *h)
2210 for (i = 0; i < h->max_huge_pages; ++i) {
2211 if (hstate_is_gigantic(h)) {
2212 if (!alloc_bootmem_huge_page(h))
2214 } else if (!alloc_pool_huge_page(h,
2215 &node_states[N_MEMORY]))
2219 if (i < h->max_huge_pages) {
2222 string_get_size(huge_page_size(h), 1, STRING_UNITS_2, buf, 32);
2223 pr_warn("HugeTLB: allocating %lu of page size %s failed. Only allocated %lu hugepages.\n",
2224 h->max_huge_pages, buf, i);
2225 h->max_huge_pages = i;
2229 static void __init hugetlb_init_hstates(void)
2233 for_each_hstate(h) {
2234 if (minimum_order > huge_page_order(h))
2235 minimum_order = huge_page_order(h);
2237 /* oversize hugepages were init'ed in early boot */
2238 if (!hstate_is_gigantic(h))
2239 hugetlb_hstate_alloc_pages(h);
2241 VM_BUG_ON(minimum_order == UINT_MAX);
2244 static void __init report_hugepages(void)
2248 for_each_hstate(h) {
2251 string_get_size(huge_page_size(h), 1, STRING_UNITS_2, buf, 32);
2252 pr_info("HugeTLB registered %s page size, pre-allocated %ld pages\n",
2253 buf, h->free_huge_pages);
2257 #ifdef CONFIG_HIGHMEM
2258 static void try_to_free_low(struct hstate *h, unsigned long count,
2259 nodemask_t *nodes_allowed)
2263 if (hstate_is_gigantic(h))
2266 for_each_node_mask(i, *nodes_allowed) {
2267 struct page *page, *next;
2268 struct list_head *freel = &h->hugepage_freelists[i];
2269 list_for_each_entry_safe(page, next, freel, lru) {
2270 if (count >= h->nr_huge_pages)
2272 if (PageHighMem(page))
2274 list_del(&page->lru);
2275 update_and_free_page(h, page);
2276 h->free_huge_pages--;
2277 h->free_huge_pages_node[page_to_nid(page)]--;
2282 static inline void try_to_free_low(struct hstate *h, unsigned long count,
2283 nodemask_t *nodes_allowed)
2289 * Increment or decrement surplus_huge_pages. Keep node-specific counters
2290 * balanced by operating on them in a round-robin fashion.
2291 * Returns 1 if an adjustment was made.
2293 static int adjust_pool_surplus(struct hstate *h, nodemask_t *nodes_allowed,
2298 VM_BUG_ON(delta != -1 && delta != 1);
2301 for_each_node_mask_to_alloc(h, nr_nodes, node, nodes_allowed) {
2302 if (h->surplus_huge_pages_node[node])
2306 for_each_node_mask_to_free(h, nr_nodes, node, nodes_allowed) {
2307 if (h->surplus_huge_pages_node[node] <
2308 h->nr_huge_pages_node[node])
2315 h->surplus_huge_pages += delta;
2316 h->surplus_huge_pages_node[node] += delta;
2320 #define persistent_huge_pages(h) (h->nr_huge_pages - h->surplus_huge_pages)
2321 static int set_max_huge_pages(struct hstate *h, unsigned long count, int nid,
2322 nodemask_t *nodes_allowed)
2324 unsigned long min_count, ret;
2326 spin_lock(&hugetlb_lock);
2329 * Check for a node specific request.
2330 * Changing node specific huge page count may require a corresponding
2331 * change to the global count. In any case, the passed node mask
2332 * (nodes_allowed) will restrict alloc/free to the specified node.
2334 if (nid != NUMA_NO_NODE) {
2335 unsigned long old_count = count;
2337 count += h->nr_huge_pages - h->nr_huge_pages_node[nid];
2339 * User may have specified a large count value which caused the
2340 * above calculation to overflow. In this case, they wanted
2341 * to allocate as many huge pages as possible. Set count to
2342 * largest possible value to align with their intention.
2344 if (count < old_count)
2349 * Gigantic pages runtime allocation depend on the capability for large
2350 * page range allocation.
2351 * If the system does not provide this feature, return an error when
2352 * the user tries to allocate gigantic pages but let the user free the
2353 * boottime allocated gigantic pages.
2355 if (hstate_is_gigantic(h) && !IS_ENABLED(CONFIG_CONTIG_ALLOC)) {
2356 if (count > persistent_huge_pages(h)) {
2357 spin_unlock(&hugetlb_lock);
2360 /* Fall through to decrease pool */
2364 * Increase the pool size
2365 * First take pages out of surplus state. Then make up the
2366 * remaining difference by allocating fresh huge pages.
2368 * We might race with alloc_surplus_huge_page() here and be unable
2369 * to convert a surplus huge page to a normal huge page. That is
2370 * not critical, though, it just means the overall size of the
2371 * pool might be one hugepage larger than it needs to be, but
2372 * within all the constraints specified by the sysctls.
2374 while (h->surplus_huge_pages && count > persistent_huge_pages(h)) {
2375 if (!adjust_pool_surplus(h, nodes_allowed, -1))
2379 while (count > persistent_huge_pages(h)) {
2381 * If this allocation races such that we no longer need the
2382 * page, free_huge_page will handle it by freeing the page
2383 * and reducing the surplus.
2385 spin_unlock(&hugetlb_lock);
2387 /* yield cpu to avoid soft lockup */
2390 ret = alloc_pool_huge_page(h, nodes_allowed);
2391 spin_lock(&hugetlb_lock);
2395 /* Bail for signals. Probably ctrl-c from user */
2396 if (signal_pending(current))
2401 * Decrease the pool size
2402 * First return free pages to the buddy allocator (being careful
2403 * to keep enough around to satisfy reservations). Then place
2404 * pages into surplus state as needed so the pool will shrink
2405 * to the desired size as pages become free.
2407 * By placing pages into the surplus state independent of the
2408 * overcommit value, we are allowing the surplus pool size to
2409 * exceed overcommit. There are few sane options here. Since
2410 * alloc_surplus_huge_page() is checking the global counter,
2411 * though, we'll note that we're not allowed to exceed surplus
2412 * and won't grow the pool anywhere else. Not until one of the
2413 * sysctls are changed, or the surplus pages go out of use.
2415 min_count = h->resv_huge_pages + h->nr_huge_pages - h->free_huge_pages;
2416 min_count = max(count, min_count);
2417 try_to_free_low(h, min_count, nodes_allowed);
2418 while (min_count < persistent_huge_pages(h)) {
2419 if (!free_pool_huge_page(h, nodes_allowed, 0))
2421 cond_resched_lock(&hugetlb_lock);
2423 while (count < persistent_huge_pages(h)) {
2424 if (!adjust_pool_surplus(h, nodes_allowed, 1))
2428 h->max_huge_pages = persistent_huge_pages(h);
2429 spin_unlock(&hugetlb_lock);
2434 #define HSTATE_ATTR_RO(_name) \
2435 static struct kobj_attribute _name##_attr = __ATTR_RO(_name)
2437 #define HSTATE_ATTR(_name) \
2438 static struct kobj_attribute _name##_attr = \
2439 __ATTR(_name, 0644, _name##_show, _name##_store)
2441 static struct kobject *hugepages_kobj;
2442 static struct kobject *hstate_kobjs[HUGE_MAX_HSTATE];
2444 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp);
2446 static struct hstate *kobj_to_hstate(struct kobject *kobj, int *nidp)
2450 for (i = 0; i < HUGE_MAX_HSTATE; i++)
2451 if (hstate_kobjs[i] == kobj) {
2453 *nidp = NUMA_NO_NODE;
2457 return kobj_to_node_hstate(kobj, nidp);
2460 static ssize_t nr_hugepages_show_common(struct kobject *kobj,
2461 struct kobj_attribute *attr, char *buf)
2464 unsigned long nr_huge_pages;
2467 h = kobj_to_hstate(kobj, &nid);
2468 if (nid == NUMA_NO_NODE)
2469 nr_huge_pages = h->nr_huge_pages;
2471 nr_huge_pages = h->nr_huge_pages_node[nid];
2473 return sprintf(buf, "%lu\n", nr_huge_pages);
2476 static ssize_t __nr_hugepages_store_common(bool obey_mempolicy,
2477 struct hstate *h, int nid,
2478 unsigned long count, size_t len)
2481 nodemask_t nodes_allowed, *n_mask;
2483 if (hstate_is_gigantic(h) && !gigantic_page_runtime_supported())
2486 if (nid == NUMA_NO_NODE) {
2488 * global hstate attribute
2490 if (!(obey_mempolicy &&
2491 init_nodemask_of_mempolicy(&nodes_allowed)))
2492 n_mask = &node_states[N_MEMORY];
2494 n_mask = &nodes_allowed;
2497 * Node specific request. count adjustment happens in
2498 * set_max_huge_pages() after acquiring hugetlb_lock.
2500 init_nodemask_of_node(&nodes_allowed, nid);
2501 n_mask = &nodes_allowed;
2504 err = set_max_huge_pages(h, count, nid, n_mask);
2506 return err ? err : len;
2509 static ssize_t nr_hugepages_store_common(bool obey_mempolicy,
2510 struct kobject *kobj, const char *buf,
2514 unsigned long count;
2518 err = kstrtoul(buf, 10, &count);
2522 h = kobj_to_hstate(kobj, &nid);
2523 return __nr_hugepages_store_common(obey_mempolicy, h, nid, count, len);
2526 static ssize_t nr_hugepages_show(struct kobject *kobj,
2527 struct kobj_attribute *attr, char *buf)
2529 return nr_hugepages_show_common(kobj, attr, buf);
2532 static ssize_t nr_hugepages_store(struct kobject *kobj,
2533 struct kobj_attribute *attr, const char *buf, size_t len)
2535 return nr_hugepages_store_common(false, kobj, buf, len);
2537 HSTATE_ATTR(nr_hugepages);
2542 * hstate attribute for optionally mempolicy-based constraint on persistent
2543 * huge page alloc/free.
2545 static ssize_t nr_hugepages_mempolicy_show(struct kobject *kobj,
2546 struct kobj_attribute *attr, char *buf)
2548 return nr_hugepages_show_common(kobj, attr, buf);
2551 static ssize_t nr_hugepages_mempolicy_store(struct kobject *kobj,
2552 struct kobj_attribute *attr, const char *buf, size_t len)
2554 return nr_hugepages_store_common(true, kobj, buf, len);
2556 HSTATE_ATTR(nr_hugepages_mempolicy);
2560 static ssize_t nr_overcommit_hugepages_show(struct kobject *kobj,
2561 struct kobj_attribute *attr, char *buf)
2563 struct hstate *h = kobj_to_hstate(kobj, NULL);
2564 return sprintf(buf, "%lu\n", h->nr_overcommit_huge_pages);
2567 static ssize_t nr_overcommit_hugepages_store(struct kobject *kobj,
2568 struct kobj_attribute *attr, const char *buf, size_t count)
2571 unsigned long input;
2572 struct hstate *h = kobj_to_hstate(kobj, NULL);
2574 if (hstate_is_gigantic(h))
2577 err = kstrtoul(buf, 10, &input);
2581 spin_lock(&hugetlb_lock);
2582 h->nr_overcommit_huge_pages = input;
2583 spin_unlock(&hugetlb_lock);
2587 HSTATE_ATTR(nr_overcommit_hugepages);
2589 static ssize_t free_hugepages_show(struct kobject *kobj,
2590 struct kobj_attribute *attr, char *buf)
2593 unsigned long free_huge_pages;
2596 h = kobj_to_hstate(kobj, &nid);
2597 if (nid == NUMA_NO_NODE)
2598 free_huge_pages = h->free_huge_pages;
2600 free_huge_pages = h->free_huge_pages_node[nid];
2602 return sprintf(buf, "%lu\n", free_huge_pages);
2604 HSTATE_ATTR_RO(free_hugepages);
2606 static ssize_t resv_hugepages_show(struct kobject *kobj,
2607 struct kobj_attribute *attr, char *buf)
2609 struct hstate *h = kobj_to_hstate(kobj, NULL);
2610 return sprintf(buf, "%lu\n", h->resv_huge_pages);
2612 HSTATE_ATTR_RO(resv_hugepages);
2614 static ssize_t surplus_hugepages_show(struct kobject *kobj,
2615 struct kobj_attribute *attr, char *buf)
2618 unsigned long surplus_huge_pages;
2621 h = kobj_to_hstate(kobj, &nid);
2622 if (nid == NUMA_NO_NODE)
2623 surplus_huge_pages = h->surplus_huge_pages;
2625 surplus_huge_pages = h->surplus_huge_pages_node[nid];
2627 return sprintf(buf, "%lu\n", surplus_huge_pages);
2629 HSTATE_ATTR_RO(surplus_hugepages);
2631 static struct attribute *hstate_attrs[] = {
2632 &nr_hugepages_attr.attr,
2633 &nr_overcommit_hugepages_attr.attr,
2634 &free_hugepages_attr.attr,
2635 &resv_hugepages_attr.attr,
2636 &surplus_hugepages_attr.attr,
2638 &nr_hugepages_mempolicy_attr.attr,
2643 static const struct attribute_group hstate_attr_group = {
2644 .attrs = hstate_attrs,
2647 static int hugetlb_sysfs_add_hstate(struct hstate *h, struct kobject *parent,
2648 struct kobject **hstate_kobjs,
2649 const struct attribute_group *hstate_attr_group)
2652 int hi = hstate_index(h);
2654 hstate_kobjs[hi] = kobject_create_and_add(h->name, parent);
2655 if (!hstate_kobjs[hi])
2658 retval = sysfs_create_group(hstate_kobjs[hi], hstate_attr_group);
2660 kobject_put(hstate_kobjs[hi]);
2665 static void __init hugetlb_sysfs_init(void)
2670 hugepages_kobj = kobject_create_and_add("hugepages", mm_kobj);
2671 if (!hugepages_kobj)
2674 for_each_hstate(h) {
2675 err = hugetlb_sysfs_add_hstate(h, hugepages_kobj,
2676 hstate_kobjs, &hstate_attr_group);
2678 pr_err("Hugetlb: Unable to add hstate %s", h->name);
2685 * node_hstate/s - associate per node hstate attributes, via their kobjects,
2686 * with node devices in node_devices[] using a parallel array. The array
2687 * index of a node device or _hstate == node id.
2688 * This is here to avoid any static dependency of the node device driver, in
2689 * the base kernel, on the hugetlb module.
2691 struct node_hstate {
2692 struct kobject *hugepages_kobj;
2693 struct kobject *hstate_kobjs[HUGE_MAX_HSTATE];
2695 static struct node_hstate node_hstates[MAX_NUMNODES];
2698 * A subset of global hstate attributes for node devices
2700 static struct attribute *per_node_hstate_attrs[] = {
2701 &nr_hugepages_attr.attr,
2702 &free_hugepages_attr.attr,
2703 &surplus_hugepages_attr.attr,
2707 static const struct attribute_group per_node_hstate_attr_group = {
2708 .attrs = per_node_hstate_attrs,
2712 * kobj_to_node_hstate - lookup global hstate for node device hstate attr kobj.
2713 * Returns node id via non-NULL nidp.
2715 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp)
2719 for (nid = 0; nid < nr_node_ids; nid++) {
2720 struct node_hstate *nhs = &node_hstates[nid];
2722 for (i = 0; i < HUGE_MAX_HSTATE; i++)
2723 if (nhs->hstate_kobjs[i] == kobj) {
2735 * Unregister hstate attributes from a single node device.
2736 * No-op if no hstate attributes attached.
2738 static void hugetlb_unregister_node(struct node *node)
2741 struct node_hstate *nhs = &node_hstates[node->dev.id];
2743 if (!nhs->hugepages_kobj)
2744 return; /* no hstate attributes */
2746 for_each_hstate(h) {
2747 int idx = hstate_index(h);
2748 if (nhs->hstate_kobjs[idx]) {
2749 kobject_put(nhs->hstate_kobjs[idx]);
2750 nhs->hstate_kobjs[idx] = NULL;
2754 kobject_put(nhs->hugepages_kobj);
2755 nhs->hugepages_kobj = NULL;
2760 * Register hstate attributes for a single node device.
2761 * No-op if attributes already registered.
2763 static void hugetlb_register_node(struct node *node)
2766 struct node_hstate *nhs = &node_hstates[node->dev.id];
2769 if (nhs->hugepages_kobj)
2770 return; /* already allocated */
2772 nhs->hugepages_kobj = kobject_create_and_add("hugepages",
2774 if (!nhs->hugepages_kobj)
2777 for_each_hstate(h) {
2778 err = hugetlb_sysfs_add_hstate(h, nhs->hugepages_kobj,
2780 &per_node_hstate_attr_group);
2782 pr_err("Hugetlb: Unable to add hstate %s for node %d\n",
2783 h->name, node->dev.id);
2784 hugetlb_unregister_node(node);
2791 * hugetlb init time: register hstate attributes for all registered node
2792 * devices of nodes that have memory. All on-line nodes should have
2793 * registered their associated device by this time.
2795 static void __init hugetlb_register_all_nodes(void)
2799 for_each_node_state(nid, N_MEMORY) {
2800 struct node *node = node_devices[nid];
2801 if (node->dev.id == nid)
2802 hugetlb_register_node(node);
2806 * Let the node device driver know we're here so it can
2807 * [un]register hstate attributes on node hotplug.
2809 register_hugetlbfs_with_node(hugetlb_register_node,
2810 hugetlb_unregister_node);
2812 #else /* !CONFIG_NUMA */
2814 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp)
2822 static void hugetlb_register_all_nodes(void) { }
2826 static int __init hugetlb_init(void)
2830 if (!hugepages_supported())
2833 if (!size_to_hstate(default_hstate_size)) {
2834 if (default_hstate_size != 0) {
2835 pr_err("HugeTLB: unsupported default_hugepagesz %lu. Reverting to %lu\n",
2836 default_hstate_size, HPAGE_SIZE);
2839 default_hstate_size = HPAGE_SIZE;
2840 if (!size_to_hstate(default_hstate_size))
2841 hugetlb_add_hstate(HUGETLB_PAGE_ORDER);
2843 default_hstate_idx = hstate_index(size_to_hstate(default_hstate_size));
2844 if (default_hstate_max_huge_pages) {
2845 if (!default_hstate.max_huge_pages)
2846 default_hstate.max_huge_pages = default_hstate_max_huge_pages;
2849 hugetlb_init_hstates();
2850 gather_bootmem_prealloc();
2853 hugetlb_sysfs_init();
2854 hugetlb_register_all_nodes();
2855 hugetlb_cgroup_file_init();
2858 num_fault_mutexes = roundup_pow_of_two(8 * num_possible_cpus());
2860 num_fault_mutexes = 1;
2862 hugetlb_fault_mutex_table =
2863 kmalloc_array(num_fault_mutexes, sizeof(struct mutex),
2865 BUG_ON(!hugetlb_fault_mutex_table);
2867 for (i = 0; i < num_fault_mutexes; i++)
2868 mutex_init(&hugetlb_fault_mutex_table[i]);
2871 subsys_initcall(hugetlb_init);
2873 /* Should be called on processing a hugepagesz=... option */
2874 void __init hugetlb_bad_size(void)
2876 parsed_valid_hugepagesz = false;
2879 void __init hugetlb_add_hstate(unsigned int order)
2884 if (size_to_hstate(PAGE_SIZE << order)) {
2885 pr_warn("hugepagesz= specified twice, ignoring\n");
2888 BUG_ON(hugetlb_max_hstate >= HUGE_MAX_HSTATE);
2890 h = &hstates[hugetlb_max_hstate++];
2892 h->mask = ~((1ULL << (order + PAGE_SHIFT)) - 1);
2893 h->nr_huge_pages = 0;
2894 h->free_huge_pages = 0;
2895 for (i = 0; i < MAX_NUMNODES; ++i)
2896 INIT_LIST_HEAD(&h->hugepage_freelists[i]);
2897 INIT_LIST_HEAD(&h->hugepage_activelist);
2898 h->next_nid_to_alloc = first_memory_node;
2899 h->next_nid_to_free = first_memory_node;
2900 snprintf(h->name, HSTATE_NAME_LEN, "hugepages-%lukB",
2901 huge_page_size(h)/1024);
2906 static int __init hugetlb_nrpages_setup(char *s)
2909 static unsigned long *last_mhp;
2911 if (!parsed_valid_hugepagesz) {
2912 pr_warn("hugepages = %s preceded by "
2913 "an unsupported hugepagesz, ignoring\n", s);
2914 parsed_valid_hugepagesz = true;
2918 * !hugetlb_max_hstate means we haven't parsed a hugepagesz= parameter yet,
2919 * so this hugepages= parameter goes to the "default hstate".
2921 else if (!hugetlb_max_hstate)
2922 mhp = &default_hstate_max_huge_pages;
2924 mhp = &parsed_hstate->max_huge_pages;
2926 if (mhp == last_mhp) {
2927 pr_warn("hugepages= specified twice without interleaving hugepagesz=, ignoring\n");
2931 if (sscanf(s, "%lu", mhp) <= 0)
2935 * Global state is always initialized later in hugetlb_init.
2936 * But we need to allocate >= MAX_ORDER hstates here early to still
2937 * use the bootmem allocator.
2939 if (hugetlb_max_hstate && parsed_hstate->order >= MAX_ORDER)
2940 hugetlb_hstate_alloc_pages(parsed_hstate);
2946 __setup("hugepages=", hugetlb_nrpages_setup);
2948 static int __init hugetlb_default_setup(char *s)
2950 default_hstate_size = memparse(s, &s);
2953 __setup("default_hugepagesz=", hugetlb_default_setup);
2955 static unsigned int cpuset_mems_nr(unsigned int *array)
2958 unsigned int nr = 0;
2960 for_each_node_mask(node, cpuset_current_mems_allowed)
2966 #ifdef CONFIG_SYSCTL
2967 static int hugetlb_sysctl_handler_common(bool obey_mempolicy,
2968 struct ctl_table *table, int write,
2969 void __user *buffer, size_t *length, loff_t *ppos)
2971 struct hstate *h = &default_hstate;
2972 unsigned long tmp = h->max_huge_pages;
2975 if (!hugepages_supported())
2979 table->maxlen = sizeof(unsigned long);
2980 ret = proc_doulongvec_minmax(table, write, buffer, length, ppos);
2985 ret = __nr_hugepages_store_common(obey_mempolicy, h,
2986 NUMA_NO_NODE, tmp, *length);
2991 int hugetlb_sysctl_handler(struct ctl_table *table, int write,
2992 void __user *buffer, size_t *length, loff_t *ppos)
2995 return hugetlb_sysctl_handler_common(false, table, write,
2996 buffer, length, ppos);
3000 int hugetlb_mempolicy_sysctl_handler(struct ctl_table *table, int write,
3001 void __user *buffer, size_t *length, loff_t *ppos)
3003 return hugetlb_sysctl_handler_common(true, table, write,
3004 buffer, length, ppos);
3006 #endif /* CONFIG_NUMA */
3008 int hugetlb_overcommit_handler(struct ctl_table *table, int write,
3009 void __user *buffer,
3010 size_t *length, loff_t *ppos)
3012 struct hstate *h = &default_hstate;
3016 if (!hugepages_supported())
3019 tmp = h->nr_overcommit_huge_pages;
3021 if (write && hstate_is_gigantic(h))
3025 table->maxlen = sizeof(unsigned long);
3026 ret = proc_doulongvec_minmax(table, write, buffer, length, ppos);
3031 spin_lock(&hugetlb_lock);
3032 h->nr_overcommit_huge_pages = tmp;
3033 spin_unlock(&hugetlb_lock);
3039 #endif /* CONFIG_SYSCTL */
3041 void hugetlb_report_meminfo(struct seq_file *m)
3044 unsigned long total = 0;
3046 if (!hugepages_supported())
3049 for_each_hstate(h) {
3050 unsigned long count = h->nr_huge_pages;
3052 total += (PAGE_SIZE << huge_page_order(h)) * count;
3054 if (h == &default_hstate)
3056 "HugePages_Total: %5lu\n"
3057 "HugePages_Free: %5lu\n"
3058 "HugePages_Rsvd: %5lu\n"
3059 "HugePages_Surp: %5lu\n"
3060 "Hugepagesize: %8lu kB\n",
3064 h->surplus_huge_pages,
3065 (PAGE_SIZE << huge_page_order(h)) / 1024);
3068 seq_printf(m, "Hugetlb: %8lu kB\n", total / 1024);
3071 int hugetlb_report_node_meminfo(int nid, char *buf)
3073 struct hstate *h = &default_hstate;
3074 if (!hugepages_supported())
3077 "Node %d HugePages_Total: %5u\n"
3078 "Node %d HugePages_Free: %5u\n"
3079 "Node %d HugePages_Surp: %5u\n",
3080 nid, h->nr_huge_pages_node[nid],
3081 nid, h->free_huge_pages_node[nid],
3082 nid, h->surplus_huge_pages_node[nid]);
3085 void hugetlb_show_meminfo(void)
3090 if (!hugepages_supported())
3093 for_each_node_state(nid, N_MEMORY)
3095 pr_info("Node %d hugepages_total=%u hugepages_free=%u hugepages_surp=%u hugepages_size=%lukB\n",
3097 h->nr_huge_pages_node[nid],
3098 h->free_huge_pages_node[nid],
3099 h->surplus_huge_pages_node[nid],
3100 1UL << (huge_page_order(h) + PAGE_SHIFT - 10));
3103 void hugetlb_report_usage(struct seq_file *m, struct mm_struct *mm)
3105 seq_printf(m, "HugetlbPages:\t%8lu kB\n",
3106 atomic_long_read(&mm->hugetlb_usage) << (PAGE_SHIFT - 10));
3109 /* Return the number pages of memory we physically have, in PAGE_SIZE units. */
3110 unsigned long hugetlb_total_pages(void)
3113 unsigned long nr_total_pages = 0;
3116 nr_total_pages += h->nr_huge_pages * pages_per_huge_page(h);
3117 return nr_total_pages;
3120 static int hugetlb_acct_memory(struct hstate *h, long delta)
3124 spin_lock(&hugetlb_lock);
3126 * When cpuset is configured, it breaks the strict hugetlb page
3127 * reservation as the accounting is done on a global variable. Such
3128 * reservation is completely rubbish in the presence of cpuset because
3129 * the reservation is not checked against page availability for the
3130 * current cpuset. Application can still potentially OOM'ed by kernel
3131 * with lack of free htlb page in cpuset that the task is in.
3132 * Attempt to enforce strict accounting with cpuset is almost
3133 * impossible (or too ugly) because cpuset is too fluid that
3134 * task or memory node can be dynamically moved between cpusets.
3136 * The change of semantics for shared hugetlb mapping with cpuset is
3137 * undesirable. However, in order to preserve some of the semantics,
3138 * we fall back to check against current free page availability as
3139 * a best attempt and hopefully to minimize the impact of changing
3140 * semantics that cpuset has.
3143 if (gather_surplus_pages(h, delta) < 0)
3146 if (delta > cpuset_mems_nr(h->free_huge_pages_node)) {
3147 return_unused_surplus_pages(h, delta);
3154 return_unused_surplus_pages(h, (unsigned long) -delta);
3157 spin_unlock(&hugetlb_lock);
3161 static void hugetlb_vm_op_open(struct vm_area_struct *vma)
3163 struct resv_map *resv = vma_resv_map(vma);
3166 * This new VMA should share its siblings reservation map if present.
3167 * The VMA will only ever have a valid reservation map pointer where
3168 * it is being copied for another still existing VMA. As that VMA
3169 * has a reference to the reservation map it cannot disappear until
3170 * after this open call completes. It is therefore safe to take a
3171 * new reference here without additional locking.
3173 if (resv && is_vma_resv_set(vma, HPAGE_RESV_OWNER))
3174 kref_get(&resv->refs);
3177 static void hugetlb_vm_op_close(struct vm_area_struct *vma)
3179 struct hstate *h = hstate_vma(vma);
3180 struct resv_map *resv = vma_resv_map(vma);
3181 struct hugepage_subpool *spool = subpool_vma(vma);
3182 unsigned long reserve, start, end;
3185 if (!resv || !is_vma_resv_set(vma, HPAGE_RESV_OWNER))
3188 start = vma_hugecache_offset(h, vma, vma->vm_start);
3189 end = vma_hugecache_offset(h, vma, vma->vm_end);
3191 reserve = (end - start) - region_count(resv, start, end);
3193 kref_put(&resv->refs, resv_map_release);
3197 * Decrement reserve counts. The global reserve count may be
3198 * adjusted if the subpool has a minimum size.
3200 gbl_reserve = hugepage_subpool_put_pages(spool, reserve);
3201 hugetlb_acct_memory(h, -gbl_reserve);
3205 static int hugetlb_vm_op_split(struct vm_area_struct *vma, unsigned long addr)
3207 if (addr & ~(huge_page_mask(hstate_vma(vma))))
3212 static unsigned long hugetlb_vm_op_pagesize(struct vm_area_struct *vma)
3214 struct hstate *hstate = hstate_vma(vma);
3216 return 1UL << huge_page_shift(hstate);
3220 * We cannot handle pagefaults against hugetlb pages at all. They cause
3221 * handle_mm_fault() to try to instantiate regular-sized pages in the
3222 * hugegpage VMA. do_page_fault() is supposed to trap this, so BUG is we get
3225 static vm_fault_t hugetlb_vm_op_fault(struct vm_fault *vmf)
3232 * When a new function is introduced to vm_operations_struct and added
3233 * to hugetlb_vm_ops, please consider adding the function to shm_vm_ops.
3234 * This is because under System V memory model, mappings created via
3235 * shmget/shmat with "huge page" specified are backed by hugetlbfs files,
3236 * their original vm_ops are overwritten with shm_vm_ops.
3238 const struct vm_operations_struct hugetlb_vm_ops = {
3239 .fault = hugetlb_vm_op_fault,
3240 .open = hugetlb_vm_op_open,
3241 .close = hugetlb_vm_op_close,
3242 .split = hugetlb_vm_op_split,
3243 .pagesize = hugetlb_vm_op_pagesize,
3246 static pte_t make_huge_pte(struct vm_area_struct *vma, struct page *page,
3252 entry = huge_pte_mkwrite(huge_pte_mkdirty(mk_huge_pte(page,
3253 vma->vm_page_prot)));
3255 entry = huge_pte_wrprotect(mk_huge_pte(page,
3256 vma->vm_page_prot));
3258 entry = pte_mkyoung(entry);
3259 entry = pte_mkhuge(entry);
3260 entry = arch_make_huge_pte(entry, vma, page, writable);
3265 static void set_huge_ptep_writable(struct vm_area_struct *vma,
3266 unsigned long address, pte_t *ptep)
3270 entry = huge_pte_mkwrite(huge_pte_mkdirty(huge_ptep_get(ptep)));
3271 if (huge_ptep_set_access_flags(vma, address, ptep, entry, 1))
3272 update_mmu_cache(vma, address, ptep);
3275 bool is_hugetlb_entry_migration(pte_t pte)
3279 if (huge_pte_none(pte) || pte_present(pte))
3281 swp = pte_to_swp_entry(pte);
3282 if (non_swap_entry(swp) && is_migration_entry(swp))
3288 static int is_hugetlb_entry_hwpoisoned(pte_t pte)
3292 if (huge_pte_none(pte) || pte_present(pte))
3294 swp = pte_to_swp_entry(pte);
3295 if (non_swap_entry(swp) && is_hwpoison_entry(swp))
3301 int copy_hugetlb_page_range(struct mm_struct *dst, struct mm_struct *src,
3302 struct vm_area_struct *vma)
3304 pte_t *src_pte, *dst_pte, entry, dst_entry;
3305 struct page *ptepage;
3308 struct hstate *h = hstate_vma(vma);
3309 unsigned long sz = huge_page_size(h);
3310 struct mmu_notifier_range range;
3313 cow = (vma->vm_flags & (VM_SHARED | VM_MAYWRITE)) == VM_MAYWRITE;
3316 mmu_notifier_range_init(&range, MMU_NOTIFY_CLEAR, 0, vma, src,
3319 mmu_notifier_invalidate_range_start(&range);
3322 for (addr = vma->vm_start; addr < vma->vm_end; addr += sz) {
3323 spinlock_t *src_ptl, *dst_ptl;
3324 src_pte = huge_pte_offset(src, addr, sz);
3327 dst_pte = huge_pte_alloc(dst, addr, sz);
3334 * If the pagetables are shared don't copy or take references.
3335 * dst_pte == src_pte is the common case of src/dest sharing.
3337 * However, src could have 'unshared' and dst shares with
3338 * another vma. If dst_pte !none, this implies sharing.
3339 * Check here before taking page table lock, and once again
3340 * after taking the lock below.
3342 dst_entry = huge_ptep_get(dst_pte);
3343 if ((dst_pte == src_pte) || !huge_pte_none(dst_entry))
3346 dst_ptl = huge_pte_lock(h, dst, dst_pte);
3347 src_ptl = huge_pte_lockptr(h, src, src_pte);
3348 spin_lock_nested(src_ptl, SINGLE_DEPTH_NESTING);
3349 entry = huge_ptep_get(src_pte);
3350 dst_entry = huge_ptep_get(dst_pte);
3351 if (huge_pte_none(entry) || !huge_pte_none(dst_entry)) {
3353 * Skip if src entry none. Also, skip in the
3354 * unlikely case dst entry !none as this implies
3355 * sharing with another vma.
3358 } else if (unlikely(is_hugetlb_entry_migration(entry) ||
3359 is_hugetlb_entry_hwpoisoned(entry))) {
3360 swp_entry_t swp_entry = pte_to_swp_entry(entry);
3362 if (is_write_migration_entry(swp_entry) && cow) {
3364 * COW mappings require pages in both
3365 * parent and child to be set to read.
3367 make_migration_entry_read(&swp_entry);
3368 entry = swp_entry_to_pte(swp_entry);
3369 set_huge_swap_pte_at(src, addr, src_pte,
3372 set_huge_swap_pte_at(dst, addr, dst_pte, entry, sz);
3376 * No need to notify as we are downgrading page
3377 * table protection not changing it to point
3380 * See Documentation/vm/mmu_notifier.rst
3382 huge_ptep_set_wrprotect(src, addr, src_pte);
3384 entry = huge_ptep_get(src_pte);
3385 ptepage = pte_page(entry);
3387 page_dup_rmap(ptepage, true);
3388 set_huge_pte_at(dst, addr, dst_pte, entry);
3389 hugetlb_count_add(pages_per_huge_page(h), dst);
3391 spin_unlock(src_ptl);
3392 spin_unlock(dst_ptl);
3396 mmu_notifier_invalidate_range_end(&range);
3401 void __unmap_hugepage_range(struct mmu_gather *tlb, struct vm_area_struct *vma,
3402 unsigned long start, unsigned long end,
3403 struct page *ref_page)
3405 struct mm_struct *mm = vma->vm_mm;
3406 unsigned long address;
3411 struct hstate *h = hstate_vma(vma);
3412 unsigned long sz = huge_page_size(h);
3413 struct mmu_notifier_range range;
3415 WARN_ON(!is_vm_hugetlb_page(vma));
3416 BUG_ON(start & ~huge_page_mask(h));
3417 BUG_ON(end & ~huge_page_mask(h));
3420 * This is a hugetlb vma, all the pte entries should point
3423 tlb_change_page_size(tlb, sz);
3424 tlb_start_vma(tlb, vma);
3427 * If sharing possible, alert mmu notifiers of worst case.
3429 mmu_notifier_range_init(&range, MMU_NOTIFY_UNMAP, 0, vma, mm, start,
3431 adjust_range_if_pmd_sharing_possible(vma, &range.start, &range.end);
3432 mmu_notifier_invalidate_range_start(&range);
3434 for (; address < end; address += sz) {
3435 ptep = huge_pte_offset(mm, address, sz);
3439 ptl = huge_pte_lock(h, mm, ptep);
3440 if (huge_pmd_unshare(mm, &address, ptep)) {
3443 * We just unmapped a page of PMDs by clearing a PUD.
3444 * The caller's TLB flush range should cover this area.
3449 pte = huge_ptep_get(ptep);
3450 if (huge_pte_none(pte)) {
3456 * Migrating hugepage or HWPoisoned hugepage is already
3457 * unmapped and its refcount is dropped, so just clear pte here.
3459 if (unlikely(!pte_present(pte))) {
3460 huge_pte_clear(mm, address, ptep, sz);
3465 page = pte_page(pte);
3467 * If a reference page is supplied, it is because a specific
3468 * page is being unmapped, not a range. Ensure the page we
3469 * are about to unmap is the actual page of interest.
3472 if (page != ref_page) {
3477 * Mark the VMA as having unmapped its page so that
3478 * future faults in this VMA will fail rather than
3479 * looking like data was lost
3481 set_vma_resv_flags(vma, HPAGE_RESV_UNMAPPED);
3484 pte = huge_ptep_get_and_clear(mm, address, ptep);
3485 tlb_remove_huge_tlb_entry(h, tlb, ptep, address);
3486 if (huge_pte_dirty(pte))
3487 set_page_dirty(page);
3489 hugetlb_count_sub(pages_per_huge_page(h), mm);
3490 page_remove_rmap(page, true);
3493 tlb_remove_page_size(tlb, page, huge_page_size(h));
3495 * Bail out after unmapping reference page if supplied
3500 mmu_notifier_invalidate_range_end(&range);
3501 tlb_end_vma(tlb, vma);
3504 void __unmap_hugepage_range_final(struct mmu_gather *tlb,
3505 struct vm_area_struct *vma, unsigned long start,
3506 unsigned long end, struct page *ref_page)
3508 __unmap_hugepage_range(tlb, vma, start, end, ref_page);
3511 * Clear this flag so that x86's huge_pmd_share page_table_shareable
3512 * test will fail on a vma being torn down, and not grab a page table
3513 * on its way out. We're lucky that the flag has such an appropriate
3514 * name, and can in fact be safely cleared here. We could clear it
3515 * before the __unmap_hugepage_range above, but all that's necessary
3516 * is to clear it before releasing the i_mmap_rwsem. This works
3517 * because in the context this is called, the VMA is about to be
3518 * destroyed and the i_mmap_rwsem is held.
3520 vma->vm_flags &= ~VM_MAYSHARE;
3523 void unmap_hugepage_range(struct vm_area_struct *vma, unsigned long start,
3524 unsigned long end, struct page *ref_page)
3526 struct mm_struct *mm;
3527 struct mmu_gather tlb;
3528 unsigned long tlb_start = start;
3529 unsigned long tlb_end = end;
3532 * If shared PMDs were possibly used within this vma range, adjust
3533 * start/end for worst case tlb flushing.
3534 * Note that we can not be sure if PMDs are shared until we try to
3535 * unmap pages. However, we want to make sure TLB flushing covers
3536 * the largest possible range.
3538 adjust_range_if_pmd_sharing_possible(vma, &tlb_start, &tlb_end);
3542 tlb_gather_mmu(&tlb, mm, tlb_start, tlb_end);
3543 __unmap_hugepage_range(&tlb, vma, start, end, ref_page);
3544 tlb_finish_mmu(&tlb, tlb_start, tlb_end);
3548 * This is called when the original mapper is failing to COW a MAP_PRIVATE
3549 * mappping it owns the reserve page for. The intention is to unmap the page
3550 * from other VMAs and let the children be SIGKILLed if they are faulting the
3553 static void unmap_ref_private(struct mm_struct *mm, struct vm_area_struct *vma,
3554 struct page *page, unsigned long address)
3556 struct hstate *h = hstate_vma(vma);
3557 struct vm_area_struct *iter_vma;
3558 struct address_space *mapping;
3562 * vm_pgoff is in PAGE_SIZE units, hence the different calculation
3563 * from page cache lookup which is in HPAGE_SIZE units.
3565 address = address & huge_page_mask(h);
3566 pgoff = ((address - vma->vm_start) >> PAGE_SHIFT) +
3568 mapping = vma->vm_file->f_mapping;
3571 * Take the mapping lock for the duration of the table walk. As
3572 * this mapping should be shared between all the VMAs,
3573 * __unmap_hugepage_range() is called as the lock is already held
3575 i_mmap_lock_write(mapping);
3576 vma_interval_tree_foreach(iter_vma, &mapping->i_mmap, pgoff, pgoff) {
3577 /* Do not unmap the current VMA */
3578 if (iter_vma == vma)
3582 * Shared VMAs have their own reserves and do not affect
3583 * MAP_PRIVATE accounting but it is possible that a shared
3584 * VMA is using the same page so check and skip such VMAs.
3586 if (iter_vma->vm_flags & VM_MAYSHARE)
3590 * Unmap the page from other VMAs without their own reserves.
3591 * They get marked to be SIGKILLed if they fault in these
3592 * areas. This is because a future no-page fault on this VMA
3593 * could insert a zeroed page instead of the data existing
3594 * from the time of fork. This would look like data corruption
3596 if (!is_vma_resv_set(iter_vma, HPAGE_RESV_OWNER))
3597 unmap_hugepage_range(iter_vma, address,
3598 address + huge_page_size(h), page);
3600 i_mmap_unlock_write(mapping);
3604 * Hugetlb_cow() should be called with page lock of the original hugepage held.
3605 * Called with hugetlb_instantiation_mutex held and pte_page locked so we
3606 * cannot race with other handlers or page migration.
3607 * Keep the pte_same checks anyway to make transition from the mutex easier.
3609 static vm_fault_t hugetlb_cow(struct mm_struct *mm, struct vm_area_struct *vma,
3610 unsigned long address, pte_t *ptep,
3611 struct page *pagecache_page, spinlock_t *ptl)
3614 struct hstate *h = hstate_vma(vma);
3615 struct page *old_page, *new_page;
3616 int outside_reserve = 0;
3618 unsigned long haddr = address & huge_page_mask(h);
3619 struct mmu_notifier_range range;
3621 pte = huge_ptep_get(ptep);
3622 old_page = pte_page(pte);
3625 /* If no-one else is actually using this page, avoid the copy
3626 * and just make the page writable */
3627 if (page_mapcount(old_page) == 1 && PageAnon(old_page)) {
3628 page_move_anon_rmap(old_page, vma);
3629 set_huge_ptep_writable(vma, haddr, ptep);
3634 * If the process that created a MAP_PRIVATE mapping is about to
3635 * perform a COW due to a shared page count, attempt to satisfy
3636 * the allocation without using the existing reserves. The pagecache
3637 * page is used to determine if the reserve at this address was
3638 * consumed or not. If reserves were used, a partial faulted mapping
3639 * at the time of fork() could consume its reserves on COW instead
3640 * of the full address range.
3642 if (is_vma_resv_set(vma, HPAGE_RESV_OWNER) &&
3643 old_page != pagecache_page)
3644 outside_reserve = 1;
3649 * Drop page table lock as buddy allocator may be called. It will
3650 * be acquired again before returning to the caller, as expected.
3653 new_page = alloc_huge_page(vma, haddr, outside_reserve);
3655 if (IS_ERR(new_page)) {
3657 * If a process owning a MAP_PRIVATE mapping fails to COW,
3658 * it is due to references held by a child and an insufficient
3659 * huge page pool. To guarantee the original mappers
3660 * reliability, unmap the page from child processes. The child
3661 * may get SIGKILLed if it later faults.
3663 if (outside_reserve) {
3665 BUG_ON(huge_pte_none(pte));
3666 unmap_ref_private(mm, vma, old_page, haddr);
3667 BUG_ON(huge_pte_none(pte));
3669 ptep = huge_pte_offset(mm, haddr, huge_page_size(h));
3671 pte_same(huge_ptep_get(ptep), pte)))
3672 goto retry_avoidcopy;
3674 * race occurs while re-acquiring page table
3675 * lock, and our job is done.
3680 ret = vmf_error(PTR_ERR(new_page));
3681 goto out_release_old;
3685 * When the original hugepage is shared one, it does not have
3686 * anon_vma prepared.
3688 if (unlikely(anon_vma_prepare(vma))) {
3690 goto out_release_all;
3693 copy_user_huge_page(new_page, old_page, address, vma,
3694 pages_per_huge_page(h));
3695 __SetPageUptodate(new_page);
3697 mmu_notifier_range_init(&range, MMU_NOTIFY_CLEAR, 0, vma, mm, haddr,
3698 haddr + huge_page_size(h));
3699 mmu_notifier_invalidate_range_start(&range);
3702 * Retake the page table lock to check for racing updates
3703 * before the page tables are altered
3706 ptep = huge_pte_offset(mm, haddr, huge_page_size(h));
3707 if (likely(ptep && pte_same(huge_ptep_get(ptep), pte))) {
3708 ClearPagePrivate(new_page);
3711 huge_ptep_clear_flush(vma, haddr, ptep);
3712 mmu_notifier_invalidate_range(mm, range.start, range.end);
3713 set_huge_pte_at(mm, haddr, ptep,
3714 make_huge_pte(vma, new_page, 1));
3715 page_remove_rmap(old_page, true);
3716 hugepage_add_new_anon_rmap(new_page, vma, haddr);
3717 set_page_huge_active(new_page);
3718 /* Make the old page be freed below */
3719 new_page = old_page;
3722 mmu_notifier_invalidate_range_end(&range);
3724 restore_reserve_on_error(h, vma, haddr, new_page);
3729 spin_lock(ptl); /* Caller expects lock to be held */
3733 /* Return the pagecache page at a given address within a VMA */
3734 static struct page *hugetlbfs_pagecache_page(struct hstate *h,
3735 struct vm_area_struct *vma, unsigned long address)
3737 struct address_space *mapping;
3740 mapping = vma->vm_file->f_mapping;
3741 idx = vma_hugecache_offset(h, vma, address);
3743 return find_lock_page(mapping, idx);
3747 * Return whether there is a pagecache page to back given address within VMA.
3748 * Caller follow_hugetlb_page() holds page_table_lock so we cannot lock_page.
3750 static bool hugetlbfs_pagecache_present(struct hstate *h,
3751 struct vm_area_struct *vma, unsigned long address)
3753 struct address_space *mapping;
3757 mapping = vma->vm_file->f_mapping;
3758 idx = vma_hugecache_offset(h, vma, address);
3760 page = find_get_page(mapping, idx);
3763 return page != NULL;
3766 int huge_add_to_page_cache(struct page *page, struct address_space *mapping,
3769 struct inode *inode = mapping->host;
3770 struct hstate *h = hstate_inode(inode);
3771 int err = add_to_page_cache(page, mapping, idx, GFP_KERNEL);
3775 ClearPagePrivate(page);
3778 * set page dirty so that it will not be removed from cache/file
3779 * by non-hugetlbfs specific code paths.
3781 set_page_dirty(page);
3783 spin_lock(&inode->i_lock);
3784 inode->i_blocks += blocks_per_huge_page(h);
3785 spin_unlock(&inode->i_lock);
3789 static vm_fault_t hugetlb_no_page(struct mm_struct *mm,
3790 struct vm_area_struct *vma,
3791 struct address_space *mapping, pgoff_t idx,
3792 unsigned long address, pte_t *ptep, unsigned int flags)
3794 struct hstate *h = hstate_vma(vma);
3795 vm_fault_t ret = VM_FAULT_SIGBUS;
3801 unsigned long haddr = address & huge_page_mask(h);
3802 bool new_page = false;
3805 * Currently, we are forced to kill the process in the event the
3806 * original mapper has unmapped pages from the child due to a failed
3807 * COW. Warn that such a situation has occurred as it may not be obvious
3809 if (is_vma_resv_set(vma, HPAGE_RESV_UNMAPPED)) {
3810 pr_warn_ratelimited("PID %d killed due to inadequate hugepage pool\n",
3816 * Use page lock to guard against racing truncation
3817 * before we get page_table_lock.
3820 page = find_lock_page(mapping, idx);
3822 size = i_size_read(mapping->host) >> huge_page_shift(h);
3827 * Check for page in userfault range
3829 if (userfaultfd_missing(vma)) {
3831 struct vm_fault vmf = {
3836 * Hard to debug if it ends up being
3837 * used by a callee that assumes
3838 * something about the other
3839 * uninitialized fields... same as in
3845 * hugetlb_fault_mutex must be dropped before
3846 * handling userfault. Reacquire after handling
3847 * fault to make calling code simpler.
3849 hash = hugetlb_fault_mutex_hash(h, mapping, idx, haddr);
3850 mutex_unlock(&hugetlb_fault_mutex_table[hash]);
3851 ret = handle_userfault(&vmf, VM_UFFD_MISSING);
3852 mutex_lock(&hugetlb_fault_mutex_table[hash]);
3856 page = alloc_huge_page(vma, haddr, 0);
3859 * Returning error will result in faulting task being
3860 * sent SIGBUS. The hugetlb fault mutex prevents two
3861 * tasks from racing to fault in the same page which
3862 * could result in false unable to allocate errors.
3863 * Page migration does not take the fault mutex, but
3864 * does a clear then write of pte's under page table
3865 * lock. Page fault code could race with migration,
3866 * notice the clear pte and try to allocate a page
3867 * here. Before returning error, get ptl and make
3868 * sure there really is no pte entry.
3870 ptl = huge_pte_lock(h, mm, ptep);
3871 if (!huge_pte_none(huge_ptep_get(ptep))) {
3877 ret = vmf_error(PTR_ERR(page));
3880 clear_huge_page(page, address, pages_per_huge_page(h));
3881 __SetPageUptodate(page);
3884 if (vma->vm_flags & VM_MAYSHARE) {
3885 int err = huge_add_to_page_cache(page, mapping, idx);
3894 if (unlikely(anon_vma_prepare(vma))) {
3896 goto backout_unlocked;
3902 * If memory error occurs between mmap() and fault, some process
3903 * don't have hwpoisoned swap entry for errored virtual address.
3904 * So we need to block hugepage fault by PG_hwpoison bit check.
3906 if (unlikely(PageHWPoison(page))) {
3907 ret = VM_FAULT_HWPOISON |
3908 VM_FAULT_SET_HINDEX(hstate_index(h));
3909 goto backout_unlocked;
3914 * If we are going to COW a private mapping later, we examine the
3915 * pending reservations for this page now. This will ensure that
3916 * any allocations necessary to record that reservation occur outside
3919 if ((flags & FAULT_FLAG_WRITE) && !(vma->vm_flags & VM_SHARED)) {
3920 if (vma_needs_reservation(h, vma, haddr) < 0) {
3922 goto backout_unlocked;
3924 /* Just decrements count, does not deallocate */
3925 vma_end_reservation(h, vma, haddr);
3928 ptl = huge_pte_lock(h, mm, ptep);
3929 size = i_size_read(mapping->host) >> huge_page_shift(h);
3934 if (!huge_pte_none(huge_ptep_get(ptep)))
3938 ClearPagePrivate(page);
3939 hugepage_add_new_anon_rmap(page, vma, haddr);
3941 page_dup_rmap(page, true);
3942 new_pte = make_huge_pte(vma, page, ((vma->vm_flags & VM_WRITE)
3943 && (vma->vm_flags & VM_SHARED)));
3944 set_huge_pte_at(mm, haddr, ptep, new_pte);
3946 hugetlb_count_add(pages_per_huge_page(h), mm);
3947 if ((flags & FAULT_FLAG_WRITE) && !(vma->vm_flags & VM_SHARED)) {
3948 /* Optimization, do the COW without a second fault */
3949 ret = hugetlb_cow(mm, vma, address, ptep, page, ptl);
3955 * Only make newly allocated pages active. Existing pages found
3956 * in the pagecache could be !page_huge_active() if they have been
3957 * isolated for migration.
3960 set_page_huge_active(page);
3970 restore_reserve_on_error(h, vma, haddr, page);
3976 u32 hugetlb_fault_mutex_hash(struct hstate *h, struct address_space *mapping,
3977 pgoff_t idx, unsigned long address)
3979 unsigned long key[2];
3982 key[0] = (unsigned long) mapping;
3985 hash = jhash2((u32 *)&key, sizeof(key)/sizeof(u32), 0);
3987 return hash & (num_fault_mutexes - 1);
3991 * For uniprocesor systems we always use a single mutex, so just
3992 * return 0 and avoid the hashing overhead.
3994 u32 hugetlb_fault_mutex_hash(struct hstate *h, struct address_space *mapping,
3995 pgoff_t idx, unsigned long address)
4001 vm_fault_t hugetlb_fault(struct mm_struct *mm, struct vm_area_struct *vma,
4002 unsigned long address, unsigned int flags)
4009 struct page *page = NULL;
4010 struct page *pagecache_page = NULL;
4011 struct hstate *h = hstate_vma(vma);
4012 struct address_space *mapping;
4013 int need_wait_lock = 0;
4014 unsigned long haddr = address & huge_page_mask(h);
4016 ptep = huge_pte_offset(mm, haddr, huge_page_size(h));
4018 entry = huge_ptep_get(ptep);
4019 if (unlikely(is_hugetlb_entry_migration(entry))) {
4020 migration_entry_wait_huge(vma, mm, ptep);
4022 } else if (unlikely(is_hugetlb_entry_hwpoisoned(entry)))
4023 return VM_FAULT_HWPOISON_LARGE |
4024 VM_FAULT_SET_HINDEX(hstate_index(h));
4026 ptep = huge_pte_alloc(mm, haddr, huge_page_size(h));
4028 return VM_FAULT_OOM;
4031 mapping = vma->vm_file->f_mapping;
4032 idx = vma_hugecache_offset(h, vma, haddr);
4035 * Serialize hugepage allocation and instantiation, so that we don't
4036 * get spurious allocation failures if two CPUs race to instantiate
4037 * the same page in the page cache.
4039 hash = hugetlb_fault_mutex_hash(h, mapping, idx, haddr);
4040 mutex_lock(&hugetlb_fault_mutex_table[hash]);
4042 entry = huge_ptep_get(ptep);
4043 if (huge_pte_none(entry)) {
4044 ret = hugetlb_no_page(mm, vma, mapping, idx, address, ptep, flags);
4051 * entry could be a migration/hwpoison entry at this point, so this
4052 * check prevents the kernel from going below assuming that we have
4053 * a active hugepage in pagecache. This goto expects the 2nd page fault,
4054 * and is_hugetlb_entry_(migration|hwpoisoned) check will properly
4057 if (!pte_present(entry))
4061 * If we are going to COW the mapping later, we examine the pending
4062 * reservations for this page now. This will ensure that any
4063 * allocations necessary to record that reservation occur outside the
4064 * spinlock. For private mappings, we also lookup the pagecache
4065 * page now as it is used to determine if a reservation has been
4068 if ((flags & FAULT_FLAG_WRITE) && !huge_pte_write(entry)) {
4069 if (vma_needs_reservation(h, vma, haddr) < 0) {
4073 /* Just decrements count, does not deallocate */
4074 vma_end_reservation(h, vma, haddr);
4076 if (!(vma->vm_flags & VM_MAYSHARE))
4077 pagecache_page = hugetlbfs_pagecache_page(h,
4081 ptl = huge_pte_lock(h, mm, ptep);
4083 /* Check for a racing update before calling hugetlb_cow */
4084 if (unlikely(!pte_same(entry, huge_ptep_get(ptep))))
4088 * hugetlb_cow() requires page locks of pte_page(entry) and
4089 * pagecache_page, so here we need take the former one
4090 * when page != pagecache_page or !pagecache_page.
4092 page = pte_page(entry);
4093 if (page != pagecache_page)
4094 if (!trylock_page(page)) {
4101 if (flags & FAULT_FLAG_WRITE) {
4102 if (!huge_pte_write(entry)) {
4103 ret = hugetlb_cow(mm, vma, address, ptep,
4104 pagecache_page, ptl);
4107 entry = huge_pte_mkdirty(entry);
4109 entry = pte_mkyoung(entry);
4110 if (huge_ptep_set_access_flags(vma, haddr, ptep, entry,
4111 flags & FAULT_FLAG_WRITE))
4112 update_mmu_cache(vma, haddr, ptep);
4114 if (page != pagecache_page)
4120 if (pagecache_page) {
4121 unlock_page(pagecache_page);
4122 put_page(pagecache_page);
4125 mutex_unlock(&hugetlb_fault_mutex_table[hash]);
4127 * Generally it's safe to hold refcount during waiting page lock. But
4128 * here we just wait to defer the next page fault to avoid busy loop and
4129 * the page is not used after unlocked before returning from the current
4130 * page fault. So we are safe from accessing freed page, even if we wait
4131 * here without taking refcount.
4134 wait_on_page_locked(page);
4139 * Used by userfaultfd UFFDIO_COPY. Based on mcopy_atomic_pte with
4140 * modifications for huge pages.
4142 int hugetlb_mcopy_atomic_pte(struct mm_struct *dst_mm,
4144 struct vm_area_struct *dst_vma,
4145 unsigned long dst_addr,
4146 unsigned long src_addr,
4147 struct page **pagep)
4149 struct address_space *mapping;
4152 int vm_shared = dst_vma->vm_flags & VM_SHARED;
4153 struct hstate *h = hstate_vma(dst_vma);
4161 page = alloc_huge_page(dst_vma, dst_addr, 0);
4165 ret = copy_huge_page_from_user(page,
4166 (const void __user *) src_addr,
4167 pages_per_huge_page(h), false);
4169 /* fallback to copy_from_user outside mmap_sem */
4170 if (unlikely(ret)) {
4173 /* don't free the page */
4182 * The memory barrier inside __SetPageUptodate makes sure that
4183 * preceding stores to the page contents become visible before
4184 * the set_pte_at() write.
4186 __SetPageUptodate(page);
4188 mapping = dst_vma->vm_file->f_mapping;
4189 idx = vma_hugecache_offset(h, dst_vma, dst_addr);
4192 * If shared, add to page cache
4195 size = i_size_read(mapping->host) >> huge_page_shift(h);
4198 goto out_release_nounlock;
4201 * Serialization between remove_inode_hugepages() and
4202 * huge_add_to_page_cache() below happens through the
4203 * hugetlb_fault_mutex_table that here must be hold by
4206 ret = huge_add_to_page_cache(page, mapping, idx);
4208 goto out_release_nounlock;
4211 ptl = huge_pte_lockptr(h, dst_mm, dst_pte);
4215 * Recheck the i_size after holding PT lock to make sure not
4216 * to leave any page mapped (as page_mapped()) beyond the end
4217 * of the i_size (remove_inode_hugepages() is strict about
4218 * enforcing that). If we bail out here, we'll also leave a
4219 * page in the radix tree in the vm_shared case beyond the end
4220 * of the i_size, but remove_inode_hugepages() will take care
4221 * of it as soon as we drop the hugetlb_fault_mutex_table.
4223 size = i_size_read(mapping->host) >> huge_page_shift(h);
4226 goto out_release_unlock;
4229 if (!huge_pte_none(huge_ptep_get(dst_pte)))
4230 goto out_release_unlock;
4233 page_dup_rmap(page, true);
4235 ClearPagePrivate(page);
4236 hugepage_add_new_anon_rmap(page, dst_vma, dst_addr);
4239 _dst_pte = make_huge_pte(dst_vma, page, dst_vma->vm_flags & VM_WRITE);
4240 if (dst_vma->vm_flags & VM_WRITE)
4241 _dst_pte = huge_pte_mkdirty(_dst_pte);
4242 _dst_pte = pte_mkyoung(_dst_pte);
4244 set_huge_pte_at(dst_mm, dst_addr, dst_pte, _dst_pte);
4246 (void)huge_ptep_set_access_flags(dst_vma, dst_addr, dst_pte, _dst_pte,
4247 dst_vma->vm_flags & VM_WRITE);
4248 hugetlb_count_add(pages_per_huge_page(h), dst_mm);
4250 /* No need to invalidate - it was non-present before */
4251 update_mmu_cache(dst_vma, dst_addr, dst_pte);
4254 set_page_huge_active(page);
4264 out_release_nounlock:
4269 long follow_hugetlb_page(struct mm_struct *mm, struct vm_area_struct *vma,
4270 struct page **pages, struct vm_area_struct **vmas,
4271 unsigned long *position, unsigned long *nr_pages,
4272 long i, unsigned int flags, int *nonblocking)
4274 unsigned long pfn_offset;
4275 unsigned long vaddr = *position;
4276 unsigned long remainder = *nr_pages;
4277 struct hstate *h = hstate_vma(vma);
4280 while (vaddr < vma->vm_end && remainder) {
4282 spinlock_t *ptl = NULL;
4287 * If we have a pending SIGKILL, don't keep faulting pages and
4288 * potentially allocating memory.
4290 if (fatal_signal_pending(current)) {
4296 * Some archs (sparc64, sh*) have multiple pte_ts to
4297 * each hugepage. We have to make sure we get the
4298 * first, for the page indexing below to work.
4300 * Note that page table lock is not held when pte is null.
4302 pte = huge_pte_offset(mm, vaddr & huge_page_mask(h),
4305 ptl = huge_pte_lock(h, mm, pte);
4306 absent = !pte || huge_pte_none(huge_ptep_get(pte));
4309 * When coredumping, it suits get_dump_page if we just return
4310 * an error where there's an empty slot with no huge pagecache
4311 * to back it. This way, we avoid allocating a hugepage, and
4312 * the sparse dumpfile avoids allocating disk blocks, but its
4313 * huge holes still show up with zeroes where they need to be.
4315 if (absent && (flags & FOLL_DUMP) &&
4316 !hugetlbfs_pagecache_present(h, vma, vaddr)) {
4324 * We need call hugetlb_fault for both hugepages under migration
4325 * (in which case hugetlb_fault waits for the migration,) and
4326 * hwpoisoned hugepages (in which case we need to prevent the
4327 * caller from accessing to them.) In order to do this, we use
4328 * here is_swap_pte instead of is_hugetlb_entry_migration and
4329 * is_hugetlb_entry_hwpoisoned. This is because it simply covers
4330 * both cases, and because we can't follow correct pages
4331 * directly from any kind of swap entries.
4333 if (absent || is_swap_pte(huge_ptep_get(pte)) ||
4334 ((flags & FOLL_WRITE) &&
4335 !huge_pte_write(huge_ptep_get(pte)))) {
4337 unsigned int fault_flags = 0;
4341 if (flags & FOLL_WRITE)
4342 fault_flags |= FAULT_FLAG_WRITE;
4344 fault_flags |= FAULT_FLAG_ALLOW_RETRY;
4345 if (flags & FOLL_NOWAIT)
4346 fault_flags |= FAULT_FLAG_ALLOW_RETRY |
4347 FAULT_FLAG_RETRY_NOWAIT;
4348 if (flags & FOLL_TRIED) {
4349 VM_WARN_ON_ONCE(fault_flags &
4350 FAULT_FLAG_ALLOW_RETRY);
4351 fault_flags |= FAULT_FLAG_TRIED;
4353 ret = hugetlb_fault(mm, vma, vaddr, fault_flags);
4354 if (ret & VM_FAULT_ERROR) {
4355 err = vm_fault_to_errno(ret, flags);
4359 if (ret & VM_FAULT_RETRY) {
4361 !(fault_flags & FAULT_FLAG_RETRY_NOWAIT))
4365 * VM_FAULT_RETRY must not return an
4366 * error, it will return zero
4369 * No need to update "position" as the
4370 * caller will not check it after
4371 * *nr_pages is set to 0.
4378 pfn_offset = (vaddr & ~huge_page_mask(h)) >> PAGE_SHIFT;
4379 page = pte_page(huge_ptep_get(pte));
4382 * Instead of doing 'try_get_page()' below in the same_page
4383 * loop, just check the count once here.
4385 if (unlikely(page_count(page) <= 0)) {
4395 pages[i] = mem_map_offset(page, pfn_offset);
4406 if (vaddr < vma->vm_end && remainder &&
4407 pfn_offset < pages_per_huge_page(h)) {
4409 * We use pfn_offset to avoid touching the pageframes
4410 * of this compound page.
4416 *nr_pages = remainder;
4418 * setting position is actually required only if remainder is
4419 * not zero but it's faster not to add a "if (remainder)"
4427 #ifndef __HAVE_ARCH_FLUSH_HUGETLB_TLB_RANGE
4429 * ARCHes with special requirements for evicting HUGETLB backing TLB entries can
4432 #define flush_hugetlb_tlb_range(vma, addr, end) flush_tlb_range(vma, addr, end)
4435 unsigned long hugetlb_change_protection(struct vm_area_struct *vma,
4436 unsigned long address, unsigned long end, pgprot_t newprot)
4438 struct mm_struct *mm = vma->vm_mm;
4439 unsigned long start = address;
4442 struct hstate *h = hstate_vma(vma);
4443 unsigned long pages = 0;
4444 bool shared_pmd = false;
4445 struct mmu_notifier_range range;
4448 * In the case of shared PMDs, the area to flush could be beyond
4449 * start/end. Set range.start/range.end to cover the maximum possible
4450 * range if PMD sharing is possible.
4452 mmu_notifier_range_init(&range, MMU_NOTIFY_PROTECTION_VMA,
4453 0, vma, mm, start, end);
4454 adjust_range_if_pmd_sharing_possible(vma, &range.start, &range.end);
4456 BUG_ON(address >= end);
4457 flush_cache_range(vma, range.start, range.end);
4459 mmu_notifier_invalidate_range_start(&range);
4460 i_mmap_lock_write(vma->vm_file->f_mapping);
4461 for (; address < end; address += huge_page_size(h)) {
4463 ptep = huge_pte_offset(mm, address, huge_page_size(h));
4466 ptl = huge_pte_lock(h, mm, ptep);
4467 if (huge_pmd_unshare(mm, &address, ptep)) {
4473 pte = huge_ptep_get(ptep);
4474 if (unlikely(is_hugetlb_entry_hwpoisoned(pte))) {
4478 if (unlikely(is_hugetlb_entry_migration(pte))) {
4479 swp_entry_t entry = pte_to_swp_entry(pte);
4481 if (is_write_migration_entry(entry)) {
4484 make_migration_entry_read(&entry);
4485 newpte = swp_entry_to_pte(entry);
4486 set_huge_swap_pte_at(mm, address, ptep,
4487 newpte, huge_page_size(h));
4493 if (!huge_pte_none(pte)) {
4496 old_pte = huge_ptep_modify_prot_start(vma, address, ptep);
4497 pte = pte_mkhuge(huge_pte_modify(old_pte, newprot));
4498 pte = arch_make_huge_pte(pte, vma, NULL, 0);
4499 huge_ptep_modify_prot_commit(vma, address, ptep, old_pte, pte);
4505 * Must flush TLB before releasing i_mmap_rwsem: x86's huge_pmd_unshare
4506 * may have cleared our pud entry and done put_page on the page table:
4507 * once we release i_mmap_rwsem, another task can do the final put_page
4508 * and that page table be reused and filled with junk. If we actually
4509 * did unshare a page of pmds, flush the range corresponding to the pud.
4512 flush_hugetlb_tlb_range(vma, range.start, range.end);
4514 flush_hugetlb_tlb_range(vma, start, end);
4516 * No need to call mmu_notifier_invalidate_range() we are downgrading
4517 * page table protection not changing it to point to a new page.
4519 * See Documentation/vm/mmu_notifier.rst
4521 i_mmap_unlock_write(vma->vm_file->f_mapping);
4522 mmu_notifier_invalidate_range_end(&range);
4524 return pages << h->order;
4527 int hugetlb_reserve_pages(struct inode *inode,
4529 struct vm_area_struct *vma,
4530 vm_flags_t vm_flags)
4533 struct hstate *h = hstate_inode(inode);
4534 struct hugepage_subpool *spool = subpool_inode(inode);
4535 struct resv_map *resv_map;
4538 /* This should never happen */
4540 VM_WARN(1, "%s called with a negative range\n", __func__);
4545 * Only apply hugepage reservation if asked. At fault time, an
4546 * attempt will be made for VM_NORESERVE to allocate a page
4547 * without using reserves
4549 if (vm_flags & VM_NORESERVE)
4553 * Shared mappings base their reservation on the number of pages that
4554 * are already allocated on behalf of the file. Private mappings need
4555 * to reserve the full area even if read-only as mprotect() may be
4556 * called to make the mapping read-write. Assume !vma is a shm mapping
4558 if (!vma || vma->vm_flags & VM_MAYSHARE) {
4560 * resv_map can not be NULL as hugetlb_reserve_pages is only
4561 * called for inodes for which resv_maps were created (see
4562 * hugetlbfs_get_inode).
4564 resv_map = inode_resv_map(inode);
4566 chg = region_chg(resv_map, from, to);
4569 resv_map = resv_map_alloc();
4575 set_vma_resv_map(vma, resv_map);
4576 set_vma_resv_flags(vma, HPAGE_RESV_OWNER);
4585 * There must be enough pages in the subpool for the mapping. If
4586 * the subpool has a minimum size, there may be some global
4587 * reservations already in place (gbl_reserve).
4589 gbl_reserve = hugepage_subpool_get_pages(spool, chg);
4590 if (gbl_reserve < 0) {
4596 * Check enough hugepages are available for the reservation.
4597 * Hand the pages back to the subpool if there are not
4599 ret = hugetlb_acct_memory(h, gbl_reserve);
4601 /* put back original number of pages, chg */
4602 (void)hugepage_subpool_put_pages(spool, chg);
4607 * Account for the reservations made. Shared mappings record regions
4608 * that have reservations as they are shared by multiple VMAs.
4609 * When the last VMA disappears, the region map says how much
4610 * the reservation was and the page cache tells how much of
4611 * the reservation was consumed. Private mappings are per-VMA and
4612 * only the consumed reservations are tracked. When the VMA
4613 * disappears, the original reservation is the VMA size and the
4614 * consumed reservations are stored in the map. Hence, nothing
4615 * else has to be done for private mappings here
4617 if (!vma || vma->vm_flags & VM_MAYSHARE) {
4618 long add = region_add(resv_map, from, to);
4620 if (unlikely(chg > add)) {
4622 * pages in this range were added to the reserve
4623 * map between region_chg and region_add. This
4624 * indicates a race with alloc_huge_page. Adjust
4625 * the subpool and reserve counts modified above
4626 * based on the difference.
4630 rsv_adjust = hugepage_subpool_put_pages(spool,
4632 hugetlb_acct_memory(h, -rsv_adjust);
4637 if (!vma || vma->vm_flags & VM_MAYSHARE)
4638 /* Don't call region_abort if region_chg failed */
4640 region_abort(resv_map, from, to);
4641 if (vma && is_vma_resv_set(vma, HPAGE_RESV_OWNER))
4642 kref_put(&resv_map->refs, resv_map_release);
4646 long hugetlb_unreserve_pages(struct inode *inode, long start, long end,
4649 struct hstate *h = hstate_inode(inode);
4650 struct resv_map *resv_map = inode_resv_map(inode);
4652 struct hugepage_subpool *spool = subpool_inode(inode);
4656 * Since this routine can be called in the evict inode path for all
4657 * hugetlbfs inodes, resv_map could be NULL.
4660 chg = region_del(resv_map, start, end);
4662 * region_del() can fail in the rare case where a region
4663 * must be split and another region descriptor can not be
4664 * allocated. If end == LONG_MAX, it will not fail.
4670 spin_lock(&inode->i_lock);
4671 inode->i_blocks -= (blocks_per_huge_page(h) * freed);
4672 spin_unlock(&inode->i_lock);
4675 * If the subpool has a minimum size, the number of global
4676 * reservations to be released may be adjusted.
4678 gbl_reserve = hugepage_subpool_put_pages(spool, (chg - freed));
4679 hugetlb_acct_memory(h, -gbl_reserve);
4684 #ifdef CONFIG_ARCH_WANT_HUGE_PMD_SHARE
4685 static unsigned long page_table_shareable(struct vm_area_struct *svma,
4686 struct vm_area_struct *vma,
4687 unsigned long addr, pgoff_t idx)
4689 unsigned long saddr = ((idx - svma->vm_pgoff) << PAGE_SHIFT) +
4691 unsigned long sbase = saddr & PUD_MASK;
4692 unsigned long s_end = sbase + PUD_SIZE;
4694 /* Allow segments to share if only one is marked locked */
4695 unsigned long vm_flags = vma->vm_flags & VM_LOCKED_CLEAR_MASK;
4696 unsigned long svm_flags = svma->vm_flags & VM_LOCKED_CLEAR_MASK;
4699 * match the virtual addresses, permission and the alignment of the
4702 if (pmd_index(addr) != pmd_index(saddr) ||
4703 vm_flags != svm_flags ||
4704 sbase < svma->vm_start || svma->vm_end < s_end)
4710 static bool vma_shareable(struct vm_area_struct *vma, unsigned long addr)
4712 unsigned long base = addr & PUD_MASK;
4713 unsigned long end = base + PUD_SIZE;
4716 * check on proper vm_flags and page table alignment
4718 if (vma->vm_flags & VM_MAYSHARE && range_in_vma(vma, base, end))
4724 * Determine if start,end range within vma could be mapped by shared pmd.
4725 * If yes, adjust start and end to cover range associated with possible
4726 * shared pmd mappings.
4728 void adjust_range_if_pmd_sharing_possible(struct vm_area_struct *vma,
4729 unsigned long *start, unsigned long *end)
4731 unsigned long check_addr = *start;
4733 if (!(vma->vm_flags & VM_MAYSHARE))
4736 for (check_addr = *start; check_addr < *end; check_addr += PUD_SIZE) {
4737 unsigned long a_start = check_addr & PUD_MASK;
4738 unsigned long a_end = a_start + PUD_SIZE;
4741 * If sharing is possible, adjust start/end if necessary.
4743 if (range_in_vma(vma, a_start, a_end)) {
4744 if (a_start < *start)
4753 * Search for a shareable pmd page for hugetlb. In any case calls pmd_alloc()
4754 * and returns the corresponding pte. While this is not necessary for the
4755 * !shared pmd case because we can allocate the pmd later as well, it makes the
4756 * code much cleaner. pmd allocation is essential for the shared case because
4757 * pud has to be populated inside the same i_mmap_rwsem section - otherwise
4758 * racing tasks could either miss the sharing (see huge_pte_offset) or select a
4759 * bad pmd for sharing.
4761 pte_t *huge_pmd_share(struct mm_struct *mm, unsigned long addr, pud_t *pud)
4763 struct vm_area_struct *vma = find_vma(mm, addr);
4764 struct address_space *mapping = vma->vm_file->f_mapping;
4765 pgoff_t idx = ((addr - vma->vm_start) >> PAGE_SHIFT) +
4767 struct vm_area_struct *svma;
4768 unsigned long saddr;
4773 if (!vma_shareable(vma, addr))
4774 return (pte_t *)pmd_alloc(mm, pud, addr);
4776 i_mmap_lock_write(mapping);
4777 vma_interval_tree_foreach(svma, &mapping->i_mmap, idx, idx) {
4781 saddr = page_table_shareable(svma, vma, addr, idx);
4783 spte = huge_pte_offset(svma->vm_mm, saddr,
4784 vma_mmu_pagesize(svma));
4786 get_page(virt_to_page(spte));
4795 ptl = huge_pte_lock(hstate_vma(vma), mm, spte);
4796 if (pud_none(*pud)) {
4797 pud_populate(mm, pud,
4798 (pmd_t *)((unsigned long)spte & PAGE_MASK));
4801 put_page(virt_to_page(spte));
4805 pte = (pte_t *)pmd_alloc(mm, pud, addr);
4806 i_mmap_unlock_write(mapping);
4811 * unmap huge page backed by shared pte.
4813 * Hugetlb pte page is ref counted at the time of mapping. If pte is shared
4814 * indicated by page_count > 1, unmap is achieved by clearing pud and
4815 * decrementing the ref count. If count == 1, the pte page is not shared.
4817 * called with page table lock held.
4819 * returns: 1 successfully unmapped a shared pte page
4820 * 0 the underlying pte page is not shared, or it is the last user
4822 int huge_pmd_unshare(struct mm_struct *mm, unsigned long *addr, pte_t *ptep)
4824 pgd_t *pgd = pgd_offset(mm, *addr);
4825 p4d_t *p4d = p4d_offset(pgd, *addr);
4826 pud_t *pud = pud_offset(p4d, *addr);
4828 BUG_ON(page_count(virt_to_page(ptep)) == 0);
4829 if (page_count(virt_to_page(ptep)) == 1)
4833 put_page(virt_to_page(ptep));
4835 *addr = ALIGN(*addr, HPAGE_SIZE * PTRS_PER_PTE) - HPAGE_SIZE;
4838 #define want_pmd_share() (1)
4839 #else /* !CONFIG_ARCH_WANT_HUGE_PMD_SHARE */
4840 pte_t *huge_pmd_share(struct mm_struct *mm, unsigned long addr, pud_t *pud)
4845 int huge_pmd_unshare(struct mm_struct *mm, unsigned long *addr, pte_t *ptep)
4850 void adjust_range_if_pmd_sharing_possible(struct vm_area_struct *vma,
4851 unsigned long *start, unsigned long *end)
4854 #define want_pmd_share() (0)
4855 #endif /* CONFIG_ARCH_WANT_HUGE_PMD_SHARE */
4857 #ifdef CONFIG_ARCH_WANT_GENERAL_HUGETLB
4858 pte_t *huge_pte_alloc(struct mm_struct *mm,
4859 unsigned long addr, unsigned long sz)
4866 pgd = pgd_offset(mm, addr);
4867 p4d = p4d_alloc(mm, pgd, addr);
4870 pud = pud_alloc(mm, p4d, addr);
4872 if (sz == PUD_SIZE) {
4875 BUG_ON(sz != PMD_SIZE);
4876 if (want_pmd_share() && pud_none(*pud))
4877 pte = huge_pmd_share(mm, addr, pud);
4879 pte = (pte_t *)pmd_alloc(mm, pud, addr);
4882 BUG_ON(pte && pte_present(*pte) && !pte_huge(*pte));
4888 * huge_pte_offset() - Walk the page table to resolve the hugepage
4889 * entry at address @addr
4891 * Return: Pointer to page table or swap entry (PUD or PMD) for
4892 * address @addr, or NULL if a p*d_none() entry is encountered and the
4893 * size @sz doesn't match the hugepage size at this level of the page
4896 pte_t *huge_pte_offset(struct mm_struct *mm,
4897 unsigned long addr, unsigned long sz)
4904 pgd = pgd_offset(mm, addr);
4905 if (!pgd_present(*pgd))
4907 p4d = p4d_offset(pgd, addr);
4908 if (!p4d_present(*p4d))
4911 pud = pud_offset(p4d, addr);
4912 if (sz != PUD_SIZE && pud_none(*pud))
4914 /* hugepage or swap? */
4915 if (pud_huge(*pud) || !pud_present(*pud))
4916 return (pte_t *)pud;
4918 pmd = pmd_offset(pud, addr);
4919 if (sz != PMD_SIZE && pmd_none(*pmd))
4921 /* hugepage or swap? */
4922 if (pmd_huge(*pmd) || !pmd_present(*pmd))
4923 return (pte_t *)pmd;
4928 #endif /* CONFIG_ARCH_WANT_GENERAL_HUGETLB */
4931 * These functions are overwritable if your architecture needs its own
4934 struct page * __weak
4935 follow_huge_addr(struct mm_struct *mm, unsigned long address,
4938 return ERR_PTR(-EINVAL);
4941 struct page * __weak
4942 follow_huge_pd(struct vm_area_struct *vma,
4943 unsigned long address, hugepd_t hpd, int flags, int pdshift)
4945 WARN(1, "hugepd follow called with no support for hugepage directory format\n");
4949 struct page * __weak
4950 follow_huge_pmd(struct mm_struct *mm, unsigned long address,
4951 pmd_t *pmd, int flags)
4953 struct page *page = NULL;
4957 ptl = pmd_lockptr(mm, pmd);
4960 * make sure that the address range covered by this pmd is not
4961 * unmapped from other threads.
4963 if (!pmd_huge(*pmd))
4965 pte = huge_ptep_get((pte_t *)pmd);
4966 if (pte_present(pte)) {
4967 page = pmd_page(*pmd) + ((address & ~PMD_MASK) >> PAGE_SHIFT);
4968 if (flags & FOLL_GET)
4971 if (is_hugetlb_entry_migration(pte)) {
4973 __migration_entry_wait(mm, (pte_t *)pmd, ptl);
4977 * hwpoisoned entry is treated as no_page_table in
4978 * follow_page_mask().
4986 struct page * __weak
4987 follow_huge_pud(struct mm_struct *mm, unsigned long address,
4988 pud_t *pud, int flags)
4990 if (flags & FOLL_GET)
4993 return pte_page(*(pte_t *)pud) + ((address & ~PUD_MASK) >> PAGE_SHIFT);
4996 struct page * __weak
4997 follow_huge_pgd(struct mm_struct *mm, unsigned long address, pgd_t *pgd, int flags)
4999 if (flags & FOLL_GET)
5002 return pte_page(*(pte_t *)pgd) + ((address & ~PGDIR_MASK) >> PAGE_SHIFT);
5005 bool isolate_huge_page(struct page *page, struct list_head *list)
5009 VM_BUG_ON_PAGE(!PageHead(page), page);
5010 spin_lock(&hugetlb_lock);
5011 if (!page_huge_active(page) || !get_page_unless_zero(page)) {
5015 clear_page_huge_active(page);
5016 list_move_tail(&page->lru, list);
5018 spin_unlock(&hugetlb_lock);
5022 void putback_active_hugepage(struct page *page)
5024 VM_BUG_ON_PAGE(!PageHead(page), page);
5025 spin_lock(&hugetlb_lock);
5026 set_page_huge_active(page);
5027 list_move_tail(&page->lru, &(page_hstate(page))->hugepage_activelist);
5028 spin_unlock(&hugetlb_lock);
5032 void move_hugetlb_state(struct page *oldpage, struct page *newpage, int reason)
5034 struct hstate *h = page_hstate(oldpage);
5036 hugetlb_cgroup_migrate(oldpage, newpage);
5037 set_page_owner_migrate_reason(newpage, reason);
5040 * transfer temporary state of the new huge page. This is
5041 * reverse to other transitions because the newpage is going to
5042 * be final while the old one will be freed so it takes over
5043 * the temporary status.
5045 * Also note that we have to transfer the per-node surplus state
5046 * here as well otherwise the global surplus count will not match
5049 if (PageHugeTemporary(newpage)) {
5050 int old_nid = page_to_nid(oldpage);
5051 int new_nid = page_to_nid(newpage);
5053 SetPageHugeTemporary(oldpage);
5054 ClearPageHugeTemporary(newpage);
5056 spin_lock(&hugetlb_lock);
5057 if (h->surplus_huge_pages_node[old_nid]) {
5058 h->surplus_huge_pages_node[old_nid]--;
5059 h->surplus_huge_pages_node[new_nid]++;
5061 spin_unlock(&hugetlb_lock);