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
10 #include <linux/sched/mm.h>
11 #include <linux/sched/task.h>
12 #include <linux/hugetlb.h>
13 #include <linux/mman.h>
14 #include <linux/slab.h>
15 #include <linux/kernel_stat.h>
16 #include <linux/swap.h>
17 #include <linux/vmalloc.h>
18 #include <linux/pagemap.h>
19 #include <linux/namei.h>
20 #include <linux/shmem_fs.h>
21 #include <linux/blkdev.h>
22 #include <linux/random.h>
23 #include <linux/writeback.h>
24 #include <linux/proc_fs.h>
25 #include <linux/seq_file.h>
26 #include <linux/init.h>
27 #include <linux/ksm.h>
28 #include <linux/rmap.h>
29 #include <linux/security.h>
30 #include <linux/backing-dev.h>
31 #include <linux/mutex.h>
32 #include <linux/capability.h>
33 #include <linux/syscalls.h>
34 #include <linux/memcontrol.h>
35 #include <linux/poll.h>
36 #include <linux/oom.h>
37 #include <linux/frontswap.h>
38 #include <linux/swapfile.h>
39 #include <linux/export.h>
40 #include <linux/swap_slots.h>
41 #include <linux/sort.h>
43 #include <asm/tlbflush.h>
44 #include <linux/swapops.h>
45 #include <linux/swap_cgroup.h>
47 static bool swap_count_continued(struct swap_info_struct *, pgoff_t,
49 static void free_swap_count_continuations(struct swap_info_struct *);
50 static sector_t map_swap_entry(swp_entry_t, struct block_device**);
52 DEFINE_SPINLOCK(swap_lock);
53 static unsigned int nr_swapfiles;
54 atomic_long_t nr_swap_pages;
56 * Some modules use swappable objects and may try to swap them out under
57 * memory pressure (via the shrinker). Before doing so, they may wish to
58 * check to see if any swap space is available.
60 EXPORT_SYMBOL_GPL(nr_swap_pages);
61 /* protected with swap_lock. reading in vm_swap_full() doesn't need lock */
62 long total_swap_pages;
63 static int least_priority = -1;
65 static const char Bad_file[] = "Bad swap file entry ";
66 static const char Unused_file[] = "Unused swap file entry ";
67 static const char Bad_offset[] = "Bad swap offset entry ";
68 static const char Unused_offset[] = "Unused swap offset entry ";
71 * all active swap_info_structs
72 * protected with swap_lock, and ordered by priority.
74 PLIST_HEAD(swap_active_head);
77 * all available (active, not full) swap_info_structs
78 * protected with swap_avail_lock, ordered by priority.
79 * This is used by get_swap_page() instead of swap_active_head
80 * because swap_active_head includes all swap_info_structs,
81 * but get_swap_page() doesn't need to look at full ones.
82 * This uses its own lock instead of swap_lock because when a
83 * swap_info_struct changes between not-full/full, it needs to
84 * add/remove itself to/from this list, but the swap_info_struct->lock
85 * is held and the locking order requires swap_lock to be taken
86 * before any swap_info_struct->lock.
88 static struct plist_head *swap_avail_heads;
89 static DEFINE_SPINLOCK(swap_avail_lock);
91 struct swap_info_struct *swap_info[MAX_SWAPFILES];
93 static DEFINE_MUTEX(swapon_mutex);
95 static DECLARE_WAIT_QUEUE_HEAD(proc_poll_wait);
96 /* Activity counter to indicate that a swapon or swapoff has occurred */
97 static atomic_t proc_poll_event = ATOMIC_INIT(0);
99 atomic_t nr_rotate_swap = ATOMIC_INIT(0);
101 static struct swap_info_struct *swap_type_to_swap_info(int type)
103 if (type >= READ_ONCE(nr_swapfiles))
106 smp_rmb(); /* Pairs with smp_wmb in alloc_swap_info. */
107 return READ_ONCE(swap_info[type]);
110 static inline unsigned char swap_count(unsigned char ent)
112 return ent & ~SWAP_HAS_CACHE; /* may include COUNT_CONTINUED flag */
115 /* Reclaim the swap entry anyway if possible */
116 #define TTRS_ANYWAY 0x1
118 * Reclaim the swap entry if there are no more mappings of the
121 #define TTRS_UNMAPPED 0x2
122 /* Reclaim the swap entry if swap is getting full*/
123 #define TTRS_FULL 0x4
125 /* returns 1 if swap entry is freed */
126 static int __try_to_reclaim_swap(struct swap_info_struct *si,
127 unsigned long offset, unsigned long flags)
129 swp_entry_t entry = swp_entry(si->type, offset);
133 page = find_get_page(swap_address_space(entry), offset);
137 * When this function is called from scan_swap_map_slots() and it's
138 * called by vmscan.c at reclaiming pages. So, we hold a lock on a page,
139 * here. We have to use trylock for avoiding deadlock. This is a special
140 * case and you should use try_to_free_swap() with explicit lock_page()
141 * in usual operations.
143 if (trylock_page(page)) {
144 if ((flags & TTRS_ANYWAY) ||
145 ((flags & TTRS_UNMAPPED) && !page_mapped(page)) ||
146 ((flags & TTRS_FULL) && mem_cgroup_swap_full(page)))
147 ret = try_to_free_swap(page);
154 static inline struct swap_extent *first_se(struct swap_info_struct *sis)
156 struct rb_node *rb = rb_first(&sis->swap_extent_root);
157 return rb_entry(rb, struct swap_extent, rb_node);
160 static inline struct swap_extent *next_se(struct swap_extent *se)
162 struct rb_node *rb = rb_next(&se->rb_node);
163 return rb ? rb_entry(rb, struct swap_extent, rb_node) : NULL;
167 * swapon tell device that all the old swap contents can be discarded,
168 * to allow the swap device to optimize its wear-levelling.
170 static int discard_swap(struct swap_info_struct *si)
172 struct swap_extent *se;
173 sector_t start_block;
177 /* Do not discard the swap header page! */
179 start_block = (se->start_block + 1) << (PAGE_SHIFT - 9);
180 nr_blocks = ((sector_t)se->nr_pages - 1) << (PAGE_SHIFT - 9);
182 err = blkdev_issue_discard(si->bdev, start_block,
183 nr_blocks, GFP_KERNEL, 0);
189 for (se = next_se(se); se; se = next_se(se)) {
190 start_block = se->start_block << (PAGE_SHIFT - 9);
191 nr_blocks = (sector_t)se->nr_pages << (PAGE_SHIFT - 9);
193 err = blkdev_issue_discard(si->bdev, start_block,
194 nr_blocks, GFP_KERNEL, 0);
200 return err; /* That will often be -EOPNOTSUPP */
203 static struct swap_extent *
204 offset_to_swap_extent(struct swap_info_struct *sis, unsigned long offset)
206 struct swap_extent *se;
209 rb = sis->swap_extent_root.rb_node;
211 se = rb_entry(rb, struct swap_extent, rb_node);
212 if (offset < se->start_page)
214 else if (offset >= se->start_page + se->nr_pages)
219 /* It *must* be present */
224 * swap allocation tell device that a cluster of swap can now be discarded,
225 * to allow the swap device to optimize its wear-levelling.
227 static void discard_swap_cluster(struct swap_info_struct *si,
228 pgoff_t start_page, pgoff_t nr_pages)
230 struct swap_extent *se = offset_to_swap_extent(si, start_page);
233 pgoff_t offset = start_page - se->start_page;
234 sector_t start_block = se->start_block + offset;
235 sector_t nr_blocks = se->nr_pages - offset;
237 if (nr_blocks > nr_pages)
238 nr_blocks = nr_pages;
239 start_page += nr_blocks;
240 nr_pages -= nr_blocks;
242 start_block <<= PAGE_SHIFT - 9;
243 nr_blocks <<= PAGE_SHIFT - 9;
244 if (blkdev_issue_discard(si->bdev, start_block,
245 nr_blocks, GFP_NOIO, 0))
252 #ifdef CONFIG_THP_SWAP
253 #define SWAPFILE_CLUSTER HPAGE_PMD_NR
255 #define swap_entry_size(size) (size)
257 #define SWAPFILE_CLUSTER 256
260 * Define swap_entry_size() as constant to let compiler to optimize
261 * out some code if !CONFIG_THP_SWAP
263 #define swap_entry_size(size) 1
265 #define LATENCY_LIMIT 256
267 static inline void cluster_set_flag(struct swap_cluster_info *info,
273 static inline unsigned int cluster_count(struct swap_cluster_info *info)
278 static inline void cluster_set_count(struct swap_cluster_info *info,
284 static inline void cluster_set_count_flag(struct swap_cluster_info *info,
285 unsigned int c, unsigned int f)
291 static inline unsigned int cluster_next(struct swap_cluster_info *info)
296 static inline void cluster_set_next(struct swap_cluster_info *info,
302 static inline void cluster_set_next_flag(struct swap_cluster_info *info,
303 unsigned int n, unsigned int f)
309 static inline bool cluster_is_free(struct swap_cluster_info *info)
311 return info->flags & CLUSTER_FLAG_FREE;
314 static inline bool cluster_is_null(struct swap_cluster_info *info)
316 return info->flags & CLUSTER_FLAG_NEXT_NULL;
319 static inline void cluster_set_null(struct swap_cluster_info *info)
321 info->flags = CLUSTER_FLAG_NEXT_NULL;
325 static inline bool cluster_is_huge(struct swap_cluster_info *info)
327 if (IS_ENABLED(CONFIG_THP_SWAP))
328 return info->flags & CLUSTER_FLAG_HUGE;
332 static inline void cluster_clear_huge(struct swap_cluster_info *info)
334 info->flags &= ~CLUSTER_FLAG_HUGE;
337 static inline struct swap_cluster_info *lock_cluster(struct swap_info_struct *si,
338 unsigned long offset)
340 struct swap_cluster_info *ci;
342 ci = si->cluster_info;
344 ci += offset / SWAPFILE_CLUSTER;
345 spin_lock(&ci->lock);
350 static inline void unlock_cluster(struct swap_cluster_info *ci)
353 spin_unlock(&ci->lock);
357 * Determine the locking method in use for this device. Return
358 * swap_cluster_info if SSD-style cluster-based locking is in place.
360 static inline struct swap_cluster_info *lock_cluster_or_swap_info(
361 struct swap_info_struct *si, unsigned long offset)
363 struct swap_cluster_info *ci;
365 /* Try to use fine-grained SSD-style locking if available: */
366 ci = lock_cluster(si, offset);
367 /* Otherwise, fall back to traditional, coarse locking: */
369 spin_lock(&si->lock);
374 static inline void unlock_cluster_or_swap_info(struct swap_info_struct *si,
375 struct swap_cluster_info *ci)
380 spin_unlock(&si->lock);
383 static inline bool cluster_list_empty(struct swap_cluster_list *list)
385 return cluster_is_null(&list->head);
388 static inline unsigned int cluster_list_first(struct swap_cluster_list *list)
390 return cluster_next(&list->head);
393 static void cluster_list_init(struct swap_cluster_list *list)
395 cluster_set_null(&list->head);
396 cluster_set_null(&list->tail);
399 static void cluster_list_add_tail(struct swap_cluster_list *list,
400 struct swap_cluster_info *ci,
403 if (cluster_list_empty(list)) {
404 cluster_set_next_flag(&list->head, idx, 0);
405 cluster_set_next_flag(&list->tail, idx, 0);
407 struct swap_cluster_info *ci_tail;
408 unsigned int tail = cluster_next(&list->tail);
411 * Nested cluster lock, but both cluster locks are
412 * only acquired when we held swap_info_struct->lock
415 spin_lock_nested(&ci_tail->lock, SINGLE_DEPTH_NESTING);
416 cluster_set_next(ci_tail, idx);
417 spin_unlock(&ci_tail->lock);
418 cluster_set_next_flag(&list->tail, idx, 0);
422 static unsigned int cluster_list_del_first(struct swap_cluster_list *list,
423 struct swap_cluster_info *ci)
427 idx = cluster_next(&list->head);
428 if (cluster_next(&list->tail) == idx) {
429 cluster_set_null(&list->head);
430 cluster_set_null(&list->tail);
432 cluster_set_next_flag(&list->head,
433 cluster_next(&ci[idx]), 0);
438 /* Add a cluster to discard list and schedule it to do discard */
439 static void swap_cluster_schedule_discard(struct swap_info_struct *si,
443 * If scan_swap_map() can't find a free cluster, it will check
444 * si->swap_map directly. To make sure the discarding cluster isn't
445 * taken by scan_swap_map(), mark the swap entries bad (occupied). It
446 * will be cleared after discard
448 memset(si->swap_map + idx * SWAPFILE_CLUSTER,
449 SWAP_MAP_BAD, SWAPFILE_CLUSTER);
451 cluster_list_add_tail(&si->discard_clusters, si->cluster_info, idx);
453 schedule_work(&si->discard_work);
456 static void __free_cluster(struct swap_info_struct *si, unsigned long idx)
458 struct swap_cluster_info *ci = si->cluster_info;
460 cluster_set_flag(ci + idx, CLUSTER_FLAG_FREE);
461 cluster_list_add_tail(&si->free_clusters, ci, idx);
465 * Doing discard actually. After a cluster discard is finished, the cluster
466 * will be added to free cluster list. caller should hold si->lock.
468 static void swap_do_scheduled_discard(struct swap_info_struct *si)
470 struct swap_cluster_info *info, *ci;
473 info = si->cluster_info;
475 while (!cluster_list_empty(&si->discard_clusters)) {
476 idx = cluster_list_del_first(&si->discard_clusters, info);
477 spin_unlock(&si->lock);
479 discard_swap_cluster(si, idx * SWAPFILE_CLUSTER,
482 spin_lock(&si->lock);
483 ci = lock_cluster(si, idx * SWAPFILE_CLUSTER);
484 __free_cluster(si, idx);
485 memset(si->swap_map + idx * SWAPFILE_CLUSTER,
486 0, SWAPFILE_CLUSTER);
491 static void swap_discard_work(struct work_struct *work)
493 struct swap_info_struct *si;
495 si = container_of(work, struct swap_info_struct, discard_work);
497 spin_lock(&si->lock);
498 swap_do_scheduled_discard(si);
499 spin_unlock(&si->lock);
502 static void alloc_cluster(struct swap_info_struct *si, unsigned long idx)
504 struct swap_cluster_info *ci = si->cluster_info;
506 VM_BUG_ON(cluster_list_first(&si->free_clusters) != idx);
507 cluster_list_del_first(&si->free_clusters, ci);
508 cluster_set_count_flag(ci + idx, 0, 0);
511 static void free_cluster(struct swap_info_struct *si, unsigned long idx)
513 struct swap_cluster_info *ci = si->cluster_info + idx;
515 VM_BUG_ON(cluster_count(ci) != 0);
517 * If the swap is discardable, prepare discard the cluster
518 * instead of free it immediately. The cluster will be freed
521 if ((si->flags & (SWP_WRITEOK | SWP_PAGE_DISCARD)) ==
522 (SWP_WRITEOK | SWP_PAGE_DISCARD)) {
523 swap_cluster_schedule_discard(si, idx);
527 __free_cluster(si, idx);
531 * The cluster corresponding to page_nr will be used. The cluster will be
532 * removed from free cluster list and its usage counter will be increased.
534 static void inc_cluster_info_page(struct swap_info_struct *p,
535 struct swap_cluster_info *cluster_info, unsigned long page_nr)
537 unsigned long idx = page_nr / SWAPFILE_CLUSTER;
541 if (cluster_is_free(&cluster_info[idx]))
542 alloc_cluster(p, idx);
544 VM_BUG_ON(cluster_count(&cluster_info[idx]) >= SWAPFILE_CLUSTER);
545 cluster_set_count(&cluster_info[idx],
546 cluster_count(&cluster_info[idx]) + 1);
550 * The cluster corresponding to page_nr decreases one usage. If the usage
551 * counter becomes 0, which means no page in the cluster is in using, we can
552 * optionally discard the cluster and add it to free cluster list.
554 static void dec_cluster_info_page(struct swap_info_struct *p,
555 struct swap_cluster_info *cluster_info, unsigned long page_nr)
557 unsigned long idx = page_nr / SWAPFILE_CLUSTER;
562 VM_BUG_ON(cluster_count(&cluster_info[idx]) == 0);
563 cluster_set_count(&cluster_info[idx],
564 cluster_count(&cluster_info[idx]) - 1);
566 if (cluster_count(&cluster_info[idx]) == 0)
567 free_cluster(p, idx);
571 * It's possible scan_swap_map() uses a free cluster in the middle of free
572 * cluster list. Avoiding such abuse to avoid list corruption.
575 scan_swap_map_ssd_cluster_conflict(struct swap_info_struct *si,
576 unsigned long offset)
578 struct percpu_cluster *percpu_cluster;
581 offset /= SWAPFILE_CLUSTER;
582 conflict = !cluster_list_empty(&si->free_clusters) &&
583 offset != cluster_list_first(&si->free_clusters) &&
584 cluster_is_free(&si->cluster_info[offset]);
589 percpu_cluster = this_cpu_ptr(si->percpu_cluster);
590 cluster_set_null(&percpu_cluster->index);
595 * Try to get a swap entry from current cpu's swap entry pool (a cluster). This
596 * might involve allocating a new cluster for current CPU too.
598 static bool scan_swap_map_try_ssd_cluster(struct swap_info_struct *si,
599 unsigned long *offset, unsigned long *scan_base)
601 struct percpu_cluster *cluster;
602 struct swap_cluster_info *ci;
603 unsigned long tmp, max;
606 cluster = this_cpu_ptr(si->percpu_cluster);
607 if (cluster_is_null(&cluster->index)) {
608 if (!cluster_list_empty(&si->free_clusters)) {
609 cluster->index = si->free_clusters.head;
610 cluster->next = cluster_next(&cluster->index) *
612 } else if (!cluster_list_empty(&si->discard_clusters)) {
614 * we don't have free cluster but have some clusters in
615 * discarding, do discard now and reclaim them, then
616 * reread cluster_next_cpu since we dropped si->lock
618 swap_do_scheduled_discard(si);
619 *scan_base = this_cpu_read(*si->cluster_next_cpu);
620 *offset = *scan_base;
627 * Other CPUs can use our cluster if they can't find a free cluster,
628 * check if there is still free entry in the cluster
631 max = min_t(unsigned long, si->max,
632 (cluster_next(&cluster->index) + 1) * SWAPFILE_CLUSTER);
634 ci = lock_cluster(si, tmp);
636 if (!si->swap_map[tmp])
643 cluster_set_null(&cluster->index);
646 cluster->next = tmp + 1;
652 static void __del_from_avail_list(struct swap_info_struct *p)
657 plist_del(&p->avail_lists[nid], &swap_avail_heads[nid]);
660 static void del_from_avail_list(struct swap_info_struct *p)
662 spin_lock(&swap_avail_lock);
663 __del_from_avail_list(p);
664 spin_unlock(&swap_avail_lock);
667 static void swap_range_alloc(struct swap_info_struct *si, unsigned long offset,
668 unsigned int nr_entries)
670 unsigned int end = offset + nr_entries - 1;
672 if (offset == si->lowest_bit)
673 si->lowest_bit += nr_entries;
674 if (end == si->highest_bit)
675 WRITE_ONCE(si->highest_bit, si->highest_bit - nr_entries);
676 si->inuse_pages += nr_entries;
677 if (si->inuse_pages == si->pages) {
678 si->lowest_bit = si->max;
680 del_from_avail_list(si);
684 static void add_to_avail_list(struct swap_info_struct *p)
688 spin_lock(&swap_avail_lock);
690 WARN_ON(!plist_node_empty(&p->avail_lists[nid]));
691 plist_add(&p->avail_lists[nid], &swap_avail_heads[nid]);
693 spin_unlock(&swap_avail_lock);
696 static void swap_range_free(struct swap_info_struct *si, unsigned long offset,
697 unsigned int nr_entries)
699 unsigned long begin = offset;
700 unsigned long end = offset + nr_entries - 1;
701 void (*swap_slot_free_notify)(struct block_device *, unsigned long);
703 if (offset < si->lowest_bit)
704 si->lowest_bit = offset;
705 if (end > si->highest_bit) {
706 bool was_full = !si->highest_bit;
708 WRITE_ONCE(si->highest_bit, end);
709 if (was_full && (si->flags & SWP_WRITEOK))
710 add_to_avail_list(si);
712 atomic_long_add(nr_entries, &nr_swap_pages);
713 si->inuse_pages -= nr_entries;
714 if (si->flags & SWP_BLKDEV)
715 swap_slot_free_notify =
716 si->bdev->bd_disk->fops->swap_slot_free_notify;
718 swap_slot_free_notify = NULL;
719 while (offset <= end) {
720 frontswap_invalidate_page(si->type, offset);
721 if (swap_slot_free_notify)
722 swap_slot_free_notify(si->bdev, offset);
725 clear_shadow_from_swap_cache(si->type, begin, end);
728 static void set_cluster_next(struct swap_info_struct *si, unsigned long next)
732 if (!(si->flags & SWP_SOLIDSTATE)) {
733 si->cluster_next = next;
737 prev = this_cpu_read(*si->cluster_next_cpu);
739 * Cross the swap address space size aligned trunk, choose
740 * another trunk randomly to avoid lock contention on swap
741 * address space if possible.
743 if ((prev >> SWAP_ADDRESS_SPACE_SHIFT) !=
744 (next >> SWAP_ADDRESS_SPACE_SHIFT)) {
745 /* No free swap slots available */
746 if (si->highest_bit <= si->lowest_bit)
748 next = si->lowest_bit +
749 prandom_u32_max(si->highest_bit - si->lowest_bit + 1);
750 next = ALIGN_DOWN(next, SWAP_ADDRESS_SPACE_PAGES);
751 next = max_t(unsigned int, next, si->lowest_bit);
753 this_cpu_write(*si->cluster_next_cpu, next);
756 static int scan_swap_map_slots(struct swap_info_struct *si,
757 unsigned char usage, int nr,
760 struct swap_cluster_info *ci;
761 unsigned long offset;
762 unsigned long scan_base;
763 unsigned long last_in_cluster = 0;
764 int latency_ration = LATENCY_LIMIT;
766 bool scanned_many = false;
769 * We try to cluster swap pages by allocating them sequentially
770 * in swap. Once we've allocated SWAPFILE_CLUSTER pages this
771 * way, however, we resort to first-free allocation, starting
772 * a new cluster. This prevents us from scattering swap pages
773 * all over the entire swap partition, so that we reduce
774 * overall disk seek times between swap pages. -- sct
775 * But we do now try to find an empty cluster. -Andrea
776 * And we let swap pages go all over an SSD partition. Hugh
779 si->flags += SWP_SCANNING;
781 * Use percpu scan base for SSD to reduce lock contention on
782 * cluster and swap cache. For HDD, sequential access is more
785 if (si->flags & SWP_SOLIDSTATE)
786 scan_base = this_cpu_read(*si->cluster_next_cpu);
788 scan_base = si->cluster_next;
792 if (si->cluster_info) {
793 if (!scan_swap_map_try_ssd_cluster(si, &offset, &scan_base))
795 } else if (unlikely(!si->cluster_nr--)) {
796 if (si->pages - si->inuse_pages < SWAPFILE_CLUSTER) {
797 si->cluster_nr = SWAPFILE_CLUSTER - 1;
801 spin_unlock(&si->lock);
804 * If seek is expensive, start searching for new cluster from
805 * start of partition, to minimize the span of allocated swap.
806 * If seek is cheap, that is the SWP_SOLIDSTATE si->cluster_info
807 * case, just handled by scan_swap_map_try_ssd_cluster() above.
809 scan_base = offset = si->lowest_bit;
810 last_in_cluster = offset + SWAPFILE_CLUSTER - 1;
812 /* Locate the first empty (unaligned) cluster */
813 for (; last_in_cluster <= si->highest_bit; offset++) {
814 if (si->swap_map[offset])
815 last_in_cluster = offset + SWAPFILE_CLUSTER;
816 else if (offset == last_in_cluster) {
817 spin_lock(&si->lock);
818 offset -= SWAPFILE_CLUSTER - 1;
819 si->cluster_next = offset;
820 si->cluster_nr = SWAPFILE_CLUSTER - 1;
823 if (unlikely(--latency_ration < 0)) {
825 latency_ration = LATENCY_LIMIT;
830 spin_lock(&si->lock);
831 si->cluster_nr = SWAPFILE_CLUSTER - 1;
835 if (si->cluster_info) {
836 while (scan_swap_map_ssd_cluster_conflict(si, offset)) {
837 /* take a break if we already got some slots */
840 if (!scan_swap_map_try_ssd_cluster(si, &offset,
845 if (!(si->flags & SWP_WRITEOK))
847 if (!si->highest_bit)
849 if (offset > si->highest_bit)
850 scan_base = offset = si->lowest_bit;
852 ci = lock_cluster(si, offset);
853 /* reuse swap entry of cache-only swap if not busy. */
854 if (vm_swap_full() && si->swap_map[offset] == SWAP_HAS_CACHE) {
857 spin_unlock(&si->lock);
858 swap_was_freed = __try_to_reclaim_swap(si, offset, TTRS_ANYWAY);
859 spin_lock(&si->lock);
860 /* entry was freed successfully, try to use this again */
863 goto scan; /* check next one */
866 if (si->swap_map[offset]) {
873 WRITE_ONCE(si->swap_map[offset], usage);
874 inc_cluster_info_page(si, si->cluster_info, offset);
877 swap_range_alloc(si, offset, 1);
878 slots[n_ret++] = swp_entry(si->type, offset);
880 /* got enough slots or reach max slots? */
881 if ((n_ret == nr) || (offset >= si->highest_bit))
884 /* search for next available slot */
886 /* time to take a break? */
887 if (unlikely(--latency_ration < 0)) {
890 spin_unlock(&si->lock);
892 spin_lock(&si->lock);
893 latency_ration = LATENCY_LIMIT;
896 /* try to get more slots in cluster */
897 if (si->cluster_info) {
898 if (scan_swap_map_try_ssd_cluster(si, &offset, &scan_base))
900 } else if (si->cluster_nr && !si->swap_map[++offset]) {
901 /* non-ssd case, still more slots in cluster? */
907 * Even if there's no free clusters available (fragmented),
908 * try to scan a little more quickly with lock held unless we
909 * have scanned too many slots already.
912 unsigned long scan_limit;
914 if (offset < scan_base)
915 scan_limit = scan_base;
917 scan_limit = si->highest_bit;
918 for (; offset <= scan_limit && --latency_ration > 0;
920 if (!si->swap_map[offset])
926 set_cluster_next(si, offset + 1);
927 si->flags -= SWP_SCANNING;
931 spin_unlock(&si->lock);
932 while (++offset <= READ_ONCE(si->highest_bit)) {
933 if (data_race(!si->swap_map[offset])) {
934 spin_lock(&si->lock);
937 if (vm_swap_full() &&
938 READ_ONCE(si->swap_map[offset]) == SWAP_HAS_CACHE) {
939 spin_lock(&si->lock);
942 if (unlikely(--latency_ration < 0)) {
944 latency_ration = LATENCY_LIMIT;
948 offset = si->lowest_bit;
949 while (offset < scan_base) {
950 if (data_race(!si->swap_map[offset])) {
951 spin_lock(&si->lock);
954 if (vm_swap_full() &&
955 READ_ONCE(si->swap_map[offset]) == SWAP_HAS_CACHE) {
956 spin_lock(&si->lock);
959 if (unlikely(--latency_ration < 0)) {
961 latency_ration = LATENCY_LIMIT;
966 spin_lock(&si->lock);
969 si->flags -= SWP_SCANNING;
973 static int swap_alloc_cluster(struct swap_info_struct *si, swp_entry_t *slot)
976 struct swap_cluster_info *ci;
977 unsigned long offset, i;
981 * Should not even be attempting cluster allocations when huge
982 * page swap is disabled. Warn and fail the allocation.
984 if (!IS_ENABLED(CONFIG_THP_SWAP)) {
989 if (cluster_list_empty(&si->free_clusters))
992 idx = cluster_list_first(&si->free_clusters);
993 offset = idx * SWAPFILE_CLUSTER;
994 ci = lock_cluster(si, offset);
995 alloc_cluster(si, idx);
996 cluster_set_count_flag(ci, SWAPFILE_CLUSTER, CLUSTER_FLAG_HUGE);
998 map = si->swap_map + offset;
999 for (i = 0; i < SWAPFILE_CLUSTER; i++)
1000 map[i] = SWAP_HAS_CACHE;
1002 swap_range_alloc(si, offset, SWAPFILE_CLUSTER);
1003 *slot = swp_entry(si->type, offset);
1008 static void swap_free_cluster(struct swap_info_struct *si, unsigned long idx)
1010 unsigned long offset = idx * SWAPFILE_CLUSTER;
1011 struct swap_cluster_info *ci;
1013 ci = lock_cluster(si, offset);
1014 memset(si->swap_map + offset, 0, SWAPFILE_CLUSTER);
1015 cluster_set_count_flag(ci, 0, 0);
1016 free_cluster(si, idx);
1018 swap_range_free(si, offset, SWAPFILE_CLUSTER);
1021 static unsigned long scan_swap_map(struct swap_info_struct *si,
1022 unsigned char usage)
1027 n_ret = scan_swap_map_slots(si, usage, 1, &entry);
1030 return swp_offset(entry);
1036 int get_swap_pages(int n_goal, swp_entry_t swp_entries[], int entry_size)
1038 unsigned long size = swap_entry_size(entry_size);
1039 struct swap_info_struct *si, *next;
1044 /* Only single cluster request supported */
1045 WARN_ON_ONCE(n_goal > 1 && size == SWAPFILE_CLUSTER);
1047 avail_pgs = atomic_long_read(&nr_swap_pages) / size;
1051 n_goal = min3((long)n_goal, (long)SWAP_BATCH, avail_pgs);
1053 atomic_long_sub(n_goal * size, &nr_swap_pages);
1055 spin_lock(&swap_avail_lock);
1058 node = numa_node_id();
1059 plist_for_each_entry_safe(si, next, &swap_avail_heads[node], avail_lists[node]) {
1060 /* requeue si to after same-priority siblings */
1061 plist_requeue(&si->avail_lists[node], &swap_avail_heads[node]);
1062 spin_unlock(&swap_avail_lock);
1063 spin_lock(&si->lock);
1064 if (!si->highest_bit || !(si->flags & SWP_WRITEOK)) {
1065 spin_lock(&swap_avail_lock);
1066 if (plist_node_empty(&si->avail_lists[node])) {
1067 spin_unlock(&si->lock);
1070 WARN(!si->highest_bit,
1071 "swap_info %d in list but !highest_bit\n",
1073 WARN(!(si->flags & SWP_WRITEOK),
1074 "swap_info %d in list but !SWP_WRITEOK\n",
1076 __del_from_avail_list(si);
1077 spin_unlock(&si->lock);
1080 if (size == SWAPFILE_CLUSTER) {
1081 if (!(si->flags & SWP_FS))
1082 n_ret = swap_alloc_cluster(si, swp_entries);
1084 n_ret = scan_swap_map_slots(si, SWAP_HAS_CACHE,
1085 n_goal, swp_entries);
1086 spin_unlock(&si->lock);
1087 if (n_ret || size == SWAPFILE_CLUSTER)
1089 pr_debug("scan_swap_map of si %d failed to find offset\n",
1092 spin_lock(&swap_avail_lock);
1095 * if we got here, it's likely that si was almost full before,
1096 * and since scan_swap_map() can drop the si->lock, multiple
1097 * callers probably all tried to get a page from the same si
1098 * and it filled up before we could get one; or, the si filled
1099 * up between us dropping swap_avail_lock and taking si->lock.
1100 * Since we dropped the swap_avail_lock, the swap_avail_head
1101 * list may have been modified; so if next is still in the
1102 * swap_avail_head list then try it, otherwise start over
1103 * if we have not gotten any slots.
1105 if (plist_node_empty(&next->avail_lists[node]))
1109 spin_unlock(&swap_avail_lock);
1113 atomic_long_add((long)(n_goal - n_ret) * size,
1119 /* The only caller of this function is now suspend routine */
1120 swp_entry_t get_swap_page_of_type(int type)
1122 struct swap_info_struct *si = swap_type_to_swap_info(type);
1128 spin_lock(&si->lock);
1129 if (si->flags & SWP_WRITEOK) {
1130 atomic_long_dec(&nr_swap_pages);
1131 /* This is called for allocating swap entry, not cache */
1132 offset = scan_swap_map(si, 1);
1134 spin_unlock(&si->lock);
1135 return swp_entry(type, offset);
1137 atomic_long_inc(&nr_swap_pages);
1139 spin_unlock(&si->lock);
1141 return (swp_entry_t) {0};
1144 static struct swap_info_struct *__swap_info_get(swp_entry_t entry)
1146 struct swap_info_struct *p;
1147 unsigned long offset;
1151 p = swp_swap_info(entry);
1154 if (data_race(!(p->flags & SWP_USED)))
1156 offset = swp_offset(entry);
1157 if (offset >= p->max)
1162 pr_err("swap_info_get: %s%08lx\n", Bad_offset, entry.val);
1165 pr_err("swap_info_get: %s%08lx\n", Unused_file, entry.val);
1168 pr_err("swap_info_get: %s%08lx\n", Bad_file, entry.val);
1173 static struct swap_info_struct *_swap_info_get(swp_entry_t entry)
1175 struct swap_info_struct *p;
1177 p = __swap_info_get(entry);
1180 if (data_race(!p->swap_map[swp_offset(entry)]))
1185 pr_err("swap_info_get: %s%08lx\n", Unused_offset, entry.val);
1191 static struct swap_info_struct *swap_info_get(swp_entry_t entry)
1193 struct swap_info_struct *p;
1195 p = _swap_info_get(entry);
1197 spin_lock(&p->lock);
1201 static struct swap_info_struct *swap_info_get_cont(swp_entry_t entry,
1202 struct swap_info_struct *q)
1204 struct swap_info_struct *p;
1206 p = _swap_info_get(entry);
1210 spin_unlock(&q->lock);
1212 spin_lock(&p->lock);
1217 static unsigned char __swap_entry_free_locked(struct swap_info_struct *p,
1218 unsigned long offset,
1219 unsigned char usage)
1221 unsigned char count;
1222 unsigned char has_cache;
1224 count = p->swap_map[offset];
1226 has_cache = count & SWAP_HAS_CACHE;
1227 count &= ~SWAP_HAS_CACHE;
1229 if (usage == SWAP_HAS_CACHE) {
1230 VM_BUG_ON(!has_cache);
1232 } else if (count == SWAP_MAP_SHMEM) {
1234 * Or we could insist on shmem.c using a special
1235 * swap_shmem_free() and free_shmem_swap_and_cache()...
1238 } else if ((count & ~COUNT_CONTINUED) <= SWAP_MAP_MAX) {
1239 if (count == COUNT_CONTINUED) {
1240 if (swap_count_continued(p, offset, count))
1241 count = SWAP_MAP_MAX | COUNT_CONTINUED;
1243 count = SWAP_MAP_MAX;
1248 usage = count | has_cache;
1250 WRITE_ONCE(p->swap_map[offset], usage);
1252 WRITE_ONCE(p->swap_map[offset], SWAP_HAS_CACHE);
1258 * Check whether swap entry is valid in the swap device. If so,
1259 * return pointer to swap_info_struct, and keep the swap entry valid
1260 * via preventing the swap device from being swapoff, until
1261 * put_swap_device() is called. Otherwise return NULL.
1263 * The entirety of the RCU read critical section must come before the
1264 * return from or after the call to synchronize_rcu() in
1265 * enable_swap_info() or swapoff(). So if "si->flags & SWP_VALID" is
1266 * true, the si->map, si->cluster_info, etc. must be valid in the
1269 * Notice that swapoff or swapoff+swapon can still happen before the
1270 * rcu_read_lock() in get_swap_device() or after the rcu_read_unlock()
1271 * in put_swap_device() if there isn't any other way to prevent
1272 * swapoff, such as page lock, page table lock, etc. The caller must
1273 * be prepared for that. For example, the following situation is
1278 * ... swapoff+swapon
1279 * __read_swap_cache_async()
1280 * swapcache_prepare()
1281 * __swap_duplicate()
1283 * // verify PTE not changed
1285 * In __swap_duplicate(), the swap_map need to be checked before
1286 * changing partly because the specified swap entry may be for another
1287 * swap device which has been swapoff. And in do_swap_page(), after
1288 * the page is read from the swap device, the PTE is verified not
1289 * changed with the page table locked to check whether the swap device
1290 * has been swapoff or swapoff+swapon.
1292 struct swap_info_struct *get_swap_device(swp_entry_t entry)
1294 struct swap_info_struct *si;
1295 unsigned long offset;
1299 si = swp_swap_info(entry);
1304 if (data_race(!(si->flags & SWP_VALID)))
1306 offset = swp_offset(entry);
1307 if (offset >= si->max)
1312 pr_err("%s: %s%08lx\n", __func__, Bad_file, entry.val);
1320 static unsigned char __swap_entry_free(struct swap_info_struct *p,
1323 struct swap_cluster_info *ci;
1324 unsigned long offset = swp_offset(entry);
1325 unsigned char usage;
1327 ci = lock_cluster_or_swap_info(p, offset);
1328 usage = __swap_entry_free_locked(p, offset, 1);
1329 unlock_cluster_or_swap_info(p, ci);
1331 free_swap_slot(entry);
1336 static void swap_entry_free(struct swap_info_struct *p, swp_entry_t entry)
1338 struct swap_cluster_info *ci;
1339 unsigned long offset = swp_offset(entry);
1340 unsigned char count;
1342 ci = lock_cluster(p, offset);
1343 count = p->swap_map[offset];
1344 VM_BUG_ON(count != SWAP_HAS_CACHE);
1345 p->swap_map[offset] = 0;
1346 dec_cluster_info_page(p, p->cluster_info, offset);
1349 mem_cgroup_uncharge_swap(entry, 1);
1350 swap_range_free(p, offset, 1);
1354 * Caller has made sure that the swap device corresponding to entry
1355 * is still around or has not been recycled.
1357 void swap_free(swp_entry_t entry)
1359 struct swap_info_struct *p;
1361 p = _swap_info_get(entry);
1363 __swap_entry_free(p, entry);
1367 * Called after dropping swapcache to decrease refcnt to swap entries.
1369 void put_swap_page(struct page *page, swp_entry_t entry)
1371 unsigned long offset = swp_offset(entry);
1372 unsigned long idx = offset / SWAPFILE_CLUSTER;
1373 struct swap_cluster_info *ci;
1374 struct swap_info_struct *si;
1376 unsigned int i, free_entries = 0;
1378 int size = swap_entry_size(thp_nr_pages(page));
1380 si = _swap_info_get(entry);
1384 ci = lock_cluster_or_swap_info(si, offset);
1385 if (size == SWAPFILE_CLUSTER) {
1386 VM_BUG_ON(!cluster_is_huge(ci));
1387 map = si->swap_map + offset;
1388 for (i = 0; i < SWAPFILE_CLUSTER; i++) {
1390 VM_BUG_ON(!(val & SWAP_HAS_CACHE));
1391 if (val == SWAP_HAS_CACHE)
1394 cluster_clear_huge(ci);
1395 if (free_entries == SWAPFILE_CLUSTER) {
1396 unlock_cluster_or_swap_info(si, ci);
1397 spin_lock(&si->lock);
1398 mem_cgroup_uncharge_swap(entry, SWAPFILE_CLUSTER);
1399 swap_free_cluster(si, idx);
1400 spin_unlock(&si->lock);
1404 for (i = 0; i < size; i++, entry.val++) {
1405 if (!__swap_entry_free_locked(si, offset + i, SWAP_HAS_CACHE)) {
1406 unlock_cluster_or_swap_info(si, ci);
1407 free_swap_slot(entry);
1410 lock_cluster_or_swap_info(si, offset);
1413 unlock_cluster_or_swap_info(si, ci);
1416 #ifdef CONFIG_THP_SWAP
1417 int split_swap_cluster(swp_entry_t entry)
1419 struct swap_info_struct *si;
1420 struct swap_cluster_info *ci;
1421 unsigned long offset = swp_offset(entry);
1423 si = _swap_info_get(entry);
1426 ci = lock_cluster(si, offset);
1427 cluster_clear_huge(ci);
1433 static int swp_entry_cmp(const void *ent1, const void *ent2)
1435 const swp_entry_t *e1 = ent1, *e2 = ent2;
1437 return (int)swp_type(*e1) - (int)swp_type(*e2);
1440 void swapcache_free_entries(swp_entry_t *entries, int n)
1442 struct swap_info_struct *p, *prev;
1452 * Sort swap entries by swap device, so each lock is only taken once.
1453 * nr_swapfiles isn't absolutely correct, but the overhead of sort() is
1454 * so low that it isn't necessary to optimize further.
1456 if (nr_swapfiles > 1)
1457 sort(entries, n, sizeof(entries[0]), swp_entry_cmp, NULL);
1458 for (i = 0; i < n; ++i) {
1459 p = swap_info_get_cont(entries[i], prev);
1461 swap_entry_free(p, entries[i]);
1465 spin_unlock(&p->lock);
1469 * How many references to page are currently swapped out?
1470 * This does not give an exact answer when swap count is continued,
1471 * but does include the high COUNT_CONTINUED flag to allow for that.
1473 int page_swapcount(struct page *page)
1476 struct swap_info_struct *p;
1477 struct swap_cluster_info *ci;
1479 unsigned long offset;
1481 entry.val = page_private(page);
1482 p = _swap_info_get(entry);
1484 offset = swp_offset(entry);
1485 ci = lock_cluster_or_swap_info(p, offset);
1486 count = swap_count(p->swap_map[offset]);
1487 unlock_cluster_or_swap_info(p, ci);
1492 int __swap_count(swp_entry_t entry)
1494 struct swap_info_struct *si;
1495 pgoff_t offset = swp_offset(entry);
1498 si = get_swap_device(entry);
1500 count = swap_count(si->swap_map[offset]);
1501 put_swap_device(si);
1506 static int swap_swapcount(struct swap_info_struct *si, swp_entry_t entry)
1509 pgoff_t offset = swp_offset(entry);
1510 struct swap_cluster_info *ci;
1512 ci = lock_cluster_or_swap_info(si, offset);
1513 count = swap_count(si->swap_map[offset]);
1514 unlock_cluster_or_swap_info(si, ci);
1519 * How many references to @entry are currently swapped out?
1520 * This does not give an exact answer when swap count is continued,
1521 * but does include the high COUNT_CONTINUED flag to allow for that.
1523 int __swp_swapcount(swp_entry_t entry)
1526 struct swap_info_struct *si;
1528 si = get_swap_device(entry);
1530 count = swap_swapcount(si, entry);
1531 put_swap_device(si);
1537 * How many references to @entry are currently swapped out?
1538 * This considers COUNT_CONTINUED so it returns exact answer.
1540 int swp_swapcount(swp_entry_t entry)
1542 int count, tmp_count, n;
1543 struct swap_info_struct *p;
1544 struct swap_cluster_info *ci;
1549 p = _swap_info_get(entry);
1553 offset = swp_offset(entry);
1555 ci = lock_cluster_or_swap_info(p, offset);
1557 count = swap_count(p->swap_map[offset]);
1558 if (!(count & COUNT_CONTINUED))
1561 count &= ~COUNT_CONTINUED;
1562 n = SWAP_MAP_MAX + 1;
1564 page = vmalloc_to_page(p->swap_map + offset);
1565 offset &= ~PAGE_MASK;
1566 VM_BUG_ON(page_private(page) != SWP_CONTINUED);
1569 page = list_next_entry(page, lru);
1570 map = kmap_atomic(page);
1571 tmp_count = map[offset];
1574 count += (tmp_count & ~COUNT_CONTINUED) * n;
1575 n *= (SWAP_CONT_MAX + 1);
1576 } while (tmp_count & COUNT_CONTINUED);
1578 unlock_cluster_or_swap_info(p, ci);
1582 static bool swap_page_trans_huge_swapped(struct swap_info_struct *si,
1585 struct swap_cluster_info *ci;
1586 unsigned char *map = si->swap_map;
1587 unsigned long roffset = swp_offset(entry);
1588 unsigned long offset = round_down(roffset, SWAPFILE_CLUSTER);
1592 ci = lock_cluster_or_swap_info(si, offset);
1593 if (!ci || !cluster_is_huge(ci)) {
1594 if (swap_count(map[roffset]))
1598 for (i = 0; i < SWAPFILE_CLUSTER; i++) {
1599 if (swap_count(map[offset + i])) {
1605 unlock_cluster_or_swap_info(si, ci);
1609 static bool page_swapped(struct page *page)
1612 struct swap_info_struct *si;
1614 if (!IS_ENABLED(CONFIG_THP_SWAP) || likely(!PageTransCompound(page)))
1615 return page_swapcount(page) != 0;
1617 page = compound_head(page);
1618 entry.val = page_private(page);
1619 si = _swap_info_get(entry);
1621 return swap_page_trans_huge_swapped(si, entry);
1625 static int page_trans_huge_map_swapcount(struct page *page, int *total_mapcount,
1626 int *total_swapcount)
1628 int i, map_swapcount, _total_mapcount, _total_swapcount;
1629 unsigned long offset = 0;
1630 struct swap_info_struct *si;
1631 struct swap_cluster_info *ci = NULL;
1632 unsigned char *map = NULL;
1633 int mapcount, swapcount = 0;
1635 /* hugetlbfs shouldn't call it */
1636 VM_BUG_ON_PAGE(PageHuge(page), page);
1638 if (!IS_ENABLED(CONFIG_THP_SWAP) || likely(!PageTransCompound(page))) {
1639 mapcount = page_trans_huge_mapcount(page, total_mapcount);
1640 if (PageSwapCache(page))
1641 swapcount = page_swapcount(page);
1642 if (total_swapcount)
1643 *total_swapcount = swapcount;
1644 return mapcount + swapcount;
1647 page = compound_head(page);
1649 _total_mapcount = _total_swapcount = map_swapcount = 0;
1650 if (PageSwapCache(page)) {
1653 entry.val = page_private(page);
1654 si = _swap_info_get(entry);
1657 offset = swp_offset(entry);
1661 ci = lock_cluster(si, offset);
1662 for (i = 0; i < HPAGE_PMD_NR; i++) {
1663 mapcount = atomic_read(&page[i]._mapcount) + 1;
1664 _total_mapcount += mapcount;
1666 swapcount = swap_count(map[offset + i]);
1667 _total_swapcount += swapcount;
1669 map_swapcount = max(map_swapcount, mapcount + swapcount);
1672 if (PageDoubleMap(page)) {
1674 _total_mapcount -= HPAGE_PMD_NR;
1676 mapcount = compound_mapcount(page);
1677 map_swapcount += mapcount;
1678 _total_mapcount += mapcount;
1680 *total_mapcount = _total_mapcount;
1681 if (total_swapcount)
1682 *total_swapcount = _total_swapcount;
1684 return map_swapcount;
1688 * We can write to an anon page without COW if there are no other references
1689 * to it. And as a side-effect, free up its swap: because the old content
1690 * on disk will never be read, and seeking back there to write new content
1691 * later would only waste time away from clustering.
1693 * NOTE: total_map_swapcount should not be relied upon by the caller if
1694 * reuse_swap_page() returns false, but it may be always overwritten
1695 * (see the other implementation for CONFIG_SWAP=n).
1697 bool reuse_swap_page(struct page *page, int *total_map_swapcount)
1699 int count, total_mapcount, total_swapcount;
1701 VM_BUG_ON_PAGE(!PageLocked(page), page);
1702 if (unlikely(PageKsm(page)))
1704 count = page_trans_huge_map_swapcount(page, &total_mapcount,
1706 if (total_map_swapcount)
1707 *total_map_swapcount = total_mapcount + total_swapcount;
1708 if (count == 1 && PageSwapCache(page) &&
1709 (likely(!PageTransCompound(page)) ||
1710 /* The remaining swap count will be freed soon */
1711 total_swapcount == page_swapcount(page))) {
1712 if (!PageWriteback(page)) {
1713 page = compound_head(page);
1714 delete_from_swap_cache(page);
1718 struct swap_info_struct *p;
1720 entry.val = page_private(page);
1721 p = swap_info_get(entry);
1722 if (p->flags & SWP_STABLE_WRITES) {
1723 spin_unlock(&p->lock);
1726 spin_unlock(&p->lock);
1734 * If swap is getting full, or if there are no more mappings of this page,
1735 * then try_to_free_swap is called to free its swap space.
1737 int try_to_free_swap(struct page *page)
1739 VM_BUG_ON_PAGE(!PageLocked(page), page);
1741 if (!PageSwapCache(page))
1743 if (PageWriteback(page))
1745 if (page_swapped(page))
1749 * Once hibernation has begun to create its image of memory,
1750 * there's a danger that one of the calls to try_to_free_swap()
1751 * - most probably a call from __try_to_reclaim_swap() while
1752 * hibernation is allocating its own swap pages for the image,
1753 * but conceivably even a call from memory reclaim - will free
1754 * the swap from a page which has already been recorded in the
1755 * image as a clean swapcache page, and then reuse its swap for
1756 * another page of the image. On waking from hibernation, the
1757 * original page might be freed under memory pressure, then
1758 * later read back in from swap, now with the wrong data.
1760 * Hibernation suspends storage while it is writing the image
1761 * to disk so check that here.
1763 if (pm_suspended_storage())
1766 page = compound_head(page);
1767 delete_from_swap_cache(page);
1773 * Free the swap entry like above, but also try to
1774 * free the page cache entry if it is the last user.
1776 int free_swap_and_cache(swp_entry_t entry)
1778 struct swap_info_struct *p;
1779 unsigned char count;
1781 if (non_swap_entry(entry))
1784 p = _swap_info_get(entry);
1786 count = __swap_entry_free(p, entry);
1787 if (count == SWAP_HAS_CACHE &&
1788 !swap_page_trans_huge_swapped(p, entry))
1789 __try_to_reclaim_swap(p, swp_offset(entry),
1790 TTRS_UNMAPPED | TTRS_FULL);
1795 #ifdef CONFIG_HIBERNATION
1797 * Find the swap type that corresponds to given device (if any).
1799 * @offset - number of the PAGE_SIZE-sized block of the device, starting
1800 * from 0, in which the swap header is expected to be located.
1802 * This is needed for the suspend to disk (aka swsusp).
1804 int swap_type_of(dev_t device, sector_t offset)
1811 spin_lock(&swap_lock);
1812 for (type = 0; type < nr_swapfiles; type++) {
1813 struct swap_info_struct *sis = swap_info[type];
1815 if (!(sis->flags & SWP_WRITEOK))
1818 if (device == sis->bdev->bd_dev) {
1819 struct swap_extent *se = first_se(sis);
1821 if (se->start_block == offset) {
1822 spin_unlock(&swap_lock);
1827 spin_unlock(&swap_lock);
1831 int find_first_swap(dev_t *device)
1835 spin_lock(&swap_lock);
1836 for (type = 0; type < nr_swapfiles; type++) {
1837 struct swap_info_struct *sis = swap_info[type];
1839 if (!(sis->flags & SWP_WRITEOK))
1841 *device = sis->bdev->bd_dev;
1842 spin_unlock(&swap_lock);
1845 spin_unlock(&swap_lock);
1850 * Get the (PAGE_SIZE) block corresponding to given offset on the swapdev
1851 * corresponding to given index in swap_info (swap type).
1853 sector_t swapdev_block(int type, pgoff_t offset)
1855 struct block_device *bdev;
1856 struct swap_info_struct *si = swap_type_to_swap_info(type);
1858 if (!si || !(si->flags & SWP_WRITEOK))
1860 return map_swap_entry(swp_entry(type, offset), &bdev);
1864 * Return either the total number of swap pages of given type, or the number
1865 * of free pages of that type (depending on @free)
1867 * This is needed for software suspend
1869 unsigned int count_swap_pages(int type, int free)
1873 spin_lock(&swap_lock);
1874 if ((unsigned int)type < nr_swapfiles) {
1875 struct swap_info_struct *sis = swap_info[type];
1877 spin_lock(&sis->lock);
1878 if (sis->flags & SWP_WRITEOK) {
1881 n -= sis->inuse_pages;
1883 spin_unlock(&sis->lock);
1885 spin_unlock(&swap_lock);
1888 #endif /* CONFIG_HIBERNATION */
1890 static inline int pte_same_as_swp(pte_t pte, pte_t swp_pte)
1892 return pte_same(pte_swp_clear_soft_dirty(pte), swp_pte);
1896 * No need to decide whether this PTE shares the swap entry with others,
1897 * just let do_wp_page work it out if a write is requested later - to
1898 * force COW, vm_page_prot omits write permission from any private vma.
1900 static int unuse_pte(struct vm_area_struct *vma, pmd_t *pmd,
1901 unsigned long addr, swp_entry_t entry, struct page *page)
1903 struct page *swapcache;
1909 page = ksm_might_need_to_copy(page, vma, addr);
1910 if (unlikely(!page))
1913 pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl);
1914 if (unlikely(!pte_same_as_swp(*pte, swp_entry_to_pte(entry)))) {
1919 dec_mm_counter(vma->vm_mm, MM_SWAPENTS);
1920 inc_mm_counter(vma->vm_mm, MM_ANONPAGES);
1922 set_pte_at(vma->vm_mm, addr, pte,
1923 pte_mkold(mk_pte(page, vma->vm_page_prot)));
1924 if (page == swapcache) {
1925 page_add_anon_rmap(page, vma, addr, false);
1926 } else { /* ksm created a completely new copy */
1927 page_add_new_anon_rmap(page, vma, addr, false);
1928 lru_cache_add_inactive_or_unevictable(page, vma);
1932 * Move the page to the active list so it is not
1933 * immediately swapped out again after swapon.
1935 activate_page(page);
1937 pte_unmap_unlock(pte, ptl);
1938 if (page != swapcache) {
1945 static int unuse_pte_range(struct vm_area_struct *vma, pmd_t *pmd,
1946 unsigned long addr, unsigned long end,
1947 unsigned int type, bool frontswap,
1948 unsigned long *fs_pages_to_unuse)
1953 struct swap_info_struct *si;
1954 unsigned long offset;
1956 volatile unsigned char *swap_map;
1958 si = swap_info[type];
1959 pte = pte_offset_map(pmd, addr);
1961 struct vm_fault vmf;
1963 if (!is_swap_pte(*pte))
1966 entry = pte_to_swp_entry(*pte);
1967 if (swp_type(entry) != type)
1970 offset = swp_offset(entry);
1971 if (frontswap && !frontswap_test(si, offset))
1975 swap_map = &si->swap_map[offset];
1976 page = lookup_swap_cache(entry, vma, addr);
1981 page = swapin_readahead(entry, GFP_HIGHUSER_MOVABLE,
1985 if (*swap_map == 0 || *swap_map == SWAP_MAP_BAD)
1991 wait_on_page_writeback(page);
1992 ret = unuse_pte(vma, pmd, addr, entry, page);
1999 try_to_free_swap(page);
2003 if (*fs_pages_to_unuse && !--(*fs_pages_to_unuse)) {
2004 ret = FRONTSWAP_PAGES_UNUSED;
2008 pte = pte_offset_map(pmd, addr);
2009 } while (pte++, addr += PAGE_SIZE, addr != end);
2017 static inline int unuse_pmd_range(struct vm_area_struct *vma, pud_t *pud,
2018 unsigned long addr, unsigned long end,
2019 unsigned int type, bool frontswap,
2020 unsigned long *fs_pages_to_unuse)
2026 pmd = pmd_offset(pud, addr);
2029 next = pmd_addr_end(addr, end);
2030 if (pmd_none_or_trans_huge_or_clear_bad(pmd))
2032 ret = unuse_pte_range(vma, pmd, addr, next, type,
2033 frontswap, fs_pages_to_unuse);
2036 } while (pmd++, addr = next, addr != end);
2040 static inline int unuse_pud_range(struct vm_area_struct *vma, p4d_t *p4d,
2041 unsigned long addr, unsigned long end,
2042 unsigned int type, bool frontswap,
2043 unsigned long *fs_pages_to_unuse)
2049 pud = pud_offset(p4d, addr);
2051 next = pud_addr_end(addr, end);
2052 if (pud_none_or_clear_bad(pud))
2054 ret = unuse_pmd_range(vma, pud, addr, next, type,
2055 frontswap, fs_pages_to_unuse);
2058 } while (pud++, addr = next, addr != end);
2062 static inline int unuse_p4d_range(struct vm_area_struct *vma, pgd_t *pgd,
2063 unsigned long addr, unsigned long end,
2064 unsigned int type, bool frontswap,
2065 unsigned long *fs_pages_to_unuse)
2071 p4d = p4d_offset(pgd, addr);
2073 next = p4d_addr_end(addr, end);
2074 if (p4d_none_or_clear_bad(p4d))
2076 ret = unuse_pud_range(vma, p4d, addr, next, type,
2077 frontswap, fs_pages_to_unuse);
2080 } while (p4d++, addr = next, addr != end);
2084 static int unuse_vma(struct vm_area_struct *vma, unsigned int type,
2085 bool frontswap, unsigned long *fs_pages_to_unuse)
2088 unsigned long addr, end, next;
2091 addr = vma->vm_start;
2094 pgd = pgd_offset(vma->vm_mm, addr);
2096 next = pgd_addr_end(addr, end);
2097 if (pgd_none_or_clear_bad(pgd))
2099 ret = unuse_p4d_range(vma, pgd, addr, next, type,
2100 frontswap, fs_pages_to_unuse);
2103 } while (pgd++, addr = next, addr != end);
2107 static int unuse_mm(struct mm_struct *mm, unsigned int type,
2108 bool frontswap, unsigned long *fs_pages_to_unuse)
2110 struct vm_area_struct *vma;
2114 for (vma = mm->mmap; vma; vma = vma->vm_next) {
2115 if (vma->anon_vma) {
2116 ret = unuse_vma(vma, type, frontswap,
2123 mmap_read_unlock(mm);
2128 * Scan swap_map (or frontswap_map if frontswap parameter is true)
2129 * from current position to next entry still in use. Return 0
2130 * if there are no inuse entries after prev till end of the map.
2132 static unsigned int find_next_to_unuse(struct swap_info_struct *si,
2133 unsigned int prev, bool frontswap)
2136 unsigned char count;
2139 * No need for swap_lock here: we're just looking
2140 * for whether an entry is in use, not modifying it; false
2141 * hits are okay, and sys_swapoff() has already prevented new
2142 * allocations from this area (while holding swap_lock).
2144 for (i = prev + 1; i < si->max; i++) {
2145 count = READ_ONCE(si->swap_map[i]);
2146 if (count && swap_count(count) != SWAP_MAP_BAD)
2147 if (!frontswap || frontswap_test(si, i))
2149 if ((i % LATENCY_LIMIT) == 0)
2160 * If the boolean frontswap is true, only unuse pages_to_unuse pages;
2161 * pages_to_unuse==0 means all pages; ignored if frontswap is false
2163 int try_to_unuse(unsigned int type, bool frontswap,
2164 unsigned long pages_to_unuse)
2166 struct mm_struct *prev_mm;
2167 struct mm_struct *mm;
2168 struct list_head *p;
2170 struct swap_info_struct *si = swap_info[type];
2175 if (!READ_ONCE(si->inuse_pages))
2182 retval = shmem_unuse(type, frontswap, &pages_to_unuse);
2189 spin_lock(&mmlist_lock);
2190 p = &init_mm.mmlist;
2191 while (READ_ONCE(si->inuse_pages) &&
2192 !signal_pending(current) &&
2193 (p = p->next) != &init_mm.mmlist) {
2195 mm = list_entry(p, struct mm_struct, mmlist);
2196 if (!mmget_not_zero(mm))
2198 spin_unlock(&mmlist_lock);
2201 retval = unuse_mm(mm, type, frontswap, &pages_to_unuse);
2209 * Make sure that we aren't completely killing
2210 * interactive performance.
2213 spin_lock(&mmlist_lock);
2215 spin_unlock(&mmlist_lock);
2220 while (READ_ONCE(si->inuse_pages) &&
2221 !signal_pending(current) &&
2222 (i = find_next_to_unuse(si, i, frontswap)) != 0) {
2224 entry = swp_entry(type, i);
2225 page = find_get_page(swap_address_space(entry), i);
2230 * It is conceivable that a racing task removed this page from
2231 * swap cache just before we acquired the page lock. The page
2232 * might even be back in swap cache on another swap area. But
2233 * that is okay, try_to_free_swap() only removes stale pages.
2236 wait_on_page_writeback(page);
2237 try_to_free_swap(page);
2242 * For frontswap, we just need to unuse pages_to_unuse, if
2243 * it was specified. Need not check frontswap again here as
2244 * we already zeroed out pages_to_unuse if not frontswap.
2246 if (pages_to_unuse && --pages_to_unuse == 0)
2251 * Lets check again to see if there are still swap entries in the map.
2252 * If yes, we would need to do retry the unuse logic again.
2253 * Under global memory pressure, swap entries can be reinserted back
2254 * into process space after the mmlist loop above passes over them.
2256 * Limit the number of retries? No: when mmget_not_zero() above fails,
2257 * that mm is likely to be freeing swap from exit_mmap(), which proceeds
2258 * at its own independent pace; and even shmem_writepage() could have
2259 * been preempted after get_swap_page(), temporarily hiding that swap.
2260 * It's easy and robust (though cpu-intensive) just to keep retrying.
2262 if (READ_ONCE(si->inuse_pages)) {
2263 if (!signal_pending(current))
2268 return (retval == FRONTSWAP_PAGES_UNUSED) ? 0 : retval;
2272 * After a successful try_to_unuse, if no swap is now in use, we know
2273 * we can empty the mmlist. swap_lock must be held on entry and exit.
2274 * Note that mmlist_lock nests inside swap_lock, and an mm must be
2275 * added to the mmlist just after page_duplicate - before would be racy.
2277 static void drain_mmlist(void)
2279 struct list_head *p, *next;
2282 for (type = 0; type < nr_swapfiles; type++)
2283 if (swap_info[type]->inuse_pages)
2285 spin_lock(&mmlist_lock);
2286 list_for_each_safe(p, next, &init_mm.mmlist)
2288 spin_unlock(&mmlist_lock);
2292 * Use this swapdev's extent info to locate the (PAGE_SIZE) block which
2293 * corresponds to page offset for the specified swap entry.
2294 * Note that the type of this function is sector_t, but it returns page offset
2295 * into the bdev, not sector offset.
2297 static sector_t map_swap_entry(swp_entry_t entry, struct block_device **bdev)
2299 struct swap_info_struct *sis;
2300 struct swap_extent *se;
2303 sis = swp_swap_info(entry);
2306 offset = swp_offset(entry);
2307 se = offset_to_swap_extent(sis, offset);
2308 return se->start_block + (offset - se->start_page);
2312 * Returns the page offset into bdev for the specified page's swap entry.
2314 sector_t map_swap_page(struct page *page, struct block_device **bdev)
2317 entry.val = page_private(page);
2318 return map_swap_entry(entry, bdev);
2322 * Free all of a swapdev's extent information
2324 static void destroy_swap_extents(struct swap_info_struct *sis)
2326 while (!RB_EMPTY_ROOT(&sis->swap_extent_root)) {
2327 struct rb_node *rb = sis->swap_extent_root.rb_node;
2328 struct swap_extent *se = rb_entry(rb, struct swap_extent, rb_node);
2330 rb_erase(rb, &sis->swap_extent_root);
2334 if (sis->flags & SWP_ACTIVATED) {
2335 struct file *swap_file = sis->swap_file;
2336 struct address_space *mapping = swap_file->f_mapping;
2338 sis->flags &= ~SWP_ACTIVATED;
2339 if (mapping->a_ops->swap_deactivate)
2340 mapping->a_ops->swap_deactivate(swap_file);
2345 * Add a block range (and the corresponding page range) into this swapdev's
2348 * This function rather assumes that it is called in ascending page order.
2351 add_swap_extent(struct swap_info_struct *sis, unsigned long start_page,
2352 unsigned long nr_pages, sector_t start_block)
2354 struct rb_node **link = &sis->swap_extent_root.rb_node, *parent = NULL;
2355 struct swap_extent *se;
2356 struct swap_extent *new_se;
2359 * place the new node at the right most since the
2360 * function is called in ascending page order.
2364 link = &parent->rb_right;
2368 se = rb_entry(parent, struct swap_extent, rb_node);
2369 BUG_ON(se->start_page + se->nr_pages != start_page);
2370 if (se->start_block + se->nr_pages == start_block) {
2372 se->nr_pages += nr_pages;
2377 /* No merge, insert a new extent. */
2378 new_se = kmalloc(sizeof(*se), GFP_KERNEL);
2381 new_se->start_page = start_page;
2382 new_se->nr_pages = nr_pages;
2383 new_se->start_block = start_block;
2385 rb_link_node(&new_se->rb_node, parent, link);
2386 rb_insert_color(&new_se->rb_node, &sis->swap_extent_root);
2389 EXPORT_SYMBOL_GPL(add_swap_extent);
2392 * A `swap extent' is a simple thing which maps a contiguous range of pages
2393 * onto a contiguous range of disk blocks. An ordered list of swap extents
2394 * is built at swapon time and is then used at swap_writepage/swap_readpage
2395 * time for locating where on disk a page belongs.
2397 * If the swapfile is an S_ISBLK block device, a single extent is installed.
2398 * This is done so that the main operating code can treat S_ISBLK and S_ISREG
2399 * swap files identically.
2401 * Whether the swapdev is an S_ISREG file or an S_ISBLK blockdev, the swap
2402 * extent list operates in PAGE_SIZE disk blocks. Both S_ISREG and S_ISBLK
2403 * swapfiles are handled *identically* after swapon time.
2405 * For S_ISREG swapfiles, setup_swap_extents() will walk all the file's blocks
2406 * and will parse them into an ordered extent list, in PAGE_SIZE chunks. If
2407 * some stray blocks are found which do not fall within the PAGE_SIZE alignment
2408 * requirements, they are simply tossed out - we will never use those blocks
2411 * For all swap devices we set S_SWAPFILE across the life of the swapon. This
2412 * prevents users from writing to the swap device, which will corrupt memory.
2414 * The amount of disk space which a single swap extent represents varies.
2415 * Typically it is in the 1-4 megabyte range. So we can have hundreds of
2416 * extents in the list. To avoid much list walking, we cache the previous
2417 * search location in `curr_swap_extent', and start new searches from there.
2418 * This is extremely effective. The average number of iterations in
2419 * map_swap_page() has been measured at about 0.3 per page. - akpm.
2421 static int setup_swap_extents(struct swap_info_struct *sis, sector_t *span)
2423 struct file *swap_file = sis->swap_file;
2424 struct address_space *mapping = swap_file->f_mapping;
2425 struct inode *inode = mapping->host;
2428 if (S_ISBLK(inode->i_mode)) {
2429 ret = add_swap_extent(sis, 0, sis->max, 0);
2434 if (mapping->a_ops->swap_activate) {
2435 ret = mapping->a_ops->swap_activate(sis, swap_file, span);
2437 sis->flags |= SWP_ACTIVATED;
2439 sis->flags |= SWP_FS;
2440 ret = add_swap_extent(sis, 0, sis->max, 0);
2446 return generic_swapfile_activate(sis, swap_file, span);
2449 static int swap_node(struct swap_info_struct *p)
2451 struct block_device *bdev;
2456 bdev = p->swap_file->f_inode->i_sb->s_bdev;
2458 return bdev ? bdev->bd_disk->node_id : NUMA_NO_NODE;
2461 static void setup_swap_info(struct swap_info_struct *p, int prio,
2462 unsigned char *swap_map,
2463 struct swap_cluster_info *cluster_info)
2470 p->prio = --least_priority;
2472 * the plist prio is negated because plist ordering is
2473 * low-to-high, while swap ordering is high-to-low
2475 p->list.prio = -p->prio;
2478 p->avail_lists[i].prio = -p->prio;
2480 if (swap_node(p) == i)
2481 p->avail_lists[i].prio = 1;
2483 p->avail_lists[i].prio = -p->prio;
2486 p->swap_map = swap_map;
2487 p->cluster_info = cluster_info;
2490 static void _enable_swap_info(struct swap_info_struct *p)
2492 p->flags |= SWP_WRITEOK | SWP_VALID;
2493 atomic_long_add(p->pages, &nr_swap_pages);
2494 total_swap_pages += p->pages;
2496 assert_spin_locked(&swap_lock);
2498 * both lists are plists, and thus priority ordered.
2499 * swap_active_head needs to be priority ordered for swapoff(),
2500 * which on removal of any swap_info_struct with an auto-assigned
2501 * (i.e. negative) priority increments the auto-assigned priority
2502 * of any lower-priority swap_info_structs.
2503 * swap_avail_head needs to be priority ordered for get_swap_page(),
2504 * which allocates swap pages from the highest available priority
2507 plist_add(&p->list, &swap_active_head);
2508 add_to_avail_list(p);
2511 static void enable_swap_info(struct swap_info_struct *p, int prio,
2512 unsigned char *swap_map,
2513 struct swap_cluster_info *cluster_info,
2514 unsigned long *frontswap_map)
2516 frontswap_init(p->type, frontswap_map);
2517 spin_lock(&swap_lock);
2518 spin_lock(&p->lock);
2519 setup_swap_info(p, prio, swap_map, cluster_info);
2520 spin_unlock(&p->lock);
2521 spin_unlock(&swap_lock);
2523 * Guarantee swap_map, cluster_info, etc. fields are valid
2524 * between get/put_swap_device() if SWP_VALID bit is set
2527 spin_lock(&swap_lock);
2528 spin_lock(&p->lock);
2529 _enable_swap_info(p);
2530 spin_unlock(&p->lock);
2531 spin_unlock(&swap_lock);
2534 static void reinsert_swap_info(struct swap_info_struct *p)
2536 spin_lock(&swap_lock);
2537 spin_lock(&p->lock);
2538 setup_swap_info(p, p->prio, p->swap_map, p->cluster_info);
2539 _enable_swap_info(p);
2540 spin_unlock(&p->lock);
2541 spin_unlock(&swap_lock);
2544 bool has_usable_swap(void)
2548 spin_lock(&swap_lock);
2549 if (plist_head_empty(&swap_active_head))
2551 spin_unlock(&swap_lock);
2555 SYSCALL_DEFINE1(swapoff, const char __user *, specialfile)
2557 struct swap_info_struct *p = NULL;
2558 unsigned char *swap_map;
2559 struct swap_cluster_info *cluster_info;
2560 unsigned long *frontswap_map;
2561 struct file *swap_file, *victim;
2562 struct address_space *mapping;
2563 struct inode *inode;
2564 struct filename *pathname;
2566 unsigned int old_block_size;
2568 if (!capable(CAP_SYS_ADMIN))
2571 BUG_ON(!current->mm);
2573 pathname = getname(specialfile);
2574 if (IS_ERR(pathname))
2575 return PTR_ERR(pathname);
2577 victim = file_open_name(pathname, O_RDWR|O_LARGEFILE, 0);
2578 err = PTR_ERR(victim);
2582 mapping = victim->f_mapping;
2583 spin_lock(&swap_lock);
2584 plist_for_each_entry(p, &swap_active_head, list) {
2585 if (p->flags & SWP_WRITEOK) {
2586 if (p->swap_file->f_mapping == mapping) {
2594 spin_unlock(&swap_lock);
2597 if (!security_vm_enough_memory_mm(current->mm, p->pages))
2598 vm_unacct_memory(p->pages);
2601 spin_unlock(&swap_lock);
2604 del_from_avail_list(p);
2605 spin_lock(&p->lock);
2607 struct swap_info_struct *si = p;
2610 plist_for_each_entry_continue(si, &swap_active_head, list) {
2613 for_each_node(nid) {
2614 if (si->avail_lists[nid].prio != 1)
2615 si->avail_lists[nid].prio--;
2620 plist_del(&p->list, &swap_active_head);
2621 atomic_long_sub(p->pages, &nr_swap_pages);
2622 total_swap_pages -= p->pages;
2623 p->flags &= ~SWP_WRITEOK;
2624 spin_unlock(&p->lock);
2625 spin_unlock(&swap_lock);
2627 disable_swap_slots_cache_lock();
2629 set_current_oom_origin();
2630 err = try_to_unuse(p->type, false, 0); /* force unuse all pages */
2631 clear_current_oom_origin();
2634 /* re-insert swap space back into swap_list */
2635 reinsert_swap_info(p);
2636 reenable_swap_slots_cache_unlock();
2640 reenable_swap_slots_cache_unlock();
2642 spin_lock(&swap_lock);
2643 spin_lock(&p->lock);
2644 p->flags &= ~SWP_VALID; /* mark swap device as invalid */
2645 spin_unlock(&p->lock);
2646 spin_unlock(&swap_lock);
2648 * wait for swap operations protected by get/put_swap_device()
2653 flush_work(&p->discard_work);
2655 destroy_swap_extents(p);
2656 if (p->flags & SWP_CONTINUED)
2657 free_swap_count_continuations(p);
2659 if (!p->bdev || !blk_queue_nonrot(bdev_get_queue(p->bdev)))
2660 atomic_dec(&nr_rotate_swap);
2662 mutex_lock(&swapon_mutex);
2663 spin_lock(&swap_lock);
2664 spin_lock(&p->lock);
2667 /* wait for anyone still in scan_swap_map */
2668 p->highest_bit = 0; /* cuts scans short */
2669 while (p->flags >= SWP_SCANNING) {
2670 spin_unlock(&p->lock);
2671 spin_unlock(&swap_lock);
2672 schedule_timeout_uninterruptible(1);
2673 spin_lock(&swap_lock);
2674 spin_lock(&p->lock);
2677 swap_file = p->swap_file;
2678 old_block_size = p->old_block_size;
2679 p->swap_file = NULL;
2681 swap_map = p->swap_map;
2683 cluster_info = p->cluster_info;
2684 p->cluster_info = NULL;
2685 frontswap_map = frontswap_map_get(p);
2686 spin_unlock(&p->lock);
2687 spin_unlock(&swap_lock);
2688 frontswap_invalidate_area(p->type);
2689 frontswap_map_set(p, NULL);
2690 mutex_unlock(&swapon_mutex);
2691 free_percpu(p->percpu_cluster);
2692 p->percpu_cluster = NULL;
2693 free_percpu(p->cluster_next_cpu);
2694 p->cluster_next_cpu = NULL;
2696 kvfree(cluster_info);
2697 kvfree(frontswap_map);
2698 /* Destroy swap account information */
2699 swap_cgroup_swapoff(p->type);
2700 exit_swap_address_space(p->type);
2702 inode = mapping->host;
2703 if (S_ISBLK(inode->i_mode)) {
2704 struct block_device *bdev = I_BDEV(inode);
2706 set_blocksize(bdev, old_block_size);
2707 blkdev_put(bdev, FMODE_READ | FMODE_WRITE | FMODE_EXCL);
2711 inode->i_flags &= ~S_SWAPFILE;
2712 inode_unlock(inode);
2713 filp_close(swap_file, NULL);
2716 * Clear the SWP_USED flag after all resources are freed so that swapon
2717 * can reuse this swap_info in alloc_swap_info() safely. It is ok to
2718 * not hold p->lock after we cleared its SWP_WRITEOK.
2720 spin_lock(&swap_lock);
2722 spin_unlock(&swap_lock);
2725 atomic_inc(&proc_poll_event);
2726 wake_up_interruptible(&proc_poll_wait);
2729 filp_close(victim, NULL);
2735 #ifdef CONFIG_PROC_FS
2736 static __poll_t swaps_poll(struct file *file, poll_table *wait)
2738 struct seq_file *seq = file->private_data;
2740 poll_wait(file, &proc_poll_wait, wait);
2742 if (seq->poll_event != atomic_read(&proc_poll_event)) {
2743 seq->poll_event = atomic_read(&proc_poll_event);
2744 return EPOLLIN | EPOLLRDNORM | EPOLLERR | EPOLLPRI;
2747 return EPOLLIN | EPOLLRDNORM;
2751 static void *swap_start(struct seq_file *swap, loff_t *pos)
2753 struct swap_info_struct *si;
2757 mutex_lock(&swapon_mutex);
2760 return SEQ_START_TOKEN;
2762 for (type = 0; (si = swap_type_to_swap_info(type)); type++) {
2763 if (!(si->flags & SWP_USED) || !si->swap_map)
2772 static void *swap_next(struct seq_file *swap, void *v, loff_t *pos)
2774 struct swap_info_struct *si = v;
2777 if (v == SEQ_START_TOKEN)
2780 type = si->type + 1;
2783 for (; (si = swap_type_to_swap_info(type)); type++) {
2784 if (!(si->flags & SWP_USED) || !si->swap_map)
2792 static void swap_stop(struct seq_file *swap, void *v)
2794 mutex_unlock(&swapon_mutex);
2797 static int swap_show(struct seq_file *swap, void *v)
2799 struct swap_info_struct *si = v;
2802 unsigned int bytes, inuse;
2804 if (si == SEQ_START_TOKEN) {
2805 seq_puts(swap,"Filename\t\t\t\tType\t\tSize\t\tUsed\t\tPriority\n");
2809 bytes = si->pages << (PAGE_SHIFT - 10);
2810 inuse = si->inuse_pages << (PAGE_SHIFT - 10);
2812 file = si->swap_file;
2813 len = seq_file_path(swap, file, " \t\n\\");
2814 seq_printf(swap, "%*s%s\t%u\t%s%u\t%s%d\n",
2815 len < 40 ? 40 - len : 1, " ",
2816 S_ISBLK(file_inode(file)->i_mode) ?
2817 "partition" : "file\t",
2818 bytes, bytes < 10000000 ? "\t" : "",
2819 inuse, inuse < 10000000 ? "\t" : "",
2824 static const struct seq_operations swaps_op = {
2825 .start = swap_start,
2831 static int swaps_open(struct inode *inode, struct file *file)
2833 struct seq_file *seq;
2836 ret = seq_open(file, &swaps_op);
2840 seq = file->private_data;
2841 seq->poll_event = atomic_read(&proc_poll_event);
2845 static const struct proc_ops swaps_proc_ops = {
2846 .proc_flags = PROC_ENTRY_PERMANENT,
2847 .proc_open = swaps_open,
2848 .proc_read = seq_read,
2849 .proc_lseek = seq_lseek,
2850 .proc_release = seq_release,
2851 .proc_poll = swaps_poll,
2854 static int __init procswaps_init(void)
2856 proc_create("swaps", 0, NULL, &swaps_proc_ops);
2859 __initcall(procswaps_init);
2860 #endif /* CONFIG_PROC_FS */
2862 #ifdef MAX_SWAPFILES_CHECK
2863 static int __init max_swapfiles_check(void)
2865 MAX_SWAPFILES_CHECK();
2868 late_initcall(max_swapfiles_check);
2871 static struct swap_info_struct *alloc_swap_info(void)
2873 struct swap_info_struct *p;
2877 p = kvzalloc(struct_size(p, avail_lists, nr_node_ids), GFP_KERNEL);
2879 return ERR_PTR(-ENOMEM);
2881 spin_lock(&swap_lock);
2882 for (type = 0; type < nr_swapfiles; type++) {
2883 if (!(swap_info[type]->flags & SWP_USED))
2886 if (type >= MAX_SWAPFILES) {
2887 spin_unlock(&swap_lock);
2889 return ERR_PTR(-EPERM);
2891 if (type >= nr_swapfiles) {
2893 WRITE_ONCE(swap_info[type], p);
2895 * Write swap_info[type] before nr_swapfiles, in case a
2896 * racing procfs swap_start() or swap_next() is reading them.
2897 * (We never shrink nr_swapfiles, we never free this entry.)
2900 WRITE_ONCE(nr_swapfiles, nr_swapfiles + 1);
2903 p = swap_info[type];
2905 * Do not memset this entry: a racing procfs swap_next()
2906 * would be relying on p->type to remain valid.
2909 p->swap_extent_root = RB_ROOT;
2910 plist_node_init(&p->list, 0);
2912 plist_node_init(&p->avail_lists[i], 0);
2913 p->flags = SWP_USED;
2914 spin_unlock(&swap_lock);
2915 spin_lock_init(&p->lock);
2916 spin_lock_init(&p->cont_lock);
2921 static int claim_swapfile(struct swap_info_struct *p, struct inode *inode)
2925 if (S_ISBLK(inode->i_mode)) {
2926 p->bdev = blkdev_get_by_dev(inode->i_rdev,
2927 FMODE_READ | FMODE_WRITE | FMODE_EXCL, p);
2928 if (IS_ERR(p->bdev)) {
2929 error = PTR_ERR(p->bdev);
2933 p->old_block_size = block_size(p->bdev);
2934 error = set_blocksize(p->bdev, PAGE_SIZE);
2938 * Zoned block devices contain zones that have a sequential
2939 * write only restriction. Hence zoned block devices are not
2940 * suitable for swapping. Disallow them here.
2942 if (blk_queue_is_zoned(p->bdev->bd_disk->queue))
2944 p->flags |= SWP_BLKDEV;
2945 } else if (S_ISREG(inode->i_mode)) {
2946 p->bdev = inode->i_sb->s_bdev;
2954 * Find out how many pages are allowed for a single swap device. There
2955 * are two limiting factors:
2956 * 1) the number of bits for the swap offset in the swp_entry_t type, and
2957 * 2) the number of bits in the swap pte, as defined by the different
2960 * In order to find the largest possible bit mask, a swap entry with
2961 * swap type 0 and swap offset ~0UL is created, encoded to a swap pte,
2962 * decoded to a swp_entry_t again, and finally the swap offset is
2965 * This will mask all the bits from the initial ~0UL mask that can't
2966 * be encoded in either the swp_entry_t or the architecture definition
2969 unsigned long generic_max_swapfile_size(void)
2971 return swp_offset(pte_to_swp_entry(
2972 swp_entry_to_pte(swp_entry(0, ~0UL)))) + 1;
2975 /* Can be overridden by an architecture for additional checks. */
2976 __weak unsigned long max_swapfile_size(void)
2978 return generic_max_swapfile_size();
2981 static unsigned long read_swap_header(struct swap_info_struct *p,
2982 union swap_header *swap_header,
2983 struct inode *inode)
2986 unsigned long maxpages;
2987 unsigned long swapfilepages;
2988 unsigned long last_page;
2990 if (memcmp("SWAPSPACE2", swap_header->magic.magic, 10)) {
2991 pr_err("Unable to find swap-space signature\n");
2995 /* swap partition endianess hack... */
2996 if (swab32(swap_header->info.version) == 1) {
2997 swab32s(&swap_header->info.version);
2998 swab32s(&swap_header->info.last_page);
2999 swab32s(&swap_header->info.nr_badpages);
3000 if (swap_header->info.nr_badpages > MAX_SWAP_BADPAGES)
3002 for (i = 0; i < swap_header->info.nr_badpages; i++)
3003 swab32s(&swap_header->info.badpages[i]);
3005 /* Check the swap header's sub-version */
3006 if (swap_header->info.version != 1) {
3007 pr_warn("Unable to handle swap header version %d\n",
3008 swap_header->info.version);
3013 p->cluster_next = 1;
3016 maxpages = max_swapfile_size();
3017 last_page = swap_header->info.last_page;
3019 pr_warn("Empty swap-file\n");
3022 if (last_page > maxpages) {
3023 pr_warn("Truncating oversized swap area, only using %luk out of %luk\n",
3024 maxpages << (PAGE_SHIFT - 10),
3025 last_page << (PAGE_SHIFT - 10));
3027 if (maxpages > last_page) {
3028 maxpages = last_page + 1;
3029 /* p->max is an unsigned int: don't overflow it */
3030 if ((unsigned int)maxpages == 0)
3031 maxpages = UINT_MAX;
3033 p->highest_bit = maxpages - 1;
3037 swapfilepages = i_size_read(inode) >> PAGE_SHIFT;
3038 if (swapfilepages && maxpages > swapfilepages) {
3039 pr_warn("Swap area shorter than signature indicates\n");
3042 if (swap_header->info.nr_badpages && S_ISREG(inode->i_mode))
3044 if (swap_header->info.nr_badpages > MAX_SWAP_BADPAGES)
3050 #define SWAP_CLUSTER_INFO_COLS \
3051 DIV_ROUND_UP(L1_CACHE_BYTES, sizeof(struct swap_cluster_info))
3052 #define SWAP_CLUSTER_SPACE_COLS \
3053 DIV_ROUND_UP(SWAP_ADDRESS_SPACE_PAGES, SWAPFILE_CLUSTER)
3054 #define SWAP_CLUSTER_COLS \
3055 max_t(unsigned int, SWAP_CLUSTER_INFO_COLS, SWAP_CLUSTER_SPACE_COLS)
3057 static int setup_swap_map_and_extents(struct swap_info_struct *p,
3058 union swap_header *swap_header,
3059 unsigned char *swap_map,
3060 struct swap_cluster_info *cluster_info,
3061 unsigned long maxpages,
3065 unsigned int nr_good_pages;
3067 unsigned long nr_clusters = DIV_ROUND_UP(maxpages, SWAPFILE_CLUSTER);
3068 unsigned long col = p->cluster_next / SWAPFILE_CLUSTER % SWAP_CLUSTER_COLS;
3069 unsigned long i, idx;
3071 nr_good_pages = maxpages - 1; /* omit header page */
3073 cluster_list_init(&p->free_clusters);
3074 cluster_list_init(&p->discard_clusters);
3076 for (i = 0; i < swap_header->info.nr_badpages; i++) {
3077 unsigned int page_nr = swap_header->info.badpages[i];
3078 if (page_nr == 0 || page_nr > swap_header->info.last_page)
3080 if (page_nr < maxpages) {
3081 swap_map[page_nr] = SWAP_MAP_BAD;
3084 * Haven't marked the cluster free yet, no list
3085 * operation involved
3087 inc_cluster_info_page(p, cluster_info, page_nr);
3091 /* Haven't marked the cluster free yet, no list operation involved */
3092 for (i = maxpages; i < round_up(maxpages, SWAPFILE_CLUSTER); i++)
3093 inc_cluster_info_page(p, cluster_info, i);
3095 if (nr_good_pages) {
3096 swap_map[0] = SWAP_MAP_BAD;
3098 * Not mark the cluster free yet, no list
3099 * operation involved
3101 inc_cluster_info_page(p, cluster_info, 0);
3103 p->pages = nr_good_pages;
3104 nr_extents = setup_swap_extents(p, span);
3107 nr_good_pages = p->pages;
3109 if (!nr_good_pages) {
3110 pr_warn("Empty swap-file\n");
3119 * Reduce false cache line sharing between cluster_info and
3120 * sharing same address space.
3122 for (k = 0; k < SWAP_CLUSTER_COLS; k++) {
3123 j = (k + col) % SWAP_CLUSTER_COLS;
3124 for (i = 0; i < DIV_ROUND_UP(nr_clusters, SWAP_CLUSTER_COLS); i++) {
3125 idx = i * SWAP_CLUSTER_COLS + j;
3126 if (idx >= nr_clusters)
3128 if (cluster_count(&cluster_info[idx]))
3130 cluster_set_flag(&cluster_info[idx], CLUSTER_FLAG_FREE);
3131 cluster_list_add_tail(&p->free_clusters, cluster_info,
3139 * Helper to sys_swapon determining if a given swap
3140 * backing device queue supports DISCARD operations.
3142 static bool swap_discardable(struct swap_info_struct *si)
3144 struct request_queue *q = bdev_get_queue(si->bdev);
3146 if (!q || !blk_queue_discard(q))
3152 SYSCALL_DEFINE2(swapon, const char __user *, specialfile, int, swap_flags)
3154 struct swap_info_struct *p;
3155 struct filename *name;
3156 struct file *swap_file = NULL;
3157 struct address_space *mapping;
3160 union swap_header *swap_header;
3163 unsigned long maxpages;
3164 unsigned char *swap_map = NULL;
3165 struct swap_cluster_info *cluster_info = NULL;
3166 unsigned long *frontswap_map = NULL;
3167 struct page *page = NULL;
3168 struct inode *inode = NULL;
3169 bool inced_nr_rotate_swap = false;
3171 if (swap_flags & ~SWAP_FLAGS_VALID)
3174 if (!capable(CAP_SYS_ADMIN))
3177 if (!swap_avail_heads)
3180 p = alloc_swap_info();
3184 INIT_WORK(&p->discard_work, swap_discard_work);
3186 name = getname(specialfile);
3188 error = PTR_ERR(name);
3192 swap_file = file_open_name(name, O_RDWR|O_LARGEFILE, 0);
3193 if (IS_ERR(swap_file)) {
3194 error = PTR_ERR(swap_file);
3199 p->swap_file = swap_file;
3200 mapping = swap_file->f_mapping;
3201 inode = mapping->host;
3203 error = claim_swapfile(p, inode);
3204 if (unlikely(error))
3208 if (IS_SWAPFILE(inode)) {
3210 goto bad_swap_unlock_inode;
3214 * Read the swap header.
3216 if (!mapping->a_ops->readpage) {
3218 goto bad_swap_unlock_inode;
3220 page = read_mapping_page(mapping, 0, swap_file);
3222 error = PTR_ERR(page);
3223 goto bad_swap_unlock_inode;
3225 swap_header = kmap(page);
3227 maxpages = read_swap_header(p, swap_header, inode);
3228 if (unlikely(!maxpages)) {
3230 goto bad_swap_unlock_inode;
3233 /* OK, set up the swap map and apply the bad block list */
3234 swap_map = vzalloc(maxpages);
3237 goto bad_swap_unlock_inode;
3240 if (bdi_cap_stable_pages_required(inode_to_bdi(inode)))
3241 p->flags |= SWP_STABLE_WRITES;
3243 if (bdi_cap_synchronous_io(inode_to_bdi(inode)))
3244 p->flags |= SWP_SYNCHRONOUS_IO;
3246 if (p->bdev && blk_queue_nonrot(bdev_get_queue(p->bdev))) {
3248 unsigned long ci, nr_cluster;
3250 p->flags |= SWP_SOLIDSTATE;
3251 p->cluster_next_cpu = alloc_percpu(unsigned int);
3252 if (!p->cluster_next_cpu) {
3254 goto bad_swap_unlock_inode;
3257 * select a random position to start with to help wear leveling
3260 for_each_possible_cpu(cpu) {
3261 per_cpu(*p->cluster_next_cpu, cpu) =
3262 1 + prandom_u32_max(p->highest_bit);
3264 nr_cluster = DIV_ROUND_UP(maxpages, SWAPFILE_CLUSTER);
3266 cluster_info = kvcalloc(nr_cluster, sizeof(*cluster_info),
3268 if (!cluster_info) {
3270 goto bad_swap_unlock_inode;
3273 for (ci = 0; ci < nr_cluster; ci++)
3274 spin_lock_init(&((cluster_info + ci)->lock));
3276 p->percpu_cluster = alloc_percpu(struct percpu_cluster);
3277 if (!p->percpu_cluster) {
3279 goto bad_swap_unlock_inode;
3281 for_each_possible_cpu(cpu) {
3282 struct percpu_cluster *cluster;
3283 cluster = per_cpu_ptr(p->percpu_cluster, cpu);
3284 cluster_set_null(&cluster->index);
3287 atomic_inc(&nr_rotate_swap);
3288 inced_nr_rotate_swap = true;
3291 error = swap_cgroup_swapon(p->type, maxpages);
3293 goto bad_swap_unlock_inode;
3295 nr_extents = setup_swap_map_and_extents(p, swap_header, swap_map,
3296 cluster_info, maxpages, &span);
3297 if (unlikely(nr_extents < 0)) {
3299 goto bad_swap_unlock_inode;
3301 /* frontswap enabled? set up bit-per-page map for frontswap */
3302 if (IS_ENABLED(CONFIG_FRONTSWAP))
3303 frontswap_map = kvcalloc(BITS_TO_LONGS(maxpages),
3307 if (p->bdev &&(swap_flags & SWAP_FLAG_DISCARD) && swap_discardable(p)) {
3309 * When discard is enabled for swap with no particular
3310 * policy flagged, we set all swap discard flags here in
3311 * order to sustain backward compatibility with older
3312 * swapon(8) releases.
3314 p->flags |= (SWP_DISCARDABLE | SWP_AREA_DISCARD |
3318 * By flagging sys_swapon, a sysadmin can tell us to
3319 * either do single-time area discards only, or to just
3320 * perform discards for released swap page-clusters.
3321 * Now it's time to adjust the p->flags accordingly.
3323 if (swap_flags & SWAP_FLAG_DISCARD_ONCE)
3324 p->flags &= ~SWP_PAGE_DISCARD;
3325 else if (swap_flags & SWAP_FLAG_DISCARD_PAGES)
3326 p->flags &= ~SWP_AREA_DISCARD;
3328 /* issue a swapon-time discard if it's still required */
3329 if (p->flags & SWP_AREA_DISCARD) {
3330 int err = discard_swap(p);
3332 pr_err("swapon: discard_swap(%p): %d\n",
3337 error = init_swap_address_space(p->type, maxpages);
3339 goto bad_swap_unlock_inode;
3342 * Flush any pending IO and dirty mappings before we start using this
3345 inode->i_flags |= S_SWAPFILE;
3346 error = inode_drain_writes(inode);
3348 inode->i_flags &= ~S_SWAPFILE;
3349 goto bad_swap_unlock_inode;
3352 mutex_lock(&swapon_mutex);
3354 if (swap_flags & SWAP_FLAG_PREFER)
3356 (swap_flags & SWAP_FLAG_PRIO_MASK) >> SWAP_FLAG_PRIO_SHIFT;
3357 enable_swap_info(p, prio, swap_map, cluster_info, frontswap_map);
3359 pr_info("Adding %uk swap on %s. Priority:%d extents:%d across:%lluk %s%s%s%s%s\n",
3360 p->pages<<(PAGE_SHIFT-10), name->name, p->prio,
3361 nr_extents, (unsigned long long)span<<(PAGE_SHIFT-10),
3362 (p->flags & SWP_SOLIDSTATE) ? "SS" : "",
3363 (p->flags & SWP_DISCARDABLE) ? "D" : "",
3364 (p->flags & SWP_AREA_DISCARD) ? "s" : "",
3365 (p->flags & SWP_PAGE_DISCARD) ? "c" : "",
3366 (frontswap_map) ? "FS" : "");
3368 mutex_unlock(&swapon_mutex);
3369 atomic_inc(&proc_poll_event);
3370 wake_up_interruptible(&proc_poll_wait);
3374 bad_swap_unlock_inode:
3375 inode_unlock(inode);
3377 free_percpu(p->percpu_cluster);
3378 p->percpu_cluster = NULL;
3379 free_percpu(p->cluster_next_cpu);
3380 p->cluster_next_cpu = NULL;
3381 if (inode && S_ISBLK(inode->i_mode) && p->bdev) {
3382 set_blocksize(p->bdev, p->old_block_size);
3383 blkdev_put(p->bdev, FMODE_READ | FMODE_WRITE | FMODE_EXCL);
3386 destroy_swap_extents(p);
3387 swap_cgroup_swapoff(p->type);
3388 spin_lock(&swap_lock);
3389 p->swap_file = NULL;
3391 spin_unlock(&swap_lock);
3393 kvfree(cluster_info);
3394 kvfree(frontswap_map);
3395 if (inced_nr_rotate_swap)
3396 atomic_dec(&nr_rotate_swap);
3398 filp_close(swap_file, NULL);
3400 if (page && !IS_ERR(page)) {
3407 inode_unlock(inode);
3409 enable_swap_slots_cache();
3413 void si_swapinfo(struct sysinfo *val)
3416 unsigned long nr_to_be_unused = 0;
3418 spin_lock(&swap_lock);
3419 for (type = 0; type < nr_swapfiles; type++) {
3420 struct swap_info_struct *si = swap_info[type];
3422 if ((si->flags & SWP_USED) && !(si->flags & SWP_WRITEOK))
3423 nr_to_be_unused += si->inuse_pages;
3425 val->freeswap = atomic_long_read(&nr_swap_pages) + nr_to_be_unused;
3426 val->totalswap = total_swap_pages + nr_to_be_unused;
3427 spin_unlock(&swap_lock);
3431 * Verify that a swap entry is valid and increment its swap map count.
3433 * Returns error code in following case.
3435 * - swp_entry is invalid -> EINVAL
3436 * - swp_entry is migration entry -> EINVAL
3437 * - swap-cache reference is requested but there is already one. -> EEXIST
3438 * - swap-cache reference is requested but the entry is not used. -> ENOENT
3439 * - swap-mapped reference requested but needs continued swap count. -> ENOMEM
3441 static int __swap_duplicate(swp_entry_t entry, unsigned char usage)
3443 struct swap_info_struct *p;
3444 struct swap_cluster_info *ci;
3445 unsigned long offset;
3446 unsigned char count;
3447 unsigned char has_cache;
3450 p = get_swap_device(entry);
3454 offset = swp_offset(entry);
3455 ci = lock_cluster_or_swap_info(p, offset);
3457 count = p->swap_map[offset];
3460 * swapin_readahead() doesn't check if a swap entry is valid, so the
3461 * swap entry could be SWAP_MAP_BAD. Check here with lock held.
3463 if (unlikely(swap_count(count) == SWAP_MAP_BAD)) {
3468 has_cache = count & SWAP_HAS_CACHE;
3469 count &= ~SWAP_HAS_CACHE;
3472 if (usage == SWAP_HAS_CACHE) {
3474 /* set SWAP_HAS_CACHE if there is no cache and entry is used */
3475 if (!has_cache && count)
3476 has_cache = SWAP_HAS_CACHE;
3477 else if (has_cache) /* someone else added cache */
3479 else /* no users remaining */
3482 } else if (count || has_cache) {
3484 if ((count & ~COUNT_CONTINUED) < SWAP_MAP_MAX)
3486 else if ((count & ~COUNT_CONTINUED) > SWAP_MAP_MAX)
3488 else if (swap_count_continued(p, offset, count))
3489 count = COUNT_CONTINUED;
3493 err = -ENOENT; /* unused swap entry */
3495 WRITE_ONCE(p->swap_map[offset], count | has_cache);
3498 unlock_cluster_or_swap_info(p, ci);
3506 * Help swapoff by noting that swap entry belongs to shmem/tmpfs
3507 * (in which case its reference count is never incremented).
3509 void swap_shmem_alloc(swp_entry_t entry)
3511 __swap_duplicate(entry, SWAP_MAP_SHMEM);
3515 * Increase reference count of swap entry by 1.
3516 * Returns 0 for success, or -ENOMEM if a swap_count_continuation is required
3517 * but could not be atomically allocated. Returns 0, just as if it succeeded,
3518 * if __swap_duplicate() fails for another reason (-EINVAL or -ENOENT), which
3519 * might occur if a page table entry has got corrupted.
3521 int swap_duplicate(swp_entry_t entry)
3525 while (!err && __swap_duplicate(entry, 1) == -ENOMEM)
3526 err = add_swap_count_continuation(entry, GFP_ATOMIC);
3531 * @entry: swap entry for which we allocate swap cache.
3533 * Called when allocating swap cache for existing swap entry,
3534 * This can return error codes. Returns 0 at success.
3535 * -EEXIST means there is a swap cache.
3536 * Note: return code is different from swap_duplicate().
3538 int swapcache_prepare(swp_entry_t entry)
3540 return __swap_duplicate(entry, SWAP_HAS_CACHE);
3543 struct swap_info_struct *swp_swap_info(swp_entry_t entry)
3545 return swap_type_to_swap_info(swp_type(entry));
3548 struct swap_info_struct *page_swap_info(struct page *page)
3550 swp_entry_t entry = { .val = page_private(page) };
3551 return swp_swap_info(entry);
3555 * out-of-line __page_file_ methods to avoid include hell.
3557 struct address_space *__page_file_mapping(struct page *page)
3559 return page_swap_info(page)->swap_file->f_mapping;
3561 EXPORT_SYMBOL_GPL(__page_file_mapping);
3563 pgoff_t __page_file_index(struct page *page)
3565 swp_entry_t swap = { .val = page_private(page) };
3566 return swp_offset(swap);
3568 EXPORT_SYMBOL_GPL(__page_file_index);
3571 * add_swap_count_continuation - called when a swap count is duplicated
3572 * beyond SWAP_MAP_MAX, it allocates a new page and links that to the entry's
3573 * page of the original vmalloc'ed swap_map, to hold the continuation count
3574 * (for that entry and for its neighbouring PAGE_SIZE swap entries). Called
3575 * again when count is duplicated beyond SWAP_MAP_MAX * SWAP_CONT_MAX, etc.
3577 * These continuation pages are seldom referenced: the common paths all work
3578 * on the original swap_map, only referring to a continuation page when the
3579 * low "digit" of a count is incremented or decremented through SWAP_MAP_MAX.
3581 * add_swap_count_continuation(, GFP_ATOMIC) can be called while holding
3582 * page table locks; if it fails, add_swap_count_continuation(, GFP_KERNEL)
3583 * can be called after dropping locks.
3585 int add_swap_count_continuation(swp_entry_t entry, gfp_t gfp_mask)
3587 struct swap_info_struct *si;
3588 struct swap_cluster_info *ci;
3591 struct page *list_page;
3593 unsigned char count;
3597 * When debugging, it's easier to use __GFP_ZERO here; but it's better
3598 * for latency not to zero a page while GFP_ATOMIC and holding locks.
3600 page = alloc_page(gfp_mask | __GFP_HIGHMEM);
3602 si = get_swap_device(entry);
3605 * An acceptable race has occurred since the failing
3606 * __swap_duplicate(): the swap device may be swapoff
3610 spin_lock(&si->lock);
3612 offset = swp_offset(entry);
3614 ci = lock_cluster(si, offset);
3616 count = si->swap_map[offset] & ~SWAP_HAS_CACHE;
3618 if ((count & ~COUNT_CONTINUED) != SWAP_MAP_MAX) {
3620 * The higher the swap count, the more likely it is that tasks
3621 * will race to add swap count continuation: we need to avoid
3622 * over-provisioning.
3633 * We are fortunate that although vmalloc_to_page uses pte_offset_map,
3634 * no architecture is using highmem pages for kernel page tables: so it
3635 * will not corrupt the GFP_ATOMIC caller's atomic page table kmaps.
3637 head = vmalloc_to_page(si->swap_map + offset);
3638 offset &= ~PAGE_MASK;
3640 spin_lock(&si->cont_lock);
3642 * Page allocation does not initialize the page's lru field,
3643 * but it does always reset its private field.
3645 if (!page_private(head)) {
3646 BUG_ON(count & COUNT_CONTINUED);
3647 INIT_LIST_HEAD(&head->lru);
3648 set_page_private(head, SWP_CONTINUED);
3649 si->flags |= SWP_CONTINUED;
3652 list_for_each_entry(list_page, &head->lru, lru) {
3656 * If the previous map said no continuation, but we've found
3657 * a continuation page, free our allocation and use this one.
3659 if (!(count & COUNT_CONTINUED))
3660 goto out_unlock_cont;
3662 map = kmap_atomic(list_page) + offset;
3667 * If this continuation count now has some space in it,
3668 * free our allocation and use this one.
3670 if ((count & ~COUNT_CONTINUED) != SWAP_CONT_MAX)
3671 goto out_unlock_cont;
3674 list_add_tail(&page->lru, &head->lru);
3675 page = NULL; /* now it's attached, don't free it */
3677 spin_unlock(&si->cont_lock);
3680 spin_unlock(&si->lock);
3681 put_swap_device(si);
3689 * swap_count_continued - when the original swap_map count is incremented
3690 * from SWAP_MAP_MAX, check if there is already a continuation page to carry
3691 * into, carry if so, or else fail until a new continuation page is allocated;
3692 * when the original swap_map count is decremented from 0 with continuation,
3693 * borrow from the continuation and report whether it still holds more.
3694 * Called while __swap_duplicate() or swap_entry_free() holds swap or cluster
3697 static bool swap_count_continued(struct swap_info_struct *si,
3698 pgoff_t offset, unsigned char count)
3705 head = vmalloc_to_page(si->swap_map + offset);
3706 if (page_private(head) != SWP_CONTINUED) {
3707 BUG_ON(count & COUNT_CONTINUED);
3708 return false; /* need to add count continuation */
3711 spin_lock(&si->cont_lock);
3712 offset &= ~PAGE_MASK;
3713 page = list_next_entry(head, lru);
3714 map = kmap_atomic(page) + offset;
3716 if (count == SWAP_MAP_MAX) /* initial increment from swap_map */
3717 goto init_map; /* jump over SWAP_CONT_MAX checks */
3719 if (count == (SWAP_MAP_MAX | COUNT_CONTINUED)) { /* incrementing */
3721 * Think of how you add 1 to 999
3723 while (*map == (SWAP_CONT_MAX | COUNT_CONTINUED)) {
3725 page = list_next_entry(page, lru);
3726 BUG_ON(page == head);
3727 map = kmap_atomic(page) + offset;
3729 if (*map == SWAP_CONT_MAX) {
3731 page = list_next_entry(page, lru);
3733 ret = false; /* add count continuation */
3736 map = kmap_atomic(page) + offset;
3737 init_map: *map = 0; /* we didn't zero the page */
3741 while ((page = list_prev_entry(page, lru)) != head) {
3742 map = kmap_atomic(page) + offset;
3743 *map = COUNT_CONTINUED;
3746 ret = true; /* incremented */
3748 } else { /* decrementing */
3750 * Think of how you subtract 1 from 1000
3752 BUG_ON(count != COUNT_CONTINUED);
3753 while (*map == COUNT_CONTINUED) {
3755 page = list_next_entry(page, lru);
3756 BUG_ON(page == head);
3757 map = kmap_atomic(page) + offset;
3764 while ((page = list_prev_entry(page, lru)) != head) {
3765 map = kmap_atomic(page) + offset;
3766 *map = SWAP_CONT_MAX | count;
3767 count = COUNT_CONTINUED;
3770 ret = count == COUNT_CONTINUED;
3773 spin_unlock(&si->cont_lock);
3778 * free_swap_count_continuations - swapoff free all the continuation pages
3779 * appended to the swap_map, after swap_map is quiesced, before vfree'ing it.
3781 static void free_swap_count_continuations(struct swap_info_struct *si)
3785 for (offset = 0; offset < si->max; offset += PAGE_SIZE) {
3787 head = vmalloc_to_page(si->swap_map + offset);
3788 if (page_private(head)) {
3789 struct page *page, *next;
3791 list_for_each_entry_safe(page, next, &head->lru, lru) {
3792 list_del(&page->lru);
3799 #if defined(CONFIG_MEMCG) && defined(CONFIG_BLK_CGROUP)
3800 void cgroup_throttle_swaprate(struct page *page, gfp_t gfp_mask)
3802 struct swap_info_struct *si, *next;
3803 int nid = page_to_nid(page);
3805 if (!(gfp_mask & __GFP_IO))
3808 if (!blk_cgroup_congested())
3812 * We've already scheduled a throttle, avoid taking the global swap
3815 if (current->throttle_queue)
3818 spin_lock(&swap_avail_lock);
3819 plist_for_each_entry_safe(si, next, &swap_avail_heads[nid],
3822 blkcg_schedule_throttle(bdev_get_queue(si->bdev), true);
3826 spin_unlock(&swap_avail_lock);
3830 static int __init swapfile_init(void)
3834 swap_avail_heads = kmalloc_array(nr_node_ids, sizeof(struct plist_head),
3836 if (!swap_avail_heads) {
3837 pr_emerg("Not enough memory for swap heads, swap is disabled\n");
3842 plist_head_init(&swap_avail_heads[nid]);
3846 subsys_initcall(swapfile_init);