1 // SPDX-License-Identifier: GPL-2.0-only
5 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
6 * Swap reorganised 29.12.95, Stephen Tweedie
9 #include <linux/blkdev.h>
11 #include <linux/sched/mm.h>
12 #include <linux/sched/task.h>
13 #include <linux/hugetlb.h>
14 #include <linux/mman.h>
15 #include <linux/slab.h>
16 #include <linux/kernel_stat.h>
17 #include <linux/swap.h>
18 #include <linux/vmalloc.h>
19 #include <linux/pagemap.h>
20 #include <linux/namei.h>
21 #include <linux/shmem_fs.h>
22 #include <linux/blk-cgroup.h>
23 #include <linux/random.h>
24 #include <linux/writeback.h>
25 #include <linux/proc_fs.h>
26 #include <linux/seq_file.h>
27 #include <linux/init.h>
28 #include <linux/ksm.h>
29 #include <linux/rmap.h>
30 #include <linux/security.h>
31 #include <linux/backing-dev.h>
32 #include <linux/mutex.h>
33 #include <linux/capability.h>
34 #include <linux/syscalls.h>
35 #include <linux/memcontrol.h>
36 #include <linux/poll.h>
37 #include <linux/oom.h>
38 #include <linux/swapfile.h>
39 #include <linux/export.h>
40 #include <linux/swap_slots.h>
41 #include <linux/sort.h>
42 #include <linux/completion.h>
43 #include <linux/suspend.h>
44 #include <linux/zswap.h>
45 #include <linux/plist.h>
47 #include <asm/tlbflush.h>
48 #include <linux/swapops.h>
49 #include <linux/swap_cgroup.h>
53 static bool swap_count_continued(struct swap_info_struct *, pgoff_t,
55 static void free_swap_count_continuations(struct swap_info_struct *);
57 static DEFINE_SPINLOCK(swap_lock);
58 static unsigned int nr_swapfiles;
59 atomic_long_t nr_swap_pages;
61 * Some modules use swappable objects and may try to swap them out under
62 * memory pressure (via the shrinker). Before doing so, they may wish to
63 * check to see if any swap space is available.
65 EXPORT_SYMBOL_GPL(nr_swap_pages);
66 /* protected with swap_lock. reading in vm_swap_full() doesn't need lock */
67 long total_swap_pages;
68 static int least_priority = -1;
69 unsigned long swapfile_maximum_size;
70 #ifdef CONFIG_MIGRATION
71 bool swap_migration_ad_supported;
72 #endif /* CONFIG_MIGRATION */
74 static const char Bad_file[] = "Bad swap file entry ";
75 static const char Unused_file[] = "Unused swap file entry ";
76 static const char Bad_offset[] = "Bad swap offset entry ";
77 static const char Unused_offset[] = "Unused swap offset entry ";
80 * all active swap_info_structs
81 * protected with swap_lock, and ordered by priority.
83 static PLIST_HEAD(swap_active_head);
86 * all available (active, not full) swap_info_structs
87 * protected with swap_avail_lock, ordered by priority.
88 * This is used by folio_alloc_swap() instead of swap_active_head
89 * because swap_active_head includes all swap_info_structs,
90 * but folio_alloc_swap() doesn't need to look at full ones.
91 * This uses its own lock instead of swap_lock because when a
92 * swap_info_struct changes between not-full/full, it needs to
93 * add/remove itself to/from this list, but the swap_info_struct->lock
94 * is held and the locking order requires swap_lock to be taken
95 * before any swap_info_struct->lock.
97 static struct plist_head *swap_avail_heads;
98 static DEFINE_SPINLOCK(swap_avail_lock);
100 static struct swap_info_struct *swap_info[MAX_SWAPFILES];
102 static DEFINE_MUTEX(swapon_mutex);
104 static DECLARE_WAIT_QUEUE_HEAD(proc_poll_wait);
105 /* Activity counter to indicate that a swapon or swapoff has occurred */
106 static atomic_t proc_poll_event = ATOMIC_INIT(0);
108 atomic_t nr_rotate_swap = ATOMIC_INIT(0);
110 static struct swap_info_struct *swap_type_to_swap_info(int type)
112 if (type >= MAX_SWAPFILES)
115 return READ_ONCE(swap_info[type]); /* rcu_dereference() */
118 static inline unsigned char swap_count(unsigned char ent)
120 return ent & ~SWAP_HAS_CACHE; /* may include COUNT_CONTINUED flag */
123 /* Reclaim the swap entry anyway if possible */
124 #define TTRS_ANYWAY 0x1
126 * Reclaim the swap entry if there are no more mappings of the
129 #define TTRS_UNMAPPED 0x2
130 /* Reclaim the swap entry if swap is getting full*/
131 #define TTRS_FULL 0x4
133 /* returns 1 if swap entry is freed */
134 static int __try_to_reclaim_swap(struct swap_info_struct *si,
135 unsigned long offset, unsigned long flags)
137 swp_entry_t entry = swp_entry(si->type, offset);
141 folio = filemap_get_folio(swap_address_space(entry), offset);
145 * When this function is called from scan_swap_map_slots() and it's
146 * called by vmscan.c at reclaiming folios. So we hold a folio lock
147 * here. We have to use trylock for avoiding deadlock. This is a special
148 * case and you should use folio_free_swap() with explicit folio_lock()
149 * in usual operations.
151 if (folio_trylock(folio)) {
152 if ((flags & TTRS_ANYWAY) ||
153 ((flags & TTRS_UNMAPPED) && !folio_mapped(folio)) ||
154 ((flags & TTRS_FULL) && mem_cgroup_swap_full(folio)))
155 ret = folio_free_swap(folio);
162 static inline struct swap_extent *first_se(struct swap_info_struct *sis)
164 struct rb_node *rb = rb_first(&sis->swap_extent_root);
165 return rb_entry(rb, struct swap_extent, rb_node);
168 static inline struct swap_extent *next_se(struct swap_extent *se)
170 struct rb_node *rb = rb_next(&se->rb_node);
171 return rb ? rb_entry(rb, struct swap_extent, rb_node) : NULL;
175 * swapon tell device that all the old swap contents can be discarded,
176 * to allow the swap device to optimize its wear-levelling.
178 static int discard_swap(struct swap_info_struct *si)
180 struct swap_extent *se;
181 sector_t start_block;
185 /* Do not discard the swap header page! */
187 start_block = (se->start_block + 1) << (PAGE_SHIFT - 9);
188 nr_blocks = ((sector_t)se->nr_pages - 1) << (PAGE_SHIFT - 9);
190 err = blkdev_issue_discard(si->bdev, start_block,
191 nr_blocks, GFP_KERNEL);
197 for (se = next_se(se); se; se = next_se(se)) {
198 start_block = se->start_block << (PAGE_SHIFT - 9);
199 nr_blocks = (sector_t)se->nr_pages << (PAGE_SHIFT - 9);
201 err = blkdev_issue_discard(si->bdev, start_block,
202 nr_blocks, GFP_KERNEL);
208 return err; /* That will often be -EOPNOTSUPP */
211 static struct swap_extent *
212 offset_to_swap_extent(struct swap_info_struct *sis, unsigned long offset)
214 struct swap_extent *se;
217 rb = sis->swap_extent_root.rb_node;
219 se = rb_entry(rb, struct swap_extent, rb_node);
220 if (offset < se->start_page)
222 else if (offset >= se->start_page + se->nr_pages)
227 /* It *must* be present */
231 sector_t swap_folio_sector(struct folio *folio)
233 struct swap_info_struct *sis = swp_swap_info(folio->swap);
234 struct swap_extent *se;
238 offset = swp_offset(folio->swap);
239 se = offset_to_swap_extent(sis, offset);
240 sector = se->start_block + (offset - se->start_page);
241 return sector << (PAGE_SHIFT - 9);
245 * swap allocation tell device that a cluster of swap can now be discarded,
246 * to allow the swap device to optimize its wear-levelling.
248 static void discard_swap_cluster(struct swap_info_struct *si,
249 pgoff_t start_page, pgoff_t nr_pages)
251 struct swap_extent *se = offset_to_swap_extent(si, start_page);
254 pgoff_t offset = start_page - se->start_page;
255 sector_t start_block = se->start_block + offset;
256 sector_t nr_blocks = se->nr_pages - offset;
258 if (nr_blocks > nr_pages)
259 nr_blocks = nr_pages;
260 start_page += nr_blocks;
261 nr_pages -= nr_blocks;
263 start_block <<= PAGE_SHIFT - 9;
264 nr_blocks <<= PAGE_SHIFT - 9;
265 if (blkdev_issue_discard(si->bdev, start_block,
266 nr_blocks, GFP_NOIO))
273 #ifdef CONFIG_THP_SWAP
274 #define SWAPFILE_CLUSTER HPAGE_PMD_NR
276 #define swap_entry_size(size) (size)
278 #define SWAPFILE_CLUSTER 256
281 * Define swap_entry_size() as constant to let compiler to optimize
282 * out some code if !CONFIG_THP_SWAP
284 #define swap_entry_size(size) 1
286 #define LATENCY_LIMIT 256
288 static inline void cluster_set_flag(struct swap_cluster_info *info,
294 static inline unsigned int cluster_count(struct swap_cluster_info *info)
299 static inline void cluster_set_count(struct swap_cluster_info *info,
305 static inline void cluster_set_count_flag(struct swap_cluster_info *info,
306 unsigned int c, unsigned int f)
312 static inline unsigned int cluster_next(struct swap_cluster_info *info)
317 static inline void cluster_set_next(struct swap_cluster_info *info,
323 static inline void cluster_set_next_flag(struct swap_cluster_info *info,
324 unsigned int n, unsigned int f)
330 static inline bool cluster_is_free(struct swap_cluster_info *info)
332 return info->flags & CLUSTER_FLAG_FREE;
335 static inline bool cluster_is_null(struct swap_cluster_info *info)
337 return info->flags & CLUSTER_FLAG_NEXT_NULL;
340 static inline void cluster_set_null(struct swap_cluster_info *info)
342 info->flags = CLUSTER_FLAG_NEXT_NULL;
346 static inline bool cluster_is_huge(struct swap_cluster_info *info)
348 if (IS_ENABLED(CONFIG_THP_SWAP))
349 return info->flags & CLUSTER_FLAG_HUGE;
353 static inline void cluster_clear_huge(struct swap_cluster_info *info)
355 info->flags &= ~CLUSTER_FLAG_HUGE;
358 static inline struct swap_cluster_info *lock_cluster(struct swap_info_struct *si,
359 unsigned long offset)
361 struct swap_cluster_info *ci;
363 ci = si->cluster_info;
365 ci += offset / SWAPFILE_CLUSTER;
366 spin_lock(&ci->lock);
371 static inline void unlock_cluster(struct swap_cluster_info *ci)
374 spin_unlock(&ci->lock);
378 * Determine the locking method in use for this device. Return
379 * swap_cluster_info if SSD-style cluster-based locking is in place.
381 static inline struct swap_cluster_info *lock_cluster_or_swap_info(
382 struct swap_info_struct *si, unsigned long offset)
384 struct swap_cluster_info *ci;
386 /* Try to use fine-grained SSD-style locking if available: */
387 ci = lock_cluster(si, offset);
388 /* Otherwise, fall back to traditional, coarse locking: */
390 spin_lock(&si->lock);
395 static inline void unlock_cluster_or_swap_info(struct swap_info_struct *si,
396 struct swap_cluster_info *ci)
401 spin_unlock(&si->lock);
404 static inline bool cluster_list_empty(struct swap_cluster_list *list)
406 return cluster_is_null(&list->head);
409 static inline unsigned int cluster_list_first(struct swap_cluster_list *list)
411 return cluster_next(&list->head);
414 static void cluster_list_init(struct swap_cluster_list *list)
416 cluster_set_null(&list->head);
417 cluster_set_null(&list->tail);
420 static void cluster_list_add_tail(struct swap_cluster_list *list,
421 struct swap_cluster_info *ci,
424 if (cluster_list_empty(list)) {
425 cluster_set_next_flag(&list->head, idx, 0);
426 cluster_set_next_flag(&list->tail, idx, 0);
428 struct swap_cluster_info *ci_tail;
429 unsigned int tail = cluster_next(&list->tail);
432 * Nested cluster lock, but both cluster locks are
433 * only acquired when we held swap_info_struct->lock
436 spin_lock_nested(&ci_tail->lock, SINGLE_DEPTH_NESTING);
437 cluster_set_next(ci_tail, idx);
438 spin_unlock(&ci_tail->lock);
439 cluster_set_next_flag(&list->tail, idx, 0);
443 static unsigned int cluster_list_del_first(struct swap_cluster_list *list,
444 struct swap_cluster_info *ci)
448 idx = cluster_next(&list->head);
449 if (cluster_next(&list->tail) == idx) {
450 cluster_set_null(&list->head);
451 cluster_set_null(&list->tail);
453 cluster_set_next_flag(&list->head,
454 cluster_next(&ci[idx]), 0);
459 /* Add a cluster to discard list and schedule it to do discard */
460 static void swap_cluster_schedule_discard(struct swap_info_struct *si,
464 * If scan_swap_map_slots() can't find a free cluster, it will check
465 * si->swap_map directly. To make sure the discarding cluster isn't
466 * taken by scan_swap_map_slots(), mark the swap entries bad (occupied).
467 * It will be cleared after discard
469 memset(si->swap_map + idx * SWAPFILE_CLUSTER,
470 SWAP_MAP_BAD, SWAPFILE_CLUSTER);
472 cluster_list_add_tail(&si->discard_clusters, si->cluster_info, idx);
474 schedule_work(&si->discard_work);
477 static void __free_cluster(struct swap_info_struct *si, unsigned long idx)
479 struct swap_cluster_info *ci = si->cluster_info;
481 cluster_set_flag(ci + idx, CLUSTER_FLAG_FREE);
482 cluster_list_add_tail(&si->free_clusters, ci, idx);
486 * Doing discard actually. After a cluster discard is finished, the cluster
487 * will be added to free cluster list. caller should hold si->lock.
489 static void swap_do_scheduled_discard(struct swap_info_struct *si)
491 struct swap_cluster_info *info, *ci;
494 info = si->cluster_info;
496 while (!cluster_list_empty(&si->discard_clusters)) {
497 idx = cluster_list_del_first(&si->discard_clusters, info);
498 spin_unlock(&si->lock);
500 discard_swap_cluster(si, idx * SWAPFILE_CLUSTER,
503 spin_lock(&si->lock);
504 ci = lock_cluster(si, idx * SWAPFILE_CLUSTER);
505 __free_cluster(si, idx);
506 memset(si->swap_map + idx * SWAPFILE_CLUSTER,
507 0, SWAPFILE_CLUSTER);
512 static void swap_discard_work(struct work_struct *work)
514 struct swap_info_struct *si;
516 si = container_of(work, struct swap_info_struct, discard_work);
518 spin_lock(&si->lock);
519 swap_do_scheduled_discard(si);
520 spin_unlock(&si->lock);
523 static void swap_users_ref_free(struct percpu_ref *ref)
525 struct swap_info_struct *si;
527 si = container_of(ref, struct swap_info_struct, users);
531 static void alloc_cluster(struct swap_info_struct *si, unsigned long idx)
533 struct swap_cluster_info *ci = si->cluster_info;
535 VM_BUG_ON(cluster_list_first(&si->free_clusters) != idx);
536 cluster_list_del_first(&si->free_clusters, ci);
537 cluster_set_count_flag(ci + idx, 0, 0);
540 static void free_cluster(struct swap_info_struct *si, unsigned long idx)
542 struct swap_cluster_info *ci = si->cluster_info + idx;
544 VM_BUG_ON(cluster_count(ci) != 0);
546 * If the swap is discardable, prepare discard the cluster
547 * instead of free it immediately. The cluster will be freed
550 if ((si->flags & (SWP_WRITEOK | SWP_PAGE_DISCARD)) ==
551 (SWP_WRITEOK | SWP_PAGE_DISCARD)) {
552 swap_cluster_schedule_discard(si, idx);
556 __free_cluster(si, idx);
560 * The cluster corresponding to page_nr will be used. The cluster will be
561 * removed from free cluster list and its usage counter will be increased.
563 static void inc_cluster_info_page(struct swap_info_struct *p,
564 struct swap_cluster_info *cluster_info, unsigned long page_nr)
566 unsigned long idx = page_nr / SWAPFILE_CLUSTER;
570 if (cluster_is_free(&cluster_info[idx]))
571 alloc_cluster(p, idx);
573 VM_BUG_ON(cluster_count(&cluster_info[idx]) >= SWAPFILE_CLUSTER);
574 cluster_set_count(&cluster_info[idx],
575 cluster_count(&cluster_info[idx]) + 1);
579 * The cluster corresponding to page_nr decreases one usage. If the usage
580 * counter becomes 0, which means no page in the cluster is in using, we can
581 * optionally discard the cluster and add it to free cluster list.
583 static void dec_cluster_info_page(struct swap_info_struct *p,
584 struct swap_cluster_info *cluster_info, unsigned long page_nr)
586 unsigned long idx = page_nr / SWAPFILE_CLUSTER;
591 VM_BUG_ON(cluster_count(&cluster_info[idx]) == 0);
592 cluster_set_count(&cluster_info[idx],
593 cluster_count(&cluster_info[idx]) - 1);
595 if (cluster_count(&cluster_info[idx]) == 0)
596 free_cluster(p, idx);
600 * It's possible scan_swap_map_slots() uses a free cluster in the middle of free
601 * cluster list. Avoiding such abuse to avoid list corruption.
604 scan_swap_map_ssd_cluster_conflict(struct swap_info_struct *si,
605 unsigned long offset)
607 struct percpu_cluster *percpu_cluster;
610 offset /= SWAPFILE_CLUSTER;
611 conflict = !cluster_list_empty(&si->free_clusters) &&
612 offset != cluster_list_first(&si->free_clusters) &&
613 cluster_is_free(&si->cluster_info[offset]);
618 percpu_cluster = this_cpu_ptr(si->percpu_cluster);
619 cluster_set_null(&percpu_cluster->index);
624 * Try to get a swap entry from current cpu's swap entry pool (a cluster). This
625 * might involve allocating a new cluster for current CPU too.
627 static bool scan_swap_map_try_ssd_cluster(struct swap_info_struct *si,
628 unsigned long *offset, unsigned long *scan_base)
630 struct percpu_cluster *cluster;
631 struct swap_cluster_info *ci;
632 unsigned long tmp, max;
635 cluster = this_cpu_ptr(si->percpu_cluster);
636 if (cluster_is_null(&cluster->index)) {
637 if (!cluster_list_empty(&si->free_clusters)) {
638 cluster->index = si->free_clusters.head;
639 cluster->next = cluster_next(&cluster->index) *
641 } else if (!cluster_list_empty(&si->discard_clusters)) {
643 * we don't have free cluster but have some clusters in
644 * discarding, do discard now and reclaim them, then
645 * reread cluster_next_cpu since we dropped si->lock
647 swap_do_scheduled_discard(si);
648 *scan_base = this_cpu_read(*si->cluster_next_cpu);
649 *offset = *scan_base;
656 * Other CPUs can use our cluster if they can't find a free cluster,
657 * check if there is still free entry in the cluster
660 max = min_t(unsigned long, si->max,
661 (cluster_next(&cluster->index) + 1) * SWAPFILE_CLUSTER);
663 ci = lock_cluster(si, tmp);
665 if (!si->swap_map[tmp])
672 cluster_set_null(&cluster->index);
675 cluster->next = tmp + 1;
681 static void __del_from_avail_list(struct swap_info_struct *p)
685 assert_spin_locked(&p->lock);
687 plist_del(&p->avail_lists[nid], &swap_avail_heads[nid]);
690 static void del_from_avail_list(struct swap_info_struct *p)
692 spin_lock(&swap_avail_lock);
693 __del_from_avail_list(p);
694 spin_unlock(&swap_avail_lock);
697 static void swap_range_alloc(struct swap_info_struct *si, unsigned long offset,
698 unsigned int nr_entries)
700 unsigned int end = offset + nr_entries - 1;
702 if (offset == si->lowest_bit)
703 si->lowest_bit += nr_entries;
704 if (end == si->highest_bit)
705 WRITE_ONCE(si->highest_bit, si->highest_bit - nr_entries);
706 WRITE_ONCE(si->inuse_pages, si->inuse_pages + nr_entries);
707 if (si->inuse_pages == si->pages) {
708 si->lowest_bit = si->max;
710 del_from_avail_list(si);
714 static void add_to_avail_list(struct swap_info_struct *p)
718 spin_lock(&swap_avail_lock);
720 plist_add(&p->avail_lists[nid], &swap_avail_heads[nid]);
721 spin_unlock(&swap_avail_lock);
724 static void swap_range_free(struct swap_info_struct *si, unsigned long offset,
725 unsigned int nr_entries)
727 unsigned long begin = offset;
728 unsigned long end = offset + nr_entries - 1;
729 void (*swap_slot_free_notify)(struct block_device *, unsigned long);
731 if (offset < si->lowest_bit)
732 si->lowest_bit = offset;
733 if (end > si->highest_bit) {
734 bool was_full = !si->highest_bit;
736 WRITE_ONCE(si->highest_bit, end);
737 if (was_full && (si->flags & SWP_WRITEOK))
738 add_to_avail_list(si);
740 atomic_long_add(nr_entries, &nr_swap_pages);
741 WRITE_ONCE(si->inuse_pages, si->inuse_pages - nr_entries);
742 if (si->flags & SWP_BLKDEV)
743 swap_slot_free_notify =
744 si->bdev->bd_disk->fops->swap_slot_free_notify;
746 swap_slot_free_notify = NULL;
747 while (offset <= end) {
748 arch_swap_invalidate_page(si->type, offset);
749 zswap_invalidate(si->type, offset);
750 if (swap_slot_free_notify)
751 swap_slot_free_notify(si->bdev, offset);
754 clear_shadow_from_swap_cache(si->type, begin, end);
757 static void set_cluster_next(struct swap_info_struct *si, unsigned long next)
761 if (!(si->flags & SWP_SOLIDSTATE)) {
762 si->cluster_next = next;
766 prev = this_cpu_read(*si->cluster_next_cpu);
768 * Cross the swap address space size aligned trunk, choose
769 * another trunk randomly to avoid lock contention on swap
770 * address space if possible.
772 if ((prev >> SWAP_ADDRESS_SPACE_SHIFT) !=
773 (next >> SWAP_ADDRESS_SPACE_SHIFT)) {
774 /* No free swap slots available */
775 if (si->highest_bit <= si->lowest_bit)
777 next = get_random_u32_inclusive(si->lowest_bit, si->highest_bit);
778 next = ALIGN_DOWN(next, SWAP_ADDRESS_SPACE_PAGES);
779 next = max_t(unsigned int, next, si->lowest_bit);
781 this_cpu_write(*si->cluster_next_cpu, next);
784 static bool swap_offset_available_and_locked(struct swap_info_struct *si,
785 unsigned long offset)
787 if (data_race(!si->swap_map[offset])) {
788 spin_lock(&si->lock);
792 if (vm_swap_full() && READ_ONCE(si->swap_map[offset]) == SWAP_HAS_CACHE) {
793 spin_lock(&si->lock);
800 static int scan_swap_map_slots(struct swap_info_struct *si,
801 unsigned char usage, int nr,
804 struct swap_cluster_info *ci;
805 unsigned long offset;
806 unsigned long scan_base;
807 unsigned long last_in_cluster = 0;
808 int latency_ration = LATENCY_LIMIT;
810 bool scanned_many = false;
813 * We try to cluster swap pages by allocating them sequentially
814 * in swap. Once we've allocated SWAPFILE_CLUSTER pages this
815 * way, however, we resort to first-free allocation, starting
816 * a new cluster. This prevents us from scattering swap pages
817 * all over the entire swap partition, so that we reduce
818 * overall disk seek times between swap pages. -- sct
819 * But we do now try to find an empty cluster. -Andrea
820 * And we let swap pages go all over an SSD partition. Hugh
823 si->flags += SWP_SCANNING;
825 * Use percpu scan base for SSD to reduce lock contention on
826 * cluster and swap cache. For HDD, sequential access is more
829 if (si->flags & SWP_SOLIDSTATE)
830 scan_base = this_cpu_read(*si->cluster_next_cpu);
832 scan_base = si->cluster_next;
836 if (si->cluster_info) {
837 if (!scan_swap_map_try_ssd_cluster(si, &offset, &scan_base))
839 } else if (unlikely(!si->cluster_nr--)) {
840 if (si->pages - si->inuse_pages < SWAPFILE_CLUSTER) {
841 si->cluster_nr = SWAPFILE_CLUSTER - 1;
845 spin_unlock(&si->lock);
848 * If seek is expensive, start searching for new cluster from
849 * start of partition, to minimize the span of allocated swap.
850 * If seek is cheap, that is the SWP_SOLIDSTATE si->cluster_info
851 * case, just handled by scan_swap_map_try_ssd_cluster() above.
853 scan_base = offset = si->lowest_bit;
854 last_in_cluster = offset + SWAPFILE_CLUSTER - 1;
856 /* Locate the first empty (unaligned) cluster */
857 for (; last_in_cluster <= si->highest_bit; offset++) {
858 if (si->swap_map[offset])
859 last_in_cluster = offset + SWAPFILE_CLUSTER;
860 else if (offset == last_in_cluster) {
861 spin_lock(&si->lock);
862 offset -= SWAPFILE_CLUSTER - 1;
863 si->cluster_next = offset;
864 si->cluster_nr = SWAPFILE_CLUSTER - 1;
867 if (unlikely(--latency_ration < 0)) {
869 latency_ration = LATENCY_LIMIT;
874 spin_lock(&si->lock);
875 si->cluster_nr = SWAPFILE_CLUSTER - 1;
879 if (si->cluster_info) {
880 while (scan_swap_map_ssd_cluster_conflict(si, offset)) {
881 /* take a break if we already got some slots */
884 if (!scan_swap_map_try_ssd_cluster(si, &offset,
889 if (!(si->flags & SWP_WRITEOK))
891 if (!si->highest_bit)
893 if (offset > si->highest_bit)
894 scan_base = offset = si->lowest_bit;
896 ci = lock_cluster(si, offset);
897 /* reuse swap entry of cache-only swap if not busy. */
898 if (vm_swap_full() && si->swap_map[offset] == SWAP_HAS_CACHE) {
901 spin_unlock(&si->lock);
902 swap_was_freed = __try_to_reclaim_swap(si, offset, TTRS_ANYWAY);
903 spin_lock(&si->lock);
904 /* entry was freed successfully, try to use this again */
907 goto scan; /* check next one */
910 if (si->swap_map[offset]) {
917 WRITE_ONCE(si->swap_map[offset], usage);
918 inc_cluster_info_page(si, si->cluster_info, offset);
921 swap_range_alloc(si, offset, 1);
922 slots[n_ret++] = swp_entry(si->type, offset);
924 /* got enough slots or reach max slots? */
925 if ((n_ret == nr) || (offset >= si->highest_bit))
928 /* search for next available slot */
930 /* time to take a break? */
931 if (unlikely(--latency_ration < 0)) {
934 spin_unlock(&si->lock);
936 spin_lock(&si->lock);
937 latency_ration = LATENCY_LIMIT;
940 /* try to get more slots in cluster */
941 if (si->cluster_info) {
942 if (scan_swap_map_try_ssd_cluster(si, &offset, &scan_base))
944 } else if (si->cluster_nr && !si->swap_map[++offset]) {
945 /* non-ssd case, still more slots in cluster? */
951 * Even if there's no free clusters available (fragmented),
952 * try to scan a little more quickly with lock held unless we
953 * have scanned too many slots already.
956 unsigned long scan_limit;
958 if (offset < scan_base)
959 scan_limit = scan_base;
961 scan_limit = si->highest_bit;
962 for (; offset <= scan_limit && --latency_ration > 0;
964 if (!si->swap_map[offset])
970 set_cluster_next(si, offset + 1);
971 si->flags -= SWP_SCANNING;
975 spin_unlock(&si->lock);
976 while (++offset <= READ_ONCE(si->highest_bit)) {
977 if (unlikely(--latency_ration < 0)) {
979 latency_ration = LATENCY_LIMIT;
982 if (swap_offset_available_and_locked(si, offset))
985 offset = si->lowest_bit;
986 while (offset < scan_base) {
987 if (unlikely(--latency_ration < 0)) {
989 latency_ration = LATENCY_LIMIT;
992 if (swap_offset_available_and_locked(si, offset))
996 spin_lock(&si->lock);
999 si->flags -= SWP_SCANNING;
1003 static int swap_alloc_cluster(struct swap_info_struct *si, swp_entry_t *slot)
1006 struct swap_cluster_info *ci;
1007 unsigned long offset;
1010 * Should not even be attempting cluster allocations when huge
1011 * page swap is disabled. Warn and fail the allocation.
1013 if (!IS_ENABLED(CONFIG_THP_SWAP)) {
1018 if (cluster_list_empty(&si->free_clusters))
1021 idx = cluster_list_first(&si->free_clusters);
1022 offset = idx * SWAPFILE_CLUSTER;
1023 ci = lock_cluster(si, offset);
1024 alloc_cluster(si, idx);
1025 cluster_set_count_flag(ci, SWAPFILE_CLUSTER, CLUSTER_FLAG_HUGE);
1027 memset(si->swap_map + offset, SWAP_HAS_CACHE, SWAPFILE_CLUSTER);
1029 swap_range_alloc(si, offset, SWAPFILE_CLUSTER);
1030 *slot = swp_entry(si->type, offset);
1035 static void swap_free_cluster(struct swap_info_struct *si, unsigned long idx)
1037 unsigned long offset = idx * SWAPFILE_CLUSTER;
1038 struct swap_cluster_info *ci;
1040 ci = lock_cluster(si, offset);
1041 memset(si->swap_map + offset, 0, SWAPFILE_CLUSTER);
1042 cluster_set_count_flag(ci, 0, 0);
1043 free_cluster(si, idx);
1045 swap_range_free(si, offset, SWAPFILE_CLUSTER);
1048 int get_swap_pages(int n_goal, swp_entry_t swp_entries[], int entry_size)
1050 unsigned long size = swap_entry_size(entry_size);
1051 struct swap_info_struct *si, *next;
1056 /* Only single cluster request supported */
1057 WARN_ON_ONCE(n_goal > 1 && size == SWAPFILE_CLUSTER);
1059 spin_lock(&swap_avail_lock);
1061 avail_pgs = atomic_long_read(&nr_swap_pages) / size;
1062 if (avail_pgs <= 0) {
1063 spin_unlock(&swap_avail_lock);
1067 n_goal = min3((long)n_goal, (long)SWAP_BATCH, avail_pgs);
1069 atomic_long_sub(n_goal * size, &nr_swap_pages);
1072 node = numa_node_id();
1073 plist_for_each_entry_safe(si, next, &swap_avail_heads[node], avail_lists[node]) {
1074 /* requeue si to after same-priority siblings */
1075 plist_requeue(&si->avail_lists[node], &swap_avail_heads[node]);
1076 spin_unlock(&swap_avail_lock);
1077 spin_lock(&si->lock);
1078 if (!si->highest_bit || !(si->flags & SWP_WRITEOK)) {
1079 spin_lock(&swap_avail_lock);
1080 if (plist_node_empty(&si->avail_lists[node])) {
1081 spin_unlock(&si->lock);
1084 WARN(!si->highest_bit,
1085 "swap_info %d in list but !highest_bit\n",
1087 WARN(!(si->flags & SWP_WRITEOK),
1088 "swap_info %d in list but !SWP_WRITEOK\n",
1090 __del_from_avail_list(si);
1091 spin_unlock(&si->lock);
1094 if (size == SWAPFILE_CLUSTER) {
1095 if (si->flags & SWP_BLKDEV)
1096 n_ret = swap_alloc_cluster(si, swp_entries);
1098 n_ret = scan_swap_map_slots(si, SWAP_HAS_CACHE,
1099 n_goal, swp_entries);
1100 spin_unlock(&si->lock);
1101 if (n_ret || size == SWAPFILE_CLUSTER)
1105 spin_lock(&swap_avail_lock);
1108 * if we got here, it's likely that si was almost full before,
1109 * and since scan_swap_map_slots() can drop the si->lock,
1110 * multiple callers probably all tried to get a page from the
1111 * same si and it filled up before we could get one; or, the si
1112 * filled up between us dropping swap_avail_lock and taking
1113 * si->lock. Since we dropped the swap_avail_lock, the
1114 * swap_avail_head list may have been modified; so if next is
1115 * still in the swap_avail_head list then try it, otherwise
1116 * start over if we have not gotten any slots.
1118 if (plist_node_empty(&next->avail_lists[node]))
1122 spin_unlock(&swap_avail_lock);
1126 atomic_long_add((long)(n_goal - n_ret) * size,
1132 static struct swap_info_struct *_swap_info_get(swp_entry_t entry)
1134 struct swap_info_struct *p;
1135 unsigned long offset;
1139 p = swp_swap_info(entry);
1142 if (data_race(!(p->flags & SWP_USED)))
1144 offset = swp_offset(entry);
1145 if (offset >= p->max)
1147 if (data_race(!p->swap_map[swp_offset(entry)]))
1152 pr_err("%s: %s%08lx\n", __func__, Unused_offset, entry.val);
1155 pr_err("%s: %s%08lx\n", __func__, Bad_offset, entry.val);
1158 pr_err("%s: %s%08lx\n", __func__, Unused_file, entry.val);
1161 pr_err("%s: %s%08lx\n", __func__, Bad_file, entry.val);
1166 static struct swap_info_struct *swap_info_get_cont(swp_entry_t entry,
1167 struct swap_info_struct *q)
1169 struct swap_info_struct *p;
1171 p = _swap_info_get(entry);
1175 spin_unlock(&q->lock);
1177 spin_lock(&p->lock);
1182 static unsigned char __swap_entry_free_locked(struct swap_info_struct *p,
1183 unsigned long offset,
1184 unsigned char usage)
1186 unsigned char count;
1187 unsigned char has_cache;
1189 count = p->swap_map[offset];
1191 has_cache = count & SWAP_HAS_CACHE;
1192 count &= ~SWAP_HAS_CACHE;
1194 if (usage == SWAP_HAS_CACHE) {
1195 VM_BUG_ON(!has_cache);
1197 } else if (count == SWAP_MAP_SHMEM) {
1199 * Or we could insist on shmem.c using a special
1200 * swap_shmem_free() and free_shmem_swap_and_cache()...
1203 } else if ((count & ~COUNT_CONTINUED) <= SWAP_MAP_MAX) {
1204 if (count == COUNT_CONTINUED) {
1205 if (swap_count_continued(p, offset, count))
1206 count = SWAP_MAP_MAX | COUNT_CONTINUED;
1208 count = SWAP_MAP_MAX;
1213 usage = count | has_cache;
1215 WRITE_ONCE(p->swap_map[offset], usage);
1217 WRITE_ONCE(p->swap_map[offset], SWAP_HAS_CACHE);
1223 * When we get a swap entry, if there aren't some other ways to
1224 * prevent swapoff, such as the folio in swap cache is locked, page
1225 * table lock is held, etc., the swap entry may become invalid because
1226 * of swapoff. Then, we need to enclose all swap related functions
1227 * with get_swap_device() and put_swap_device(), unless the swap
1228 * functions call get/put_swap_device() by themselves.
1230 * Note that when only holding the PTL, swapoff might succeed immediately
1231 * after freeing a swap entry. Therefore, immediately after
1232 * __swap_entry_free(), the swap info might become stale and should not
1233 * be touched without a prior get_swap_device().
1235 * Check whether swap entry is valid in the swap device. If so,
1236 * return pointer to swap_info_struct, and keep the swap entry valid
1237 * via preventing the swap device from being swapoff, until
1238 * put_swap_device() is called. Otherwise return NULL.
1240 * Notice that swapoff or swapoff+swapon can still happen before the
1241 * percpu_ref_tryget_live() in get_swap_device() or after the
1242 * percpu_ref_put() in put_swap_device() if there isn't any other way
1243 * to prevent swapoff. The caller must be prepared for that. For
1244 * example, the following situation is possible.
1248 * ... swapoff+swapon
1249 * __read_swap_cache_async()
1250 * swapcache_prepare()
1251 * __swap_duplicate()
1253 * // verify PTE not changed
1255 * In __swap_duplicate(), the swap_map need to be checked before
1256 * changing partly because the specified swap entry may be for another
1257 * swap device which has been swapoff. And in do_swap_page(), after
1258 * the page is read from the swap device, the PTE is verified not
1259 * changed with the page table locked to check whether the swap device
1260 * has been swapoff or swapoff+swapon.
1262 struct swap_info_struct *get_swap_device(swp_entry_t entry)
1264 struct swap_info_struct *si;
1265 unsigned long offset;
1269 si = swp_swap_info(entry);
1272 if (!percpu_ref_tryget_live(&si->users))
1275 * Guarantee the si->users are checked before accessing other
1276 * fields of swap_info_struct.
1278 * Paired with the spin_unlock() after setup_swap_info() in
1279 * enable_swap_info().
1282 offset = swp_offset(entry);
1283 if (offset >= si->max)
1288 pr_err("%s: %s%08lx\n", __func__, Bad_file, entry.val);
1292 pr_err("%s: %s%08lx\n", __func__, Bad_offset, entry.val);
1293 percpu_ref_put(&si->users);
1297 static unsigned char __swap_entry_free(struct swap_info_struct *p,
1300 struct swap_cluster_info *ci;
1301 unsigned long offset = swp_offset(entry);
1302 unsigned char usage;
1304 ci = lock_cluster_or_swap_info(p, offset);
1305 usage = __swap_entry_free_locked(p, offset, 1);
1306 unlock_cluster_or_swap_info(p, ci);
1308 free_swap_slot(entry);
1313 static void swap_entry_free(struct swap_info_struct *p, swp_entry_t entry)
1315 struct swap_cluster_info *ci;
1316 unsigned long offset = swp_offset(entry);
1317 unsigned char count;
1319 ci = lock_cluster(p, offset);
1320 count = p->swap_map[offset];
1321 VM_BUG_ON(count != SWAP_HAS_CACHE);
1322 p->swap_map[offset] = 0;
1323 dec_cluster_info_page(p, p->cluster_info, offset);
1326 mem_cgroup_uncharge_swap(entry, 1);
1327 swap_range_free(p, offset, 1);
1331 * Caller has made sure that the swap device corresponding to entry
1332 * is still around or has not been recycled.
1334 void swap_free(swp_entry_t entry)
1336 struct swap_info_struct *p;
1338 p = _swap_info_get(entry);
1340 __swap_entry_free(p, entry);
1344 * Called after dropping swapcache to decrease refcnt to swap entries.
1346 void put_swap_folio(struct folio *folio, swp_entry_t entry)
1348 unsigned long offset = swp_offset(entry);
1349 unsigned long idx = offset / SWAPFILE_CLUSTER;
1350 struct swap_cluster_info *ci;
1351 struct swap_info_struct *si;
1353 unsigned int i, free_entries = 0;
1355 int size = swap_entry_size(folio_nr_pages(folio));
1357 si = _swap_info_get(entry);
1361 ci = lock_cluster_or_swap_info(si, offset);
1362 if (size == SWAPFILE_CLUSTER) {
1363 VM_BUG_ON(!cluster_is_huge(ci));
1364 map = si->swap_map + offset;
1365 for (i = 0; i < SWAPFILE_CLUSTER; i++) {
1367 VM_BUG_ON(!(val & SWAP_HAS_CACHE));
1368 if (val == SWAP_HAS_CACHE)
1371 cluster_clear_huge(ci);
1372 if (free_entries == SWAPFILE_CLUSTER) {
1373 unlock_cluster_or_swap_info(si, ci);
1374 spin_lock(&si->lock);
1375 mem_cgroup_uncharge_swap(entry, SWAPFILE_CLUSTER);
1376 swap_free_cluster(si, idx);
1377 spin_unlock(&si->lock);
1381 for (i = 0; i < size; i++, entry.val++) {
1382 if (!__swap_entry_free_locked(si, offset + i, SWAP_HAS_CACHE)) {
1383 unlock_cluster_or_swap_info(si, ci);
1384 free_swap_slot(entry);
1387 lock_cluster_or_swap_info(si, offset);
1390 unlock_cluster_or_swap_info(si, ci);
1393 #ifdef CONFIG_THP_SWAP
1394 int split_swap_cluster(swp_entry_t entry)
1396 struct swap_info_struct *si;
1397 struct swap_cluster_info *ci;
1398 unsigned long offset = swp_offset(entry);
1400 si = _swap_info_get(entry);
1403 ci = lock_cluster(si, offset);
1404 cluster_clear_huge(ci);
1410 static int swp_entry_cmp(const void *ent1, const void *ent2)
1412 const swp_entry_t *e1 = ent1, *e2 = ent2;
1414 return (int)swp_type(*e1) - (int)swp_type(*e2);
1417 void swapcache_free_entries(swp_entry_t *entries, int n)
1419 struct swap_info_struct *p, *prev;
1429 * Sort swap entries by swap device, so each lock is only taken once.
1430 * nr_swapfiles isn't absolutely correct, but the overhead of sort() is
1431 * so low that it isn't necessary to optimize further.
1433 if (nr_swapfiles > 1)
1434 sort(entries, n, sizeof(entries[0]), swp_entry_cmp, NULL);
1435 for (i = 0; i < n; ++i) {
1436 p = swap_info_get_cont(entries[i], prev);
1438 swap_entry_free(p, entries[i]);
1442 spin_unlock(&p->lock);
1445 int __swap_count(swp_entry_t entry)
1447 struct swap_info_struct *si = swp_swap_info(entry);
1448 pgoff_t offset = swp_offset(entry);
1450 return swap_count(si->swap_map[offset]);
1454 * How many references to @entry are currently swapped out?
1455 * This does not give an exact answer when swap count is continued,
1456 * but does include the high COUNT_CONTINUED flag to allow for that.
1458 int swap_swapcount(struct swap_info_struct *si, swp_entry_t entry)
1460 pgoff_t offset = swp_offset(entry);
1461 struct swap_cluster_info *ci;
1464 ci = lock_cluster_or_swap_info(si, offset);
1465 count = swap_count(si->swap_map[offset]);
1466 unlock_cluster_or_swap_info(si, ci);
1471 * How many references to @entry are currently swapped out?
1472 * This considers COUNT_CONTINUED so it returns exact answer.
1474 int swp_swapcount(swp_entry_t entry)
1476 int count, tmp_count, n;
1477 struct swap_info_struct *p;
1478 struct swap_cluster_info *ci;
1483 p = _swap_info_get(entry);
1487 offset = swp_offset(entry);
1489 ci = lock_cluster_or_swap_info(p, offset);
1491 count = swap_count(p->swap_map[offset]);
1492 if (!(count & COUNT_CONTINUED))
1495 count &= ~COUNT_CONTINUED;
1496 n = SWAP_MAP_MAX + 1;
1498 page = vmalloc_to_page(p->swap_map + offset);
1499 offset &= ~PAGE_MASK;
1500 VM_BUG_ON(page_private(page) != SWP_CONTINUED);
1503 page = list_next_entry(page, lru);
1504 map = kmap_local_page(page);
1505 tmp_count = map[offset];
1508 count += (tmp_count & ~COUNT_CONTINUED) * n;
1509 n *= (SWAP_CONT_MAX + 1);
1510 } while (tmp_count & COUNT_CONTINUED);
1512 unlock_cluster_or_swap_info(p, ci);
1516 static bool swap_page_trans_huge_swapped(struct swap_info_struct *si,
1519 struct swap_cluster_info *ci;
1520 unsigned char *map = si->swap_map;
1521 unsigned long roffset = swp_offset(entry);
1522 unsigned long offset = round_down(roffset, SWAPFILE_CLUSTER);
1526 ci = lock_cluster_or_swap_info(si, offset);
1527 if (!ci || !cluster_is_huge(ci)) {
1528 if (swap_count(map[roffset]))
1532 for (i = 0; i < SWAPFILE_CLUSTER; i++) {
1533 if (swap_count(map[offset + i])) {
1539 unlock_cluster_or_swap_info(si, ci);
1543 static bool folio_swapped(struct folio *folio)
1545 swp_entry_t entry = folio->swap;
1546 struct swap_info_struct *si = _swap_info_get(entry);
1551 if (!IS_ENABLED(CONFIG_THP_SWAP) || likely(!folio_test_large(folio)))
1552 return swap_swapcount(si, entry) != 0;
1554 return swap_page_trans_huge_swapped(si, entry);
1558 * folio_free_swap() - Free the swap space used for this folio.
1559 * @folio: The folio to remove.
1561 * If swap is getting full, or if there are no more mappings of this folio,
1562 * then call folio_free_swap to free its swap space.
1564 * Return: true if we were able to release the swap space.
1566 bool folio_free_swap(struct folio *folio)
1568 VM_BUG_ON_FOLIO(!folio_test_locked(folio), folio);
1570 if (!folio_test_swapcache(folio))
1572 if (folio_test_writeback(folio))
1574 if (folio_swapped(folio))
1578 * Once hibernation has begun to create its image of memory,
1579 * there's a danger that one of the calls to folio_free_swap()
1580 * - most probably a call from __try_to_reclaim_swap() while
1581 * hibernation is allocating its own swap pages for the image,
1582 * but conceivably even a call from memory reclaim - will free
1583 * the swap from a folio which has already been recorded in the
1584 * image as a clean swapcache folio, and then reuse its swap for
1585 * another page of the image. On waking from hibernation, the
1586 * original folio might be freed under memory pressure, then
1587 * later read back in from swap, now with the wrong data.
1589 * Hibernation suspends storage while it is writing the image
1590 * to disk so check that here.
1592 if (pm_suspended_storage())
1595 delete_from_swap_cache(folio);
1596 folio_set_dirty(folio);
1601 * Free the swap entry like above, but also try to
1602 * free the page cache entry if it is the last user.
1604 int free_swap_and_cache(swp_entry_t entry)
1606 struct swap_info_struct *p;
1607 unsigned char count;
1609 if (non_swap_entry(entry))
1612 p = get_swap_device(entry);
1614 if (WARN_ON(data_race(!p->swap_map[swp_offset(entry)]))) {
1619 count = __swap_entry_free(p, entry);
1620 if (count == SWAP_HAS_CACHE &&
1621 !swap_page_trans_huge_swapped(p, entry))
1622 __try_to_reclaim_swap(p, swp_offset(entry),
1623 TTRS_UNMAPPED | TTRS_FULL);
1629 #ifdef CONFIG_HIBERNATION
1631 swp_entry_t get_swap_page_of_type(int type)
1633 struct swap_info_struct *si = swap_type_to_swap_info(type);
1634 swp_entry_t entry = {0};
1639 /* This is called for allocating swap entry, not cache */
1640 spin_lock(&si->lock);
1641 if ((si->flags & SWP_WRITEOK) && scan_swap_map_slots(si, 1, 1, &entry))
1642 atomic_long_dec(&nr_swap_pages);
1643 spin_unlock(&si->lock);
1649 * Find the swap type that corresponds to given device (if any).
1651 * @offset - number of the PAGE_SIZE-sized block of the device, starting
1652 * from 0, in which the swap header is expected to be located.
1654 * This is needed for the suspend to disk (aka swsusp).
1656 int swap_type_of(dev_t device, sector_t offset)
1663 spin_lock(&swap_lock);
1664 for (type = 0; type < nr_swapfiles; type++) {
1665 struct swap_info_struct *sis = swap_info[type];
1667 if (!(sis->flags & SWP_WRITEOK))
1670 if (device == sis->bdev->bd_dev) {
1671 struct swap_extent *se = first_se(sis);
1673 if (se->start_block == offset) {
1674 spin_unlock(&swap_lock);
1679 spin_unlock(&swap_lock);
1683 int find_first_swap(dev_t *device)
1687 spin_lock(&swap_lock);
1688 for (type = 0; type < nr_swapfiles; type++) {
1689 struct swap_info_struct *sis = swap_info[type];
1691 if (!(sis->flags & SWP_WRITEOK))
1693 *device = sis->bdev->bd_dev;
1694 spin_unlock(&swap_lock);
1697 spin_unlock(&swap_lock);
1702 * Get the (PAGE_SIZE) block corresponding to given offset on the swapdev
1703 * corresponding to given index in swap_info (swap type).
1705 sector_t swapdev_block(int type, pgoff_t offset)
1707 struct swap_info_struct *si = swap_type_to_swap_info(type);
1708 struct swap_extent *se;
1710 if (!si || !(si->flags & SWP_WRITEOK))
1712 se = offset_to_swap_extent(si, offset);
1713 return se->start_block + (offset - se->start_page);
1717 * Return either the total number of swap pages of given type, or the number
1718 * of free pages of that type (depending on @free)
1720 * This is needed for software suspend
1722 unsigned int count_swap_pages(int type, int free)
1726 spin_lock(&swap_lock);
1727 if ((unsigned int)type < nr_swapfiles) {
1728 struct swap_info_struct *sis = swap_info[type];
1730 spin_lock(&sis->lock);
1731 if (sis->flags & SWP_WRITEOK) {
1734 n -= sis->inuse_pages;
1736 spin_unlock(&sis->lock);
1738 spin_unlock(&swap_lock);
1741 #endif /* CONFIG_HIBERNATION */
1743 static inline int pte_same_as_swp(pte_t pte, pte_t swp_pte)
1745 return pte_same(pte_swp_clear_flags(pte), swp_pte);
1749 * No need to decide whether this PTE shares the swap entry with others,
1750 * just let do_wp_page work it out if a write is requested later - to
1751 * force COW, vm_page_prot omits write permission from any private vma.
1753 static int unuse_pte(struct vm_area_struct *vma, pmd_t *pmd,
1754 unsigned long addr, swp_entry_t entry, struct folio *folio)
1757 struct folio *swapcache;
1759 pte_t *pte, new_pte, old_pte;
1760 bool hwpoisoned = false;
1764 folio = ksm_might_need_to_copy(folio, vma, addr);
1765 if (unlikely(!folio))
1767 else if (unlikely(folio == ERR_PTR(-EHWPOISON))) {
1772 page = folio_file_page(folio, swp_offset(entry));
1773 if (PageHWPoison(page))
1776 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
1777 if (unlikely(!pte || !pte_same_as_swp(ptep_get(pte),
1778 swp_entry_to_pte(entry)))) {
1783 old_pte = ptep_get(pte);
1785 if (unlikely(hwpoisoned || !folio_test_uptodate(folio))) {
1786 swp_entry_t swp_entry;
1788 dec_mm_counter(vma->vm_mm, MM_SWAPENTS);
1790 swp_entry = make_hwpoison_entry(page);
1792 swp_entry = make_poisoned_swp_entry();
1794 new_pte = swp_entry_to_pte(swp_entry);
1800 * Some architectures may have to restore extra metadata to the page
1801 * when reading from swap. This metadata may be indexed by swap entry
1802 * so this must be called before swap_free().
1804 arch_swap_restore(entry, folio);
1806 dec_mm_counter(vma->vm_mm, MM_SWAPENTS);
1807 inc_mm_counter(vma->vm_mm, MM_ANONPAGES);
1809 if (folio == swapcache) {
1810 rmap_t rmap_flags = RMAP_NONE;
1813 * See do_swap_page(): writeback would be problematic.
1814 * However, we do a folio_wait_writeback() just before this
1815 * call and have the folio locked.
1817 VM_BUG_ON_FOLIO(folio_test_writeback(folio), folio);
1818 if (pte_swp_exclusive(old_pte))
1819 rmap_flags |= RMAP_EXCLUSIVE;
1821 folio_add_anon_rmap_pte(folio, page, vma, addr, rmap_flags);
1822 } else { /* ksm created a completely new copy */
1823 folio_add_new_anon_rmap(folio, vma, addr);
1824 folio_add_lru_vma(folio, vma);
1826 new_pte = pte_mkold(mk_pte(page, vma->vm_page_prot));
1827 if (pte_swp_soft_dirty(old_pte))
1828 new_pte = pte_mksoft_dirty(new_pte);
1829 if (pte_swp_uffd_wp(old_pte))
1830 new_pte = pte_mkuffd_wp(new_pte);
1832 set_pte_at(vma->vm_mm, addr, pte, new_pte);
1836 pte_unmap_unlock(pte, ptl);
1837 if (folio != swapcache) {
1838 folio_unlock(folio);
1844 static int unuse_pte_range(struct vm_area_struct *vma, pmd_t *pmd,
1845 unsigned long addr, unsigned long end,
1849 struct swap_info_struct *si;
1851 si = swap_info[type];
1853 struct folio *folio;
1854 unsigned long offset;
1855 unsigned char swp_count;
1861 pte = pte_offset_map(pmd, addr);
1866 ptent = ptep_get_lockless(pte);
1868 if (!is_swap_pte(ptent))
1871 entry = pte_to_swp_entry(ptent);
1872 if (swp_type(entry) != type)
1875 offset = swp_offset(entry);
1879 folio = swap_cache_get_folio(entry, vma, addr);
1882 struct vm_fault vmf = {
1885 .real_address = addr,
1889 page = swapin_readahead(entry, GFP_HIGHUSER_MOVABLE,
1892 folio = page_folio(page);
1895 swp_count = READ_ONCE(si->swap_map[offset]);
1896 if (swp_count == 0 || swp_count == SWAP_MAP_BAD)
1902 folio_wait_writeback(folio);
1903 ret = unuse_pte(vma, pmd, addr, entry, folio);
1905 folio_unlock(folio);
1910 folio_free_swap(folio);
1911 folio_unlock(folio);
1913 } while (addr += PAGE_SIZE, addr != end);
1920 static inline int unuse_pmd_range(struct vm_area_struct *vma, pud_t *pud,
1921 unsigned long addr, unsigned long end,
1928 pmd = pmd_offset(pud, addr);
1931 next = pmd_addr_end(addr, end);
1932 ret = unuse_pte_range(vma, pmd, addr, next, type);
1935 } while (pmd++, addr = next, addr != end);
1939 static inline int unuse_pud_range(struct vm_area_struct *vma, p4d_t *p4d,
1940 unsigned long addr, unsigned long end,
1947 pud = pud_offset(p4d, addr);
1949 next = pud_addr_end(addr, end);
1950 if (pud_none_or_clear_bad(pud))
1952 ret = unuse_pmd_range(vma, pud, addr, next, type);
1955 } while (pud++, addr = next, addr != end);
1959 static inline int unuse_p4d_range(struct vm_area_struct *vma, pgd_t *pgd,
1960 unsigned long addr, unsigned long end,
1967 p4d = p4d_offset(pgd, addr);
1969 next = p4d_addr_end(addr, end);
1970 if (p4d_none_or_clear_bad(p4d))
1972 ret = unuse_pud_range(vma, p4d, addr, next, type);
1975 } while (p4d++, addr = next, addr != end);
1979 static int unuse_vma(struct vm_area_struct *vma, unsigned int type)
1982 unsigned long addr, end, next;
1985 addr = vma->vm_start;
1988 pgd = pgd_offset(vma->vm_mm, addr);
1990 next = pgd_addr_end(addr, end);
1991 if (pgd_none_or_clear_bad(pgd))
1993 ret = unuse_p4d_range(vma, pgd, addr, next, type);
1996 } while (pgd++, addr = next, addr != end);
2000 static int unuse_mm(struct mm_struct *mm, unsigned int type)
2002 struct vm_area_struct *vma;
2004 VMA_ITERATOR(vmi, mm, 0);
2007 for_each_vma(vmi, vma) {
2008 if (vma->anon_vma) {
2009 ret = unuse_vma(vma, type);
2016 mmap_read_unlock(mm);
2021 * Scan swap_map from current position to next entry still in use.
2022 * Return 0 if there are no inuse entries after prev till end of
2025 static unsigned int find_next_to_unuse(struct swap_info_struct *si,
2029 unsigned char count;
2032 * No need for swap_lock here: we're just looking
2033 * for whether an entry is in use, not modifying it; false
2034 * hits are okay, and sys_swapoff() has already prevented new
2035 * allocations from this area (while holding swap_lock).
2037 for (i = prev + 1; i < si->max; i++) {
2038 count = READ_ONCE(si->swap_map[i]);
2039 if (count && swap_count(count) != SWAP_MAP_BAD)
2041 if ((i % LATENCY_LIMIT) == 0)
2051 static int try_to_unuse(unsigned int type)
2053 struct mm_struct *prev_mm;
2054 struct mm_struct *mm;
2055 struct list_head *p;
2057 struct swap_info_struct *si = swap_info[type];
2058 struct folio *folio;
2062 if (!READ_ONCE(si->inuse_pages))
2066 retval = shmem_unuse(type);
2073 spin_lock(&mmlist_lock);
2074 p = &init_mm.mmlist;
2075 while (READ_ONCE(si->inuse_pages) &&
2076 !signal_pending(current) &&
2077 (p = p->next) != &init_mm.mmlist) {
2079 mm = list_entry(p, struct mm_struct, mmlist);
2080 if (!mmget_not_zero(mm))
2082 spin_unlock(&mmlist_lock);
2085 retval = unuse_mm(mm, type);
2092 * Make sure that we aren't completely killing
2093 * interactive performance.
2096 spin_lock(&mmlist_lock);
2098 spin_unlock(&mmlist_lock);
2103 while (READ_ONCE(si->inuse_pages) &&
2104 !signal_pending(current) &&
2105 (i = find_next_to_unuse(si, i)) != 0) {
2107 entry = swp_entry(type, i);
2108 folio = filemap_get_folio(swap_address_space(entry), i);
2113 * It is conceivable that a racing task removed this folio from
2114 * swap cache just before we acquired the page lock. The folio
2115 * might even be back in swap cache on another swap area. But
2116 * that is okay, folio_free_swap() only removes stale folios.
2119 folio_wait_writeback(folio);
2120 folio_free_swap(folio);
2121 folio_unlock(folio);
2126 * Lets check again to see if there are still swap entries in the map.
2127 * If yes, we would need to do retry the unuse logic again.
2128 * Under global memory pressure, swap entries can be reinserted back
2129 * into process space after the mmlist loop above passes over them.
2131 * Limit the number of retries? No: when mmget_not_zero()
2132 * above fails, that mm is likely to be freeing swap from
2133 * exit_mmap(), which proceeds at its own independent pace;
2134 * and even shmem_writepage() could have been preempted after
2135 * folio_alloc_swap(), temporarily hiding that swap. It's easy
2136 * and robust (though cpu-intensive) just to keep retrying.
2138 if (READ_ONCE(si->inuse_pages)) {
2139 if (!signal_pending(current))
2148 * After a successful try_to_unuse, if no swap is now in use, we know
2149 * we can empty the mmlist. swap_lock must be held on entry and exit.
2150 * Note that mmlist_lock nests inside swap_lock, and an mm must be
2151 * added to the mmlist just after page_duplicate - before would be racy.
2153 static void drain_mmlist(void)
2155 struct list_head *p, *next;
2158 for (type = 0; type < nr_swapfiles; type++)
2159 if (swap_info[type]->inuse_pages)
2161 spin_lock(&mmlist_lock);
2162 list_for_each_safe(p, next, &init_mm.mmlist)
2164 spin_unlock(&mmlist_lock);
2168 * Free all of a swapdev's extent information
2170 static void destroy_swap_extents(struct swap_info_struct *sis)
2172 while (!RB_EMPTY_ROOT(&sis->swap_extent_root)) {
2173 struct rb_node *rb = sis->swap_extent_root.rb_node;
2174 struct swap_extent *se = rb_entry(rb, struct swap_extent, rb_node);
2176 rb_erase(rb, &sis->swap_extent_root);
2180 if (sis->flags & SWP_ACTIVATED) {
2181 struct file *swap_file = sis->swap_file;
2182 struct address_space *mapping = swap_file->f_mapping;
2184 sis->flags &= ~SWP_ACTIVATED;
2185 if (mapping->a_ops->swap_deactivate)
2186 mapping->a_ops->swap_deactivate(swap_file);
2191 * Add a block range (and the corresponding page range) into this swapdev's
2194 * This function rather assumes that it is called in ascending page order.
2197 add_swap_extent(struct swap_info_struct *sis, unsigned long start_page,
2198 unsigned long nr_pages, sector_t start_block)
2200 struct rb_node **link = &sis->swap_extent_root.rb_node, *parent = NULL;
2201 struct swap_extent *se;
2202 struct swap_extent *new_se;
2205 * place the new node at the right most since the
2206 * function is called in ascending page order.
2210 link = &parent->rb_right;
2214 se = rb_entry(parent, struct swap_extent, rb_node);
2215 BUG_ON(se->start_page + se->nr_pages != start_page);
2216 if (se->start_block + se->nr_pages == start_block) {
2218 se->nr_pages += nr_pages;
2223 /* No merge, insert a new extent. */
2224 new_se = kmalloc(sizeof(*se), GFP_KERNEL);
2227 new_se->start_page = start_page;
2228 new_se->nr_pages = nr_pages;
2229 new_se->start_block = start_block;
2231 rb_link_node(&new_se->rb_node, parent, link);
2232 rb_insert_color(&new_se->rb_node, &sis->swap_extent_root);
2235 EXPORT_SYMBOL_GPL(add_swap_extent);
2238 * A `swap extent' is a simple thing which maps a contiguous range of pages
2239 * onto a contiguous range of disk blocks. A rbtree of swap extents is
2240 * built at swapon time and is then used at swap_writepage/swap_read_folio
2241 * time for locating where on disk a page belongs.
2243 * If the swapfile is an S_ISBLK block device, a single extent is installed.
2244 * This is done so that the main operating code can treat S_ISBLK and S_ISREG
2245 * swap files identically.
2247 * Whether the swapdev is an S_ISREG file or an S_ISBLK blockdev, the swap
2248 * extent rbtree operates in PAGE_SIZE disk blocks. Both S_ISREG and S_ISBLK
2249 * swapfiles are handled *identically* after swapon time.
2251 * For S_ISREG swapfiles, setup_swap_extents() will walk all the file's blocks
2252 * and will parse them into a rbtree, in PAGE_SIZE chunks. If some stray
2253 * blocks are found which do not fall within the PAGE_SIZE alignment
2254 * requirements, they are simply tossed out - we will never use those blocks
2257 * For all swap devices we set S_SWAPFILE across the life of the swapon. This
2258 * prevents users from writing to the swap device, which will corrupt memory.
2260 * The amount of disk space which a single swap extent represents varies.
2261 * Typically it is in the 1-4 megabyte range. So we can have hundreds of
2262 * extents in the rbtree. - akpm.
2264 static int setup_swap_extents(struct swap_info_struct *sis, sector_t *span)
2266 struct file *swap_file = sis->swap_file;
2267 struct address_space *mapping = swap_file->f_mapping;
2268 struct inode *inode = mapping->host;
2271 if (S_ISBLK(inode->i_mode)) {
2272 ret = add_swap_extent(sis, 0, sis->max, 0);
2277 if (mapping->a_ops->swap_activate) {
2278 ret = mapping->a_ops->swap_activate(sis, swap_file, span);
2281 sis->flags |= SWP_ACTIVATED;
2282 if ((sis->flags & SWP_FS_OPS) &&
2283 sio_pool_init() != 0) {
2284 destroy_swap_extents(sis);
2290 return generic_swapfile_activate(sis, swap_file, span);
2293 static int swap_node(struct swap_info_struct *p)
2295 struct block_device *bdev;
2300 bdev = p->swap_file->f_inode->i_sb->s_bdev;
2302 return bdev ? bdev->bd_disk->node_id : NUMA_NO_NODE;
2305 static void setup_swap_info(struct swap_info_struct *p, int prio,
2306 unsigned char *swap_map,
2307 struct swap_cluster_info *cluster_info)
2314 p->prio = --least_priority;
2316 * the plist prio is negated because plist ordering is
2317 * low-to-high, while swap ordering is high-to-low
2319 p->list.prio = -p->prio;
2322 p->avail_lists[i].prio = -p->prio;
2324 if (swap_node(p) == i)
2325 p->avail_lists[i].prio = 1;
2327 p->avail_lists[i].prio = -p->prio;
2330 p->swap_map = swap_map;
2331 p->cluster_info = cluster_info;
2334 static void _enable_swap_info(struct swap_info_struct *p)
2336 p->flags |= SWP_WRITEOK;
2337 atomic_long_add(p->pages, &nr_swap_pages);
2338 total_swap_pages += p->pages;
2340 assert_spin_locked(&swap_lock);
2342 * both lists are plists, and thus priority ordered.
2343 * swap_active_head needs to be priority ordered for swapoff(),
2344 * which on removal of any swap_info_struct with an auto-assigned
2345 * (i.e. negative) priority increments the auto-assigned priority
2346 * of any lower-priority swap_info_structs.
2347 * swap_avail_head needs to be priority ordered for folio_alloc_swap(),
2348 * which allocates swap pages from the highest available priority
2351 plist_add(&p->list, &swap_active_head);
2353 /* add to available list iff swap device is not full */
2355 add_to_avail_list(p);
2358 static void enable_swap_info(struct swap_info_struct *p, int prio,
2359 unsigned char *swap_map,
2360 struct swap_cluster_info *cluster_info)
2362 zswap_swapon(p->type);
2364 spin_lock(&swap_lock);
2365 spin_lock(&p->lock);
2366 setup_swap_info(p, prio, swap_map, cluster_info);
2367 spin_unlock(&p->lock);
2368 spin_unlock(&swap_lock);
2370 * Finished initializing swap device, now it's safe to reference it.
2372 percpu_ref_resurrect(&p->users);
2373 spin_lock(&swap_lock);
2374 spin_lock(&p->lock);
2375 _enable_swap_info(p);
2376 spin_unlock(&p->lock);
2377 spin_unlock(&swap_lock);
2380 static void reinsert_swap_info(struct swap_info_struct *p)
2382 spin_lock(&swap_lock);
2383 spin_lock(&p->lock);
2384 setup_swap_info(p, p->prio, p->swap_map, p->cluster_info);
2385 _enable_swap_info(p);
2386 spin_unlock(&p->lock);
2387 spin_unlock(&swap_lock);
2390 bool has_usable_swap(void)
2394 spin_lock(&swap_lock);
2395 if (plist_head_empty(&swap_active_head))
2397 spin_unlock(&swap_lock);
2401 SYSCALL_DEFINE1(swapoff, const char __user *, specialfile)
2403 struct swap_info_struct *p = NULL;
2404 unsigned char *swap_map;
2405 struct swap_cluster_info *cluster_info;
2406 struct file *swap_file, *victim;
2407 struct address_space *mapping;
2408 struct inode *inode;
2409 struct filename *pathname;
2411 unsigned int old_block_size;
2413 if (!capable(CAP_SYS_ADMIN))
2416 BUG_ON(!current->mm);
2418 pathname = getname(specialfile);
2419 if (IS_ERR(pathname))
2420 return PTR_ERR(pathname);
2422 victim = file_open_name(pathname, O_RDWR|O_LARGEFILE, 0);
2423 err = PTR_ERR(victim);
2427 mapping = victim->f_mapping;
2428 spin_lock(&swap_lock);
2429 plist_for_each_entry(p, &swap_active_head, list) {
2430 if (p->flags & SWP_WRITEOK) {
2431 if (p->swap_file->f_mapping == mapping) {
2439 spin_unlock(&swap_lock);
2442 if (!security_vm_enough_memory_mm(current->mm, p->pages))
2443 vm_unacct_memory(p->pages);
2446 spin_unlock(&swap_lock);
2449 spin_lock(&p->lock);
2450 del_from_avail_list(p);
2452 struct swap_info_struct *si = p;
2455 plist_for_each_entry_continue(si, &swap_active_head, list) {
2458 for_each_node(nid) {
2459 if (si->avail_lists[nid].prio != 1)
2460 si->avail_lists[nid].prio--;
2465 plist_del(&p->list, &swap_active_head);
2466 atomic_long_sub(p->pages, &nr_swap_pages);
2467 total_swap_pages -= p->pages;
2468 p->flags &= ~SWP_WRITEOK;
2469 spin_unlock(&p->lock);
2470 spin_unlock(&swap_lock);
2472 disable_swap_slots_cache_lock();
2474 set_current_oom_origin();
2475 err = try_to_unuse(p->type);
2476 clear_current_oom_origin();
2479 /* re-insert swap space back into swap_list */
2480 reinsert_swap_info(p);
2481 reenable_swap_slots_cache_unlock();
2485 reenable_swap_slots_cache_unlock();
2488 * Wait for swap operations protected by get/put_swap_device()
2491 * We need synchronize_rcu() here to protect the accessing to
2492 * the swap cache data structure.
2494 percpu_ref_kill(&p->users);
2496 wait_for_completion(&p->comp);
2498 flush_work(&p->discard_work);
2500 destroy_swap_extents(p);
2501 if (p->flags & SWP_CONTINUED)
2502 free_swap_count_continuations(p);
2504 if (!p->bdev || !bdev_nonrot(p->bdev))
2505 atomic_dec(&nr_rotate_swap);
2507 mutex_lock(&swapon_mutex);
2508 spin_lock(&swap_lock);
2509 spin_lock(&p->lock);
2512 /* wait for anyone still in scan_swap_map_slots */
2513 p->highest_bit = 0; /* cuts scans short */
2514 while (p->flags >= SWP_SCANNING) {
2515 spin_unlock(&p->lock);
2516 spin_unlock(&swap_lock);
2517 schedule_timeout_uninterruptible(1);
2518 spin_lock(&swap_lock);
2519 spin_lock(&p->lock);
2522 swap_file = p->swap_file;
2523 old_block_size = p->old_block_size;
2524 p->swap_file = NULL;
2526 swap_map = p->swap_map;
2528 cluster_info = p->cluster_info;
2529 p->cluster_info = NULL;
2530 spin_unlock(&p->lock);
2531 spin_unlock(&swap_lock);
2532 arch_swap_invalidate_area(p->type);
2533 zswap_swapoff(p->type);
2534 mutex_unlock(&swapon_mutex);
2535 free_percpu(p->percpu_cluster);
2536 p->percpu_cluster = NULL;
2537 free_percpu(p->cluster_next_cpu);
2538 p->cluster_next_cpu = NULL;
2540 kvfree(cluster_info);
2541 /* Destroy swap account information */
2542 swap_cgroup_swapoff(p->type);
2543 exit_swap_address_space(p->type);
2545 inode = mapping->host;
2546 if (p->bdev_handle) {
2547 set_blocksize(p->bdev, old_block_size);
2548 bdev_release(p->bdev_handle);
2549 p->bdev_handle = NULL;
2553 inode->i_flags &= ~S_SWAPFILE;
2554 inode_unlock(inode);
2555 filp_close(swap_file, NULL);
2558 * Clear the SWP_USED flag after all resources are freed so that swapon
2559 * can reuse this swap_info in alloc_swap_info() safely. It is ok to
2560 * not hold p->lock after we cleared its SWP_WRITEOK.
2562 spin_lock(&swap_lock);
2564 spin_unlock(&swap_lock);
2567 atomic_inc(&proc_poll_event);
2568 wake_up_interruptible(&proc_poll_wait);
2571 filp_close(victim, NULL);
2577 #ifdef CONFIG_PROC_FS
2578 static __poll_t swaps_poll(struct file *file, poll_table *wait)
2580 struct seq_file *seq = file->private_data;
2582 poll_wait(file, &proc_poll_wait, wait);
2584 if (seq->poll_event != atomic_read(&proc_poll_event)) {
2585 seq->poll_event = atomic_read(&proc_poll_event);
2586 return EPOLLIN | EPOLLRDNORM | EPOLLERR | EPOLLPRI;
2589 return EPOLLIN | EPOLLRDNORM;
2593 static void *swap_start(struct seq_file *swap, loff_t *pos)
2595 struct swap_info_struct *si;
2599 mutex_lock(&swapon_mutex);
2602 return SEQ_START_TOKEN;
2604 for (type = 0; (si = swap_type_to_swap_info(type)); type++) {
2605 if (!(si->flags & SWP_USED) || !si->swap_map)
2614 static void *swap_next(struct seq_file *swap, void *v, loff_t *pos)
2616 struct swap_info_struct *si = v;
2619 if (v == SEQ_START_TOKEN)
2622 type = si->type + 1;
2625 for (; (si = swap_type_to_swap_info(type)); type++) {
2626 if (!(si->flags & SWP_USED) || !si->swap_map)
2634 static void swap_stop(struct seq_file *swap, void *v)
2636 mutex_unlock(&swapon_mutex);
2639 static int swap_show(struct seq_file *swap, void *v)
2641 struct swap_info_struct *si = v;
2644 unsigned long bytes, inuse;
2646 if (si == SEQ_START_TOKEN) {
2647 seq_puts(swap, "Filename\t\t\t\tType\t\tSize\t\tUsed\t\tPriority\n");
2651 bytes = K(si->pages);
2652 inuse = K(READ_ONCE(si->inuse_pages));
2654 file = si->swap_file;
2655 len = seq_file_path(swap, file, " \t\n\\");
2656 seq_printf(swap, "%*s%s\t%lu\t%s%lu\t%s%d\n",
2657 len < 40 ? 40 - len : 1, " ",
2658 S_ISBLK(file_inode(file)->i_mode) ?
2659 "partition" : "file\t",
2660 bytes, bytes < 10000000 ? "\t" : "",
2661 inuse, inuse < 10000000 ? "\t" : "",
2666 static const struct seq_operations swaps_op = {
2667 .start = swap_start,
2673 static int swaps_open(struct inode *inode, struct file *file)
2675 struct seq_file *seq;
2678 ret = seq_open(file, &swaps_op);
2682 seq = file->private_data;
2683 seq->poll_event = atomic_read(&proc_poll_event);
2687 static const struct proc_ops swaps_proc_ops = {
2688 .proc_flags = PROC_ENTRY_PERMANENT,
2689 .proc_open = swaps_open,
2690 .proc_read = seq_read,
2691 .proc_lseek = seq_lseek,
2692 .proc_release = seq_release,
2693 .proc_poll = swaps_poll,
2696 static int __init procswaps_init(void)
2698 proc_create("swaps", 0, NULL, &swaps_proc_ops);
2701 __initcall(procswaps_init);
2702 #endif /* CONFIG_PROC_FS */
2704 #ifdef MAX_SWAPFILES_CHECK
2705 static int __init max_swapfiles_check(void)
2707 MAX_SWAPFILES_CHECK();
2710 late_initcall(max_swapfiles_check);
2713 static struct swap_info_struct *alloc_swap_info(void)
2715 struct swap_info_struct *p;
2716 struct swap_info_struct *defer = NULL;
2720 p = kvzalloc(struct_size(p, avail_lists, nr_node_ids), GFP_KERNEL);
2722 return ERR_PTR(-ENOMEM);
2724 if (percpu_ref_init(&p->users, swap_users_ref_free,
2725 PERCPU_REF_INIT_DEAD, GFP_KERNEL)) {
2727 return ERR_PTR(-ENOMEM);
2730 spin_lock(&swap_lock);
2731 for (type = 0; type < nr_swapfiles; type++) {
2732 if (!(swap_info[type]->flags & SWP_USED))
2735 if (type >= MAX_SWAPFILES) {
2736 spin_unlock(&swap_lock);
2737 percpu_ref_exit(&p->users);
2739 return ERR_PTR(-EPERM);
2741 if (type >= nr_swapfiles) {
2744 * Publish the swap_info_struct after initializing it.
2745 * Note that kvzalloc() above zeroes all its fields.
2747 smp_store_release(&swap_info[type], p); /* rcu_assign_pointer() */
2751 p = swap_info[type];
2753 * Do not memset this entry: a racing procfs swap_next()
2754 * would be relying on p->type to remain valid.
2757 p->swap_extent_root = RB_ROOT;
2758 plist_node_init(&p->list, 0);
2760 plist_node_init(&p->avail_lists[i], 0);
2761 p->flags = SWP_USED;
2762 spin_unlock(&swap_lock);
2764 percpu_ref_exit(&defer->users);
2767 spin_lock_init(&p->lock);
2768 spin_lock_init(&p->cont_lock);
2769 init_completion(&p->comp);
2774 static int claim_swapfile(struct swap_info_struct *p, struct inode *inode)
2778 if (S_ISBLK(inode->i_mode)) {
2779 p->bdev_handle = bdev_open_by_dev(inode->i_rdev,
2780 BLK_OPEN_READ | BLK_OPEN_WRITE, p, NULL);
2781 if (IS_ERR(p->bdev_handle)) {
2782 error = PTR_ERR(p->bdev_handle);
2783 p->bdev_handle = NULL;
2786 p->bdev = p->bdev_handle->bdev;
2787 p->old_block_size = block_size(p->bdev);
2788 error = set_blocksize(p->bdev, PAGE_SIZE);
2792 * Zoned block devices contain zones that have a sequential
2793 * write only restriction. Hence zoned block devices are not
2794 * suitable for swapping. Disallow them here.
2796 if (bdev_is_zoned(p->bdev))
2798 p->flags |= SWP_BLKDEV;
2799 } else if (S_ISREG(inode->i_mode)) {
2800 p->bdev = inode->i_sb->s_bdev;
2808 * Find out how many pages are allowed for a single swap device. There
2809 * are two limiting factors:
2810 * 1) the number of bits for the swap offset in the swp_entry_t type, and
2811 * 2) the number of bits in the swap pte, as defined by the different
2814 * In order to find the largest possible bit mask, a swap entry with
2815 * swap type 0 and swap offset ~0UL is created, encoded to a swap pte,
2816 * decoded to a swp_entry_t again, and finally the swap offset is
2819 * This will mask all the bits from the initial ~0UL mask that can't
2820 * be encoded in either the swp_entry_t or the architecture definition
2823 unsigned long generic_max_swapfile_size(void)
2825 return swp_offset(pte_to_swp_entry(
2826 swp_entry_to_pte(swp_entry(0, ~0UL)))) + 1;
2829 /* Can be overridden by an architecture for additional checks. */
2830 __weak unsigned long arch_max_swapfile_size(void)
2832 return generic_max_swapfile_size();
2835 static unsigned long read_swap_header(struct swap_info_struct *p,
2836 union swap_header *swap_header,
2837 struct inode *inode)
2840 unsigned long maxpages;
2841 unsigned long swapfilepages;
2842 unsigned long last_page;
2844 if (memcmp("SWAPSPACE2", swap_header->magic.magic, 10)) {
2845 pr_err("Unable to find swap-space signature\n");
2849 /* swap partition endianness hack... */
2850 if (swab32(swap_header->info.version) == 1) {
2851 swab32s(&swap_header->info.version);
2852 swab32s(&swap_header->info.last_page);
2853 swab32s(&swap_header->info.nr_badpages);
2854 if (swap_header->info.nr_badpages > MAX_SWAP_BADPAGES)
2856 for (i = 0; i < swap_header->info.nr_badpages; i++)
2857 swab32s(&swap_header->info.badpages[i]);
2859 /* Check the swap header's sub-version */
2860 if (swap_header->info.version != 1) {
2861 pr_warn("Unable to handle swap header version %d\n",
2862 swap_header->info.version);
2867 p->cluster_next = 1;
2870 maxpages = swapfile_maximum_size;
2871 last_page = swap_header->info.last_page;
2873 pr_warn("Empty swap-file\n");
2876 if (last_page > maxpages) {
2877 pr_warn("Truncating oversized swap area, only using %luk out of %luk\n",
2878 K(maxpages), K(last_page));
2880 if (maxpages > last_page) {
2881 maxpages = last_page + 1;
2882 /* p->max is an unsigned int: don't overflow it */
2883 if ((unsigned int)maxpages == 0)
2884 maxpages = UINT_MAX;
2886 p->highest_bit = maxpages - 1;
2890 swapfilepages = i_size_read(inode) >> PAGE_SHIFT;
2891 if (swapfilepages && maxpages > swapfilepages) {
2892 pr_warn("Swap area shorter than signature indicates\n");
2895 if (swap_header->info.nr_badpages && S_ISREG(inode->i_mode))
2897 if (swap_header->info.nr_badpages > MAX_SWAP_BADPAGES)
2903 #define SWAP_CLUSTER_INFO_COLS \
2904 DIV_ROUND_UP(L1_CACHE_BYTES, sizeof(struct swap_cluster_info))
2905 #define SWAP_CLUSTER_SPACE_COLS \
2906 DIV_ROUND_UP(SWAP_ADDRESS_SPACE_PAGES, SWAPFILE_CLUSTER)
2907 #define SWAP_CLUSTER_COLS \
2908 max_t(unsigned int, SWAP_CLUSTER_INFO_COLS, SWAP_CLUSTER_SPACE_COLS)
2910 static int setup_swap_map_and_extents(struct swap_info_struct *p,
2911 union swap_header *swap_header,
2912 unsigned char *swap_map,
2913 struct swap_cluster_info *cluster_info,
2914 unsigned long maxpages,
2918 unsigned int nr_good_pages;
2920 unsigned long nr_clusters = DIV_ROUND_UP(maxpages, SWAPFILE_CLUSTER);
2921 unsigned long col = p->cluster_next / SWAPFILE_CLUSTER % SWAP_CLUSTER_COLS;
2922 unsigned long i, idx;
2924 nr_good_pages = maxpages - 1; /* omit header page */
2926 cluster_list_init(&p->free_clusters);
2927 cluster_list_init(&p->discard_clusters);
2929 for (i = 0; i < swap_header->info.nr_badpages; i++) {
2930 unsigned int page_nr = swap_header->info.badpages[i];
2931 if (page_nr == 0 || page_nr > swap_header->info.last_page)
2933 if (page_nr < maxpages) {
2934 swap_map[page_nr] = SWAP_MAP_BAD;
2937 * Haven't marked the cluster free yet, no list
2938 * operation involved
2940 inc_cluster_info_page(p, cluster_info, page_nr);
2944 /* Haven't marked the cluster free yet, no list operation involved */
2945 for (i = maxpages; i < round_up(maxpages, SWAPFILE_CLUSTER); i++)
2946 inc_cluster_info_page(p, cluster_info, i);
2948 if (nr_good_pages) {
2949 swap_map[0] = SWAP_MAP_BAD;
2951 * Not mark the cluster free yet, no list
2952 * operation involved
2954 inc_cluster_info_page(p, cluster_info, 0);
2956 p->pages = nr_good_pages;
2957 nr_extents = setup_swap_extents(p, span);
2960 nr_good_pages = p->pages;
2962 if (!nr_good_pages) {
2963 pr_warn("Empty swap-file\n");
2972 * Reduce false cache line sharing between cluster_info and
2973 * sharing same address space.
2975 for (k = 0; k < SWAP_CLUSTER_COLS; k++) {
2976 j = (k + col) % SWAP_CLUSTER_COLS;
2977 for (i = 0; i < DIV_ROUND_UP(nr_clusters, SWAP_CLUSTER_COLS); i++) {
2978 idx = i * SWAP_CLUSTER_COLS + j;
2979 if (idx >= nr_clusters)
2981 if (cluster_count(&cluster_info[idx]))
2983 cluster_set_flag(&cluster_info[idx], CLUSTER_FLAG_FREE);
2984 cluster_list_add_tail(&p->free_clusters, cluster_info,
2991 SYSCALL_DEFINE2(swapon, const char __user *, specialfile, int, swap_flags)
2993 struct swap_info_struct *p;
2994 struct filename *name;
2995 struct file *swap_file = NULL;
2996 struct address_space *mapping;
2997 struct dentry *dentry;
3000 union swap_header *swap_header;
3003 unsigned long maxpages;
3004 unsigned char *swap_map = NULL;
3005 struct swap_cluster_info *cluster_info = NULL;
3006 struct page *page = NULL;
3007 struct inode *inode = NULL;
3008 bool inced_nr_rotate_swap = false;
3010 if (swap_flags & ~SWAP_FLAGS_VALID)
3013 if (!capable(CAP_SYS_ADMIN))
3016 if (!swap_avail_heads)
3019 p = alloc_swap_info();
3023 INIT_WORK(&p->discard_work, swap_discard_work);
3025 name = getname(specialfile);
3027 error = PTR_ERR(name);
3031 swap_file = file_open_name(name, O_RDWR|O_LARGEFILE, 0);
3032 if (IS_ERR(swap_file)) {
3033 error = PTR_ERR(swap_file);
3038 p->swap_file = swap_file;
3039 mapping = swap_file->f_mapping;
3040 dentry = swap_file->f_path.dentry;
3041 inode = mapping->host;
3043 error = claim_swapfile(p, inode);
3044 if (unlikely(error))
3048 if (d_unlinked(dentry) || cant_mount(dentry)) {
3050 goto bad_swap_unlock_inode;
3052 if (IS_SWAPFILE(inode)) {
3054 goto bad_swap_unlock_inode;
3058 * Read the swap header.
3060 if (!mapping->a_ops->read_folio) {
3062 goto bad_swap_unlock_inode;
3064 page = read_mapping_page(mapping, 0, swap_file);
3066 error = PTR_ERR(page);
3067 goto bad_swap_unlock_inode;
3069 swap_header = kmap(page);
3071 maxpages = read_swap_header(p, swap_header, inode);
3072 if (unlikely(!maxpages)) {
3074 goto bad_swap_unlock_inode;
3077 /* OK, set up the swap map and apply the bad block list */
3078 swap_map = vzalloc(maxpages);
3081 goto bad_swap_unlock_inode;
3084 if (p->bdev && bdev_stable_writes(p->bdev))
3085 p->flags |= SWP_STABLE_WRITES;
3087 if (p->bdev && bdev_synchronous(p->bdev))
3088 p->flags |= SWP_SYNCHRONOUS_IO;
3090 if (p->bdev && bdev_nonrot(p->bdev)) {
3092 unsigned long ci, nr_cluster;
3094 p->flags |= SWP_SOLIDSTATE;
3095 p->cluster_next_cpu = alloc_percpu(unsigned int);
3096 if (!p->cluster_next_cpu) {
3098 goto bad_swap_unlock_inode;
3101 * select a random position to start with to help wear leveling
3104 for_each_possible_cpu(cpu) {
3105 per_cpu(*p->cluster_next_cpu, cpu) =
3106 get_random_u32_inclusive(1, p->highest_bit);
3108 nr_cluster = DIV_ROUND_UP(maxpages, SWAPFILE_CLUSTER);
3110 cluster_info = kvcalloc(nr_cluster, sizeof(*cluster_info),
3112 if (!cluster_info) {
3114 goto bad_swap_unlock_inode;
3117 for (ci = 0; ci < nr_cluster; ci++)
3118 spin_lock_init(&((cluster_info + ci)->lock));
3120 p->percpu_cluster = alloc_percpu(struct percpu_cluster);
3121 if (!p->percpu_cluster) {
3123 goto bad_swap_unlock_inode;
3125 for_each_possible_cpu(cpu) {
3126 struct percpu_cluster *cluster;
3127 cluster = per_cpu_ptr(p->percpu_cluster, cpu);
3128 cluster_set_null(&cluster->index);
3131 atomic_inc(&nr_rotate_swap);
3132 inced_nr_rotate_swap = true;
3135 error = swap_cgroup_swapon(p->type, maxpages);
3137 goto bad_swap_unlock_inode;
3139 nr_extents = setup_swap_map_and_extents(p, swap_header, swap_map,
3140 cluster_info, maxpages, &span);
3141 if (unlikely(nr_extents < 0)) {
3143 goto bad_swap_unlock_inode;
3146 if ((swap_flags & SWAP_FLAG_DISCARD) &&
3147 p->bdev && bdev_max_discard_sectors(p->bdev)) {
3149 * When discard is enabled for swap with no particular
3150 * policy flagged, we set all swap discard flags here in
3151 * order to sustain backward compatibility with older
3152 * swapon(8) releases.
3154 p->flags |= (SWP_DISCARDABLE | SWP_AREA_DISCARD |
3158 * By flagging sys_swapon, a sysadmin can tell us to
3159 * either do single-time area discards only, or to just
3160 * perform discards for released swap page-clusters.
3161 * Now it's time to adjust the p->flags accordingly.
3163 if (swap_flags & SWAP_FLAG_DISCARD_ONCE)
3164 p->flags &= ~SWP_PAGE_DISCARD;
3165 else if (swap_flags & SWAP_FLAG_DISCARD_PAGES)
3166 p->flags &= ~SWP_AREA_DISCARD;
3168 /* issue a swapon-time discard if it's still required */
3169 if (p->flags & SWP_AREA_DISCARD) {
3170 int err = discard_swap(p);
3172 pr_err("swapon: discard_swap(%p): %d\n",
3177 error = init_swap_address_space(p->type, maxpages);
3179 goto bad_swap_unlock_inode;
3182 * Flush any pending IO and dirty mappings before we start using this
3185 inode->i_flags |= S_SWAPFILE;
3186 error = inode_drain_writes(inode);
3188 inode->i_flags &= ~S_SWAPFILE;
3189 goto free_swap_address_space;
3192 mutex_lock(&swapon_mutex);
3194 if (swap_flags & SWAP_FLAG_PREFER)
3196 (swap_flags & SWAP_FLAG_PRIO_MASK) >> SWAP_FLAG_PRIO_SHIFT;
3197 enable_swap_info(p, prio, swap_map, cluster_info);
3199 pr_info("Adding %uk swap on %s. Priority:%d extents:%d across:%lluk %s%s%s%s\n",
3200 K(p->pages), name->name, p->prio, nr_extents,
3201 K((unsigned long long)span),
3202 (p->flags & SWP_SOLIDSTATE) ? "SS" : "",
3203 (p->flags & SWP_DISCARDABLE) ? "D" : "",
3204 (p->flags & SWP_AREA_DISCARD) ? "s" : "",
3205 (p->flags & SWP_PAGE_DISCARD) ? "c" : "");
3207 mutex_unlock(&swapon_mutex);
3208 atomic_inc(&proc_poll_event);
3209 wake_up_interruptible(&proc_poll_wait);
3213 free_swap_address_space:
3214 exit_swap_address_space(p->type);
3215 bad_swap_unlock_inode:
3216 inode_unlock(inode);
3218 free_percpu(p->percpu_cluster);
3219 p->percpu_cluster = NULL;
3220 free_percpu(p->cluster_next_cpu);
3221 p->cluster_next_cpu = NULL;
3222 if (p->bdev_handle) {
3223 set_blocksize(p->bdev, p->old_block_size);
3224 bdev_release(p->bdev_handle);
3225 p->bdev_handle = NULL;
3228 destroy_swap_extents(p);
3229 swap_cgroup_swapoff(p->type);
3230 spin_lock(&swap_lock);
3231 p->swap_file = NULL;
3233 spin_unlock(&swap_lock);
3235 kvfree(cluster_info);
3236 if (inced_nr_rotate_swap)
3237 atomic_dec(&nr_rotate_swap);
3239 filp_close(swap_file, NULL);
3241 if (page && !IS_ERR(page)) {
3248 inode_unlock(inode);
3250 enable_swap_slots_cache();
3254 void si_swapinfo(struct sysinfo *val)
3257 unsigned long nr_to_be_unused = 0;
3259 spin_lock(&swap_lock);
3260 for (type = 0; type < nr_swapfiles; type++) {
3261 struct swap_info_struct *si = swap_info[type];
3263 if ((si->flags & SWP_USED) && !(si->flags & SWP_WRITEOK))
3264 nr_to_be_unused += READ_ONCE(si->inuse_pages);
3266 val->freeswap = atomic_long_read(&nr_swap_pages) + nr_to_be_unused;
3267 val->totalswap = total_swap_pages + nr_to_be_unused;
3268 spin_unlock(&swap_lock);
3272 * Verify that a swap entry is valid and increment its swap map count.
3274 * Returns error code in following case.
3276 * - swp_entry is invalid -> EINVAL
3277 * - swp_entry is migration entry -> EINVAL
3278 * - swap-cache reference is requested but there is already one. -> EEXIST
3279 * - swap-cache reference is requested but the entry is not used. -> ENOENT
3280 * - swap-mapped reference requested but needs continued swap count. -> ENOMEM
3282 static int __swap_duplicate(swp_entry_t entry, unsigned char usage)
3284 struct swap_info_struct *p;
3285 struct swap_cluster_info *ci;
3286 unsigned long offset;
3287 unsigned char count;
3288 unsigned char has_cache;
3291 p = swp_swap_info(entry);
3293 offset = swp_offset(entry);
3294 ci = lock_cluster_or_swap_info(p, offset);
3296 count = p->swap_map[offset];
3299 * swapin_readahead() doesn't check if a swap entry is valid, so the
3300 * swap entry could be SWAP_MAP_BAD. Check here with lock held.
3302 if (unlikely(swap_count(count) == SWAP_MAP_BAD)) {
3307 has_cache = count & SWAP_HAS_CACHE;
3308 count &= ~SWAP_HAS_CACHE;
3311 if (usage == SWAP_HAS_CACHE) {
3313 /* set SWAP_HAS_CACHE if there is no cache and entry is used */
3314 if (!has_cache && count)
3315 has_cache = SWAP_HAS_CACHE;
3316 else if (has_cache) /* someone else added cache */
3318 else /* no users remaining */
3321 } else if (count || has_cache) {
3323 if ((count & ~COUNT_CONTINUED) < SWAP_MAP_MAX)
3325 else if ((count & ~COUNT_CONTINUED) > SWAP_MAP_MAX)
3327 else if (swap_count_continued(p, offset, count))
3328 count = COUNT_CONTINUED;
3332 err = -ENOENT; /* unused swap entry */
3334 WRITE_ONCE(p->swap_map[offset], count | has_cache);
3337 unlock_cluster_or_swap_info(p, ci);
3342 * Help swapoff by noting that swap entry belongs to shmem/tmpfs
3343 * (in which case its reference count is never incremented).
3345 void swap_shmem_alloc(swp_entry_t entry)
3347 __swap_duplicate(entry, SWAP_MAP_SHMEM);
3351 * Increase reference count of swap entry by 1.
3352 * Returns 0 for success, or -ENOMEM if a swap_count_continuation is required
3353 * but could not be atomically allocated. Returns 0, just as if it succeeded,
3354 * if __swap_duplicate() fails for another reason (-EINVAL or -ENOENT), which
3355 * might occur if a page table entry has got corrupted.
3357 int swap_duplicate(swp_entry_t entry)
3361 while (!err && __swap_duplicate(entry, 1) == -ENOMEM)
3362 err = add_swap_count_continuation(entry, GFP_ATOMIC);
3367 * @entry: swap entry for which we allocate swap cache.
3369 * Called when allocating swap cache for existing swap entry,
3370 * This can return error codes. Returns 0 at success.
3371 * -EEXIST means there is a swap cache.
3372 * Note: return code is different from swap_duplicate().
3374 int swapcache_prepare(swp_entry_t entry)
3376 return __swap_duplicate(entry, SWAP_HAS_CACHE);
3379 void swapcache_clear(struct swap_info_struct *si, swp_entry_t entry)
3381 struct swap_cluster_info *ci;
3382 unsigned long offset = swp_offset(entry);
3383 unsigned char usage;
3385 ci = lock_cluster_or_swap_info(si, offset);
3386 usage = __swap_entry_free_locked(si, offset, SWAP_HAS_CACHE);
3387 unlock_cluster_or_swap_info(si, ci);
3389 free_swap_slot(entry);
3392 struct swap_info_struct *swp_swap_info(swp_entry_t entry)
3394 return swap_type_to_swap_info(swp_type(entry));
3398 * out-of-line methods to avoid include hell.
3400 struct address_space *swapcache_mapping(struct folio *folio)
3402 return swp_swap_info(folio->swap)->swap_file->f_mapping;
3404 EXPORT_SYMBOL_GPL(swapcache_mapping);
3406 pgoff_t __page_file_index(struct page *page)
3408 swp_entry_t swap = page_swap_entry(page);
3409 return swp_offset(swap);
3411 EXPORT_SYMBOL_GPL(__page_file_index);
3414 * add_swap_count_continuation - called when a swap count is duplicated
3415 * beyond SWAP_MAP_MAX, it allocates a new page and links that to the entry's
3416 * page of the original vmalloc'ed swap_map, to hold the continuation count
3417 * (for that entry and for its neighbouring PAGE_SIZE swap entries). Called
3418 * again when count is duplicated beyond SWAP_MAP_MAX * SWAP_CONT_MAX, etc.
3420 * These continuation pages are seldom referenced: the common paths all work
3421 * on the original swap_map, only referring to a continuation page when the
3422 * low "digit" of a count is incremented or decremented through SWAP_MAP_MAX.
3424 * add_swap_count_continuation(, GFP_ATOMIC) can be called while holding
3425 * page table locks; if it fails, add_swap_count_continuation(, GFP_KERNEL)
3426 * can be called after dropping locks.
3428 int add_swap_count_continuation(swp_entry_t entry, gfp_t gfp_mask)
3430 struct swap_info_struct *si;
3431 struct swap_cluster_info *ci;
3434 struct page *list_page;
3436 unsigned char count;
3440 * When debugging, it's easier to use __GFP_ZERO here; but it's better
3441 * for latency not to zero a page while GFP_ATOMIC and holding locks.
3443 page = alloc_page(gfp_mask | __GFP_HIGHMEM);
3445 si = get_swap_device(entry);
3448 * An acceptable race has occurred since the failing
3449 * __swap_duplicate(): the swap device may be swapoff
3453 spin_lock(&si->lock);
3455 offset = swp_offset(entry);
3457 ci = lock_cluster(si, offset);
3459 count = swap_count(si->swap_map[offset]);
3461 if ((count & ~COUNT_CONTINUED) != SWAP_MAP_MAX) {
3463 * The higher the swap count, the more likely it is that tasks
3464 * will race to add swap count continuation: we need to avoid
3465 * over-provisioning.
3475 head = vmalloc_to_page(si->swap_map + offset);
3476 offset &= ~PAGE_MASK;
3478 spin_lock(&si->cont_lock);
3480 * Page allocation does not initialize the page's lru field,
3481 * but it does always reset its private field.
3483 if (!page_private(head)) {
3484 BUG_ON(count & COUNT_CONTINUED);
3485 INIT_LIST_HEAD(&head->lru);
3486 set_page_private(head, SWP_CONTINUED);
3487 si->flags |= SWP_CONTINUED;
3490 list_for_each_entry(list_page, &head->lru, lru) {
3494 * If the previous map said no continuation, but we've found
3495 * a continuation page, free our allocation and use this one.
3497 if (!(count & COUNT_CONTINUED))
3498 goto out_unlock_cont;
3500 map = kmap_local_page(list_page) + offset;
3505 * If this continuation count now has some space in it,
3506 * free our allocation and use this one.
3508 if ((count & ~COUNT_CONTINUED) != SWAP_CONT_MAX)
3509 goto out_unlock_cont;
3512 list_add_tail(&page->lru, &head->lru);
3513 page = NULL; /* now it's attached, don't free it */
3515 spin_unlock(&si->cont_lock);
3518 spin_unlock(&si->lock);
3519 put_swap_device(si);
3527 * swap_count_continued - when the original swap_map count is incremented
3528 * from SWAP_MAP_MAX, check if there is already a continuation page to carry
3529 * into, carry if so, or else fail until a new continuation page is allocated;
3530 * when the original swap_map count is decremented from 0 with continuation,
3531 * borrow from the continuation and report whether it still holds more.
3532 * Called while __swap_duplicate() or swap_entry_free() holds swap or cluster
3535 static bool swap_count_continued(struct swap_info_struct *si,
3536 pgoff_t offset, unsigned char count)
3543 head = vmalloc_to_page(si->swap_map + offset);
3544 if (page_private(head) != SWP_CONTINUED) {
3545 BUG_ON(count & COUNT_CONTINUED);
3546 return false; /* need to add count continuation */
3549 spin_lock(&si->cont_lock);
3550 offset &= ~PAGE_MASK;
3551 page = list_next_entry(head, lru);
3552 map = kmap_local_page(page) + offset;
3554 if (count == SWAP_MAP_MAX) /* initial increment from swap_map */
3555 goto init_map; /* jump over SWAP_CONT_MAX checks */
3557 if (count == (SWAP_MAP_MAX | COUNT_CONTINUED)) { /* incrementing */
3559 * Think of how you add 1 to 999
3561 while (*map == (SWAP_CONT_MAX | COUNT_CONTINUED)) {
3563 page = list_next_entry(page, lru);
3564 BUG_ON(page == head);
3565 map = kmap_local_page(page) + offset;
3567 if (*map == SWAP_CONT_MAX) {
3569 page = list_next_entry(page, lru);
3571 ret = false; /* add count continuation */
3574 map = kmap_local_page(page) + offset;
3575 init_map: *map = 0; /* we didn't zero the page */
3579 while ((page = list_prev_entry(page, lru)) != head) {
3580 map = kmap_local_page(page) + offset;
3581 *map = COUNT_CONTINUED;
3584 ret = true; /* incremented */
3586 } else { /* decrementing */
3588 * Think of how you subtract 1 from 1000
3590 BUG_ON(count != COUNT_CONTINUED);
3591 while (*map == COUNT_CONTINUED) {
3593 page = list_next_entry(page, lru);
3594 BUG_ON(page == head);
3595 map = kmap_local_page(page) + offset;
3602 while ((page = list_prev_entry(page, lru)) != head) {
3603 map = kmap_local_page(page) + offset;
3604 *map = SWAP_CONT_MAX | count;
3605 count = COUNT_CONTINUED;
3608 ret = count == COUNT_CONTINUED;
3611 spin_unlock(&si->cont_lock);
3616 * free_swap_count_continuations - swapoff free all the continuation pages
3617 * appended to the swap_map, after swap_map is quiesced, before vfree'ing it.
3619 static void free_swap_count_continuations(struct swap_info_struct *si)
3623 for (offset = 0; offset < si->max; offset += PAGE_SIZE) {
3625 head = vmalloc_to_page(si->swap_map + offset);
3626 if (page_private(head)) {
3627 struct page *page, *next;
3629 list_for_each_entry_safe(page, next, &head->lru, lru) {
3630 list_del(&page->lru);
3637 #if defined(CONFIG_MEMCG) && defined(CONFIG_BLK_CGROUP)
3638 void __folio_throttle_swaprate(struct folio *folio, gfp_t gfp)
3640 struct swap_info_struct *si, *next;
3641 int nid = folio_nid(folio);
3643 if (!(gfp & __GFP_IO))
3646 if (!blk_cgroup_congested())
3650 * We've already scheduled a throttle, avoid taking the global swap
3653 if (current->throttle_disk)
3656 spin_lock(&swap_avail_lock);
3657 plist_for_each_entry_safe(si, next, &swap_avail_heads[nid],
3660 blkcg_schedule_throttle(si->bdev->bd_disk, true);
3664 spin_unlock(&swap_avail_lock);
3668 static int __init swapfile_init(void)
3672 swap_avail_heads = kmalloc_array(nr_node_ids, sizeof(struct plist_head),
3674 if (!swap_avail_heads) {
3675 pr_emerg("Not enough memory for swap heads, swap is disabled\n");
3680 plist_head_init(&swap_avail_heads[nid]);
3682 swapfile_maximum_size = arch_max_swapfile_size();
3684 #ifdef CONFIG_MIGRATION
3685 if (swapfile_maximum_size >= (1UL << SWP_MIG_TOTAL_BITS))
3686 swap_migration_ad_supported = true;
3687 #endif /* CONFIG_MIGRATION */
3691 subsys_initcall(swapfile_init);