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/sched/mm.h>
23 #include <linux/mmdebug.h>
24 #include <linux/sched/signal.h>
25 #include <linux/rmap.h>
26 #include <linux/string_helpers.h>
27 #include <linux/swap.h>
28 #include <linux/swapops.h>
29 #include <linux/jhash.h>
30 #include <linux/numa.h>
31 #include <linux/llist.h>
32 #include <linux/cma.h>
35 #include <asm/pgalloc.h>
39 #include <linux/hugetlb.h>
40 #include <linux/hugetlb_cgroup.h>
41 #include <linux/node.h>
42 #include <linux/userfaultfd_k.h>
43 #include <linux/page_owner.h>
46 int hugetlb_max_hstate __read_mostly;
47 unsigned int default_hstate_idx;
48 struct hstate hstates[HUGE_MAX_HSTATE];
51 static struct cma *hugetlb_cma[MAX_NUMNODES];
53 static unsigned long hugetlb_cma_size __initdata;
56 * Minimum page order among possible hugepage sizes, set to a proper value
59 static unsigned int minimum_order __read_mostly = UINT_MAX;
61 __initdata LIST_HEAD(huge_boot_pages);
63 /* for command line parsing */
64 static struct hstate * __initdata parsed_hstate;
65 static unsigned long __initdata default_hstate_max_huge_pages;
66 static bool __initdata parsed_valid_hugepagesz = true;
67 static bool __initdata parsed_default_hugepagesz;
70 * Protects updates to hugepage_freelists, hugepage_activelist, nr_huge_pages,
71 * free_huge_pages, and surplus_huge_pages.
73 DEFINE_SPINLOCK(hugetlb_lock);
76 * Serializes faults on the same logical page. This is used to
77 * prevent spurious OOMs when the hugepage pool is fully utilized.
79 static int num_fault_mutexes;
80 struct mutex *hugetlb_fault_mutex_table ____cacheline_aligned_in_smp;
82 /* Forward declaration */
83 static int hugetlb_acct_memory(struct hstate *h, long delta);
85 static inline bool subpool_is_free(struct hugepage_subpool *spool)
89 if (spool->max_hpages != -1)
90 return spool->used_hpages == 0;
91 if (spool->min_hpages != -1)
92 return spool->rsv_hpages == spool->min_hpages;
97 static inline void unlock_or_release_subpool(struct hugepage_subpool *spool,
98 unsigned long irq_flags)
100 spin_unlock_irqrestore(&spool->lock, irq_flags);
102 /* If no pages are used, and no other handles to the subpool
103 * remain, give up any reservations based on minimum size and
104 * free the subpool */
105 if (subpool_is_free(spool)) {
106 if (spool->min_hpages != -1)
107 hugetlb_acct_memory(spool->hstate,
113 struct hugepage_subpool *hugepage_new_subpool(struct hstate *h, long max_hpages,
116 struct hugepage_subpool *spool;
118 spool = kzalloc(sizeof(*spool), GFP_KERNEL);
122 spin_lock_init(&spool->lock);
124 spool->max_hpages = max_hpages;
126 spool->min_hpages = min_hpages;
128 if (min_hpages != -1 && hugetlb_acct_memory(h, min_hpages)) {
132 spool->rsv_hpages = min_hpages;
137 void hugepage_put_subpool(struct hugepage_subpool *spool)
141 spin_lock_irqsave(&spool->lock, flags);
142 BUG_ON(!spool->count);
144 unlock_or_release_subpool(spool, flags);
148 * Subpool accounting for allocating and reserving pages.
149 * Return -ENOMEM if there are not enough resources to satisfy the
150 * request. Otherwise, return the number of pages by which the
151 * global pools must be adjusted (upward). The returned value may
152 * only be different than the passed value (delta) in the case where
153 * a subpool minimum size must be maintained.
155 static long hugepage_subpool_get_pages(struct hugepage_subpool *spool,
163 spin_lock_irq(&spool->lock);
165 if (spool->max_hpages != -1) { /* maximum size accounting */
166 if ((spool->used_hpages + delta) <= spool->max_hpages)
167 spool->used_hpages += delta;
174 /* minimum size accounting */
175 if (spool->min_hpages != -1 && spool->rsv_hpages) {
176 if (delta > spool->rsv_hpages) {
178 * Asking for more reserves than those already taken on
179 * behalf of subpool. Return difference.
181 ret = delta - spool->rsv_hpages;
182 spool->rsv_hpages = 0;
184 ret = 0; /* reserves already accounted for */
185 spool->rsv_hpages -= delta;
190 spin_unlock_irq(&spool->lock);
195 * Subpool accounting for freeing and unreserving pages.
196 * Return the number of global page reservations that must be dropped.
197 * The return value may only be different than the passed value (delta)
198 * in the case where a subpool minimum size must be maintained.
200 static long hugepage_subpool_put_pages(struct hugepage_subpool *spool,
209 spin_lock_irqsave(&spool->lock, flags);
211 if (spool->max_hpages != -1) /* maximum size accounting */
212 spool->used_hpages -= delta;
214 /* minimum size accounting */
215 if (spool->min_hpages != -1 && spool->used_hpages < spool->min_hpages) {
216 if (spool->rsv_hpages + delta <= spool->min_hpages)
219 ret = spool->rsv_hpages + delta - spool->min_hpages;
221 spool->rsv_hpages += delta;
222 if (spool->rsv_hpages > spool->min_hpages)
223 spool->rsv_hpages = spool->min_hpages;
227 * If hugetlbfs_put_super couldn't free spool due to an outstanding
228 * quota reference, free it now.
230 unlock_or_release_subpool(spool, flags);
235 static inline struct hugepage_subpool *subpool_inode(struct inode *inode)
237 return HUGETLBFS_SB(inode->i_sb)->spool;
240 static inline struct hugepage_subpool *subpool_vma(struct vm_area_struct *vma)
242 return subpool_inode(file_inode(vma->vm_file));
245 /* Helper that removes a struct file_region from the resv_map cache and returns
248 static struct file_region *
249 get_file_region_entry_from_cache(struct resv_map *resv, long from, long to)
251 struct file_region *nrg = NULL;
253 VM_BUG_ON(resv->region_cache_count <= 0);
255 resv->region_cache_count--;
256 nrg = list_first_entry(&resv->region_cache, struct file_region, link);
257 list_del(&nrg->link);
265 static void copy_hugetlb_cgroup_uncharge_info(struct file_region *nrg,
266 struct file_region *rg)
268 #ifdef CONFIG_CGROUP_HUGETLB
269 nrg->reservation_counter = rg->reservation_counter;
276 /* Helper that records hugetlb_cgroup uncharge info. */
277 static void record_hugetlb_cgroup_uncharge_info(struct hugetlb_cgroup *h_cg,
279 struct resv_map *resv,
280 struct file_region *nrg)
282 #ifdef CONFIG_CGROUP_HUGETLB
284 nrg->reservation_counter =
285 &h_cg->rsvd_hugepage[hstate_index(h)];
286 nrg->css = &h_cg->css;
288 * The caller will hold exactly one h_cg->css reference for the
289 * whole contiguous reservation region. But this area might be
290 * scattered when there are already some file_regions reside in
291 * it. As a result, many file_regions may share only one css
292 * reference. In order to ensure that one file_region must hold
293 * exactly one h_cg->css reference, we should do css_get for
294 * each file_region and leave the reference held by caller
298 if (!resv->pages_per_hpage)
299 resv->pages_per_hpage = pages_per_huge_page(h);
300 /* pages_per_hpage should be the same for all entries in
303 VM_BUG_ON(resv->pages_per_hpage != pages_per_huge_page(h));
305 nrg->reservation_counter = NULL;
311 static void put_uncharge_info(struct file_region *rg)
313 #ifdef CONFIG_CGROUP_HUGETLB
319 static bool has_same_uncharge_info(struct file_region *rg,
320 struct file_region *org)
322 #ifdef CONFIG_CGROUP_HUGETLB
324 rg->reservation_counter == org->reservation_counter &&
332 static void coalesce_file_region(struct resv_map *resv, struct file_region *rg)
334 struct file_region *nrg = NULL, *prg = NULL;
336 prg = list_prev_entry(rg, link);
337 if (&prg->link != &resv->regions && prg->to == rg->from &&
338 has_same_uncharge_info(prg, rg)) {
342 put_uncharge_info(rg);
348 nrg = list_next_entry(rg, link);
349 if (&nrg->link != &resv->regions && nrg->from == rg->to &&
350 has_same_uncharge_info(nrg, rg)) {
351 nrg->from = rg->from;
354 put_uncharge_info(rg);
360 hugetlb_resv_map_add(struct resv_map *map, struct file_region *rg, long from,
361 long to, struct hstate *h, struct hugetlb_cgroup *cg,
362 long *regions_needed)
364 struct file_region *nrg;
366 if (!regions_needed) {
367 nrg = get_file_region_entry_from_cache(map, from, to);
368 record_hugetlb_cgroup_uncharge_info(cg, h, map, nrg);
369 list_add(&nrg->link, rg->link.prev);
370 coalesce_file_region(map, nrg);
372 *regions_needed += 1;
378 * Must be called with resv->lock held.
380 * Calling this with regions_needed != NULL will count the number of pages
381 * to be added but will not modify the linked list. And regions_needed will
382 * indicate the number of file_regions needed in the cache to carry out to add
383 * the regions for this range.
385 static long add_reservation_in_range(struct resv_map *resv, long f, long t,
386 struct hugetlb_cgroup *h_cg,
387 struct hstate *h, long *regions_needed)
390 struct list_head *head = &resv->regions;
391 long last_accounted_offset = f;
392 struct file_region *rg = NULL, *trg = NULL;
397 /* In this loop, we essentially handle an entry for the range
398 * [last_accounted_offset, rg->from), at every iteration, with some
401 list_for_each_entry_safe(rg, trg, head, link) {
402 /* Skip irrelevant regions that start before our range. */
404 /* If this region ends after the last accounted offset,
405 * then we need to update last_accounted_offset.
407 if (rg->to > last_accounted_offset)
408 last_accounted_offset = rg->to;
412 /* When we find a region that starts beyond our range, we've
418 /* Add an entry for last_accounted_offset -> rg->from, and
419 * update last_accounted_offset.
421 if (rg->from > last_accounted_offset)
422 add += hugetlb_resv_map_add(resv, rg,
423 last_accounted_offset,
427 last_accounted_offset = rg->to;
430 /* Handle the case where our range extends beyond
431 * last_accounted_offset.
433 if (last_accounted_offset < t)
434 add += hugetlb_resv_map_add(resv, rg, last_accounted_offset,
435 t, h, h_cg, regions_needed);
441 /* Must be called with resv->lock acquired. Will drop lock to allocate entries.
443 static int allocate_file_region_entries(struct resv_map *resv,
445 __must_hold(&resv->lock)
447 struct list_head allocated_regions;
448 int to_allocate = 0, i = 0;
449 struct file_region *trg = NULL, *rg = NULL;
451 VM_BUG_ON(regions_needed < 0);
453 INIT_LIST_HEAD(&allocated_regions);
456 * Check for sufficient descriptors in the cache to accommodate
457 * the number of in progress add operations plus regions_needed.
459 * This is a while loop because when we drop the lock, some other call
460 * to region_add or region_del may have consumed some region_entries,
461 * so we keep looping here until we finally have enough entries for
462 * (adds_in_progress + regions_needed).
464 while (resv->region_cache_count <
465 (resv->adds_in_progress + regions_needed)) {
466 to_allocate = resv->adds_in_progress + regions_needed -
467 resv->region_cache_count;
469 /* At this point, we should have enough entries in the cache
470 * for all the existings adds_in_progress. We should only be
471 * needing to allocate for regions_needed.
473 VM_BUG_ON(resv->region_cache_count < resv->adds_in_progress);
475 spin_unlock(&resv->lock);
476 for (i = 0; i < to_allocate; i++) {
477 trg = kmalloc(sizeof(*trg), GFP_KERNEL);
480 list_add(&trg->link, &allocated_regions);
483 spin_lock(&resv->lock);
485 list_splice(&allocated_regions, &resv->region_cache);
486 resv->region_cache_count += to_allocate;
492 list_for_each_entry_safe(rg, trg, &allocated_regions, link) {
500 * Add the huge page range represented by [f, t) to the reserve
501 * map. Regions will be taken from the cache to fill in this range.
502 * Sufficient regions should exist in the cache due to the previous
503 * call to region_chg with the same range, but in some cases the cache will not
504 * have sufficient entries due to races with other code doing region_add or
505 * region_del. The extra needed entries will be allocated.
507 * regions_needed is the out value provided by a previous call to region_chg.
509 * Return the number of new huge pages added to the map. This number is greater
510 * than or equal to zero. If file_region entries needed to be allocated for
511 * this operation and we were not able to allocate, it returns -ENOMEM.
512 * region_add of regions of length 1 never allocate file_regions and cannot
513 * fail; region_chg will always allocate at least 1 entry and a region_add for
514 * 1 page will only require at most 1 entry.
516 static long region_add(struct resv_map *resv, long f, long t,
517 long in_regions_needed, struct hstate *h,
518 struct hugetlb_cgroup *h_cg)
520 long add = 0, actual_regions_needed = 0;
522 spin_lock(&resv->lock);
525 /* Count how many regions are actually needed to execute this add. */
526 add_reservation_in_range(resv, f, t, NULL, NULL,
527 &actual_regions_needed);
530 * Check for sufficient descriptors in the cache to accommodate
531 * this add operation. Note that actual_regions_needed may be greater
532 * than in_regions_needed, as the resv_map may have been modified since
533 * the region_chg call. In this case, we need to make sure that we
534 * allocate extra entries, such that we have enough for all the
535 * existing adds_in_progress, plus the excess needed for this
538 if (actual_regions_needed > in_regions_needed &&
539 resv->region_cache_count <
540 resv->adds_in_progress +
541 (actual_regions_needed - in_regions_needed)) {
542 /* region_add operation of range 1 should never need to
543 * allocate file_region entries.
545 VM_BUG_ON(t - f <= 1);
547 if (allocate_file_region_entries(
548 resv, actual_regions_needed - in_regions_needed)) {
555 add = add_reservation_in_range(resv, f, t, h_cg, h, NULL);
557 resv->adds_in_progress -= in_regions_needed;
559 spin_unlock(&resv->lock);
564 * Examine the existing reserve map and determine how many
565 * huge pages in the specified range [f, t) are NOT currently
566 * represented. This routine is called before a subsequent
567 * call to region_add that will actually modify the reserve
568 * map to add the specified range [f, t). region_chg does
569 * not change the number of huge pages represented by the
570 * map. A number of new file_region structures is added to the cache as a
571 * placeholder, for the subsequent region_add call to use. At least 1
572 * file_region structure is added.
574 * out_regions_needed is the number of regions added to the
575 * resv->adds_in_progress. This value needs to be provided to a follow up call
576 * to region_add or region_abort for proper accounting.
578 * Returns the number of huge pages that need to be added to the existing
579 * reservation map for the range [f, t). This number is greater or equal to
580 * zero. -ENOMEM is returned if a new file_region structure or cache entry
581 * is needed and can not be allocated.
583 static long region_chg(struct resv_map *resv, long f, long t,
584 long *out_regions_needed)
588 spin_lock(&resv->lock);
590 /* Count how many hugepages in this range are NOT represented. */
591 chg = add_reservation_in_range(resv, f, t, NULL, NULL,
594 if (*out_regions_needed == 0)
595 *out_regions_needed = 1;
597 if (allocate_file_region_entries(resv, *out_regions_needed))
600 resv->adds_in_progress += *out_regions_needed;
602 spin_unlock(&resv->lock);
607 * Abort the in progress add operation. The adds_in_progress field
608 * of the resv_map keeps track of the operations in progress between
609 * calls to region_chg and region_add. Operations are sometimes
610 * aborted after the call to region_chg. In such cases, region_abort
611 * is called to decrement the adds_in_progress counter. regions_needed
612 * is the value returned by the region_chg call, it is used to decrement
613 * the adds_in_progress counter.
615 * NOTE: The range arguments [f, t) are not needed or used in this
616 * routine. They are kept to make reading the calling code easier as
617 * arguments will match the associated region_chg call.
619 static void region_abort(struct resv_map *resv, long f, long t,
622 spin_lock(&resv->lock);
623 VM_BUG_ON(!resv->region_cache_count);
624 resv->adds_in_progress -= regions_needed;
625 spin_unlock(&resv->lock);
629 * Delete the specified range [f, t) from the reserve map. If the
630 * t parameter is LONG_MAX, this indicates that ALL regions after f
631 * should be deleted. Locate the regions which intersect [f, t)
632 * and either trim, delete or split the existing regions.
634 * Returns the number of huge pages deleted from the reserve map.
635 * In the normal case, the return value is zero or more. In the
636 * case where a region must be split, a new region descriptor must
637 * be allocated. If the allocation fails, -ENOMEM will be returned.
638 * NOTE: If the parameter t == LONG_MAX, then we will never split
639 * a region and possibly return -ENOMEM. Callers specifying
640 * t == LONG_MAX do not need to check for -ENOMEM error.
642 static long region_del(struct resv_map *resv, long f, long t)
644 struct list_head *head = &resv->regions;
645 struct file_region *rg, *trg;
646 struct file_region *nrg = NULL;
650 spin_lock(&resv->lock);
651 list_for_each_entry_safe(rg, trg, head, link) {
653 * Skip regions before the range to be deleted. file_region
654 * ranges are normally of the form [from, to). However, there
655 * may be a "placeholder" entry in the map which is of the form
656 * (from, to) with from == to. Check for placeholder entries
657 * at the beginning of the range to be deleted.
659 if (rg->to <= f && (rg->to != rg->from || rg->to != f))
665 if (f > rg->from && t < rg->to) { /* Must split region */
667 * Check for an entry in the cache before dropping
668 * lock and attempting allocation.
671 resv->region_cache_count > resv->adds_in_progress) {
672 nrg = list_first_entry(&resv->region_cache,
675 list_del(&nrg->link);
676 resv->region_cache_count--;
680 spin_unlock(&resv->lock);
681 nrg = kmalloc(sizeof(*nrg), GFP_KERNEL);
688 hugetlb_cgroup_uncharge_file_region(
689 resv, rg, t - f, false);
691 /* New entry for end of split region */
695 copy_hugetlb_cgroup_uncharge_info(nrg, rg);
697 INIT_LIST_HEAD(&nrg->link);
699 /* Original entry is trimmed */
702 list_add(&nrg->link, &rg->link);
707 if (f <= rg->from && t >= rg->to) { /* Remove entire region */
708 del += rg->to - rg->from;
709 hugetlb_cgroup_uncharge_file_region(resv, rg,
710 rg->to - rg->from, true);
716 if (f <= rg->from) { /* Trim beginning of region */
717 hugetlb_cgroup_uncharge_file_region(resv, rg,
718 t - rg->from, false);
722 } else { /* Trim end of region */
723 hugetlb_cgroup_uncharge_file_region(resv, rg,
731 spin_unlock(&resv->lock);
737 * A rare out of memory error was encountered which prevented removal of
738 * the reserve map region for a page. The huge page itself was free'ed
739 * and removed from the page cache. This routine will adjust the subpool
740 * usage count, and the global reserve count if needed. By incrementing
741 * these counts, the reserve map entry which could not be deleted will
742 * appear as a "reserved" entry instead of simply dangling with incorrect
745 void hugetlb_fix_reserve_counts(struct inode *inode)
747 struct hugepage_subpool *spool = subpool_inode(inode);
749 bool reserved = false;
751 rsv_adjust = hugepage_subpool_get_pages(spool, 1);
752 if (rsv_adjust > 0) {
753 struct hstate *h = hstate_inode(inode);
755 if (!hugetlb_acct_memory(h, 1))
757 } else if (!rsv_adjust) {
762 pr_warn("hugetlb: Huge Page Reserved count may go negative.\n");
766 * Count and return the number of huge pages in the reserve map
767 * that intersect with the range [f, t).
769 static long region_count(struct resv_map *resv, long f, long t)
771 struct list_head *head = &resv->regions;
772 struct file_region *rg;
775 spin_lock(&resv->lock);
776 /* Locate each segment we overlap with, and count that overlap. */
777 list_for_each_entry(rg, head, link) {
786 seg_from = max(rg->from, f);
787 seg_to = min(rg->to, t);
789 chg += seg_to - seg_from;
791 spin_unlock(&resv->lock);
797 * Convert the address within this vma to the page offset within
798 * the mapping, in pagecache page units; huge pages here.
800 static pgoff_t vma_hugecache_offset(struct hstate *h,
801 struct vm_area_struct *vma, unsigned long address)
803 return ((address - vma->vm_start) >> huge_page_shift(h)) +
804 (vma->vm_pgoff >> huge_page_order(h));
807 pgoff_t linear_hugepage_index(struct vm_area_struct *vma,
808 unsigned long address)
810 return vma_hugecache_offset(hstate_vma(vma), vma, address);
812 EXPORT_SYMBOL_GPL(linear_hugepage_index);
815 * Return the size of the pages allocated when backing a VMA. In the majority
816 * cases this will be same size as used by the page table entries.
818 unsigned long vma_kernel_pagesize(struct vm_area_struct *vma)
820 if (vma->vm_ops && vma->vm_ops->pagesize)
821 return vma->vm_ops->pagesize(vma);
824 EXPORT_SYMBOL_GPL(vma_kernel_pagesize);
827 * Return the page size being used by the MMU to back a VMA. In the majority
828 * of cases, the page size used by the kernel matches the MMU size. On
829 * architectures where it differs, an architecture-specific 'strong'
830 * version of this symbol is required.
832 __weak unsigned long vma_mmu_pagesize(struct vm_area_struct *vma)
834 return vma_kernel_pagesize(vma);
838 * Flags for MAP_PRIVATE reservations. These are stored in the bottom
839 * bits of the reservation map pointer, which are always clear due to
842 #define HPAGE_RESV_OWNER (1UL << 0)
843 #define HPAGE_RESV_UNMAPPED (1UL << 1)
844 #define HPAGE_RESV_MASK (HPAGE_RESV_OWNER | HPAGE_RESV_UNMAPPED)
847 * These helpers are used to track how many pages are reserved for
848 * faults in a MAP_PRIVATE mapping. Only the process that called mmap()
849 * is guaranteed to have their future faults succeed.
851 * With the exception of reset_vma_resv_huge_pages() which is called at fork(),
852 * the reserve counters are updated with the hugetlb_lock held. It is safe
853 * to reset the VMA at fork() time as it is not in use yet and there is no
854 * chance of the global counters getting corrupted as a result of the values.
856 * The private mapping reservation is represented in a subtly different
857 * manner to a shared mapping. A shared mapping has a region map associated
858 * with the underlying file, this region map represents the backing file
859 * pages which have ever had a reservation assigned which this persists even
860 * after the page is instantiated. A private mapping has a region map
861 * associated with the original mmap which is attached to all VMAs which
862 * reference it, this region map represents those offsets which have consumed
863 * reservation ie. where pages have been instantiated.
865 static unsigned long get_vma_private_data(struct vm_area_struct *vma)
867 return (unsigned long)vma->vm_private_data;
870 static void set_vma_private_data(struct vm_area_struct *vma,
873 vma->vm_private_data = (void *)value;
877 resv_map_set_hugetlb_cgroup_uncharge_info(struct resv_map *resv_map,
878 struct hugetlb_cgroup *h_cg,
881 #ifdef CONFIG_CGROUP_HUGETLB
883 resv_map->reservation_counter = NULL;
884 resv_map->pages_per_hpage = 0;
885 resv_map->css = NULL;
887 resv_map->reservation_counter =
888 &h_cg->rsvd_hugepage[hstate_index(h)];
889 resv_map->pages_per_hpage = pages_per_huge_page(h);
890 resv_map->css = &h_cg->css;
895 struct resv_map *resv_map_alloc(void)
897 struct resv_map *resv_map = kmalloc(sizeof(*resv_map), GFP_KERNEL);
898 struct file_region *rg = kmalloc(sizeof(*rg), GFP_KERNEL);
900 if (!resv_map || !rg) {
906 kref_init(&resv_map->refs);
907 spin_lock_init(&resv_map->lock);
908 INIT_LIST_HEAD(&resv_map->regions);
910 resv_map->adds_in_progress = 0;
912 * Initialize these to 0. On shared mappings, 0's here indicate these
913 * fields don't do cgroup accounting. On private mappings, these will be
914 * re-initialized to the proper values, to indicate that hugetlb cgroup
915 * reservations are to be un-charged from here.
917 resv_map_set_hugetlb_cgroup_uncharge_info(resv_map, NULL, NULL);
919 INIT_LIST_HEAD(&resv_map->region_cache);
920 list_add(&rg->link, &resv_map->region_cache);
921 resv_map->region_cache_count = 1;
926 void resv_map_release(struct kref *ref)
928 struct resv_map *resv_map = container_of(ref, struct resv_map, refs);
929 struct list_head *head = &resv_map->region_cache;
930 struct file_region *rg, *trg;
932 /* Clear out any active regions before we release the map. */
933 region_del(resv_map, 0, LONG_MAX);
935 /* ... and any entries left in the cache */
936 list_for_each_entry_safe(rg, trg, head, link) {
941 VM_BUG_ON(resv_map->adds_in_progress);
946 static inline struct resv_map *inode_resv_map(struct inode *inode)
949 * At inode evict time, i_mapping may not point to the original
950 * address space within the inode. This original address space
951 * contains the pointer to the resv_map. So, always use the
952 * address space embedded within the inode.
953 * The VERY common case is inode->mapping == &inode->i_data but,
954 * this may not be true for device special inodes.
956 return (struct resv_map *)(&inode->i_data)->private_data;
959 static struct resv_map *vma_resv_map(struct vm_area_struct *vma)
961 VM_BUG_ON_VMA(!is_vm_hugetlb_page(vma), vma);
962 if (vma->vm_flags & VM_MAYSHARE) {
963 struct address_space *mapping = vma->vm_file->f_mapping;
964 struct inode *inode = mapping->host;
966 return inode_resv_map(inode);
969 return (struct resv_map *)(get_vma_private_data(vma) &
974 static void set_vma_resv_map(struct vm_area_struct *vma, struct resv_map *map)
976 VM_BUG_ON_VMA(!is_vm_hugetlb_page(vma), vma);
977 VM_BUG_ON_VMA(vma->vm_flags & VM_MAYSHARE, vma);
979 set_vma_private_data(vma, (get_vma_private_data(vma) &
980 HPAGE_RESV_MASK) | (unsigned long)map);
983 static void set_vma_resv_flags(struct vm_area_struct *vma, unsigned long flags)
985 VM_BUG_ON_VMA(!is_vm_hugetlb_page(vma), vma);
986 VM_BUG_ON_VMA(vma->vm_flags & VM_MAYSHARE, vma);
988 set_vma_private_data(vma, get_vma_private_data(vma) | flags);
991 static int is_vma_resv_set(struct vm_area_struct *vma, unsigned long flag)
993 VM_BUG_ON_VMA(!is_vm_hugetlb_page(vma), vma);
995 return (get_vma_private_data(vma) & flag) != 0;
998 /* Reset counters to 0 and clear all HPAGE_RESV_* flags */
999 void reset_vma_resv_huge_pages(struct vm_area_struct *vma)
1001 VM_BUG_ON_VMA(!is_vm_hugetlb_page(vma), vma);
1002 if (!(vma->vm_flags & VM_MAYSHARE))
1003 vma->vm_private_data = (void *)0;
1006 /* Returns true if the VMA has associated reserve pages */
1007 static bool vma_has_reserves(struct vm_area_struct *vma, long chg)
1009 if (vma->vm_flags & VM_NORESERVE) {
1011 * This address is already reserved by other process(chg == 0),
1012 * so, we should decrement reserved count. Without decrementing,
1013 * reserve count remains after releasing inode, because this
1014 * allocated page will go into page cache and is regarded as
1015 * coming from reserved pool in releasing step. Currently, we
1016 * don't have any other solution to deal with this situation
1017 * properly, so add work-around here.
1019 if (vma->vm_flags & VM_MAYSHARE && chg == 0)
1025 /* Shared mappings always use reserves */
1026 if (vma->vm_flags & VM_MAYSHARE) {
1028 * We know VM_NORESERVE is not set. Therefore, there SHOULD
1029 * be a region map for all pages. The only situation where
1030 * there is no region map is if a hole was punched via
1031 * fallocate. In this case, there really are no reserves to
1032 * use. This situation is indicated if chg != 0.
1041 * Only the process that called mmap() has reserves for
1044 if (is_vma_resv_set(vma, HPAGE_RESV_OWNER)) {
1046 * Like the shared case above, a hole punch or truncate
1047 * could have been performed on the private mapping.
1048 * Examine the value of chg to determine if reserves
1049 * actually exist or were previously consumed.
1050 * Very Subtle - The value of chg comes from a previous
1051 * call to vma_needs_reserves(). The reserve map for
1052 * private mappings has different (opposite) semantics
1053 * than that of shared mappings. vma_needs_reserves()
1054 * has already taken this difference in semantics into
1055 * account. Therefore, the meaning of chg is the same
1056 * as in the shared case above. Code could easily be
1057 * combined, but keeping it separate draws attention to
1058 * subtle differences.
1069 static void enqueue_huge_page(struct hstate *h, struct page *page)
1071 int nid = page_to_nid(page);
1072 list_move(&page->lru, &h->hugepage_freelists[nid]);
1073 h->free_huge_pages++;
1074 h->free_huge_pages_node[nid]++;
1075 SetHPageFreed(page);
1078 static struct page *dequeue_huge_page_node_exact(struct hstate *h, int nid)
1081 bool nocma = !!(current->flags & PF_MEMALLOC_NOCMA);
1083 list_for_each_entry(page, &h->hugepage_freelists[nid], lru) {
1084 if (nocma && is_migrate_cma_page(page))
1087 if (PageHWPoison(page))
1090 list_move(&page->lru, &h->hugepage_activelist);
1091 set_page_refcounted(page);
1092 ClearHPageFreed(page);
1093 h->free_huge_pages--;
1094 h->free_huge_pages_node[nid]--;
1101 static struct page *dequeue_huge_page_nodemask(struct hstate *h, gfp_t gfp_mask, int nid,
1104 unsigned int cpuset_mems_cookie;
1105 struct zonelist *zonelist;
1108 int node = NUMA_NO_NODE;
1110 zonelist = node_zonelist(nid, gfp_mask);
1113 cpuset_mems_cookie = read_mems_allowed_begin();
1114 for_each_zone_zonelist_nodemask(zone, z, zonelist, gfp_zone(gfp_mask), nmask) {
1117 if (!cpuset_zone_allowed(zone, gfp_mask))
1120 * no need to ask again on the same node. Pool is node rather than
1123 if (zone_to_nid(zone) == node)
1125 node = zone_to_nid(zone);
1127 page = dequeue_huge_page_node_exact(h, node);
1131 if (unlikely(read_mems_allowed_retry(cpuset_mems_cookie)))
1137 static struct page *dequeue_huge_page_vma(struct hstate *h,
1138 struct vm_area_struct *vma,
1139 unsigned long address, int avoid_reserve,
1143 struct mempolicy *mpol;
1145 nodemask_t *nodemask;
1149 * A child process with MAP_PRIVATE mappings created by their parent
1150 * have no page reserves. This check ensures that reservations are
1151 * not "stolen". The child may still get SIGKILLed
1153 if (!vma_has_reserves(vma, chg) &&
1154 h->free_huge_pages - h->resv_huge_pages == 0)
1157 /* If reserves cannot be used, ensure enough pages are in the pool */
1158 if (avoid_reserve && h->free_huge_pages - h->resv_huge_pages == 0)
1161 gfp_mask = htlb_alloc_mask(h);
1162 nid = huge_node(vma, address, gfp_mask, &mpol, &nodemask);
1163 page = dequeue_huge_page_nodemask(h, gfp_mask, nid, nodemask);
1164 if (page && !avoid_reserve && vma_has_reserves(vma, chg)) {
1165 SetHPageRestoreReserve(page);
1166 h->resv_huge_pages--;
1169 mpol_cond_put(mpol);
1177 * common helper functions for hstate_next_node_to_{alloc|free}.
1178 * We may have allocated or freed a huge page based on a different
1179 * nodes_allowed previously, so h->next_node_to_{alloc|free} might
1180 * be outside of *nodes_allowed. Ensure that we use an allowed
1181 * node for alloc or free.
1183 static int next_node_allowed(int nid, nodemask_t *nodes_allowed)
1185 nid = next_node_in(nid, *nodes_allowed);
1186 VM_BUG_ON(nid >= MAX_NUMNODES);
1191 static int get_valid_node_allowed(int nid, nodemask_t *nodes_allowed)
1193 if (!node_isset(nid, *nodes_allowed))
1194 nid = next_node_allowed(nid, nodes_allowed);
1199 * returns the previously saved node ["this node"] from which to
1200 * allocate a persistent huge page for the pool and advance the
1201 * next node from which to allocate, handling wrap at end of node
1204 static int hstate_next_node_to_alloc(struct hstate *h,
1205 nodemask_t *nodes_allowed)
1209 VM_BUG_ON(!nodes_allowed);
1211 nid = get_valid_node_allowed(h->next_nid_to_alloc, nodes_allowed);
1212 h->next_nid_to_alloc = next_node_allowed(nid, nodes_allowed);
1218 * helper for remove_pool_huge_page() - return the previously saved
1219 * node ["this node"] from which to free a huge page. Advance the
1220 * next node id whether or not we find a free huge page to free so
1221 * that the next attempt to free addresses the next node.
1223 static int hstate_next_node_to_free(struct hstate *h, nodemask_t *nodes_allowed)
1227 VM_BUG_ON(!nodes_allowed);
1229 nid = get_valid_node_allowed(h->next_nid_to_free, nodes_allowed);
1230 h->next_nid_to_free = next_node_allowed(nid, nodes_allowed);
1235 #define for_each_node_mask_to_alloc(hs, nr_nodes, node, mask) \
1236 for (nr_nodes = nodes_weight(*mask); \
1238 ((node = hstate_next_node_to_alloc(hs, mask)) || 1); \
1241 #define for_each_node_mask_to_free(hs, nr_nodes, node, mask) \
1242 for (nr_nodes = nodes_weight(*mask); \
1244 ((node = hstate_next_node_to_free(hs, mask)) || 1); \
1247 #ifdef CONFIG_ARCH_HAS_GIGANTIC_PAGE
1248 static void destroy_compound_gigantic_page(struct page *page,
1252 int nr_pages = 1 << order;
1253 struct page *p = page + 1;
1255 atomic_set(compound_mapcount_ptr(page), 0);
1256 atomic_set(compound_pincount_ptr(page), 0);
1258 for (i = 1; i < nr_pages; i++, p = mem_map_next(p, page, i)) {
1259 clear_compound_head(p);
1260 set_page_refcounted(p);
1263 set_compound_order(page, 0);
1264 page[1].compound_nr = 0;
1265 __ClearPageHead(page);
1268 static void free_gigantic_page(struct page *page, unsigned int order)
1271 * If the page isn't allocated using the cma allocator,
1272 * cma_release() returns false.
1275 if (cma_release(hugetlb_cma[page_to_nid(page)], page, 1 << order))
1279 free_contig_range(page_to_pfn(page), 1 << order);
1282 #ifdef CONFIG_CONTIG_ALLOC
1283 static struct page *alloc_gigantic_page(struct hstate *h, gfp_t gfp_mask,
1284 int nid, nodemask_t *nodemask)
1286 unsigned long nr_pages = pages_per_huge_page(h);
1287 if (nid == NUMA_NO_NODE)
1288 nid = numa_mem_id();
1295 if (hugetlb_cma[nid]) {
1296 page = cma_alloc(hugetlb_cma[nid], nr_pages,
1297 huge_page_order(h), true);
1302 if (!(gfp_mask & __GFP_THISNODE)) {
1303 for_each_node_mask(node, *nodemask) {
1304 if (node == nid || !hugetlb_cma[node])
1307 page = cma_alloc(hugetlb_cma[node], nr_pages,
1308 huge_page_order(h), true);
1316 return alloc_contig_pages(nr_pages, gfp_mask, nid, nodemask);
1319 static void prep_new_huge_page(struct hstate *h, struct page *page, int nid);
1320 static void prep_compound_gigantic_page(struct page *page, unsigned int order);
1321 #else /* !CONFIG_CONTIG_ALLOC */
1322 static struct page *alloc_gigantic_page(struct hstate *h, gfp_t gfp_mask,
1323 int nid, nodemask_t *nodemask)
1327 #endif /* CONFIG_CONTIG_ALLOC */
1329 #else /* !CONFIG_ARCH_HAS_GIGANTIC_PAGE */
1330 static struct page *alloc_gigantic_page(struct hstate *h, gfp_t gfp_mask,
1331 int nid, nodemask_t *nodemask)
1335 static inline void free_gigantic_page(struct page *page, unsigned int order) { }
1336 static inline void destroy_compound_gigantic_page(struct page *page,
1337 unsigned int order) { }
1341 * Remove hugetlb page from lists, and update dtor so that page appears
1342 * as just a compound page. A reference is held on the page.
1344 * Must be called with hugetlb lock held.
1346 static void remove_hugetlb_page(struct hstate *h, struct page *page,
1347 bool adjust_surplus)
1349 int nid = page_to_nid(page);
1351 VM_BUG_ON_PAGE(hugetlb_cgroup_from_page(page), page);
1352 VM_BUG_ON_PAGE(hugetlb_cgroup_from_page_rsvd(page), page);
1354 if (hstate_is_gigantic(h) && !gigantic_page_runtime_supported())
1357 list_del(&page->lru);
1359 if (HPageFreed(page)) {
1360 h->free_huge_pages--;
1361 h->free_huge_pages_node[nid]--;
1363 if (adjust_surplus) {
1364 h->surplus_huge_pages--;
1365 h->surplus_huge_pages_node[nid]--;
1368 set_page_refcounted(page);
1369 set_compound_page_dtor(page, NULL_COMPOUND_DTOR);
1372 h->nr_huge_pages_node[nid]--;
1375 static void update_and_free_page(struct hstate *h, struct page *page)
1378 struct page *subpage = page;
1380 if (hstate_is_gigantic(h) && !gigantic_page_runtime_supported())
1383 for (i = 0; i < pages_per_huge_page(h);
1384 i++, subpage = mem_map_next(subpage, page, i)) {
1385 subpage->flags &= ~(1 << PG_locked | 1 << PG_error |
1386 1 << PG_referenced | 1 << PG_dirty |
1387 1 << PG_active | 1 << PG_private |
1390 if (hstate_is_gigantic(h)) {
1391 destroy_compound_gigantic_page(page, huge_page_order(h));
1392 free_gigantic_page(page, huge_page_order(h));
1394 __free_pages(page, huge_page_order(h));
1398 static void update_and_free_pages_bulk(struct hstate *h, struct list_head *list)
1400 struct page *page, *t_page;
1402 list_for_each_entry_safe(page, t_page, list, lru) {
1403 update_and_free_page(h, page);
1408 struct hstate *size_to_hstate(unsigned long size)
1412 for_each_hstate(h) {
1413 if (huge_page_size(h) == size)
1419 void free_huge_page(struct page *page)
1422 * Can't pass hstate in here because it is called from the
1423 * compound page destructor.
1425 struct hstate *h = page_hstate(page);
1426 int nid = page_to_nid(page);
1427 struct hugepage_subpool *spool = hugetlb_page_subpool(page);
1428 bool restore_reserve;
1429 unsigned long flags;
1431 VM_BUG_ON_PAGE(page_count(page), page);
1432 VM_BUG_ON_PAGE(page_mapcount(page), page);
1434 hugetlb_set_page_subpool(page, NULL);
1435 page->mapping = NULL;
1436 restore_reserve = HPageRestoreReserve(page);
1437 ClearHPageRestoreReserve(page);
1440 * If HPageRestoreReserve was set on page, page allocation consumed a
1441 * reservation. If the page was associated with a subpool, there
1442 * would have been a page reserved in the subpool before allocation
1443 * via hugepage_subpool_get_pages(). Since we are 'restoring' the
1444 * reservation, do not call hugepage_subpool_put_pages() as this will
1445 * remove the reserved page from the subpool.
1447 if (!restore_reserve) {
1449 * A return code of zero implies that the subpool will be
1450 * under its minimum size if the reservation is not restored
1451 * after page is free. Therefore, force restore_reserve
1454 if (hugepage_subpool_put_pages(spool, 1) == 0)
1455 restore_reserve = true;
1458 spin_lock_irqsave(&hugetlb_lock, flags);
1459 ClearHPageMigratable(page);
1460 hugetlb_cgroup_uncharge_page(hstate_index(h),
1461 pages_per_huge_page(h), page);
1462 hugetlb_cgroup_uncharge_page_rsvd(hstate_index(h),
1463 pages_per_huge_page(h), page);
1464 if (restore_reserve)
1465 h->resv_huge_pages++;
1467 if (HPageTemporary(page)) {
1468 remove_hugetlb_page(h, page, false);
1469 spin_unlock_irqrestore(&hugetlb_lock, flags);
1470 update_and_free_page(h, page);
1471 } else if (h->surplus_huge_pages_node[nid]) {
1472 /* remove the page from active list */
1473 remove_hugetlb_page(h, page, true);
1474 spin_unlock_irqrestore(&hugetlb_lock, flags);
1475 update_and_free_page(h, page);
1477 arch_clear_hugepage_flags(page);
1478 enqueue_huge_page(h, page);
1479 spin_unlock_irqrestore(&hugetlb_lock, flags);
1483 static void prep_new_huge_page(struct hstate *h, struct page *page, int nid)
1485 INIT_LIST_HEAD(&page->lru);
1486 set_compound_page_dtor(page, HUGETLB_PAGE_DTOR);
1487 hugetlb_set_page_subpool(page, NULL);
1488 set_hugetlb_cgroup(page, NULL);
1489 set_hugetlb_cgroup_rsvd(page, NULL);
1490 spin_lock_irq(&hugetlb_lock);
1492 h->nr_huge_pages_node[nid]++;
1493 ClearHPageFreed(page);
1494 spin_unlock_irq(&hugetlb_lock);
1497 static void prep_compound_gigantic_page(struct page *page, unsigned int order)
1500 int nr_pages = 1 << order;
1501 struct page *p = page + 1;
1503 /* we rely on prep_new_huge_page to set the destructor */
1504 set_compound_order(page, order);
1505 __ClearPageReserved(page);
1506 __SetPageHead(page);
1507 for (i = 1; i < nr_pages; i++, p = mem_map_next(p, page, i)) {
1509 * For gigantic hugepages allocated through bootmem at
1510 * boot, it's safer to be consistent with the not-gigantic
1511 * hugepages and clear the PG_reserved bit from all tail pages
1512 * too. Otherwise drivers using get_user_pages() to access tail
1513 * pages may get the reference counting wrong if they see
1514 * PG_reserved set on a tail page (despite the head page not
1515 * having PG_reserved set). Enforcing this consistency between
1516 * head and tail pages allows drivers to optimize away a check
1517 * on the head page when they need know if put_page() is needed
1518 * after get_user_pages().
1520 __ClearPageReserved(p);
1521 set_page_count(p, 0);
1522 set_compound_head(p, page);
1524 atomic_set(compound_mapcount_ptr(page), -1);
1525 atomic_set(compound_pincount_ptr(page), 0);
1529 * PageHuge() only returns true for hugetlbfs pages, but not for normal or
1530 * transparent huge pages. See the PageTransHuge() documentation for more
1533 int PageHuge(struct page *page)
1535 if (!PageCompound(page))
1538 page = compound_head(page);
1539 return page[1].compound_dtor == HUGETLB_PAGE_DTOR;
1541 EXPORT_SYMBOL_GPL(PageHuge);
1544 * PageHeadHuge() only returns true for hugetlbfs head page, but not for
1545 * normal or transparent huge pages.
1547 int PageHeadHuge(struct page *page_head)
1549 if (!PageHead(page_head))
1552 return page_head[1].compound_dtor == HUGETLB_PAGE_DTOR;
1556 * Find and lock address space (mapping) in write mode.
1558 * Upon entry, the page is locked which means that page_mapping() is
1559 * stable. Due to locking order, we can only trylock_write. If we can
1560 * not get the lock, simply return NULL to caller.
1562 struct address_space *hugetlb_page_mapping_lock_write(struct page *hpage)
1564 struct address_space *mapping = page_mapping(hpage);
1569 if (i_mmap_trylock_write(mapping))
1575 pgoff_t __basepage_index(struct page *page)
1577 struct page *page_head = compound_head(page);
1578 pgoff_t index = page_index(page_head);
1579 unsigned long compound_idx;
1581 if (!PageHuge(page_head))
1582 return page_index(page);
1584 if (compound_order(page_head) >= MAX_ORDER)
1585 compound_idx = page_to_pfn(page) - page_to_pfn(page_head);
1587 compound_idx = page - page_head;
1589 return (index << compound_order(page_head)) + compound_idx;
1592 static struct page *alloc_buddy_huge_page(struct hstate *h,
1593 gfp_t gfp_mask, int nid, nodemask_t *nmask,
1594 nodemask_t *node_alloc_noretry)
1596 int order = huge_page_order(h);
1598 bool alloc_try_hard = true;
1601 * By default we always try hard to allocate the page with
1602 * __GFP_RETRY_MAYFAIL flag. However, if we are allocating pages in
1603 * a loop (to adjust global huge page counts) and previous allocation
1604 * failed, do not continue to try hard on the same node. Use the
1605 * node_alloc_noretry bitmap to manage this state information.
1607 if (node_alloc_noretry && node_isset(nid, *node_alloc_noretry))
1608 alloc_try_hard = false;
1609 gfp_mask |= __GFP_COMP|__GFP_NOWARN;
1611 gfp_mask |= __GFP_RETRY_MAYFAIL;
1612 if (nid == NUMA_NO_NODE)
1613 nid = numa_mem_id();
1614 page = __alloc_pages(gfp_mask, order, nid, nmask);
1616 __count_vm_event(HTLB_BUDDY_PGALLOC);
1618 __count_vm_event(HTLB_BUDDY_PGALLOC_FAIL);
1621 * If we did not specify __GFP_RETRY_MAYFAIL, but still got a page this
1622 * indicates an overall state change. Clear bit so that we resume
1623 * normal 'try hard' allocations.
1625 if (node_alloc_noretry && page && !alloc_try_hard)
1626 node_clear(nid, *node_alloc_noretry);
1629 * If we tried hard to get a page but failed, set bit so that
1630 * subsequent attempts will not try as hard until there is an
1631 * overall state change.
1633 if (node_alloc_noretry && !page && alloc_try_hard)
1634 node_set(nid, *node_alloc_noretry);
1640 * Common helper to allocate a fresh hugetlb page. All specific allocators
1641 * should use this function to get new hugetlb pages
1643 static struct page *alloc_fresh_huge_page(struct hstate *h,
1644 gfp_t gfp_mask, int nid, nodemask_t *nmask,
1645 nodemask_t *node_alloc_noretry)
1649 if (hstate_is_gigantic(h))
1650 page = alloc_gigantic_page(h, gfp_mask, nid, nmask);
1652 page = alloc_buddy_huge_page(h, gfp_mask,
1653 nid, nmask, node_alloc_noretry);
1657 if (hstate_is_gigantic(h))
1658 prep_compound_gigantic_page(page, huge_page_order(h));
1659 prep_new_huge_page(h, page, page_to_nid(page));
1665 * Allocates a fresh page to the hugetlb allocator pool in the node interleaved
1668 static int alloc_pool_huge_page(struct hstate *h, nodemask_t *nodes_allowed,
1669 nodemask_t *node_alloc_noretry)
1673 gfp_t gfp_mask = htlb_alloc_mask(h) | __GFP_THISNODE;
1675 for_each_node_mask_to_alloc(h, nr_nodes, node, nodes_allowed) {
1676 page = alloc_fresh_huge_page(h, gfp_mask, node, nodes_allowed,
1677 node_alloc_noretry);
1685 put_page(page); /* free it into the hugepage allocator */
1691 * Remove huge page from pool from next node to free. Attempt to keep
1692 * persistent huge pages more or less balanced over allowed nodes.
1693 * This routine only 'removes' the hugetlb page. The caller must make
1694 * an additional call to free the page to low level allocators.
1695 * Called with hugetlb_lock locked.
1697 static struct page *remove_pool_huge_page(struct hstate *h,
1698 nodemask_t *nodes_allowed,
1702 struct page *page = NULL;
1704 for_each_node_mask_to_free(h, nr_nodes, node, nodes_allowed) {
1706 * If we're returning unused surplus pages, only examine
1707 * nodes with surplus pages.
1709 if ((!acct_surplus || h->surplus_huge_pages_node[node]) &&
1710 !list_empty(&h->hugepage_freelists[node])) {
1711 page = list_entry(h->hugepage_freelists[node].next,
1713 remove_hugetlb_page(h, page, acct_surplus);
1722 * Dissolve a given free hugepage into free buddy pages. This function does
1723 * nothing for in-use hugepages and non-hugepages.
1724 * This function returns values like below:
1726 * -EBUSY: failed to dissolved free hugepages or the hugepage is in-use
1727 * (allocated or reserved.)
1728 * 0: successfully dissolved free hugepages or the page is not a
1729 * hugepage (considered as already dissolved)
1731 int dissolve_free_huge_page(struct page *page)
1736 /* Not to disrupt normal path by vainly holding hugetlb_lock */
1737 if (!PageHuge(page))
1740 spin_lock_irq(&hugetlb_lock);
1741 if (!PageHuge(page)) {
1746 if (!page_count(page)) {
1747 struct page *head = compound_head(page);
1748 struct hstate *h = page_hstate(head);
1749 if (h->free_huge_pages - h->resv_huge_pages == 0)
1753 * We should make sure that the page is already on the free list
1754 * when it is dissolved.
1756 if (unlikely(!HPageFreed(head))) {
1757 spin_unlock_irq(&hugetlb_lock);
1761 * Theoretically, we should return -EBUSY when we
1762 * encounter this race. In fact, we have a chance
1763 * to successfully dissolve the page if we do a
1764 * retry. Because the race window is quite small.
1765 * If we seize this opportunity, it is an optimization
1766 * for increasing the success rate of dissolving page.
1772 * Move PageHWPoison flag from head page to the raw error page,
1773 * which makes any subpages rather than the error page reusable.
1775 if (PageHWPoison(head) && page != head) {
1776 SetPageHWPoison(page);
1777 ClearPageHWPoison(head);
1779 remove_hugetlb_page(h, page, false);
1780 h->max_huge_pages--;
1781 spin_unlock_irq(&hugetlb_lock);
1782 update_and_free_page(h, head);
1786 spin_unlock_irq(&hugetlb_lock);
1791 * Dissolve free hugepages in a given pfn range. Used by memory hotplug to
1792 * make specified memory blocks removable from the system.
1793 * Note that this will dissolve a free gigantic hugepage completely, if any
1794 * part of it lies within the given range.
1795 * Also note that if dissolve_free_huge_page() returns with an error, all
1796 * free hugepages that were dissolved before that error are lost.
1798 int dissolve_free_huge_pages(unsigned long start_pfn, unsigned long end_pfn)
1804 if (!hugepages_supported())
1807 for (pfn = start_pfn; pfn < end_pfn; pfn += 1 << minimum_order) {
1808 page = pfn_to_page(pfn);
1809 rc = dissolve_free_huge_page(page);
1818 * Allocates a fresh surplus page from the page allocator.
1820 static struct page *alloc_surplus_huge_page(struct hstate *h, gfp_t gfp_mask,
1821 int nid, nodemask_t *nmask)
1823 struct page *page = NULL;
1825 if (hstate_is_gigantic(h))
1828 spin_lock_irq(&hugetlb_lock);
1829 if (h->surplus_huge_pages >= h->nr_overcommit_huge_pages)
1831 spin_unlock_irq(&hugetlb_lock);
1833 page = alloc_fresh_huge_page(h, gfp_mask, nid, nmask, NULL);
1837 spin_lock_irq(&hugetlb_lock);
1839 * We could have raced with the pool size change.
1840 * Double check that and simply deallocate the new page
1841 * if we would end up overcommiting the surpluses. Abuse
1842 * temporary page to workaround the nasty free_huge_page
1845 if (h->surplus_huge_pages >= h->nr_overcommit_huge_pages) {
1846 SetHPageTemporary(page);
1847 spin_unlock_irq(&hugetlb_lock);
1851 h->surplus_huge_pages++;
1852 h->surplus_huge_pages_node[page_to_nid(page)]++;
1856 spin_unlock_irq(&hugetlb_lock);
1861 static struct page *alloc_migrate_huge_page(struct hstate *h, gfp_t gfp_mask,
1862 int nid, nodemask_t *nmask)
1866 if (hstate_is_gigantic(h))
1869 page = alloc_fresh_huge_page(h, gfp_mask, nid, nmask, NULL);
1874 * We do not account these pages as surplus because they are only
1875 * temporary and will be released properly on the last reference
1877 SetHPageTemporary(page);
1883 * Use the VMA's mpolicy to allocate a huge page from the buddy.
1886 struct page *alloc_buddy_huge_page_with_mpol(struct hstate *h,
1887 struct vm_area_struct *vma, unsigned long addr)
1890 struct mempolicy *mpol;
1891 gfp_t gfp_mask = htlb_alloc_mask(h);
1893 nodemask_t *nodemask;
1895 nid = huge_node(vma, addr, gfp_mask, &mpol, &nodemask);
1896 page = alloc_surplus_huge_page(h, gfp_mask, nid, nodemask);
1897 mpol_cond_put(mpol);
1902 /* page migration callback function */
1903 struct page *alloc_huge_page_nodemask(struct hstate *h, int preferred_nid,
1904 nodemask_t *nmask, gfp_t gfp_mask)
1906 spin_lock_irq(&hugetlb_lock);
1907 if (h->free_huge_pages - h->resv_huge_pages > 0) {
1910 page = dequeue_huge_page_nodemask(h, gfp_mask, preferred_nid, nmask);
1912 spin_unlock_irq(&hugetlb_lock);
1916 spin_unlock_irq(&hugetlb_lock);
1918 return alloc_migrate_huge_page(h, gfp_mask, preferred_nid, nmask);
1921 /* mempolicy aware migration callback */
1922 struct page *alloc_huge_page_vma(struct hstate *h, struct vm_area_struct *vma,
1923 unsigned long address)
1925 struct mempolicy *mpol;
1926 nodemask_t *nodemask;
1931 gfp_mask = htlb_alloc_mask(h);
1932 node = huge_node(vma, address, gfp_mask, &mpol, &nodemask);
1933 page = alloc_huge_page_nodemask(h, node, nodemask, gfp_mask);
1934 mpol_cond_put(mpol);
1940 * Increase the hugetlb pool such that it can accommodate a reservation
1943 static int gather_surplus_pages(struct hstate *h, long delta)
1944 __must_hold(&hugetlb_lock)
1946 struct list_head surplus_list;
1947 struct page *page, *tmp;
1950 long needed, allocated;
1951 bool alloc_ok = true;
1953 needed = (h->resv_huge_pages + delta) - h->free_huge_pages;
1955 h->resv_huge_pages += delta;
1960 INIT_LIST_HEAD(&surplus_list);
1964 spin_unlock_irq(&hugetlb_lock);
1965 for (i = 0; i < needed; i++) {
1966 page = alloc_surplus_huge_page(h, htlb_alloc_mask(h),
1967 NUMA_NO_NODE, NULL);
1972 list_add(&page->lru, &surplus_list);
1978 * After retaking hugetlb_lock, we need to recalculate 'needed'
1979 * because either resv_huge_pages or free_huge_pages may have changed.
1981 spin_lock_irq(&hugetlb_lock);
1982 needed = (h->resv_huge_pages + delta) -
1983 (h->free_huge_pages + allocated);
1988 * We were not able to allocate enough pages to
1989 * satisfy the entire reservation so we free what
1990 * we've allocated so far.
1995 * The surplus_list now contains _at_least_ the number of extra pages
1996 * needed to accommodate the reservation. Add the appropriate number
1997 * of pages to the hugetlb pool and free the extras back to the buddy
1998 * allocator. Commit the entire reservation here to prevent another
1999 * process from stealing the pages as they are added to the pool but
2000 * before they are reserved.
2002 needed += allocated;
2003 h->resv_huge_pages += delta;
2006 /* Free the needed pages to the hugetlb pool */
2007 list_for_each_entry_safe(page, tmp, &surplus_list, lru) {
2013 * This page is now managed by the hugetlb allocator and has
2014 * no users -- drop the buddy allocator's reference.
2016 zeroed = put_page_testzero(page);
2017 VM_BUG_ON_PAGE(!zeroed, page);
2018 enqueue_huge_page(h, page);
2021 spin_unlock_irq(&hugetlb_lock);
2023 /* Free unnecessary surplus pages to the buddy allocator */
2024 list_for_each_entry_safe(page, tmp, &surplus_list, lru)
2026 spin_lock_irq(&hugetlb_lock);
2032 * This routine has two main purposes:
2033 * 1) Decrement the reservation count (resv_huge_pages) by the value passed
2034 * in unused_resv_pages. This corresponds to the prior adjustments made
2035 * to the associated reservation map.
2036 * 2) Free any unused surplus pages that may have been allocated to satisfy
2037 * the reservation. As many as unused_resv_pages may be freed.
2039 static void return_unused_surplus_pages(struct hstate *h,
2040 unsigned long unused_resv_pages)
2042 unsigned long nr_pages;
2044 LIST_HEAD(page_list);
2046 /* Uncommit the reservation */
2047 h->resv_huge_pages -= unused_resv_pages;
2049 /* Cannot return gigantic pages currently */
2050 if (hstate_is_gigantic(h))
2054 * Part (or even all) of the reservation could have been backed
2055 * by pre-allocated pages. Only free surplus pages.
2057 nr_pages = min(unused_resv_pages, h->surplus_huge_pages);
2060 * We want to release as many surplus pages as possible, spread
2061 * evenly across all nodes with memory. Iterate across these nodes
2062 * until we can no longer free unreserved surplus pages. This occurs
2063 * when the nodes with surplus pages have no free pages.
2064 * remove_pool_huge_page() will balance the freed pages across the
2065 * on-line nodes with memory and will handle the hstate accounting.
2067 while (nr_pages--) {
2068 page = remove_pool_huge_page(h, &node_states[N_MEMORY], 1);
2072 list_add(&page->lru, &page_list);
2076 spin_unlock_irq(&hugetlb_lock);
2077 update_and_free_pages_bulk(h, &page_list);
2078 spin_lock_irq(&hugetlb_lock);
2083 * vma_needs_reservation, vma_commit_reservation and vma_end_reservation
2084 * are used by the huge page allocation routines to manage reservations.
2086 * vma_needs_reservation is called to determine if the huge page at addr
2087 * within the vma has an associated reservation. If a reservation is
2088 * needed, the value 1 is returned. The caller is then responsible for
2089 * managing the global reservation and subpool usage counts. After
2090 * the huge page has been allocated, vma_commit_reservation is called
2091 * to add the page to the reservation map. If the page allocation fails,
2092 * the reservation must be ended instead of committed. vma_end_reservation
2093 * is called in such cases.
2095 * In the normal case, vma_commit_reservation returns the same value
2096 * as the preceding vma_needs_reservation call. The only time this
2097 * is not the case is if a reserve map was changed between calls. It
2098 * is the responsibility of the caller to notice the difference and
2099 * take appropriate action.
2101 * vma_add_reservation is used in error paths where a reservation must
2102 * be restored when a newly allocated huge page must be freed. It is
2103 * to be called after calling vma_needs_reservation to determine if a
2104 * reservation exists.
2106 enum vma_resv_mode {
2112 static long __vma_reservation_common(struct hstate *h,
2113 struct vm_area_struct *vma, unsigned long addr,
2114 enum vma_resv_mode mode)
2116 struct resv_map *resv;
2119 long dummy_out_regions_needed;
2121 resv = vma_resv_map(vma);
2125 idx = vma_hugecache_offset(h, vma, addr);
2127 case VMA_NEEDS_RESV:
2128 ret = region_chg(resv, idx, idx + 1, &dummy_out_regions_needed);
2129 /* We assume that vma_reservation_* routines always operate on
2130 * 1 page, and that adding to resv map a 1 page entry can only
2131 * ever require 1 region.
2133 VM_BUG_ON(dummy_out_regions_needed != 1);
2135 case VMA_COMMIT_RESV:
2136 ret = region_add(resv, idx, idx + 1, 1, NULL, NULL);
2137 /* region_add calls of range 1 should never fail. */
2141 region_abort(resv, idx, idx + 1, 1);
2145 if (vma->vm_flags & VM_MAYSHARE) {
2146 ret = region_add(resv, idx, idx + 1, 1, NULL, NULL);
2147 /* region_add calls of range 1 should never fail. */
2150 region_abort(resv, idx, idx + 1, 1);
2151 ret = region_del(resv, idx, idx + 1);
2158 if (vma->vm_flags & VM_MAYSHARE)
2161 * We know private mapping must have HPAGE_RESV_OWNER set.
2163 * In most cases, reserves always exist for private mappings.
2164 * However, a file associated with mapping could have been
2165 * hole punched or truncated after reserves were consumed.
2166 * As subsequent fault on such a range will not use reserves.
2167 * Subtle - The reserve map for private mappings has the
2168 * opposite meaning than that of shared mappings. If NO
2169 * entry is in the reserve map, it means a reservation exists.
2170 * If an entry exists in the reserve map, it means the
2171 * reservation has already been consumed. As a result, the
2172 * return value of this routine is the opposite of the
2173 * value returned from reserve map manipulation routines above.
2182 static long vma_needs_reservation(struct hstate *h,
2183 struct vm_area_struct *vma, unsigned long addr)
2185 return __vma_reservation_common(h, vma, addr, VMA_NEEDS_RESV);
2188 static long vma_commit_reservation(struct hstate *h,
2189 struct vm_area_struct *vma, unsigned long addr)
2191 return __vma_reservation_common(h, vma, addr, VMA_COMMIT_RESV);
2194 static void vma_end_reservation(struct hstate *h,
2195 struct vm_area_struct *vma, unsigned long addr)
2197 (void)__vma_reservation_common(h, vma, addr, VMA_END_RESV);
2200 static long vma_add_reservation(struct hstate *h,
2201 struct vm_area_struct *vma, unsigned long addr)
2203 return __vma_reservation_common(h, vma, addr, VMA_ADD_RESV);
2207 * This routine is called to restore a reservation on error paths. In the
2208 * specific error paths, a huge page was allocated (via alloc_huge_page)
2209 * and is about to be freed. If a reservation for the page existed,
2210 * alloc_huge_page would have consumed the reservation and set
2211 * HPageRestoreReserve in the newly allocated page. When the page is freed
2212 * via free_huge_page, the global reservation count will be incremented if
2213 * HPageRestoreReserve is set. However, free_huge_page can not adjust the
2214 * reserve map. Adjust the reserve map here to be consistent with global
2215 * reserve count adjustments to be made by free_huge_page.
2217 static void restore_reserve_on_error(struct hstate *h,
2218 struct vm_area_struct *vma, unsigned long address,
2221 if (unlikely(HPageRestoreReserve(page))) {
2222 long rc = vma_needs_reservation(h, vma, address);
2224 if (unlikely(rc < 0)) {
2226 * Rare out of memory condition in reserve map
2227 * manipulation. Clear HPageRestoreReserve so that
2228 * global reserve count will not be incremented
2229 * by free_huge_page. This will make it appear
2230 * as though the reservation for this page was
2231 * consumed. This may prevent the task from
2232 * faulting in the page at a later time. This
2233 * is better than inconsistent global huge page
2234 * accounting of reserve counts.
2236 ClearHPageRestoreReserve(page);
2238 rc = vma_add_reservation(h, vma, address);
2239 if (unlikely(rc < 0))
2241 * See above comment about rare out of
2244 ClearHPageRestoreReserve(page);
2246 vma_end_reservation(h, vma, address);
2250 struct page *alloc_huge_page(struct vm_area_struct *vma,
2251 unsigned long addr, int avoid_reserve)
2253 struct hugepage_subpool *spool = subpool_vma(vma);
2254 struct hstate *h = hstate_vma(vma);
2256 long map_chg, map_commit;
2259 struct hugetlb_cgroup *h_cg;
2260 bool deferred_reserve;
2262 idx = hstate_index(h);
2264 * Examine the region/reserve map to determine if the process
2265 * has a reservation for the page to be allocated. A return
2266 * code of zero indicates a reservation exists (no change).
2268 map_chg = gbl_chg = vma_needs_reservation(h, vma, addr);
2270 return ERR_PTR(-ENOMEM);
2273 * Processes that did not create the mapping will have no
2274 * reserves as indicated by the region/reserve map. Check
2275 * that the allocation will not exceed the subpool limit.
2276 * Allocations for MAP_NORESERVE mappings also need to be
2277 * checked against any subpool limit.
2279 if (map_chg || avoid_reserve) {
2280 gbl_chg = hugepage_subpool_get_pages(spool, 1);
2282 vma_end_reservation(h, vma, addr);
2283 return ERR_PTR(-ENOSPC);
2287 * Even though there was no reservation in the region/reserve
2288 * map, there could be reservations associated with the
2289 * subpool that can be used. This would be indicated if the
2290 * return value of hugepage_subpool_get_pages() is zero.
2291 * However, if avoid_reserve is specified we still avoid even
2292 * the subpool reservations.
2298 /* If this allocation is not consuming a reservation, charge it now.
2300 deferred_reserve = map_chg || avoid_reserve;
2301 if (deferred_reserve) {
2302 ret = hugetlb_cgroup_charge_cgroup_rsvd(
2303 idx, pages_per_huge_page(h), &h_cg);
2305 goto out_subpool_put;
2308 ret = hugetlb_cgroup_charge_cgroup(idx, pages_per_huge_page(h), &h_cg);
2310 goto out_uncharge_cgroup_reservation;
2312 spin_lock_irq(&hugetlb_lock);
2314 * glb_chg is passed to indicate whether or not a page must be taken
2315 * from the global free pool (global change). gbl_chg == 0 indicates
2316 * a reservation exists for the allocation.
2318 page = dequeue_huge_page_vma(h, vma, addr, avoid_reserve, gbl_chg);
2320 spin_unlock_irq(&hugetlb_lock);
2321 page = alloc_buddy_huge_page_with_mpol(h, vma, addr);
2323 goto out_uncharge_cgroup;
2324 if (!avoid_reserve && vma_has_reserves(vma, gbl_chg)) {
2325 SetHPageRestoreReserve(page);
2326 h->resv_huge_pages--;
2328 spin_lock_irq(&hugetlb_lock);
2329 list_add(&page->lru, &h->hugepage_activelist);
2332 hugetlb_cgroup_commit_charge(idx, pages_per_huge_page(h), h_cg, page);
2333 /* If allocation is not consuming a reservation, also store the
2334 * hugetlb_cgroup pointer on the page.
2336 if (deferred_reserve) {
2337 hugetlb_cgroup_commit_charge_rsvd(idx, pages_per_huge_page(h),
2341 spin_unlock_irq(&hugetlb_lock);
2343 hugetlb_set_page_subpool(page, spool);
2345 map_commit = vma_commit_reservation(h, vma, addr);
2346 if (unlikely(map_chg > map_commit)) {
2348 * The page was added to the reservation map between
2349 * vma_needs_reservation and vma_commit_reservation.
2350 * This indicates a race with hugetlb_reserve_pages.
2351 * Adjust for the subpool count incremented above AND
2352 * in hugetlb_reserve_pages for the same page. Also,
2353 * the reservation count added in hugetlb_reserve_pages
2354 * no longer applies.
2358 rsv_adjust = hugepage_subpool_put_pages(spool, 1);
2359 hugetlb_acct_memory(h, -rsv_adjust);
2360 if (deferred_reserve)
2361 hugetlb_cgroup_uncharge_page_rsvd(hstate_index(h),
2362 pages_per_huge_page(h), page);
2366 out_uncharge_cgroup:
2367 hugetlb_cgroup_uncharge_cgroup(idx, pages_per_huge_page(h), h_cg);
2368 out_uncharge_cgroup_reservation:
2369 if (deferred_reserve)
2370 hugetlb_cgroup_uncharge_cgroup_rsvd(idx, pages_per_huge_page(h),
2373 if (map_chg || avoid_reserve)
2374 hugepage_subpool_put_pages(spool, 1);
2375 vma_end_reservation(h, vma, addr);
2376 return ERR_PTR(-ENOSPC);
2379 int alloc_bootmem_huge_page(struct hstate *h)
2380 __attribute__ ((weak, alias("__alloc_bootmem_huge_page")));
2381 int __alloc_bootmem_huge_page(struct hstate *h)
2383 struct huge_bootmem_page *m;
2386 for_each_node_mask_to_alloc(h, nr_nodes, node, &node_states[N_MEMORY]) {
2389 addr = memblock_alloc_try_nid_raw(
2390 huge_page_size(h), huge_page_size(h),
2391 0, MEMBLOCK_ALLOC_ACCESSIBLE, node);
2394 * Use the beginning of the huge page to store the
2395 * huge_bootmem_page struct (until gather_bootmem
2396 * puts them into the mem_map).
2405 BUG_ON(!IS_ALIGNED(virt_to_phys(m), huge_page_size(h)));
2406 /* Put them into a private list first because mem_map is not up yet */
2407 INIT_LIST_HEAD(&m->list);
2408 list_add(&m->list, &huge_boot_pages);
2413 static void __init prep_compound_huge_page(struct page *page,
2416 if (unlikely(order > (MAX_ORDER - 1)))
2417 prep_compound_gigantic_page(page, order);
2419 prep_compound_page(page, order);
2422 /* Put bootmem huge pages into the standard lists after mem_map is up */
2423 static void __init gather_bootmem_prealloc(void)
2425 struct huge_bootmem_page *m;
2427 list_for_each_entry(m, &huge_boot_pages, list) {
2428 struct page *page = virt_to_page(m);
2429 struct hstate *h = m->hstate;
2431 WARN_ON(page_count(page) != 1);
2432 prep_compound_huge_page(page, huge_page_order(h));
2433 WARN_ON(PageReserved(page));
2434 prep_new_huge_page(h, page, page_to_nid(page));
2435 put_page(page); /* free it into the hugepage allocator */
2438 * If we had gigantic hugepages allocated at boot time, we need
2439 * to restore the 'stolen' pages to totalram_pages in order to
2440 * fix confusing memory reports from free(1) and another
2441 * side-effects, like CommitLimit going negative.
2443 if (hstate_is_gigantic(h))
2444 adjust_managed_page_count(page, pages_per_huge_page(h));
2449 static void __init hugetlb_hstate_alloc_pages(struct hstate *h)
2452 nodemask_t *node_alloc_noretry;
2454 if (!hstate_is_gigantic(h)) {
2456 * Bit mask controlling how hard we retry per-node allocations.
2457 * Ignore errors as lower level routines can deal with
2458 * node_alloc_noretry == NULL. If this kmalloc fails at boot
2459 * time, we are likely in bigger trouble.
2461 node_alloc_noretry = kmalloc(sizeof(*node_alloc_noretry),
2464 /* allocations done at boot time */
2465 node_alloc_noretry = NULL;
2468 /* bit mask controlling how hard we retry per-node allocations */
2469 if (node_alloc_noretry)
2470 nodes_clear(*node_alloc_noretry);
2472 for (i = 0; i < h->max_huge_pages; ++i) {
2473 if (hstate_is_gigantic(h)) {
2474 if (hugetlb_cma_size) {
2475 pr_warn_once("HugeTLB: hugetlb_cma is enabled, skip boot time allocation\n");
2478 if (!alloc_bootmem_huge_page(h))
2480 } else if (!alloc_pool_huge_page(h,
2481 &node_states[N_MEMORY],
2482 node_alloc_noretry))
2486 if (i < h->max_huge_pages) {
2489 string_get_size(huge_page_size(h), 1, STRING_UNITS_2, buf, 32);
2490 pr_warn("HugeTLB: allocating %lu of page size %s failed. Only allocated %lu hugepages.\n",
2491 h->max_huge_pages, buf, i);
2492 h->max_huge_pages = i;
2495 kfree(node_alloc_noretry);
2498 static void __init hugetlb_init_hstates(void)
2502 for_each_hstate(h) {
2503 if (minimum_order > huge_page_order(h))
2504 minimum_order = huge_page_order(h);
2506 /* oversize hugepages were init'ed in early boot */
2507 if (!hstate_is_gigantic(h))
2508 hugetlb_hstate_alloc_pages(h);
2510 VM_BUG_ON(minimum_order == UINT_MAX);
2513 static void __init report_hugepages(void)
2517 for_each_hstate(h) {
2520 string_get_size(huge_page_size(h), 1, STRING_UNITS_2, buf, 32);
2521 pr_info("HugeTLB registered %s page size, pre-allocated %ld pages\n",
2522 buf, h->free_huge_pages);
2526 #ifdef CONFIG_HIGHMEM
2527 static void try_to_free_low(struct hstate *h, unsigned long count,
2528 nodemask_t *nodes_allowed)
2531 LIST_HEAD(page_list);
2533 if (hstate_is_gigantic(h))
2537 * Collect pages to be freed on a list, and free after dropping lock
2539 for_each_node_mask(i, *nodes_allowed) {
2540 struct page *page, *next;
2541 struct list_head *freel = &h->hugepage_freelists[i];
2542 list_for_each_entry_safe(page, next, freel, lru) {
2543 if (count >= h->nr_huge_pages)
2545 if (PageHighMem(page))
2547 remove_hugetlb_page(h, page, false);
2548 list_add(&page->lru, &page_list);
2553 spin_unlock_irq(&hugetlb_lock);
2554 update_and_free_pages_bulk(h, &page_list);
2555 spin_lock_irq(&hugetlb_lock);
2558 static inline void try_to_free_low(struct hstate *h, unsigned long count,
2559 nodemask_t *nodes_allowed)
2565 * Increment or decrement surplus_huge_pages. Keep node-specific counters
2566 * balanced by operating on them in a round-robin fashion.
2567 * Returns 1 if an adjustment was made.
2569 static int adjust_pool_surplus(struct hstate *h, nodemask_t *nodes_allowed,
2574 VM_BUG_ON(delta != -1 && delta != 1);
2577 for_each_node_mask_to_alloc(h, nr_nodes, node, nodes_allowed) {
2578 if (h->surplus_huge_pages_node[node])
2582 for_each_node_mask_to_free(h, nr_nodes, node, nodes_allowed) {
2583 if (h->surplus_huge_pages_node[node] <
2584 h->nr_huge_pages_node[node])
2591 h->surplus_huge_pages += delta;
2592 h->surplus_huge_pages_node[node] += delta;
2596 #define persistent_huge_pages(h) (h->nr_huge_pages - h->surplus_huge_pages)
2597 static int set_max_huge_pages(struct hstate *h, unsigned long count, int nid,
2598 nodemask_t *nodes_allowed)
2600 unsigned long min_count, ret;
2602 LIST_HEAD(page_list);
2603 NODEMASK_ALLOC(nodemask_t, node_alloc_noretry, GFP_KERNEL);
2606 * Bit mask controlling how hard we retry per-node allocations.
2607 * If we can not allocate the bit mask, do not attempt to allocate
2608 * the requested huge pages.
2610 if (node_alloc_noretry)
2611 nodes_clear(*node_alloc_noretry);
2616 * resize_lock mutex prevents concurrent adjustments to number of
2617 * pages in hstate via the proc/sysfs interfaces.
2619 mutex_lock(&h->resize_lock);
2620 spin_lock_irq(&hugetlb_lock);
2623 * Check for a node specific request.
2624 * Changing node specific huge page count may require a corresponding
2625 * change to the global count. In any case, the passed node mask
2626 * (nodes_allowed) will restrict alloc/free to the specified node.
2628 if (nid != NUMA_NO_NODE) {
2629 unsigned long old_count = count;
2631 count += h->nr_huge_pages - h->nr_huge_pages_node[nid];
2633 * User may have specified a large count value which caused the
2634 * above calculation to overflow. In this case, they wanted
2635 * to allocate as many huge pages as possible. Set count to
2636 * largest possible value to align with their intention.
2638 if (count < old_count)
2643 * Gigantic pages runtime allocation depend on the capability for large
2644 * page range allocation.
2645 * If the system does not provide this feature, return an error when
2646 * the user tries to allocate gigantic pages but let the user free the
2647 * boottime allocated gigantic pages.
2649 if (hstate_is_gigantic(h) && !IS_ENABLED(CONFIG_CONTIG_ALLOC)) {
2650 if (count > persistent_huge_pages(h)) {
2651 spin_unlock_irq(&hugetlb_lock);
2652 mutex_unlock(&h->resize_lock);
2653 NODEMASK_FREE(node_alloc_noretry);
2656 /* Fall through to decrease pool */
2660 * Increase the pool size
2661 * First take pages out of surplus state. Then make up the
2662 * remaining difference by allocating fresh huge pages.
2664 * We might race with alloc_surplus_huge_page() here and be unable
2665 * to convert a surplus huge page to a normal huge page. That is
2666 * not critical, though, it just means the overall size of the
2667 * pool might be one hugepage larger than it needs to be, but
2668 * within all the constraints specified by the sysctls.
2670 while (h->surplus_huge_pages && count > persistent_huge_pages(h)) {
2671 if (!adjust_pool_surplus(h, nodes_allowed, -1))
2675 while (count > persistent_huge_pages(h)) {
2677 * If this allocation races such that we no longer need the
2678 * page, free_huge_page will handle it by freeing the page
2679 * and reducing the surplus.
2681 spin_unlock_irq(&hugetlb_lock);
2683 /* yield cpu to avoid soft lockup */
2686 ret = alloc_pool_huge_page(h, nodes_allowed,
2687 node_alloc_noretry);
2688 spin_lock_irq(&hugetlb_lock);
2692 /* Bail for signals. Probably ctrl-c from user */
2693 if (signal_pending(current))
2698 * Decrease the pool size
2699 * First return free pages to the buddy allocator (being careful
2700 * to keep enough around to satisfy reservations). Then place
2701 * pages into surplus state as needed so the pool will shrink
2702 * to the desired size as pages become free.
2704 * By placing pages into the surplus state independent of the
2705 * overcommit value, we are allowing the surplus pool size to
2706 * exceed overcommit. There are few sane options here. Since
2707 * alloc_surplus_huge_page() is checking the global counter,
2708 * though, we'll note that we're not allowed to exceed surplus
2709 * and won't grow the pool anywhere else. Not until one of the
2710 * sysctls are changed, or the surplus pages go out of use.
2712 min_count = h->resv_huge_pages + h->nr_huge_pages - h->free_huge_pages;
2713 min_count = max(count, min_count);
2714 try_to_free_low(h, min_count, nodes_allowed);
2717 * Collect pages to be removed on list without dropping lock
2719 while (min_count < persistent_huge_pages(h)) {
2720 page = remove_pool_huge_page(h, nodes_allowed, 0);
2724 list_add(&page->lru, &page_list);
2726 /* free the pages after dropping lock */
2727 spin_unlock_irq(&hugetlb_lock);
2728 update_and_free_pages_bulk(h, &page_list);
2729 spin_lock_irq(&hugetlb_lock);
2731 while (count < persistent_huge_pages(h)) {
2732 if (!adjust_pool_surplus(h, nodes_allowed, 1))
2736 h->max_huge_pages = persistent_huge_pages(h);
2737 spin_unlock_irq(&hugetlb_lock);
2738 mutex_unlock(&h->resize_lock);
2740 NODEMASK_FREE(node_alloc_noretry);
2745 #define HSTATE_ATTR_RO(_name) \
2746 static struct kobj_attribute _name##_attr = __ATTR_RO(_name)
2748 #define HSTATE_ATTR(_name) \
2749 static struct kobj_attribute _name##_attr = \
2750 __ATTR(_name, 0644, _name##_show, _name##_store)
2752 static struct kobject *hugepages_kobj;
2753 static struct kobject *hstate_kobjs[HUGE_MAX_HSTATE];
2755 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp);
2757 static struct hstate *kobj_to_hstate(struct kobject *kobj, int *nidp)
2761 for (i = 0; i < HUGE_MAX_HSTATE; i++)
2762 if (hstate_kobjs[i] == kobj) {
2764 *nidp = NUMA_NO_NODE;
2768 return kobj_to_node_hstate(kobj, nidp);
2771 static ssize_t nr_hugepages_show_common(struct kobject *kobj,
2772 struct kobj_attribute *attr, char *buf)
2775 unsigned long nr_huge_pages;
2778 h = kobj_to_hstate(kobj, &nid);
2779 if (nid == NUMA_NO_NODE)
2780 nr_huge_pages = h->nr_huge_pages;
2782 nr_huge_pages = h->nr_huge_pages_node[nid];
2784 return sysfs_emit(buf, "%lu\n", nr_huge_pages);
2787 static ssize_t __nr_hugepages_store_common(bool obey_mempolicy,
2788 struct hstate *h, int nid,
2789 unsigned long count, size_t len)
2792 nodemask_t nodes_allowed, *n_mask;
2794 if (hstate_is_gigantic(h) && !gigantic_page_runtime_supported())
2797 if (nid == NUMA_NO_NODE) {
2799 * global hstate attribute
2801 if (!(obey_mempolicy &&
2802 init_nodemask_of_mempolicy(&nodes_allowed)))
2803 n_mask = &node_states[N_MEMORY];
2805 n_mask = &nodes_allowed;
2808 * Node specific request. count adjustment happens in
2809 * set_max_huge_pages() after acquiring hugetlb_lock.
2811 init_nodemask_of_node(&nodes_allowed, nid);
2812 n_mask = &nodes_allowed;
2815 err = set_max_huge_pages(h, count, nid, n_mask);
2817 return err ? err : len;
2820 static ssize_t nr_hugepages_store_common(bool obey_mempolicy,
2821 struct kobject *kobj, const char *buf,
2825 unsigned long count;
2829 err = kstrtoul(buf, 10, &count);
2833 h = kobj_to_hstate(kobj, &nid);
2834 return __nr_hugepages_store_common(obey_mempolicy, h, nid, count, len);
2837 static ssize_t nr_hugepages_show(struct kobject *kobj,
2838 struct kobj_attribute *attr, char *buf)
2840 return nr_hugepages_show_common(kobj, attr, buf);
2843 static ssize_t nr_hugepages_store(struct kobject *kobj,
2844 struct kobj_attribute *attr, const char *buf, size_t len)
2846 return nr_hugepages_store_common(false, kobj, buf, len);
2848 HSTATE_ATTR(nr_hugepages);
2853 * hstate attribute for optionally mempolicy-based constraint on persistent
2854 * huge page alloc/free.
2856 static ssize_t nr_hugepages_mempolicy_show(struct kobject *kobj,
2857 struct kobj_attribute *attr,
2860 return nr_hugepages_show_common(kobj, attr, buf);
2863 static ssize_t nr_hugepages_mempolicy_store(struct kobject *kobj,
2864 struct kobj_attribute *attr, const char *buf, size_t len)
2866 return nr_hugepages_store_common(true, kobj, buf, len);
2868 HSTATE_ATTR(nr_hugepages_mempolicy);
2872 static ssize_t nr_overcommit_hugepages_show(struct kobject *kobj,
2873 struct kobj_attribute *attr, char *buf)
2875 struct hstate *h = kobj_to_hstate(kobj, NULL);
2876 return sysfs_emit(buf, "%lu\n", h->nr_overcommit_huge_pages);
2879 static ssize_t nr_overcommit_hugepages_store(struct kobject *kobj,
2880 struct kobj_attribute *attr, const char *buf, size_t count)
2883 unsigned long input;
2884 struct hstate *h = kobj_to_hstate(kobj, NULL);
2886 if (hstate_is_gigantic(h))
2889 err = kstrtoul(buf, 10, &input);
2893 spin_lock_irq(&hugetlb_lock);
2894 h->nr_overcommit_huge_pages = input;
2895 spin_unlock_irq(&hugetlb_lock);
2899 HSTATE_ATTR(nr_overcommit_hugepages);
2901 static ssize_t free_hugepages_show(struct kobject *kobj,
2902 struct kobj_attribute *attr, char *buf)
2905 unsigned long free_huge_pages;
2908 h = kobj_to_hstate(kobj, &nid);
2909 if (nid == NUMA_NO_NODE)
2910 free_huge_pages = h->free_huge_pages;
2912 free_huge_pages = h->free_huge_pages_node[nid];
2914 return sysfs_emit(buf, "%lu\n", free_huge_pages);
2916 HSTATE_ATTR_RO(free_hugepages);
2918 static ssize_t resv_hugepages_show(struct kobject *kobj,
2919 struct kobj_attribute *attr, char *buf)
2921 struct hstate *h = kobj_to_hstate(kobj, NULL);
2922 return sysfs_emit(buf, "%lu\n", h->resv_huge_pages);
2924 HSTATE_ATTR_RO(resv_hugepages);
2926 static ssize_t surplus_hugepages_show(struct kobject *kobj,
2927 struct kobj_attribute *attr, char *buf)
2930 unsigned long surplus_huge_pages;
2933 h = kobj_to_hstate(kobj, &nid);
2934 if (nid == NUMA_NO_NODE)
2935 surplus_huge_pages = h->surplus_huge_pages;
2937 surplus_huge_pages = h->surplus_huge_pages_node[nid];
2939 return sysfs_emit(buf, "%lu\n", surplus_huge_pages);
2941 HSTATE_ATTR_RO(surplus_hugepages);
2943 static struct attribute *hstate_attrs[] = {
2944 &nr_hugepages_attr.attr,
2945 &nr_overcommit_hugepages_attr.attr,
2946 &free_hugepages_attr.attr,
2947 &resv_hugepages_attr.attr,
2948 &surplus_hugepages_attr.attr,
2950 &nr_hugepages_mempolicy_attr.attr,
2955 static const struct attribute_group hstate_attr_group = {
2956 .attrs = hstate_attrs,
2959 static int hugetlb_sysfs_add_hstate(struct hstate *h, struct kobject *parent,
2960 struct kobject **hstate_kobjs,
2961 const struct attribute_group *hstate_attr_group)
2964 int hi = hstate_index(h);
2966 hstate_kobjs[hi] = kobject_create_and_add(h->name, parent);
2967 if (!hstate_kobjs[hi])
2970 retval = sysfs_create_group(hstate_kobjs[hi], hstate_attr_group);
2972 kobject_put(hstate_kobjs[hi]);
2973 hstate_kobjs[hi] = NULL;
2979 static void __init hugetlb_sysfs_init(void)
2984 hugepages_kobj = kobject_create_and_add("hugepages", mm_kobj);
2985 if (!hugepages_kobj)
2988 for_each_hstate(h) {
2989 err = hugetlb_sysfs_add_hstate(h, hugepages_kobj,
2990 hstate_kobjs, &hstate_attr_group);
2992 pr_err("HugeTLB: Unable to add hstate %s", h->name);
2999 * node_hstate/s - associate per node hstate attributes, via their kobjects,
3000 * with node devices in node_devices[] using a parallel array. The array
3001 * index of a node device or _hstate == node id.
3002 * This is here to avoid any static dependency of the node device driver, in
3003 * the base kernel, on the hugetlb module.
3005 struct node_hstate {
3006 struct kobject *hugepages_kobj;
3007 struct kobject *hstate_kobjs[HUGE_MAX_HSTATE];
3009 static struct node_hstate node_hstates[MAX_NUMNODES];
3012 * A subset of global hstate attributes for node devices
3014 static struct attribute *per_node_hstate_attrs[] = {
3015 &nr_hugepages_attr.attr,
3016 &free_hugepages_attr.attr,
3017 &surplus_hugepages_attr.attr,
3021 static const struct attribute_group per_node_hstate_attr_group = {
3022 .attrs = per_node_hstate_attrs,
3026 * kobj_to_node_hstate - lookup global hstate for node device hstate attr kobj.
3027 * Returns node id via non-NULL nidp.
3029 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp)
3033 for (nid = 0; nid < nr_node_ids; nid++) {
3034 struct node_hstate *nhs = &node_hstates[nid];
3036 for (i = 0; i < HUGE_MAX_HSTATE; i++)
3037 if (nhs->hstate_kobjs[i] == kobj) {
3049 * Unregister hstate attributes from a single node device.
3050 * No-op if no hstate attributes attached.
3052 static void hugetlb_unregister_node(struct node *node)
3055 struct node_hstate *nhs = &node_hstates[node->dev.id];
3057 if (!nhs->hugepages_kobj)
3058 return; /* no hstate attributes */
3060 for_each_hstate(h) {
3061 int idx = hstate_index(h);
3062 if (nhs->hstate_kobjs[idx]) {
3063 kobject_put(nhs->hstate_kobjs[idx]);
3064 nhs->hstate_kobjs[idx] = NULL;
3068 kobject_put(nhs->hugepages_kobj);
3069 nhs->hugepages_kobj = NULL;
3074 * Register hstate attributes for a single node device.
3075 * No-op if attributes already registered.
3077 static void hugetlb_register_node(struct node *node)
3080 struct node_hstate *nhs = &node_hstates[node->dev.id];
3083 if (nhs->hugepages_kobj)
3084 return; /* already allocated */
3086 nhs->hugepages_kobj = kobject_create_and_add("hugepages",
3088 if (!nhs->hugepages_kobj)
3091 for_each_hstate(h) {
3092 err = hugetlb_sysfs_add_hstate(h, nhs->hugepages_kobj,
3094 &per_node_hstate_attr_group);
3096 pr_err("HugeTLB: Unable to add hstate %s for node %d\n",
3097 h->name, node->dev.id);
3098 hugetlb_unregister_node(node);
3105 * hugetlb init time: register hstate attributes for all registered node
3106 * devices of nodes that have memory. All on-line nodes should have
3107 * registered their associated device by this time.
3109 static void __init hugetlb_register_all_nodes(void)
3113 for_each_node_state(nid, N_MEMORY) {
3114 struct node *node = node_devices[nid];
3115 if (node->dev.id == nid)
3116 hugetlb_register_node(node);
3120 * Let the node device driver know we're here so it can
3121 * [un]register hstate attributes on node hotplug.
3123 register_hugetlbfs_with_node(hugetlb_register_node,
3124 hugetlb_unregister_node);
3126 #else /* !CONFIG_NUMA */
3128 static struct hstate *kobj_to_node_hstate(struct kobject *kobj, int *nidp)
3136 static void hugetlb_register_all_nodes(void) { }
3140 static int __init hugetlb_init(void)
3144 BUILD_BUG_ON(sizeof_field(struct page, private) * BITS_PER_BYTE <
3147 if (!hugepages_supported()) {
3148 if (hugetlb_max_hstate || default_hstate_max_huge_pages)
3149 pr_warn("HugeTLB: huge pages not supported, ignoring associated command-line parameters\n");
3154 * Make sure HPAGE_SIZE (HUGETLB_PAGE_ORDER) hstate exists. Some
3155 * architectures depend on setup being done here.
3157 hugetlb_add_hstate(HUGETLB_PAGE_ORDER);
3158 if (!parsed_default_hugepagesz) {
3160 * If we did not parse a default huge page size, set
3161 * default_hstate_idx to HPAGE_SIZE hstate. And, if the
3162 * number of huge pages for this default size was implicitly
3163 * specified, set that here as well.
3164 * Note that the implicit setting will overwrite an explicit
3165 * setting. A warning will be printed in this case.
3167 default_hstate_idx = hstate_index(size_to_hstate(HPAGE_SIZE));
3168 if (default_hstate_max_huge_pages) {
3169 if (default_hstate.max_huge_pages) {
3172 string_get_size(huge_page_size(&default_hstate),
3173 1, STRING_UNITS_2, buf, 32);
3174 pr_warn("HugeTLB: Ignoring hugepages=%lu associated with %s page size\n",
3175 default_hstate.max_huge_pages, buf);
3176 pr_warn("HugeTLB: Using hugepages=%lu for number of default huge pages\n",
3177 default_hstate_max_huge_pages);
3179 default_hstate.max_huge_pages =
3180 default_hstate_max_huge_pages;
3184 hugetlb_cma_check();
3185 hugetlb_init_hstates();
3186 gather_bootmem_prealloc();
3189 hugetlb_sysfs_init();
3190 hugetlb_register_all_nodes();
3191 hugetlb_cgroup_file_init();
3194 num_fault_mutexes = roundup_pow_of_two(8 * num_possible_cpus());
3196 num_fault_mutexes = 1;
3198 hugetlb_fault_mutex_table =
3199 kmalloc_array(num_fault_mutexes, sizeof(struct mutex),
3201 BUG_ON(!hugetlb_fault_mutex_table);
3203 for (i = 0; i < num_fault_mutexes; i++)
3204 mutex_init(&hugetlb_fault_mutex_table[i]);
3207 subsys_initcall(hugetlb_init);
3209 /* Overwritten by architectures with more huge page sizes */
3210 bool __init __attribute((weak)) arch_hugetlb_valid_size(unsigned long size)
3212 return size == HPAGE_SIZE;
3215 void __init hugetlb_add_hstate(unsigned int order)
3220 if (size_to_hstate(PAGE_SIZE << order)) {
3223 BUG_ON(hugetlb_max_hstate >= HUGE_MAX_HSTATE);
3225 h = &hstates[hugetlb_max_hstate++];
3226 mutex_init(&h->resize_lock);
3228 h->mask = ~(huge_page_size(h) - 1);
3229 for (i = 0; i < MAX_NUMNODES; ++i)
3230 INIT_LIST_HEAD(&h->hugepage_freelists[i]);
3231 INIT_LIST_HEAD(&h->hugepage_activelist);
3232 h->next_nid_to_alloc = first_memory_node;
3233 h->next_nid_to_free = first_memory_node;
3234 snprintf(h->name, HSTATE_NAME_LEN, "hugepages-%lukB",
3235 huge_page_size(h)/1024);
3241 * hugepages command line processing
3242 * hugepages normally follows a valid hugepagsz or default_hugepagsz
3243 * specification. If not, ignore the hugepages value. hugepages can also
3244 * be the first huge page command line option in which case it implicitly
3245 * specifies the number of huge pages for the default size.
3247 static int __init hugepages_setup(char *s)
3250 static unsigned long *last_mhp;
3252 if (!parsed_valid_hugepagesz) {
3253 pr_warn("HugeTLB: hugepages=%s does not follow a valid hugepagesz, ignoring\n", s);
3254 parsed_valid_hugepagesz = true;
3259 * !hugetlb_max_hstate means we haven't parsed a hugepagesz= parameter
3260 * yet, so this hugepages= parameter goes to the "default hstate".
3261 * Otherwise, it goes with the previously parsed hugepagesz or
3262 * default_hugepagesz.
3264 else if (!hugetlb_max_hstate)
3265 mhp = &default_hstate_max_huge_pages;
3267 mhp = &parsed_hstate->max_huge_pages;
3269 if (mhp == last_mhp) {
3270 pr_warn("HugeTLB: hugepages= specified twice without interleaving hugepagesz=, ignoring hugepages=%s\n", s);
3274 if (sscanf(s, "%lu", mhp) <= 0)
3278 * Global state is always initialized later in hugetlb_init.
3279 * But we need to allocate gigantic hstates here early to still
3280 * use the bootmem allocator.
3282 if (hugetlb_max_hstate && hstate_is_gigantic(parsed_hstate))
3283 hugetlb_hstate_alloc_pages(parsed_hstate);
3289 __setup("hugepages=", hugepages_setup);
3292 * hugepagesz command line processing
3293 * A specific huge page size can only be specified once with hugepagesz.
3294 * hugepagesz is followed by hugepages on the command line. The global
3295 * variable 'parsed_valid_hugepagesz' is used to determine if prior
3296 * hugepagesz argument was valid.
3298 static int __init hugepagesz_setup(char *s)
3303 parsed_valid_hugepagesz = false;
3304 size = (unsigned long)memparse(s, NULL);
3306 if (!arch_hugetlb_valid_size(size)) {
3307 pr_err("HugeTLB: unsupported hugepagesz=%s\n", s);
3311 h = size_to_hstate(size);
3314 * hstate for this size already exists. This is normally
3315 * an error, but is allowed if the existing hstate is the
3316 * default hstate. More specifically, it is only allowed if
3317 * the number of huge pages for the default hstate was not
3318 * previously specified.
3320 if (!parsed_default_hugepagesz || h != &default_hstate ||
3321 default_hstate.max_huge_pages) {
3322 pr_warn("HugeTLB: hugepagesz=%s specified twice, ignoring\n", s);
3327 * No need to call hugetlb_add_hstate() as hstate already
3328 * exists. But, do set parsed_hstate so that a following
3329 * hugepages= parameter will be applied to this hstate.
3332 parsed_valid_hugepagesz = true;
3336 hugetlb_add_hstate(ilog2(size) - PAGE_SHIFT);
3337 parsed_valid_hugepagesz = true;
3340 __setup("hugepagesz=", hugepagesz_setup);
3343 * default_hugepagesz command line input
3344 * Only one instance of default_hugepagesz allowed on command line.
3346 static int __init default_hugepagesz_setup(char *s)
3350 parsed_valid_hugepagesz = false;
3351 if (parsed_default_hugepagesz) {
3352 pr_err("HugeTLB: default_hugepagesz previously specified, ignoring %s\n", s);
3356 size = (unsigned long)memparse(s, NULL);
3358 if (!arch_hugetlb_valid_size(size)) {
3359 pr_err("HugeTLB: unsupported default_hugepagesz=%s\n", s);
3363 hugetlb_add_hstate(ilog2(size) - PAGE_SHIFT);
3364 parsed_valid_hugepagesz = true;
3365 parsed_default_hugepagesz = true;
3366 default_hstate_idx = hstate_index(size_to_hstate(size));
3369 * The number of default huge pages (for this size) could have been
3370 * specified as the first hugetlb parameter: hugepages=X. If so,
3371 * then default_hstate_max_huge_pages is set. If the default huge
3372 * page size is gigantic (>= MAX_ORDER), then the pages must be
3373 * allocated here from bootmem allocator.
3375 if (default_hstate_max_huge_pages) {
3376 default_hstate.max_huge_pages = default_hstate_max_huge_pages;
3377 if (hstate_is_gigantic(&default_hstate))
3378 hugetlb_hstate_alloc_pages(&default_hstate);
3379 default_hstate_max_huge_pages = 0;
3384 __setup("default_hugepagesz=", default_hugepagesz_setup);
3386 static unsigned int allowed_mems_nr(struct hstate *h)
3389 unsigned int nr = 0;
3390 nodemask_t *mpol_allowed;
3391 unsigned int *array = h->free_huge_pages_node;
3392 gfp_t gfp_mask = htlb_alloc_mask(h);
3394 mpol_allowed = policy_nodemask_current(gfp_mask);
3396 for_each_node_mask(node, cpuset_current_mems_allowed) {
3397 if (!mpol_allowed || node_isset(node, *mpol_allowed))
3404 #ifdef CONFIG_SYSCTL
3405 static int proc_hugetlb_doulongvec_minmax(struct ctl_table *table, int write,
3406 void *buffer, size_t *length,
3407 loff_t *ppos, unsigned long *out)
3409 struct ctl_table dup_table;
3412 * In order to avoid races with __do_proc_doulongvec_minmax(), we
3413 * can duplicate the @table and alter the duplicate of it.
3416 dup_table.data = out;
3418 return proc_doulongvec_minmax(&dup_table, write, buffer, length, ppos);
3421 static int hugetlb_sysctl_handler_common(bool obey_mempolicy,
3422 struct ctl_table *table, int write,
3423 void *buffer, size_t *length, loff_t *ppos)
3425 struct hstate *h = &default_hstate;
3426 unsigned long tmp = h->max_huge_pages;
3429 if (!hugepages_supported())
3432 ret = proc_hugetlb_doulongvec_minmax(table, write, buffer, length, ppos,
3438 ret = __nr_hugepages_store_common(obey_mempolicy, h,
3439 NUMA_NO_NODE, tmp, *length);
3444 int hugetlb_sysctl_handler(struct ctl_table *table, int write,
3445 void *buffer, size_t *length, loff_t *ppos)
3448 return hugetlb_sysctl_handler_common(false, table, write,
3449 buffer, length, ppos);
3453 int hugetlb_mempolicy_sysctl_handler(struct ctl_table *table, int write,
3454 void *buffer, size_t *length, loff_t *ppos)
3456 return hugetlb_sysctl_handler_common(true, table, write,
3457 buffer, length, ppos);
3459 #endif /* CONFIG_NUMA */
3461 int hugetlb_overcommit_handler(struct ctl_table *table, int write,
3462 void *buffer, size_t *length, loff_t *ppos)
3464 struct hstate *h = &default_hstate;
3468 if (!hugepages_supported())
3471 tmp = h->nr_overcommit_huge_pages;
3473 if (write && hstate_is_gigantic(h))
3476 ret = proc_hugetlb_doulongvec_minmax(table, write, buffer, length, ppos,
3482 spin_lock_irq(&hugetlb_lock);
3483 h->nr_overcommit_huge_pages = tmp;
3484 spin_unlock_irq(&hugetlb_lock);
3490 #endif /* CONFIG_SYSCTL */
3492 void hugetlb_report_meminfo(struct seq_file *m)
3495 unsigned long total = 0;
3497 if (!hugepages_supported())
3500 for_each_hstate(h) {
3501 unsigned long count = h->nr_huge_pages;
3503 total += huge_page_size(h) * count;
3505 if (h == &default_hstate)
3507 "HugePages_Total: %5lu\n"
3508 "HugePages_Free: %5lu\n"
3509 "HugePages_Rsvd: %5lu\n"
3510 "HugePages_Surp: %5lu\n"
3511 "Hugepagesize: %8lu kB\n",
3515 h->surplus_huge_pages,
3516 huge_page_size(h) / SZ_1K);
3519 seq_printf(m, "Hugetlb: %8lu kB\n", total / SZ_1K);
3522 int hugetlb_report_node_meminfo(char *buf, int len, int nid)
3524 struct hstate *h = &default_hstate;
3526 if (!hugepages_supported())
3529 return sysfs_emit_at(buf, len,
3530 "Node %d HugePages_Total: %5u\n"
3531 "Node %d HugePages_Free: %5u\n"
3532 "Node %d HugePages_Surp: %5u\n",
3533 nid, h->nr_huge_pages_node[nid],
3534 nid, h->free_huge_pages_node[nid],
3535 nid, h->surplus_huge_pages_node[nid]);
3538 void hugetlb_show_meminfo(void)
3543 if (!hugepages_supported())
3546 for_each_node_state(nid, N_MEMORY)
3548 pr_info("Node %d hugepages_total=%u hugepages_free=%u hugepages_surp=%u hugepages_size=%lukB\n",
3550 h->nr_huge_pages_node[nid],
3551 h->free_huge_pages_node[nid],
3552 h->surplus_huge_pages_node[nid],
3553 huge_page_size(h) / SZ_1K);
3556 void hugetlb_report_usage(struct seq_file *m, struct mm_struct *mm)
3558 seq_printf(m, "HugetlbPages:\t%8lu kB\n",
3559 atomic_long_read(&mm->hugetlb_usage) << (PAGE_SHIFT - 10));
3562 /* Return the number pages of memory we physically have, in PAGE_SIZE units. */
3563 unsigned long hugetlb_total_pages(void)
3566 unsigned long nr_total_pages = 0;
3569 nr_total_pages += h->nr_huge_pages * pages_per_huge_page(h);
3570 return nr_total_pages;
3573 static int hugetlb_acct_memory(struct hstate *h, long delta)
3580 spin_lock_irq(&hugetlb_lock);
3582 * When cpuset is configured, it breaks the strict hugetlb page
3583 * reservation as the accounting is done on a global variable. Such
3584 * reservation is completely rubbish in the presence of cpuset because
3585 * the reservation is not checked against page availability for the
3586 * current cpuset. Application can still potentially OOM'ed by kernel
3587 * with lack of free htlb page in cpuset that the task is in.
3588 * Attempt to enforce strict accounting with cpuset is almost
3589 * impossible (or too ugly) because cpuset is too fluid that
3590 * task or memory node can be dynamically moved between cpusets.
3592 * The change of semantics for shared hugetlb mapping with cpuset is
3593 * undesirable. However, in order to preserve some of the semantics,
3594 * we fall back to check against current free page availability as
3595 * a best attempt and hopefully to minimize the impact of changing
3596 * semantics that cpuset has.
3598 * Apart from cpuset, we also have memory policy mechanism that
3599 * also determines from which node the kernel will allocate memory
3600 * in a NUMA system. So similar to cpuset, we also should consider
3601 * the memory policy of the current task. Similar to the description
3605 if (gather_surplus_pages(h, delta) < 0)
3608 if (delta > allowed_mems_nr(h)) {
3609 return_unused_surplus_pages(h, delta);
3616 return_unused_surplus_pages(h, (unsigned long) -delta);
3619 spin_unlock_irq(&hugetlb_lock);
3623 static void hugetlb_vm_op_open(struct vm_area_struct *vma)
3625 struct resv_map *resv = vma_resv_map(vma);
3628 * This new VMA should share its siblings reservation map if present.
3629 * The VMA will only ever have a valid reservation map pointer where
3630 * it is being copied for another still existing VMA. As that VMA
3631 * has a reference to the reservation map it cannot disappear until
3632 * after this open call completes. It is therefore safe to take a
3633 * new reference here without additional locking.
3635 if (resv && is_vma_resv_set(vma, HPAGE_RESV_OWNER))
3636 kref_get(&resv->refs);
3639 static void hugetlb_vm_op_close(struct vm_area_struct *vma)
3641 struct hstate *h = hstate_vma(vma);
3642 struct resv_map *resv = vma_resv_map(vma);
3643 struct hugepage_subpool *spool = subpool_vma(vma);
3644 unsigned long reserve, start, end;
3647 if (!resv || !is_vma_resv_set(vma, HPAGE_RESV_OWNER))
3650 start = vma_hugecache_offset(h, vma, vma->vm_start);
3651 end = vma_hugecache_offset(h, vma, vma->vm_end);
3653 reserve = (end - start) - region_count(resv, start, end);
3654 hugetlb_cgroup_uncharge_counter(resv, start, end);
3657 * Decrement reserve counts. The global reserve count may be
3658 * adjusted if the subpool has a minimum size.
3660 gbl_reserve = hugepage_subpool_put_pages(spool, reserve);
3661 hugetlb_acct_memory(h, -gbl_reserve);
3664 kref_put(&resv->refs, resv_map_release);
3667 static int hugetlb_vm_op_split(struct vm_area_struct *vma, unsigned long addr)
3669 if (addr & ~(huge_page_mask(hstate_vma(vma))))
3674 static unsigned long hugetlb_vm_op_pagesize(struct vm_area_struct *vma)
3676 return huge_page_size(hstate_vma(vma));
3680 * We cannot handle pagefaults against hugetlb pages at all. They cause
3681 * handle_mm_fault() to try to instantiate regular-sized pages in the
3682 * hugepage VMA. do_page_fault() is supposed to trap this, so BUG is we get
3685 static vm_fault_t hugetlb_vm_op_fault(struct vm_fault *vmf)
3692 * When a new function is introduced to vm_operations_struct and added
3693 * to hugetlb_vm_ops, please consider adding the function to shm_vm_ops.
3694 * This is because under System V memory model, mappings created via
3695 * shmget/shmat with "huge page" specified are backed by hugetlbfs files,
3696 * their original vm_ops are overwritten with shm_vm_ops.
3698 const struct vm_operations_struct hugetlb_vm_ops = {
3699 .fault = hugetlb_vm_op_fault,
3700 .open = hugetlb_vm_op_open,
3701 .close = hugetlb_vm_op_close,
3702 .may_split = hugetlb_vm_op_split,
3703 .pagesize = hugetlb_vm_op_pagesize,
3706 static pte_t make_huge_pte(struct vm_area_struct *vma, struct page *page,
3712 entry = huge_pte_mkwrite(huge_pte_mkdirty(mk_huge_pte(page,
3713 vma->vm_page_prot)));
3715 entry = huge_pte_wrprotect(mk_huge_pte(page,
3716 vma->vm_page_prot));
3718 entry = pte_mkyoung(entry);
3719 entry = pte_mkhuge(entry);
3720 entry = arch_make_huge_pte(entry, vma, page, writable);
3725 static void set_huge_ptep_writable(struct vm_area_struct *vma,
3726 unsigned long address, pte_t *ptep)
3730 entry = huge_pte_mkwrite(huge_pte_mkdirty(huge_ptep_get(ptep)));
3731 if (huge_ptep_set_access_flags(vma, address, ptep, entry, 1))
3732 update_mmu_cache(vma, address, ptep);
3735 bool is_hugetlb_entry_migration(pte_t pte)
3739 if (huge_pte_none(pte) || pte_present(pte))
3741 swp = pte_to_swp_entry(pte);
3742 if (is_migration_entry(swp))
3748 static bool is_hugetlb_entry_hwpoisoned(pte_t pte)
3752 if (huge_pte_none(pte) || pte_present(pte))
3754 swp = pte_to_swp_entry(pte);
3755 if (is_hwpoison_entry(swp))
3762 hugetlb_install_page(struct vm_area_struct *vma, pte_t *ptep, unsigned long addr,
3763 struct page *new_page)
3765 __SetPageUptodate(new_page);
3766 set_huge_pte_at(vma->vm_mm, addr, ptep, make_huge_pte(vma, new_page, 1));
3767 hugepage_add_new_anon_rmap(new_page, vma, addr);
3768 hugetlb_count_add(pages_per_huge_page(hstate_vma(vma)), vma->vm_mm);
3769 ClearHPageRestoreReserve(new_page);
3770 SetHPageMigratable(new_page);
3773 int copy_hugetlb_page_range(struct mm_struct *dst, struct mm_struct *src,
3774 struct vm_area_struct *vma)
3776 pte_t *src_pte, *dst_pte, entry, dst_entry;
3777 struct page *ptepage;
3779 bool cow = is_cow_mapping(vma->vm_flags);
3780 struct hstate *h = hstate_vma(vma);
3781 unsigned long sz = huge_page_size(h);
3782 unsigned long npages = pages_per_huge_page(h);
3783 struct address_space *mapping = vma->vm_file->f_mapping;
3784 struct mmu_notifier_range range;
3788 mmu_notifier_range_init(&range, MMU_NOTIFY_CLEAR, 0, vma, src,
3791 mmu_notifier_invalidate_range_start(&range);
3794 * For shared mappings i_mmap_rwsem must be held to call
3795 * huge_pte_alloc, otherwise the returned ptep could go
3796 * away if part of a shared pmd and another thread calls
3799 i_mmap_lock_read(mapping);
3802 for (addr = vma->vm_start; addr < vma->vm_end; addr += sz) {
3803 spinlock_t *src_ptl, *dst_ptl;
3804 src_pte = huge_pte_offset(src, addr, sz);
3807 dst_pte = huge_pte_alloc(dst, vma, addr, sz);
3814 * If the pagetables are shared don't copy or take references.
3815 * dst_pte == src_pte is the common case of src/dest sharing.
3817 * However, src could have 'unshared' and dst shares with
3818 * another vma. If dst_pte !none, this implies sharing.
3819 * Check here before taking page table lock, and once again
3820 * after taking the lock below.
3822 dst_entry = huge_ptep_get(dst_pte);
3823 if ((dst_pte == src_pte) || !huge_pte_none(dst_entry))
3826 dst_ptl = huge_pte_lock(h, dst, dst_pte);
3827 src_ptl = huge_pte_lockptr(h, src, src_pte);
3828 spin_lock_nested(src_ptl, SINGLE_DEPTH_NESTING);
3829 entry = huge_ptep_get(src_pte);
3830 dst_entry = huge_ptep_get(dst_pte);
3832 if (huge_pte_none(entry) || !huge_pte_none(dst_entry)) {
3834 * Skip if src entry none. Also, skip in the
3835 * unlikely case dst entry !none as this implies
3836 * sharing with another vma.
3839 } else if (unlikely(is_hugetlb_entry_migration(entry) ||
3840 is_hugetlb_entry_hwpoisoned(entry))) {
3841 swp_entry_t swp_entry = pte_to_swp_entry(entry);
3843 if (is_write_migration_entry(swp_entry) && cow) {
3845 * COW mappings require pages in both
3846 * parent and child to be set to read.
3848 make_migration_entry_read(&swp_entry);
3849 entry = swp_entry_to_pte(swp_entry);
3850 set_huge_swap_pte_at(src, addr, src_pte,
3853 set_huge_swap_pte_at(dst, addr, dst_pte, entry, sz);
3855 entry = huge_ptep_get(src_pte);
3856 ptepage = pte_page(entry);
3860 * This is a rare case where we see pinned hugetlb
3861 * pages while they're prone to COW. We need to do the
3862 * COW earlier during fork.
3864 * When pre-allocating the page or copying data, we
3865 * need to be without the pgtable locks since we could
3866 * sleep during the process.
3868 if (unlikely(page_needs_cow_for_dma(vma, ptepage))) {
3869 pte_t src_pte_old = entry;
3872 spin_unlock(src_ptl);
3873 spin_unlock(dst_ptl);
3874 /* Do not use reserve as it's private owned */
3875 new = alloc_huge_page(vma, addr, 1);
3881 copy_user_huge_page(new, ptepage, addr, vma,
3885 /* Install the new huge page if src pte stable */
3886 dst_ptl = huge_pte_lock(h, dst, dst_pte);
3887 src_ptl = huge_pte_lockptr(h, src, src_pte);
3888 spin_lock_nested(src_ptl, SINGLE_DEPTH_NESTING);
3889 entry = huge_ptep_get(src_pte);
3890 if (!pte_same(src_pte_old, entry)) {
3892 /* dst_entry won't change as in child */
3895 hugetlb_install_page(vma, dst_pte, addr, new);
3896 spin_unlock(src_ptl);
3897 spin_unlock(dst_ptl);
3903 * No need to notify as we are downgrading page
3904 * table protection not changing it to point
3907 * See Documentation/vm/mmu_notifier.rst
3909 huge_ptep_set_wrprotect(src, addr, src_pte);
3912 page_dup_rmap(ptepage, true);
3913 set_huge_pte_at(dst, addr, dst_pte, entry);
3914 hugetlb_count_add(npages, dst);
3916 spin_unlock(src_ptl);
3917 spin_unlock(dst_ptl);
3921 mmu_notifier_invalidate_range_end(&range);
3923 i_mmap_unlock_read(mapping);
3928 void __unmap_hugepage_range(struct mmu_gather *tlb, struct vm_area_struct *vma,
3929 unsigned long start, unsigned long end,
3930 struct page *ref_page)
3932 struct mm_struct *mm = vma->vm_mm;
3933 unsigned long address;
3938 struct hstate *h = hstate_vma(vma);
3939 unsigned long sz = huge_page_size(h);
3940 struct mmu_notifier_range range;
3942 WARN_ON(!is_vm_hugetlb_page(vma));
3943 BUG_ON(start & ~huge_page_mask(h));
3944 BUG_ON(end & ~huge_page_mask(h));
3947 * This is a hugetlb vma, all the pte entries should point
3950 tlb_change_page_size(tlb, sz);
3951 tlb_start_vma(tlb, vma);
3954 * If sharing possible, alert mmu notifiers of worst case.
3956 mmu_notifier_range_init(&range, MMU_NOTIFY_UNMAP, 0, vma, mm, start,
3958 adjust_range_if_pmd_sharing_possible(vma, &range.start, &range.end);
3959 mmu_notifier_invalidate_range_start(&range);
3961 for (; address < end; address += sz) {
3962 ptep = huge_pte_offset(mm, address, sz);
3966 ptl = huge_pte_lock(h, mm, ptep);
3967 if (huge_pmd_unshare(mm, vma, &address, ptep)) {
3970 * We just unmapped a page of PMDs by clearing a PUD.
3971 * The caller's TLB flush range should cover this area.
3976 pte = huge_ptep_get(ptep);
3977 if (huge_pte_none(pte)) {
3983 * Migrating hugepage or HWPoisoned hugepage is already
3984 * unmapped and its refcount is dropped, so just clear pte here.
3986 if (unlikely(!pte_present(pte))) {
3987 huge_pte_clear(mm, address, ptep, sz);
3992 page = pte_page(pte);
3994 * If a reference page is supplied, it is because a specific
3995 * page is being unmapped, not a range. Ensure the page we
3996 * are about to unmap is the actual page of interest.
3999 if (page != ref_page) {
4004 * Mark the VMA as having unmapped its page so that
4005 * future faults in this VMA will fail rather than
4006 * looking like data was lost
4008 set_vma_resv_flags(vma, HPAGE_RESV_UNMAPPED);
4011 pte = huge_ptep_get_and_clear(mm, address, ptep);
4012 tlb_remove_huge_tlb_entry(h, tlb, ptep, address);
4013 if (huge_pte_dirty(pte))
4014 set_page_dirty(page);
4016 hugetlb_count_sub(pages_per_huge_page(h), mm);
4017 page_remove_rmap(page, true);
4020 tlb_remove_page_size(tlb, page, huge_page_size(h));
4022 * Bail out after unmapping reference page if supplied
4027 mmu_notifier_invalidate_range_end(&range);
4028 tlb_end_vma(tlb, vma);
4031 void __unmap_hugepage_range_final(struct mmu_gather *tlb,
4032 struct vm_area_struct *vma, unsigned long start,
4033 unsigned long end, struct page *ref_page)
4035 __unmap_hugepage_range(tlb, vma, start, end, ref_page);
4038 * Clear this flag so that x86's huge_pmd_share page_table_shareable
4039 * test will fail on a vma being torn down, and not grab a page table
4040 * on its way out. We're lucky that the flag has such an appropriate
4041 * name, and can in fact be safely cleared here. We could clear it
4042 * before the __unmap_hugepage_range above, but all that's necessary
4043 * is to clear it before releasing the i_mmap_rwsem. This works
4044 * because in the context this is called, the VMA is about to be
4045 * destroyed and the i_mmap_rwsem is held.
4047 vma->vm_flags &= ~VM_MAYSHARE;
4050 void unmap_hugepage_range(struct vm_area_struct *vma, unsigned long start,
4051 unsigned long end, struct page *ref_page)
4053 struct mmu_gather tlb;
4055 tlb_gather_mmu(&tlb, vma->vm_mm);
4056 __unmap_hugepage_range(&tlb, vma, start, end, ref_page);
4057 tlb_finish_mmu(&tlb);
4061 * This is called when the original mapper is failing to COW a MAP_PRIVATE
4062 * mapping it owns the reserve page for. The intention is to unmap the page
4063 * from other VMAs and let the children be SIGKILLed if they are faulting the
4066 static void unmap_ref_private(struct mm_struct *mm, struct vm_area_struct *vma,
4067 struct page *page, unsigned long address)
4069 struct hstate *h = hstate_vma(vma);
4070 struct vm_area_struct *iter_vma;
4071 struct address_space *mapping;
4075 * vm_pgoff is in PAGE_SIZE units, hence the different calculation
4076 * from page cache lookup which is in HPAGE_SIZE units.
4078 address = address & huge_page_mask(h);
4079 pgoff = ((address - vma->vm_start) >> PAGE_SHIFT) +
4081 mapping = vma->vm_file->f_mapping;
4084 * Take the mapping lock for the duration of the table walk. As
4085 * this mapping should be shared between all the VMAs,
4086 * __unmap_hugepage_range() is called as the lock is already held
4088 i_mmap_lock_write(mapping);
4089 vma_interval_tree_foreach(iter_vma, &mapping->i_mmap, pgoff, pgoff) {
4090 /* Do not unmap the current VMA */
4091 if (iter_vma == vma)
4095 * Shared VMAs have their own reserves and do not affect
4096 * MAP_PRIVATE accounting but it is possible that a shared
4097 * VMA is using the same page so check and skip such VMAs.
4099 if (iter_vma->vm_flags & VM_MAYSHARE)
4103 * Unmap the page from other VMAs without their own reserves.
4104 * They get marked to be SIGKILLed if they fault in these
4105 * areas. This is because a future no-page fault on this VMA
4106 * could insert a zeroed page instead of the data existing
4107 * from the time of fork. This would look like data corruption
4109 if (!is_vma_resv_set(iter_vma, HPAGE_RESV_OWNER))
4110 unmap_hugepage_range(iter_vma, address,
4111 address + huge_page_size(h), page);
4113 i_mmap_unlock_write(mapping);
4117 * Hugetlb_cow() should be called with page lock of the original hugepage held.
4118 * Called with hugetlb_instantiation_mutex held and pte_page locked so we
4119 * cannot race with other handlers or page migration.
4120 * Keep the pte_same checks anyway to make transition from the mutex easier.
4122 static vm_fault_t hugetlb_cow(struct mm_struct *mm, struct vm_area_struct *vma,
4123 unsigned long address, pte_t *ptep,
4124 struct page *pagecache_page, spinlock_t *ptl)
4127 struct hstate *h = hstate_vma(vma);
4128 struct page *old_page, *new_page;
4129 int outside_reserve = 0;
4131 unsigned long haddr = address & huge_page_mask(h);
4132 struct mmu_notifier_range range;
4134 pte = huge_ptep_get(ptep);
4135 old_page = pte_page(pte);
4138 /* If no-one else is actually using this page, avoid the copy
4139 * and just make the page writable */
4140 if (page_mapcount(old_page) == 1 && PageAnon(old_page)) {
4141 page_move_anon_rmap(old_page, vma);
4142 set_huge_ptep_writable(vma, haddr, ptep);
4147 * If the process that created a MAP_PRIVATE mapping is about to
4148 * perform a COW due to a shared page count, attempt to satisfy
4149 * the allocation without using the existing reserves. The pagecache
4150 * page is used to determine if the reserve at this address was
4151 * consumed or not. If reserves were used, a partial faulted mapping
4152 * at the time of fork() could consume its reserves on COW instead
4153 * of the full address range.
4155 if (is_vma_resv_set(vma, HPAGE_RESV_OWNER) &&
4156 old_page != pagecache_page)
4157 outside_reserve = 1;
4162 * Drop page table lock as buddy allocator may be called. It will
4163 * be acquired again before returning to the caller, as expected.
4166 new_page = alloc_huge_page(vma, haddr, outside_reserve);
4168 if (IS_ERR(new_page)) {
4170 * If a process owning a MAP_PRIVATE mapping fails to COW,
4171 * it is due to references held by a child and an insufficient
4172 * huge page pool. To guarantee the original mappers
4173 * reliability, unmap the page from child processes. The child
4174 * may get SIGKILLed if it later faults.
4176 if (outside_reserve) {
4177 struct address_space *mapping = vma->vm_file->f_mapping;
4182 BUG_ON(huge_pte_none(pte));
4184 * Drop hugetlb_fault_mutex and i_mmap_rwsem before
4185 * unmapping. unmapping needs to hold i_mmap_rwsem
4186 * in write mode. Dropping i_mmap_rwsem in read mode
4187 * here is OK as COW mappings do not interact with
4190 * Reacquire both after unmap operation.
4192 idx = vma_hugecache_offset(h, vma, haddr);
4193 hash = hugetlb_fault_mutex_hash(mapping, idx);
4194 mutex_unlock(&hugetlb_fault_mutex_table[hash]);
4195 i_mmap_unlock_read(mapping);
4197 unmap_ref_private(mm, vma, old_page, haddr);
4199 i_mmap_lock_read(mapping);
4200 mutex_lock(&hugetlb_fault_mutex_table[hash]);
4202 ptep = huge_pte_offset(mm, haddr, huge_page_size(h));
4204 pte_same(huge_ptep_get(ptep), pte)))
4205 goto retry_avoidcopy;
4207 * race occurs while re-acquiring page table
4208 * lock, and our job is done.
4213 ret = vmf_error(PTR_ERR(new_page));
4214 goto out_release_old;
4218 * When the original hugepage is shared one, it does not have
4219 * anon_vma prepared.
4221 if (unlikely(anon_vma_prepare(vma))) {
4223 goto out_release_all;
4226 copy_user_huge_page(new_page, old_page, address, vma,
4227 pages_per_huge_page(h));
4228 __SetPageUptodate(new_page);
4230 mmu_notifier_range_init(&range, MMU_NOTIFY_CLEAR, 0, vma, mm, haddr,
4231 haddr + huge_page_size(h));
4232 mmu_notifier_invalidate_range_start(&range);
4235 * Retake the page table lock to check for racing updates
4236 * before the page tables are altered
4239 ptep = huge_pte_offset(mm, haddr, huge_page_size(h));
4240 if (likely(ptep && pte_same(huge_ptep_get(ptep), pte))) {
4241 ClearHPageRestoreReserve(new_page);
4244 huge_ptep_clear_flush(vma, haddr, ptep);
4245 mmu_notifier_invalidate_range(mm, range.start, range.end);
4246 set_huge_pte_at(mm, haddr, ptep,
4247 make_huge_pte(vma, new_page, 1));
4248 page_remove_rmap(old_page, true);
4249 hugepage_add_new_anon_rmap(new_page, vma, haddr);
4250 SetHPageMigratable(new_page);
4251 /* Make the old page be freed below */
4252 new_page = old_page;
4255 mmu_notifier_invalidate_range_end(&range);
4257 restore_reserve_on_error(h, vma, haddr, new_page);
4262 spin_lock(ptl); /* Caller expects lock to be held */
4266 /* Return the pagecache page at a given address within a VMA */
4267 static struct page *hugetlbfs_pagecache_page(struct hstate *h,
4268 struct vm_area_struct *vma, unsigned long address)
4270 struct address_space *mapping;
4273 mapping = vma->vm_file->f_mapping;
4274 idx = vma_hugecache_offset(h, vma, address);
4276 return find_lock_page(mapping, idx);
4280 * Return whether there is a pagecache page to back given address within VMA.
4281 * Caller follow_hugetlb_page() holds page_table_lock so we cannot lock_page.
4283 static bool hugetlbfs_pagecache_present(struct hstate *h,
4284 struct vm_area_struct *vma, unsigned long address)
4286 struct address_space *mapping;
4290 mapping = vma->vm_file->f_mapping;
4291 idx = vma_hugecache_offset(h, vma, address);
4293 page = find_get_page(mapping, idx);
4296 return page != NULL;
4299 int huge_add_to_page_cache(struct page *page, struct address_space *mapping,
4302 struct inode *inode = mapping->host;
4303 struct hstate *h = hstate_inode(inode);
4304 int err = add_to_page_cache(page, mapping, idx, GFP_KERNEL);
4308 ClearHPageRestoreReserve(page);
4311 * set page dirty so that it will not be removed from cache/file
4312 * by non-hugetlbfs specific code paths.
4314 set_page_dirty(page);
4316 spin_lock(&inode->i_lock);
4317 inode->i_blocks += blocks_per_huge_page(h);
4318 spin_unlock(&inode->i_lock);
4322 static vm_fault_t hugetlb_no_page(struct mm_struct *mm,
4323 struct vm_area_struct *vma,
4324 struct address_space *mapping, pgoff_t idx,
4325 unsigned long address, pte_t *ptep, unsigned int flags)
4327 struct hstate *h = hstate_vma(vma);
4328 vm_fault_t ret = VM_FAULT_SIGBUS;
4334 unsigned long haddr = address & huge_page_mask(h);
4335 bool new_page = false;
4338 * Currently, we are forced to kill the process in the event the
4339 * original mapper has unmapped pages from the child due to a failed
4340 * COW. Warn that such a situation has occurred as it may not be obvious
4342 if (is_vma_resv_set(vma, HPAGE_RESV_UNMAPPED)) {
4343 pr_warn_ratelimited("PID %d killed due to inadequate hugepage pool\n",
4349 * We can not race with truncation due to holding i_mmap_rwsem.
4350 * i_size is modified when holding i_mmap_rwsem, so check here
4351 * once for faults beyond end of file.
4353 size = i_size_read(mapping->host) >> huge_page_shift(h);
4358 page = find_lock_page(mapping, idx);
4361 * Check for page in userfault range
4363 if (userfaultfd_missing(vma)) {
4365 struct vm_fault vmf = {
4370 * Hard to debug if it ends up being
4371 * used by a callee that assumes
4372 * something about the other
4373 * uninitialized fields... same as in
4379 * hugetlb_fault_mutex and i_mmap_rwsem must be
4380 * dropped before handling userfault. Reacquire
4381 * after handling fault to make calling code simpler.
4383 hash = hugetlb_fault_mutex_hash(mapping, idx);
4384 mutex_unlock(&hugetlb_fault_mutex_table[hash]);
4385 i_mmap_unlock_read(mapping);
4386 ret = handle_userfault(&vmf, VM_UFFD_MISSING);
4387 i_mmap_lock_read(mapping);
4388 mutex_lock(&hugetlb_fault_mutex_table[hash]);
4392 page = alloc_huge_page(vma, haddr, 0);
4395 * Returning error will result in faulting task being
4396 * sent SIGBUS. The hugetlb fault mutex prevents two
4397 * tasks from racing to fault in the same page which
4398 * could result in false unable to allocate errors.
4399 * Page migration does not take the fault mutex, but
4400 * does a clear then write of pte's under page table
4401 * lock. Page fault code could race with migration,
4402 * notice the clear pte and try to allocate a page
4403 * here. Before returning error, get ptl and make
4404 * sure there really is no pte entry.
4406 ptl = huge_pte_lock(h, mm, ptep);
4408 if (huge_pte_none(huge_ptep_get(ptep)))
4409 ret = vmf_error(PTR_ERR(page));
4413 clear_huge_page(page, address, pages_per_huge_page(h));
4414 __SetPageUptodate(page);
4417 if (vma->vm_flags & VM_MAYSHARE) {
4418 int err = huge_add_to_page_cache(page, mapping, idx);
4427 if (unlikely(anon_vma_prepare(vma))) {
4429 goto backout_unlocked;
4435 * If memory error occurs between mmap() and fault, some process
4436 * don't have hwpoisoned swap entry for errored virtual address.
4437 * So we need to block hugepage fault by PG_hwpoison bit check.
4439 if (unlikely(PageHWPoison(page))) {
4440 ret = VM_FAULT_HWPOISON_LARGE |
4441 VM_FAULT_SET_HINDEX(hstate_index(h));
4442 goto backout_unlocked;
4447 * If we are going to COW a private mapping later, we examine the
4448 * pending reservations for this page now. This will ensure that
4449 * any allocations necessary to record that reservation occur outside
4452 if ((flags & FAULT_FLAG_WRITE) && !(vma->vm_flags & VM_SHARED)) {
4453 if (vma_needs_reservation(h, vma, haddr) < 0) {
4455 goto backout_unlocked;
4457 /* Just decrements count, does not deallocate */
4458 vma_end_reservation(h, vma, haddr);
4461 ptl = huge_pte_lock(h, mm, ptep);
4463 if (!huge_pte_none(huge_ptep_get(ptep)))
4467 ClearHPageRestoreReserve(page);
4468 hugepage_add_new_anon_rmap(page, vma, haddr);
4470 page_dup_rmap(page, true);
4471 new_pte = make_huge_pte(vma, page, ((vma->vm_flags & VM_WRITE)
4472 && (vma->vm_flags & VM_SHARED)));
4473 set_huge_pte_at(mm, haddr, ptep, new_pte);
4475 hugetlb_count_add(pages_per_huge_page(h), mm);
4476 if ((flags & FAULT_FLAG_WRITE) && !(vma->vm_flags & VM_SHARED)) {
4477 /* Optimization, do the COW without a second fault */
4478 ret = hugetlb_cow(mm, vma, address, ptep, page, ptl);
4484 * Only set HPageMigratable in newly allocated pages. Existing pages
4485 * found in the pagecache may not have HPageMigratableset if they have
4486 * been isolated for migration.
4489 SetHPageMigratable(page);
4499 restore_reserve_on_error(h, vma, haddr, page);
4505 u32 hugetlb_fault_mutex_hash(struct address_space *mapping, pgoff_t idx)
4507 unsigned long key[2];
4510 key[0] = (unsigned long) mapping;
4513 hash = jhash2((u32 *)&key, sizeof(key)/(sizeof(u32)), 0);
4515 return hash & (num_fault_mutexes - 1);
4519 * For uniprocessor systems we always use a single mutex, so just
4520 * return 0 and avoid the hashing overhead.
4522 u32 hugetlb_fault_mutex_hash(struct address_space *mapping, pgoff_t idx)
4528 vm_fault_t hugetlb_fault(struct mm_struct *mm, struct vm_area_struct *vma,
4529 unsigned long address, unsigned int flags)
4536 struct page *page = NULL;
4537 struct page *pagecache_page = NULL;
4538 struct hstate *h = hstate_vma(vma);
4539 struct address_space *mapping;
4540 int need_wait_lock = 0;
4541 unsigned long haddr = address & huge_page_mask(h);
4543 ptep = huge_pte_offset(mm, haddr, huge_page_size(h));
4546 * Since we hold no locks, ptep could be stale. That is
4547 * OK as we are only making decisions based on content and
4548 * not actually modifying content here.
4550 entry = huge_ptep_get(ptep);
4551 if (unlikely(is_hugetlb_entry_migration(entry))) {
4552 migration_entry_wait_huge(vma, mm, ptep);
4554 } else if (unlikely(is_hugetlb_entry_hwpoisoned(entry)))
4555 return VM_FAULT_HWPOISON_LARGE |
4556 VM_FAULT_SET_HINDEX(hstate_index(h));
4560 * Acquire i_mmap_rwsem before calling huge_pte_alloc and hold
4561 * until finished with ptep. This serves two purposes:
4562 * 1) It prevents huge_pmd_unshare from being called elsewhere
4563 * and making the ptep no longer valid.
4564 * 2) It synchronizes us with i_size modifications during truncation.
4566 * ptep could have already be assigned via huge_pte_offset. That
4567 * is OK, as huge_pte_alloc will return the same value unless
4568 * something has changed.
4570 mapping = vma->vm_file->f_mapping;
4571 i_mmap_lock_read(mapping);
4572 ptep = huge_pte_alloc(mm, vma, haddr, huge_page_size(h));
4574 i_mmap_unlock_read(mapping);
4575 return VM_FAULT_OOM;
4579 * Serialize hugepage allocation and instantiation, so that we don't
4580 * get spurious allocation failures if two CPUs race to instantiate
4581 * the same page in the page cache.
4583 idx = vma_hugecache_offset(h, vma, haddr);
4584 hash = hugetlb_fault_mutex_hash(mapping, idx);
4585 mutex_lock(&hugetlb_fault_mutex_table[hash]);
4587 entry = huge_ptep_get(ptep);
4588 if (huge_pte_none(entry)) {
4589 ret = hugetlb_no_page(mm, vma, mapping, idx, address, ptep, flags);
4596 * entry could be a migration/hwpoison entry at this point, so this
4597 * check prevents the kernel from going below assuming that we have
4598 * an active hugepage in pagecache. This goto expects the 2nd page
4599 * fault, and is_hugetlb_entry_(migration|hwpoisoned) check will
4600 * properly handle it.
4602 if (!pte_present(entry))
4606 * If we are going to COW the mapping later, we examine the pending
4607 * reservations for this page now. This will ensure that any
4608 * allocations necessary to record that reservation occur outside the
4609 * spinlock. For private mappings, we also lookup the pagecache
4610 * page now as it is used to determine if a reservation has been
4613 if ((flags & FAULT_FLAG_WRITE) && !huge_pte_write(entry)) {
4614 if (vma_needs_reservation(h, vma, haddr) < 0) {
4618 /* Just decrements count, does not deallocate */
4619 vma_end_reservation(h, vma, haddr);
4621 if (!(vma->vm_flags & VM_MAYSHARE))
4622 pagecache_page = hugetlbfs_pagecache_page(h,
4626 ptl = huge_pte_lock(h, mm, ptep);
4628 /* Check for a racing update before calling hugetlb_cow */
4629 if (unlikely(!pte_same(entry, huge_ptep_get(ptep))))
4633 * hugetlb_cow() requires page locks of pte_page(entry) and
4634 * pagecache_page, so here we need take the former one
4635 * when page != pagecache_page or !pagecache_page.
4637 page = pte_page(entry);
4638 if (page != pagecache_page)
4639 if (!trylock_page(page)) {
4646 if (flags & FAULT_FLAG_WRITE) {
4647 if (!huge_pte_write(entry)) {
4648 ret = hugetlb_cow(mm, vma, address, ptep,
4649 pagecache_page, ptl);
4652 entry = huge_pte_mkdirty(entry);
4654 entry = pte_mkyoung(entry);
4655 if (huge_ptep_set_access_flags(vma, haddr, ptep, entry,
4656 flags & FAULT_FLAG_WRITE))
4657 update_mmu_cache(vma, haddr, ptep);
4659 if (page != pagecache_page)
4665 if (pagecache_page) {
4666 unlock_page(pagecache_page);
4667 put_page(pagecache_page);
4670 mutex_unlock(&hugetlb_fault_mutex_table[hash]);
4671 i_mmap_unlock_read(mapping);
4673 * Generally it's safe to hold refcount during waiting page lock. But
4674 * here we just wait to defer the next page fault to avoid busy loop and
4675 * the page is not used after unlocked before returning from the current
4676 * page fault. So we are safe from accessing freed page, even if we wait
4677 * here without taking refcount.
4680 wait_on_page_locked(page);
4685 * Used by userfaultfd UFFDIO_COPY. Based on mcopy_atomic_pte with
4686 * modifications for huge pages.
4688 int hugetlb_mcopy_atomic_pte(struct mm_struct *dst_mm,
4690 struct vm_area_struct *dst_vma,
4691 unsigned long dst_addr,
4692 unsigned long src_addr,
4693 struct page **pagep)
4695 struct address_space *mapping;
4698 int vm_shared = dst_vma->vm_flags & VM_SHARED;
4699 struct hstate *h = hstate_vma(dst_vma);
4707 page = alloc_huge_page(dst_vma, dst_addr, 0);
4711 ret = copy_huge_page_from_user(page,
4712 (const void __user *) src_addr,
4713 pages_per_huge_page(h), false);
4715 /* fallback to copy_from_user outside mmap_lock */
4716 if (unlikely(ret)) {
4719 /* don't free the page */
4728 * The memory barrier inside __SetPageUptodate makes sure that
4729 * preceding stores to the page contents become visible before
4730 * the set_pte_at() write.
4732 __SetPageUptodate(page);
4734 mapping = dst_vma->vm_file->f_mapping;
4735 idx = vma_hugecache_offset(h, dst_vma, dst_addr);
4738 * If shared, add to page cache
4741 size = i_size_read(mapping->host) >> huge_page_shift(h);
4744 goto out_release_nounlock;
4747 * Serialization between remove_inode_hugepages() and
4748 * huge_add_to_page_cache() below happens through the
4749 * hugetlb_fault_mutex_table that here must be hold by
4752 ret = huge_add_to_page_cache(page, mapping, idx);
4754 goto out_release_nounlock;
4757 ptl = huge_pte_lockptr(h, dst_mm, dst_pte);
4761 * Recheck the i_size after holding PT lock to make sure not
4762 * to leave any page mapped (as page_mapped()) beyond the end
4763 * of the i_size (remove_inode_hugepages() is strict about
4764 * enforcing that). If we bail out here, we'll also leave a
4765 * page in the radix tree in the vm_shared case beyond the end
4766 * of the i_size, but remove_inode_hugepages() will take care
4767 * of it as soon as we drop the hugetlb_fault_mutex_table.
4769 size = i_size_read(mapping->host) >> huge_page_shift(h);
4772 goto out_release_unlock;
4775 if (!huge_pte_none(huge_ptep_get(dst_pte)))
4776 goto out_release_unlock;
4779 page_dup_rmap(page, true);
4781 ClearHPageRestoreReserve(page);
4782 hugepage_add_new_anon_rmap(page, dst_vma, dst_addr);
4785 _dst_pte = make_huge_pte(dst_vma, page, dst_vma->vm_flags & VM_WRITE);
4786 if (dst_vma->vm_flags & VM_WRITE)
4787 _dst_pte = huge_pte_mkdirty(_dst_pte);
4788 _dst_pte = pte_mkyoung(_dst_pte);
4790 set_huge_pte_at(dst_mm, dst_addr, dst_pte, _dst_pte);
4792 (void)huge_ptep_set_access_flags(dst_vma, dst_addr, dst_pte, _dst_pte,
4793 dst_vma->vm_flags & VM_WRITE);
4794 hugetlb_count_add(pages_per_huge_page(h), dst_mm);
4796 /* No need to invalidate - it was non-present before */
4797 update_mmu_cache(dst_vma, dst_addr, dst_pte);
4800 SetHPageMigratable(page);
4810 out_release_nounlock:
4815 static void record_subpages_vmas(struct page *page, struct vm_area_struct *vma,
4816 int refs, struct page **pages,
4817 struct vm_area_struct **vmas)
4821 for (nr = 0; nr < refs; nr++) {
4823 pages[nr] = mem_map_offset(page, nr);
4829 long follow_hugetlb_page(struct mm_struct *mm, struct vm_area_struct *vma,
4830 struct page **pages, struct vm_area_struct **vmas,
4831 unsigned long *position, unsigned long *nr_pages,
4832 long i, unsigned int flags, int *locked)
4834 unsigned long pfn_offset;
4835 unsigned long vaddr = *position;
4836 unsigned long remainder = *nr_pages;
4837 struct hstate *h = hstate_vma(vma);
4838 int err = -EFAULT, refs;
4840 while (vaddr < vma->vm_end && remainder) {
4842 spinlock_t *ptl = NULL;
4847 * If we have a pending SIGKILL, don't keep faulting pages and
4848 * potentially allocating memory.
4850 if (fatal_signal_pending(current)) {
4856 * Some archs (sparc64, sh*) have multiple pte_ts to
4857 * each hugepage. We have to make sure we get the
4858 * first, for the page indexing below to work.
4860 * Note that page table lock is not held when pte is null.
4862 pte = huge_pte_offset(mm, vaddr & huge_page_mask(h),
4865 ptl = huge_pte_lock(h, mm, pte);
4866 absent = !pte || huge_pte_none(huge_ptep_get(pte));
4869 * When coredumping, it suits get_dump_page if we just return
4870 * an error where there's an empty slot with no huge pagecache
4871 * to back it. This way, we avoid allocating a hugepage, and
4872 * the sparse dumpfile avoids allocating disk blocks, but its
4873 * huge holes still show up with zeroes where they need to be.
4875 if (absent && (flags & FOLL_DUMP) &&
4876 !hugetlbfs_pagecache_present(h, vma, vaddr)) {
4884 * We need call hugetlb_fault for both hugepages under migration
4885 * (in which case hugetlb_fault waits for the migration,) and
4886 * hwpoisoned hugepages (in which case we need to prevent the
4887 * caller from accessing to them.) In order to do this, we use
4888 * here is_swap_pte instead of is_hugetlb_entry_migration and
4889 * is_hugetlb_entry_hwpoisoned. This is because it simply covers
4890 * both cases, and because we can't follow correct pages
4891 * directly from any kind of swap entries.
4893 if (absent || is_swap_pte(huge_ptep_get(pte)) ||
4894 ((flags & FOLL_WRITE) &&
4895 !huge_pte_write(huge_ptep_get(pte)))) {
4897 unsigned int fault_flags = 0;
4901 if (flags & FOLL_WRITE)
4902 fault_flags |= FAULT_FLAG_WRITE;
4904 fault_flags |= FAULT_FLAG_ALLOW_RETRY |
4905 FAULT_FLAG_KILLABLE;
4906 if (flags & FOLL_NOWAIT)
4907 fault_flags |= FAULT_FLAG_ALLOW_RETRY |
4908 FAULT_FLAG_RETRY_NOWAIT;
4909 if (flags & FOLL_TRIED) {
4911 * Note: FAULT_FLAG_ALLOW_RETRY and
4912 * FAULT_FLAG_TRIED can co-exist
4914 fault_flags |= FAULT_FLAG_TRIED;
4916 ret = hugetlb_fault(mm, vma, vaddr, fault_flags);
4917 if (ret & VM_FAULT_ERROR) {
4918 err = vm_fault_to_errno(ret, flags);
4922 if (ret & VM_FAULT_RETRY) {
4924 !(fault_flags & FAULT_FLAG_RETRY_NOWAIT))
4928 * VM_FAULT_RETRY must not return an
4929 * error, it will return zero
4932 * No need to update "position" as the
4933 * caller will not check it after
4934 * *nr_pages is set to 0.
4941 pfn_offset = (vaddr & ~huge_page_mask(h)) >> PAGE_SHIFT;
4942 page = pte_page(huge_ptep_get(pte));
4945 * If subpage information not requested, update counters
4946 * and skip the same_page loop below.
4948 if (!pages && !vmas && !pfn_offset &&
4949 (vaddr + huge_page_size(h) < vma->vm_end) &&
4950 (remainder >= pages_per_huge_page(h))) {
4951 vaddr += huge_page_size(h);
4952 remainder -= pages_per_huge_page(h);
4953 i += pages_per_huge_page(h);
4958 refs = min3(pages_per_huge_page(h) - pfn_offset,
4959 (vma->vm_end - vaddr) >> PAGE_SHIFT, remainder);
4962 record_subpages_vmas(mem_map_offset(page, pfn_offset),
4964 likely(pages) ? pages + i : NULL,
4965 vmas ? vmas + i : NULL);
4969 * try_grab_compound_head() should always succeed here,
4970 * because: a) we hold the ptl lock, and b) we've just
4971 * checked that the huge page is present in the page
4972 * tables. If the huge page is present, then the tail
4973 * pages must also be present. The ptl prevents the
4974 * head page and tail pages from being rearranged in
4975 * any way. So this page must be available at this
4976 * point, unless the page refcount overflowed:
4978 if (WARN_ON_ONCE(!try_grab_compound_head(pages[i],
4988 vaddr += (refs << PAGE_SHIFT);
4994 *nr_pages = remainder;
4996 * setting position is actually required only if remainder is
4997 * not zero but it's faster not to add a "if (remainder)"
5005 unsigned long hugetlb_change_protection(struct vm_area_struct *vma,
5006 unsigned long address, unsigned long end, pgprot_t newprot)
5008 struct mm_struct *mm = vma->vm_mm;
5009 unsigned long start = address;
5012 struct hstate *h = hstate_vma(vma);
5013 unsigned long pages = 0;
5014 bool shared_pmd = false;
5015 struct mmu_notifier_range range;
5018 * In the case of shared PMDs, the area to flush could be beyond
5019 * start/end. Set range.start/range.end to cover the maximum possible
5020 * range if PMD sharing is possible.
5022 mmu_notifier_range_init(&range, MMU_NOTIFY_PROTECTION_VMA,
5023 0, vma, mm, start, end);
5024 adjust_range_if_pmd_sharing_possible(vma, &range.start, &range.end);
5026 BUG_ON(address >= end);
5027 flush_cache_range(vma, range.start, range.end);
5029 mmu_notifier_invalidate_range_start(&range);
5030 i_mmap_lock_write(vma->vm_file->f_mapping);
5031 for (; address < end; address += huge_page_size(h)) {
5033 ptep = huge_pte_offset(mm, address, huge_page_size(h));
5036 ptl = huge_pte_lock(h, mm, ptep);
5037 if (huge_pmd_unshare(mm, vma, &address, ptep)) {
5043 pte = huge_ptep_get(ptep);
5044 if (unlikely(is_hugetlb_entry_hwpoisoned(pte))) {
5048 if (unlikely(is_hugetlb_entry_migration(pte))) {
5049 swp_entry_t entry = pte_to_swp_entry(pte);
5051 if (is_write_migration_entry(entry)) {
5054 make_migration_entry_read(&entry);
5055 newpte = swp_entry_to_pte(entry);
5056 set_huge_swap_pte_at(mm, address, ptep,
5057 newpte, huge_page_size(h));
5063 if (!huge_pte_none(pte)) {
5066 old_pte = huge_ptep_modify_prot_start(vma, address, ptep);
5067 pte = pte_mkhuge(huge_pte_modify(old_pte, newprot));
5068 pte = arch_make_huge_pte(pte, vma, NULL, 0);
5069 huge_ptep_modify_prot_commit(vma, address, ptep, old_pte, pte);
5075 * Must flush TLB before releasing i_mmap_rwsem: x86's huge_pmd_unshare
5076 * may have cleared our pud entry and done put_page on the page table:
5077 * once we release i_mmap_rwsem, another task can do the final put_page
5078 * and that page table be reused and filled with junk. If we actually
5079 * did unshare a page of pmds, flush the range corresponding to the pud.
5082 flush_hugetlb_tlb_range(vma, range.start, range.end);
5084 flush_hugetlb_tlb_range(vma, start, end);
5086 * No need to call mmu_notifier_invalidate_range() we are downgrading
5087 * page table protection not changing it to point to a new page.
5089 * See Documentation/vm/mmu_notifier.rst
5091 i_mmap_unlock_write(vma->vm_file->f_mapping);
5092 mmu_notifier_invalidate_range_end(&range);
5094 return pages << h->order;
5097 /* Return true if reservation was successful, false otherwise. */
5098 bool hugetlb_reserve_pages(struct inode *inode,
5100 struct vm_area_struct *vma,
5101 vm_flags_t vm_flags)
5104 struct hstate *h = hstate_inode(inode);
5105 struct hugepage_subpool *spool = subpool_inode(inode);
5106 struct resv_map *resv_map;
5107 struct hugetlb_cgroup *h_cg = NULL;
5108 long gbl_reserve, regions_needed = 0;
5110 /* This should never happen */
5112 VM_WARN(1, "%s called with a negative range\n", __func__);
5117 * Only apply hugepage reservation if asked. At fault time, an
5118 * attempt will be made for VM_NORESERVE to allocate a page
5119 * without using reserves
5121 if (vm_flags & VM_NORESERVE)
5125 * Shared mappings base their reservation on the number of pages that
5126 * are already allocated on behalf of the file. Private mappings need
5127 * to reserve the full area even if read-only as mprotect() may be
5128 * called to make the mapping read-write. Assume !vma is a shm mapping
5130 if (!vma || vma->vm_flags & VM_MAYSHARE) {
5132 * resv_map can not be NULL as hugetlb_reserve_pages is only
5133 * called for inodes for which resv_maps were created (see
5134 * hugetlbfs_get_inode).
5136 resv_map = inode_resv_map(inode);
5138 chg = region_chg(resv_map, from, to, ®ions_needed);
5141 /* Private mapping. */
5142 resv_map = resv_map_alloc();
5148 set_vma_resv_map(vma, resv_map);
5149 set_vma_resv_flags(vma, HPAGE_RESV_OWNER);
5155 if (hugetlb_cgroup_charge_cgroup_rsvd(hstate_index(h),
5156 chg * pages_per_huge_page(h), &h_cg) < 0)
5159 if (vma && !(vma->vm_flags & VM_MAYSHARE) && h_cg) {
5160 /* For private mappings, the hugetlb_cgroup uncharge info hangs
5163 resv_map_set_hugetlb_cgroup_uncharge_info(resv_map, h_cg, h);
5167 * There must be enough pages in the subpool for the mapping. If
5168 * the subpool has a minimum size, there may be some global
5169 * reservations already in place (gbl_reserve).
5171 gbl_reserve = hugepage_subpool_get_pages(spool, chg);
5172 if (gbl_reserve < 0)
5173 goto out_uncharge_cgroup;
5176 * Check enough hugepages are available for the reservation.
5177 * Hand the pages back to the subpool if there are not
5179 if (hugetlb_acct_memory(h, gbl_reserve) < 0)
5183 * Account for the reservations made. Shared mappings record regions
5184 * that have reservations as they are shared by multiple VMAs.
5185 * When the last VMA disappears, the region map says how much
5186 * the reservation was and the page cache tells how much of
5187 * the reservation was consumed. Private mappings are per-VMA and
5188 * only the consumed reservations are tracked. When the VMA
5189 * disappears, the original reservation is the VMA size and the
5190 * consumed reservations are stored in the map. Hence, nothing
5191 * else has to be done for private mappings here
5193 if (!vma || vma->vm_flags & VM_MAYSHARE) {
5194 add = region_add(resv_map, from, to, regions_needed, h, h_cg);
5196 if (unlikely(add < 0)) {
5197 hugetlb_acct_memory(h, -gbl_reserve);
5199 } else if (unlikely(chg > add)) {
5201 * pages in this range were added to the reserve
5202 * map between region_chg and region_add. This
5203 * indicates a race with alloc_huge_page. Adjust
5204 * the subpool and reserve counts modified above
5205 * based on the difference.
5210 * hugetlb_cgroup_uncharge_cgroup_rsvd() will put the
5211 * reference to h_cg->css. See comment below for detail.
5213 hugetlb_cgroup_uncharge_cgroup_rsvd(
5215 (chg - add) * pages_per_huge_page(h), h_cg);
5217 rsv_adjust = hugepage_subpool_put_pages(spool,
5219 hugetlb_acct_memory(h, -rsv_adjust);
5222 * The file_regions will hold their own reference to
5223 * h_cg->css. So we should release the reference held
5224 * via hugetlb_cgroup_charge_cgroup_rsvd() when we are
5227 hugetlb_cgroup_put_rsvd_cgroup(h_cg);
5233 /* put back original number of pages, chg */
5234 (void)hugepage_subpool_put_pages(spool, chg);
5235 out_uncharge_cgroup:
5236 hugetlb_cgroup_uncharge_cgroup_rsvd(hstate_index(h),
5237 chg * pages_per_huge_page(h), h_cg);
5239 if (!vma || vma->vm_flags & VM_MAYSHARE)
5240 /* Only call region_abort if the region_chg succeeded but the
5241 * region_add failed or didn't run.
5243 if (chg >= 0 && add < 0)
5244 region_abort(resv_map, from, to, regions_needed);
5245 if (vma && is_vma_resv_set(vma, HPAGE_RESV_OWNER))
5246 kref_put(&resv_map->refs, resv_map_release);
5250 long hugetlb_unreserve_pages(struct inode *inode, long start, long end,
5253 struct hstate *h = hstate_inode(inode);
5254 struct resv_map *resv_map = inode_resv_map(inode);
5256 struct hugepage_subpool *spool = subpool_inode(inode);
5260 * Since this routine can be called in the evict inode path for all
5261 * hugetlbfs inodes, resv_map could be NULL.
5264 chg = region_del(resv_map, start, end);
5266 * region_del() can fail in the rare case where a region
5267 * must be split and another region descriptor can not be
5268 * allocated. If end == LONG_MAX, it will not fail.
5274 spin_lock(&inode->i_lock);
5275 inode->i_blocks -= (blocks_per_huge_page(h) * freed);
5276 spin_unlock(&inode->i_lock);
5279 * If the subpool has a minimum size, the number of global
5280 * reservations to be released may be adjusted.
5282 * Note that !resv_map implies freed == 0. So (chg - freed)
5283 * won't go negative.
5285 gbl_reserve = hugepage_subpool_put_pages(spool, (chg - freed));
5286 hugetlb_acct_memory(h, -gbl_reserve);
5291 #ifdef CONFIG_ARCH_WANT_HUGE_PMD_SHARE
5292 static unsigned long page_table_shareable(struct vm_area_struct *svma,
5293 struct vm_area_struct *vma,
5294 unsigned long addr, pgoff_t idx)
5296 unsigned long saddr = ((idx - svma->vm_pgoff) << PAGE_SHIFT) +
5298 unsigned long sbase = saddr & PUD_MASK;
5299 unsigned long s_end = sbase + PUD_SIZE;
5301 /* Allow segments to share if only one is marked locked */
5302 unsigned long vm_flags = vma->vm_flags & VM_LOCKED_CLEAR_MASK;
5303 unsigned long svm_flags = svma->vm_flags & VM_LOCKED_CLEAR_MASK;
5306 * match the virtual addresses, permission and the alignment of the
5309 if (pmd_index(addr) != pmd_index(saddr) ||
5310 vm_flags != svm_flags ||
5311 !range_in_vma(svma, sbase, s_end))
5317 static bool vma_shareable(struct vm_area_struct *vma, unsigned long addr)
5319 unsigned long base = addr & PUD_MASK;
5320 unsigned long end = base + PUD_SIZE;
5323 * check on proper vm_flags and page table alignment
5325 if (vma->vm_flags & VM_MAYSHARE && range_in_vma(vma, base, end))
5330 bool want_pmd_share(struct vm_area_struct *vma, unsigned long addr)
5332 #ifdef CONFIG_USERFAULTFD
5333 if (uffd_disable_huge_pmd_share(vma))
5336 return vma_shareable(vma, addr);
5340 * Determine if start,end range within vma could be mapped by shared pmd.
5341 * If yes, adjust start and end to cover range associated with possible
5342 * shared pmd mappings.
5344 void adjust_range_if_pmd_sharing_possible(struct vm_area_struct *vma,
5345 unsigned long *start, unsigned long *end)
5347 unsigned long v_start = ALIGN(vma->vm_start, PUD_SIZE),
5348 v_end = ALIGN_DOWN(vma->vm_end, PUD_SIZE);
5351 * vma need span at least one aligned PUD size and the start,end range
5352 * must at least partialy within it.
5354 if (!(vma->vm_flags & VM_MAYSHARE) || !(v_end > v_start) ||
5355 (*end <= v_start) || (*start >= v_end))
5358 /* Extend the range to be PUD aligned for a worst case scenario */
5359 if (*start > v_start)
5360 *start = ALIGN_DOWN(*start, PUD_SIZE);
5363 *end = ALIGN(*end, PUD_SIZE);
5367 * Search for a shareable pmd page for hugetlb. In any case calls pmd_alloc()
5368 * and returns the corresponding pte. While this is not necessary for the
5369 * !shared pmd case because we can allocate the pmd later as well, it makes the
5370 * code much cleaner.
5372 * This routine must be called with i_mmap_rwsem held in at least read mode if
5373 * sharing is possible. For hugetlbfs, this prevents removal of any page
5374 * table entries associated with the address space. This is important as we
5375 * are setting up sharing based on existing page table entries (mappings).
5377 * NOTE: This routine is only called from huge_pte_alloc. Some callers of
5378 * huge_pte_alloc know that sharing is not possible and do not take
5379 * i_mmap_rwsem as a performance optimization. This is handled by the
5380 * if !vma_shareable check at the beginning of the routine. i_mmap_rwsem is
5381 * only required for subsequent processing.
5383 pte_t *huge_pmd_share(struct mm_struct *mm, struct vm_area_struct *vma,
5384 unsigned long addr, pud_t *pud)
5386 struct address_space *mapping = vma->vm_file->f_mapping;
5387 pgoff_t idx = ((addr - vma->vm_start) >> PAGE_SHIFT) +
5389 struct vm_area_struct *svma;
5390 unsigned long saddr;
5395 i_mmap_assert_locked(mapping);
5396 vma_interval_tree_foreach(svma, &mapping->i_mmap, idx, idx) {
5400 saddr = page_table_shareable(svma, vma, addr, idx);
5402 spte = huge_pte_offset(svma->vm_mm, saddr,
5403 vma_mmu_pagesize(svma));
5405 get_page(virt_to_page(spte));
5414 ptl = huge_pte_lock(hstate_vma(vma), mm, spte);
5415 if (pud_none(*pud)) {
5416 pud_populate(mm, pud,
5417 (pmd_t *)((unsigned long)spte & PAGE_MASK));
5420 put_page(virt_to_page(spte));
5424 pte = (pte_t *)pmd_alloc(mm, pud, addr);
5429 * unmap huge page backed by shared pte.
5431 * Hugetlb pte page is ref counted at the time of mapping. If pte is shared
5432 * indicated by page_count > 1, unmap is achieved by clearing pud and
5433 * decrementing the ref count. If count == 1, the pte page is not shared.
5435 * Called with page table lock held and i_mmap_rwsem held in write mode.
5437 * returns: 1 successfully unmapped a shared pte page
5438 * 0 the underlying pte page is not shared, or it is the last user
5440 int huge_pmd_unshare(struct mm_struct *mm, struct vm_area_struct *vma,
5441 unsigned long *addr, pte_t *ptep)
5443 pgd_t *pgd = pgd_offset(mm, *addr);
5444 p4d_t *p4d = p4d_offset(pgd, *addr);
5445 pud_t *pud = pud_offset(p4d, *addr);
5447 i_mmap_assert_write_locked(vma->vm_file->f_mapping);
5448 BUG_ON(page_count(virt_to_page(ptep)) == 0);
5449 if (page_count(virt_to_page(ptep)) == 1)
5453 put_page(virt_to_page(ptep));
5455 *addr = ALIGN(*addr, HPAGE_SIZE * PTRS_PER_PTE) - HPAGE_SIZE;
5459 #else /* !CONFIG_ARCH_WANT_HUGE_PMD_SHARE */
5460 pte_t *huge_pmd_share(struct mm_struct *mm, struct vm_area_struct *vma,
5461 unsigned long addr, pud_t *pud)
5466 int huge_pmd_unshare(struct mm_struct *mm, struct vm_area_struct *vma,
5467 unsigned long *addr, pte_t *ptep)
5472 void adjust_range_if_pmd_sharing_possible(struct vm_area_struct *vma,
5473 unsigned long *start, unsigned long *end)
5477 bool want_pmd_share(struct vm_area_struct *vma, unsigned long addr)
5481 #endif /* CONFIG_ARCH_WANT_HUGE_PMD_SHARE */
5483 #ifdef CONFIG_ARCH_WANT_GENERAL_HUGETLB
5484 pte_t *huge_pte_alloc(struct mm_struct *mm, struct vm_area_struct *vma,
5485 unsigned long addr, unsigned long sz)
5492 pgd = pgd_offset(mm, addr);
5493 p4d = p4d_alloc(mm, pgd, addr);
5496 pud = pud_alloc(mm, p4d, addr);
5498 if (sz == PUD_SIZE) {
5501 BUG_ON(sz != PMD_SIZE);
5502 if (want_pmd_share(vma, addr) && pud_none(*pud))
5503 pte = huge_pmd_share(mm, vma, addr, pud);
5505 pte = (pte_t *)pmd_alloc(mm, pud, addr);
5508 BUG_ON(pte && pte_present(*pte) && !pte_huge(*pte));
5514 * huge_pte_offset() - Walk the page table to resolve the hugepage
5515 * entry at address @addr
5517 * Return: Pointer to page table entry (PUD or PMD) for
5518 * address @addr, or NULL if a !p*d_present() entry is encountered and the
5519 * size @sz doesn't match the hugepage size at this level of the page
5522 pte_t *huge_pte_offset(struct mm_struct *mm,
5523 unsigned long addr, unsigned long sz)
5530 pgd = pgd_offset(mm, addr);
5531 if (!pgd_present(*pgd))
5533 p4d = p4d_offset(pgd, addr);
5534 if (!p4d_present(*p4d))
5537 pud = pud_offset(p4d, addr);
5539 /* must be pud huge, non-present or none */
5540 return (pte_t *)pud;
5541 if (!pud_present(*pud))
5543 /* must have a valid entry and size to go further */
5545 pmd = pmd_offset(pud, addr);
5546 /* must be pmd huge, non-present or none */
5547 return (pte_t *)pmd;
5550 #endif /* CONFIG_ARCH_WANT_GENERAL_HUGETLB */
5553 * These functions are overwritable if your architecture needs its own
5556 struct page * __weak
5557 follow_huge_addr(struct mm_struct *mm, unsigned long address,
5560 return ERR_PTR(-EINVAL);
5563 struct page * __weak
5564 follow_huge_pd(struct vm_area_struct *vma,
5565 unsigned long address, hugepd_t hpd, int flags, int pdshift)
5567 WARN(1, "hugepd follow called with no support for hugepage directory format\n");
5571 struct page * __weak
5572 follow_huge_pmd(struct mm_struct *mm, unsigned long address,
5573 pmd_t *pmd, int flags)
5575 struct page *page = NULL;
5579 /* FOLL_GET and FOLL_PIN are mutually exclusive. */
5580 if (WARN_ON_ONCE((flags & (FOLL_PIN | FOLL_GET)) ==
5581 (FOLL_PIN | FOLL_GET)))
5585 ptl = pmd_lockptr(mm, pmd);
5588 * make sure that the address range covered by this pmd is not
5589 * unmapped from other threads.
5591 if (!pmd_huge(*pmd))
5593 pte = huge_ptep_get((pte_t *)pmd);
5594 if (pte_present(pte)) {
5595 page = pmd_page(*pmd) + ((address & ~PMD_MASK) >> PAGE_SHIFT);
5597 * try_grab_page() should always succeed here, because: a) we
5598 * hold the pmd (ptl) lock, and b) we've just checked that the
5599 * huge pmd (head) page is present in the page tables. The ptl
5600 * prevents the head page and tail pages from being rearranged
5601 * in any way. So this page must be available at this point,
5602 * unless the page refcount overflowed:
5604 if (WARN_ON_ONCE(!try_grab_page(page, flags))) {
5609 if (is_hugetlb_entry_migration(pte)) {
5611 __migration_entry_wait(mm, (pte_t *)pmd, ptl);
5615 * hwpoisoned entry is treated as no_page_table in
5616 * follow_page_mask().
5624 struct page * __weak
5625 follow_huge_pud(struct mm_struct *mm, unsigned long address,
5626 pud_t *pud, int flags)
5628 if (flags & (FOLL_GET | FOLL_PIN))
5631 return pte_page(*(pte_t *)pud) + ((address & ~PUD_MASK) >> PAGE_SHIFT);
5634 struct page * __weak
5635 follow_huge_pgd(struct mm_struct *mm, unsigned long address, pgd_t *pgd, int flags)
5637 if (flags & (FOLL_GET | FOLL_PIN))
5640 return pte_page(*(pte_t *)pgd) + ((address & ~PGDIR_MASK) >> PAGE_SHIFT);
5643 bool isolate_huge_page(struct page *page, struct list_head *list)
5647 spin_lock_irq(&hugetlb_lock);
5648 if (!PageHeadHuge(page) ||
5649 !HPageMigratable(page) ||
5650 !get_page_unless_zero(page)) {
5654 ClearHPageMigratable(page);
5655 list_move_tail(&page->lru, list);
5657 spin_unlock_irq(&hugetlb_lock);
5661 void putback_active_hugepage(struct page *page)
5663 spin_lock_irq(&hugetlb_lock);
5664 SetHPageMigratable(page);
5665 list_move_tail(&page->lru, &(page_hstate(page))->hugepage_activelist);
5666 spin_unlock_irq(&hugetlb_lock);
5670 void move_hugetlb_state(struct page *oldpage, struct page *newpage, int reason)
5672 struct hstate *h = page_hstate(oldpage);
5674 hugetlb_cgroup_migrate(oldpage, newpage);
5675 set_page_owner_migrate_reason(newpage, reason);
5678 * transfer temporary state of the new huge page. This is
5679 * reverse to other transitions because the newpage is going to
5680 * be final while the old one will be freed so it takes over
5681 * the temporary status.
5683 * Also note that we have to transfer the per-node surplus state
5684 * here as well otherwise the global surplus count will not match
5687 if (HPageTemporary(newpage)) {
5688 int old_nid = page_to_nid(oldpage);
5689 int new_nid = page_to_nid(newpage);
5691 SetHPageTemporary(oldpage);
5692 ClearHPageTemporary(newpage);
5695 * There is no need to transfer the per-node surplus state
5696 * when we do not cross the node.
5698 if (new_nid == old_nid)
5700 spin_lock_irq(&hugetlb_lock);
5701 if (h->surplus_huge_pages_node[old_nid]) {
5702 h->surplus_huge_pages_node[old_nid]--;
5703 h->surplus_huge_pages_node[new_nid]++;
5705 spin_unlock_irq(&hugetlb_lock);
5710 * This function will unconditionally remove all the shared pmd pgtable entries
5711 * within the specific vma for a hugetlbfs memory range.
5713 void hugetlb_unshare_all_pmds(struct vm_area_struct *vma)
5715 struct hstate *h = hstate_vma(vma);
5716 unsigned long sz = huge_page_size(h);
5717 struct mm_struct *mm = vma->vm_mm;
5718 struct mmu_notifier_range range;
5719 unsigned long address, start, end;
5723 if (!(vma->vm_flags & VM_MAYSHARE))
5726 start = ALIGN(vma->vm_start, PUD_SIZE);
5727 end = ALIGN_DOWN(vma->vm_end, PUD_SIZE);
5733 * No need to call adjust_range_if_pmd_sharing_possible(), because
5734 * we have already done the PUD_SIZE alignment.
5736 mmu_notifier_range_init(&range, MMU_NOTIFY_CLEAR, 0, vma, mm,
5738 mmu_notifier_invalidate_range_start(&range);
5739 i_mmap_lock_write(vma->vm_file->f_mapping);
5740 for (address = start; address < end; address += PUD_SIZE) {
5741 unsigned long tmp = address;
5743 ptep = huge_pte_offset(mm, address, sz);
5746 ptl = huge_pte_lock(h, mm, ptep);
5747 /* We don't want 'address' to be changed */
5748 huge_pmd_unshare(mm, vma, &tmp, ptep);
5751 flush_hugetlb_tlb_range(vma, start, end);
5752 i_mmap_unlock_write(vma->vm_file->f_mapping);
5754 * No need to call mmu_notifier_invalidate_range(), see
5755 * Documentation/vm/mmu_notifier.rst.
5757 mmu_notifier_invalidate_range_end(&range);
5761 static bool cma_reserve_called __initdata;
5763 static int __init cmdline_parse_hugetlb_cma(char *p)
5765 hugetlb_cma_size = memparse(p, &p);
5769 early_param("hugetlb_cma", cmdline_parse_hugetlb_cma);
5771 void __init hugetlb_cma_reserve(int order)
5773 unsigned long size, reserved, per_node;
5776 cma_reserve_called = true;
5778 if (!hugetlb_cma_size)
5781 if (hugetlb_cma_size < (PAGE_SIZE << order)) {
5782 pr_warn("hugetlb_cma: cma area should be at least %lu MiB\n",
5783 (PAGE_SIZE << order) / SZ_1M);
5788 * If 3 GB area is requested on a machine with 4 numa nodes,
5789 * let's allocate 1 GB on first three nodes and ignore the last one.
5791 per_node = DIV_ROUND_UP(hugetlb_cma_size, nr_online_nodes);
5792 pr_info("hugetlb_cma: reserve %lu MiB, up to %lu MiB per node\n",
5793 hugetlb_cma_size / SZ_1M, per_node / SZ_1M);
5796 for_each_node_state(nid, N_ONLINE) {
5798 char name[CMA_MAX_NAME];
5800 size = min(per_node, hugetlb_cma_size - reserved);
5801 size = round_up(size, PAGE_SIZE << order);
5803 snprintf(name, sizeof(name), "hugetlb%d", nid);
5804 res = cma_declare_contiguous_nid(0, size, 0, PAGE_SIZE << order,
5806 &hugetlb_cma[nid], nid);
5808 pr_warn("hugetlb_cma: reservation failed: err %d, node %d",
5814 pr_info("hugetlb_cma: reserved %lu MiB on node %d\n",
5817 if (reserved >= hugetlb_cma_size)
5822 void __init hugetlb_cma_check(void)
5824 if (!hugetlb_cma_size || cma_reserve_called)
5827 pr_warn("hugetlb_cma: the option isn't supported by current arch\n");
5830 #endif /* CONFIG_CMA */