Commit | Line | Data |
---|---|---|
457c8996 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
1da177e4 LT |
2 | /* |
3 | * linux/mm/swapfile.c | |
4 | * | |
5 | * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds | |
6 | * Swap reorganised 29.12.95, Stephen Tweedie | |
7 | */ | |
8 | ||
1da177e4 | 9 | #include <linux/mm.h> |
6e84f315 | 10 | #include <linux/sched/mm.h> |
29930025 | 11 | #include <linux/sched/task.h> |
1da177e4 LT |
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> | |
072441e2 | 20 | #include <linux/shmem_fs.h> |
e41d12f5 | 21 | #include <linux/blk-cgroup.h> |
20137a49 | 22 | #include <linux/random.h> |
1da177e4 LT |
23 | #include <linux/writeback.h> |
24 | #include <linux/proc_fs.h> | |
25 | #include <linux/seq_file.h> | |
26 | #include <linux/init.h> | |
5ad64688 | 27 | #include <linux/ksm.h> |
1da177e4 LT |
28 | #include <linux/rmap.h> |
29 | #include <linux/security.h> | |
30 | #include <linux/backing-dev.h> | |
fc0abb14 | 31 | #include <linux/mutex.h> |
c59ede7b | 32 | #include <linux/capability.h> |
1da177e4 | 33 | #include <linux/syscalls.h> |
8a9f3ccd | 34 | #include <linux/memcontrol.h> |
66d7dd51 | 35 | #include <linux/poll.h> |
72788c38 | 36 | #include <linux/oom.h> |
38b5faf4 DM |
37 | #include <linux/frontswap.h> |
38 | #include <linux/swapfile.h> | |
f981c595 | 39 | #include <linux/export.h> |
67afa38e | 40 | #include <linux/swap_slots.h> |
155b5f88 | 41 | #include <linux/sort.h> |
63d8620e | 42 | #include <linux/completion.h> |
1da177e4 | 43 | |
1da177e4 LT |
44 | #include <asm/tlbflush.h> |
45 | #include <linux/swapops.h> | |
5d1ea48b | 46 | #include <linux/swap_cgroup.h> |
1da177e4 | 47 | |
570a335b HD |
48 | static bool swap_count_continued(struct swap_info_struct *, pgoff_t, |
49 | unsigned char); | |
50 | static void free_swap_count_continuations(struct swap_info_struct *); | |
51 | ||
38b5faf4 | 52 | DEFINE_SPINLOCK(swap_lock); |
7c363b8c | 53 | static unsigned int nr_swapfiles; |
ec8acf20 | 54 | atomic_long_t nr_swap_pages; |
fb0fec50 CW |
55 | /* |
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. | |
59 | */ | |
60 | EXPORT_SYMBOL_GPL(nr_swap_pages); | |
ec8acf20 | 61 | /* protected with swap_lock. reading in vm_swap_full() doesn't need lock */ |
1da177e4 | 62 | long total_swap_pages; |
a2468cc9 | 63 | static int least_priority = -1; |
1da177e4 | 64 | |
1da177e4 LT |
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 "; | |
69 | ||
adfab836 DS |
70 | /* |
71 | * all active swap_info_structs | |
72 | * protected with swap_lock, and ordered by priority. | |
73 | */ | |
18ab4d4c DS |
74 | PLIST_HEAD(swap_active_head); |
75 | ||
76 | /* | |
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. | |
87 | */ | |
bfc6b1ca | 88 | static struct plist_head *swap_avail_heads; |
18ab4d4c | 89 | static DEFINE_SPINLOCK(swap_avail_lock); |
1da177e4 | 90 | |
38b5faf4 | 91 | struct swap_info_struct *swap_info[MAX_SWAPFILES]; |
1da177e4 | 92 | |
fc0abb14 | 93 | static DEFINE_MUTEX(swapon_mutex); |
1da177e4 | 94 | |
66d7dd51 KS |
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); | |
98 | ||
81a0298b HY |
99 | atomic_t nr_rotate_swap = ATOMIC_INIT(0); |
100 | ||
c10d38cc DJ |
101 | static struct swap_info_struct *swap_type_to_swap_info(int type) |
102 | { | |
a4b45114 | 103 | if (type >= MAX_SWAPFILES) |
c10d38cc DJ |
104 | return NULL; |
105 | ||
a4b45114 | 106 | return READ_ONCE(swap_info[type]); /* rcu_dereference() */ |
c10d38cc DJ |
107 | } |
108 | ||
8d69aaee | 109 | static inline unsigned char swap_count(unsigned char ent) |
355cfa73 | 110 | { |
955c97f0 | 111 | return ent & ~SWAP_HAS_CACHE; /* may include COUNT_CONTINUED flag */ |
355cfa73 KH |
112 | } |
113 | ||
bcd49e86 HY |
114 | /* Reclaim the swap entry anyway if possible */ |
115 | #define TTRS_ANYWAY 0x1 | |
116 | /* | |
117 | * Reclaim the swap entry if there are no more mappings of the | |
118 | * corresponding page | |
119 | */ | |
120 | #define TTRS_UNMAPPED 0x2 | |
121 | /* Reclaim the swap entry if swap is getting full*/ | |
122 | #define TTRS_FULL 0x4 | |
123 | ||
efa90a98 | 124 | /* returns 1 if swap entry is freed */ |
bcd49e86 HY |
125 | static int __try_to_reclaim_swap(struct swap_info_struct *si, |
126 | unsigned long offset, unsigned long flags) | |
c9e44410 | 127 | { |
efa90a98 | 128 | swp_entry_t entry = swp_entry(si->type, offset); |
c9e44410 KH |
129 | struct page *page; |
130 | int ret = 0; | |
131 | ||
bcd49e86 | 132 | page = find_get_page(swap_address_space(entry), offset); |
c9e44410 KH |
133 | if (!page) |
134 | return 0; | |
135 | /* | |
bcd49e86 HY |
136 | * When this function is called from scan_swap_map_slots() and it's |
137 | * called by vmscan.c at reclaiming pages. So, we hold a lock on a page, | |
138 | * here. We have to use trylock for avoiding deadlock. This is a special | |
c9e44410 KH |
139 | * case and you should use try_to_free_swap() with explicit lock_page() |
140 | * in usual operations. | |
141 | */ | |
142 | if (trylock_page(page)) { | |
bcd49e86 HY |
143 | if ((flags & TTRS_ANYWAY) || |
144 | ((flags & TTRS_UNMAPPED) && !page_mapped(page)) || | |
145 | ((flags & TTRS_FULL) && mem_cgroup_swap_full(page))) | |
146 | ret = try_to_free_swap(page); | |
c9e44410 KH |
147 | unlock_page(page); |
148 | } | |
09cbfeaf | 149 | put_page(page); |
c9e44410 KH |
150 | return ret; |
151 | } | |
355cfa73 | 152 | |
4efaceb1 AL |
153 | static inline struct swap_extent *first_se(struct swap_info_struct *sis) |
154 | { | |
155 | struct rb_node *rb = rb_first(&sis->swap_extent_root); | |
156 | return rb_entry(rb, struct swap_extent, rb_node); | |
157 | } | |
158 | ||
159 | static inline struct swap_extent *next_se(struct swap_extent *se) | |
160 | { | |
161 | struct rb_node *rb = rb_next(&se->rb_node); | |
162 | return rb ? rb_entry(rb, struct swap_extent, rb_node) : NULL; | |
163 | } | |
164 | ||
6a6ba831 HD |
165 | /* |
166 | * swapon tell device that all the old swap contents can be discarded, | |
167 | * to allow the swap device to optimize its wear-levelling. | |
168 | */ | |
169 | static int discard_swap(struct swap_info_struct *si) | |
170 | { | |
171 | struct swap_extent *se; | |
9625a5f2 HD |
172 | sector_t start_block; |
173 | sector_t nr_blocks; | |
6a6ba831 HD |
174 | int err = 0; |
175 | ||
9625a5f2 | 176 | /* Do not discard the swap header page! */ |
4efaceb1 | 177 | se = first_se(si); |
9625a5f2 HD |
178 | start_block = (se->start_block + 1) << (PAGE_SHIFT - 9); |
179 | nr_blocks = ((sector_t)se->nr_pages - 1) << (PAGE_SHIFT - 9); | |
180 | if (nr_blocks) { | |
181 | err = blkdev_issue_discard(si->bdev, start_block, | |
dd3932ed | 182 | nr_blocks, GFP_KERNEL, 0); |
9625a5f2 HD |
183 | if (err) |
184 | return err; | |
185 | cond_resched(); | |
186 | } | |
6a6ba831 | 187 | |
4efaceb1 | 188 | for (se = next_se(se); se; se = next_se(se)) { |
9625a5f2 HD |
189 | start_block = se->start_block << (PAGE_SHIFT - 9); |
190 | nr_blocks = (sector_t)se->nr_pages << (PAGE_SHIFT - 9); | |
6a6ba831 HD |
191 | |
192 | err = blkdev_issue_discard(si->bdev, start_block, | |
dd3932ed | 193 | nr_blocks, GFP_KERNEL, 0); |
6a6ba831 HD |
194 | if (err) |
195 | break; | |
196 | ||
197 | cond_resched(); | |
198 | } | |
199 | return err; /* That will often be -EOPNOTSUPP */ | |
200 | } | |
201 | ||
4efaceb1 AL |
202 | static struct swap_extent * |
203 | offset_to_swap_extent(struct swap_info_struct *sis, unsigned long offset) | |
204 | { | |
205 | struct swap_extent *se; | |
206 | struct rb_node *rb; | |
207 | ||
208 | rb = sis->swap_extent_root.rb_node; | |
209 | while (rb) { | |
210 | se = rb_entry(rb, struct swap_extent, rb_node); | |
211 | if (offset < se->start_page) | |
212 | rb = rb->rb_left; | |
213 | else if (offset >= se->start_page + se->nr_pages) | |
214 | rb = rb->rb_right; | |
215 | else | |
216 | return se; | |
217 | } | |
218 | /* It *must* be present */ | |
219 | BUG(); | |
220 | } | |
221 | ||
caf6912f JA |
222 | sector_t swap_page_sector(struct page *page) |
223 | { | |
224 | struct swap_info_struct *sis = page_swap_info(page); | |
225 | struct swap_extent *se; | |
226 | sector_t sector; | |
227 | pgoff_t offset; | |
228 | ||
229 | offset = __page_file_index(page); | |
230 | se = offset_to_swap_extent(sis, offset); | |
231 | sector = se->start_block + (offset - se->start_page); | |
232 | return sector << (PAGE_SHIFT - 9); | |
233 | } | |
234 | ||
7992fde7 HD |
235 | /* |
236 | * swap allocation tell device that a cluster of swap can now be discarded, | |
237 | * to allow the swap device to optimize its wear-levelling. | |
238 | */ | |
239 | static void discard_swap_cluster(struct swap_info_struct *si, | |
240 | pgoff_t start_page, pgoff_t nr_pages) | |
241 | { | |
4efaceb1 | 242 | struct swap_extent *se = offset_to_swap_extent(si, start_page); |
7992fde7 HD |
243 | |
244 | while (nr_pages) { | |
4efaceb1 AL |
245 | pgoff_t offset = start_page - se->start_page; |
246 | sector_t start_block = se->start_block + offset; | |
247 | sector_t nr_blocks = se->nr_pages - offset; | |
248 | ||
249 | if (nr_blocks > nr_pages) | |
250 | nr_blocks = nr_pages; | |
251 | start_page += nr_blocks; | |
252 | nr_pages -= nr_blocks; | |
253 | ||
254 | start_block <<= PAGE_SHIFT - 9; | |
255 | nr_blocks <<= PAGE_SHIFT - 9; | |
256 | if (blkdev_issue_discard(si->bdev, start_block, | |
257 | nr_blocks, GFP_NOIO, 0)) | |
258 | break; | |
7992fde7 | 259 | |
4efaceb1 | 260 | se = next_se(se); |
7992fde7 HD |
261 | } |
262 | } | |
263 | ||
38d8b4e6 HY |
264 | #ifdef CONFIG_THP_SWAP |
265 | #define SWAPFILE_CLUSTER HPAGE_PMD_NR | |
a448f2d0 HY |
266 | |
267 | #define swap_entry_size(size) (size) | |
38d8b4e6 | 268 | #else |
048c27fd | 269 | #define SWAPFILE_CLUSTER 256 |
a448f2d0 HY |
270 | |
271 | /* | |
272 | * Define swap_entry_size() as constant to let compiler to optimize | |
273 | * out some code if !CONFIG_THP_SWAP | |
274 | */ | |
275 | #define swap_entry_size(size) 1 | |
38d8b4e6 | 276 | #endif |
048c27fd HD |
277 | #define LATENCY_LIMIT 256 |
278 | ||
2a8f9449 SL |
279 | static inline void cluster_set_flag(struct swap_cluster_info *info, |
280 | unsigned int flag) | |
281 | { | |
282 | info->flags = flag; | |
283 | } | |
284 | ||
285 | static inline unsigned int cluster_count(struct swap_cluster_info *info) | |
286 | { | |
287 | return info->data; | |
288 | } | |
289 | ||
290 | static inline void cluster_set_count(struct swap_cluster_info *info, | |
291 | unsigned int c) | |
292 | { | |
293 | info->data = c; | |
294 | } | |
295 | ||
296 | static inline void cluster_set_count_flag(struct swap_cluster_info *info, | |
297 | unsigned int c, unsigned int f) | |
298 | { | |
299 | info->flags = f; | |
300 | info->data = c; | |
301 | } | |
302 | ||
303 | static inline unsigned int cluster_next(struct swap_cluster_info *info) | |
304 | { | |
305 | return info->data; | |
306 | } | |
307 | ||
308 | static inline void cluster_set_next(struct swap_cluster_info *info, | |
309 | unsigned int n) | |
310 | { | |
311 | info->data = n; | |
312 | } | |
313 | ||
314 | static inline void cluster_set_next_flag(struct swap_cluster_info *info, | |
315 | unsigned int n, unsigned int f) | |
316 | { | |
317 | info->flags = f; | |
318 | info->data = n; | |
319 | } | |
320 | ||
321 | static inline bool cluster_is_free(struct swap_cluster_info *info) | |
322 | { | |
323 | return info->flags & CLUSTER_FLAG_FREE; | |
324 | } | |
325 | ||
326 | static inline bool cluster_is_null(struct swap_cluster_info *info) | |
327 | { | |
328 | return info->flags & CLUSTER_FLAG_NEXT_NULL; | |
329 | } | |
330 | ||
331 | static inline void cluster_set_null(struct swap_cluster_info *info) | |
332 | { | |
333 | info->flags = CLUSTER_FLAG_NEXT_NULL; | |
334 | info->data = 0; | |
335 | } | |
336 | ||
e0709829 HY |
337 | static inline bool cluster_is_huge(struct swap_cluster_info *info) |
338 | { | |
33ee011e HY |
339 | if (IS_ENABLED(CONFIG_THP_SWAP)) |
340 | return info->flags & CLUSTER_FLAG_HUGE; | |
341 | return false; | |
e0709829 HY |
342 | } |
343 | ||
344 | static inline void cluster_clear_huge(struct swap_cluster_info *info) | |
345 | { | |
346 | info->flags &= ~CLUSTER_FLAG_HUGE; | |
347 | } | |
348 | ||
235b6217 HY |
349 | static inline struct swap_cluster_info *lock_cluster(struct swap_info_struct *si, |
350 | unsigned long offset) | |
351 | { | |
352 | struct swap_cluster_info *ci; | |
353 | ||
354 | ci = si->cluster_info; | |
355 | if (ci) { | |
356 | ci += offset / SWAPFILE_CLUSTER; | |
357 | spin_lock(&ci->lock); | |
358 | } | |
359 | return ci; | |
360 | } | |
361 | ||
362 | static inline void unlock_cluster(struct swap_cluster_info *ci) | |
363 | { | |
364 | if (ci) | |
365 | spin_unlock(&ci->lock); | |
366 | } | |
367 | ||
59d98bf3 HY |
368 | /* |
369 | * Determine the locking method in use for this device. Return | |
370 | * swap_cluster_info if SSD-style cluster-based locking is in place. | |
371 | */ | |
235b6217 | 372 | static inline struct swap_cluster_info *lock_cluster_or_swap_info( |
59d98bf3 | 373 | struct swap_info_struct *si, unsigned long offset) |
235b6217 HY |
374 | { |
375 | struct swap_cluster_info *ci; | |
376 | ||
59d98bf3 | 377 | /* Try to use fine-grained SSD-style locking if available: */ |
235b6217 | 378 | ci = lock_cluster(si, offset); |
59d98bf3 | 379 | /* Otherwise, fall back to traditional, coarse locking: */ |
235b6217 HY |
380 | if (!ci) |
381 | spin_lock(&si->lock); | |
382 | ||
383 | return ci; | |
384 | } | |
385 | ||
386 | static inline void unlock_cluster_or_swap_info(struct swap_info_struct *si, | |
387 | struct swap_cluster_info *ci) | |
388 | { | |
389 | if (ci) | |
390 | unlock_cluster(ci); | |
391 | else | |
392 | spin_unlock(&si->lock); | |
393 | } | |
394 | ||
6b534915 HY |
395 | static inline bool cluster_list_empty(struct swap_cluster_list *list) |
396 | { | |
397 | return cluster_is_null(&list->head); | |
398 | } | |
399 | ||
400 | static inline unsigned int cluster_list_first(struct swap_cluster_list *list) | |
401 | { | |
402 | return cluster_next(&list->head); | |
403 | } | |
404 | ||
405 | static void cluster_list_init(struct swap_cluster_list *list) | |
406 | { | |
407 | cluster_set_null(&list->head); | |
408 | cluster_set_null(&list->tail); | |
409 | } | |
410 | ||
411 | static void cluster_list_add_tail(struct swap_cluster_list *list, | |
412 | struct swap_cluster_info *ci, | |
413 | unsigned int idx) | |
414 | { | |
415 | if (cluster_list_empty(list)) { | |
416 | cluster_set_next_flag(&list->head, idx, 0); | |
417 | cluster_set_next_flag(&list->tail, idx, 0); | |
418 | } else { | |
235b6217 | 419 | struct swap_cluster_info *ci_tail; |
6b534915 HY |
420 | unsigned int tail = cluster_next(&list->tail); |
421 | ||
235b6217 HY |
422 | /* |
423 | * Nested cluster lock, but both cluster locks are | |
424 | * only acquired when we held swap_info_struct->lock | |
425 | */ | |
426 | ci_tail = ci + tail; | |
427 | spin_lock_nested(&ci_tail->lock, SINGLE_DEPTH_NESTING); | |
428 | cluster_set_next(ci_tail, idx); | |
0ef017d1 | 429 | spin_unlock(&ci_tail->lock); |
6b534915 HY |
430 | cluster_set_next_flag(&list->tail, idx, 0); |
431 | } | |
432 | } | |
433 | ||
434 | static unsigned int cluster_list_del_first(struct swap_cluster_list *list, | |
435 | struct swap_cluster_info *ci) | |
436 | { | |
437 | unsigned int idx; | |
438 | ||
439 | idx = cluster_next(&list->head); | |
440 | if (cluster_next(&list->tail) == idx) { | |
441 | cluster_set_null(&list->head); | |
442 | cluster_set_null(&list->tail); | |
443 | } else | |
444 | cluster_set_next_flag(&list->head, | |
445 | cluster_next(&ci[idx]), 0); | |
446 | ||
447 | return idx; | |
448 | } | |
449 | ||
815c2c54 SL |
450 | /* Add a cluster to discard list and schedule it to do discard */ |
451 | static void swap_cluster_schedule_discard(struct swap_info_struct *si, | |
452 | unsigned int idx) | |
453 | { | |
454 | /* | |
bb243f7d | 455 | * If scan_swap_map_slots() can't find a free cluster, it will check |
815c2c54 | 456 | * si->swap_map directly. To make sure the discarding cluster isn't |
bb243f7d ML |
457 | * taken by scan_swap_map_slots(), mark the swap entries bad (occupied). |
458 | * It will be cleared after discard | |
815c2c54 SL |
459 | */ |
460 | memset(si->swap_map + idx * SWAPFILE_CLUSTER, | |
461 | SWAP_MAP_BAD, SWAPFILE_CLUSTER); | |
462 | ||
6b534915 | 463 | cluster_list_add_tail(&si->discard_clusters, si->cluster_info, idx); |
815c2c54 SL |
464 | |
465 | schedule_work(&si->discard_work); | |
466 | } | |
467 | ||
38d8b4e6 HY |
468 | static void __free_cluster(struct swap_info_struct *si, unsigned long idx) |
469 | { | |
470 | struct swap_cluster_info *ci = si->cluster_info; | |
471 | ||
472 | cluster_set_flag(ci + idx, CLUSTER_FLAG_FREE); | |
473 | cluster_list_add_tail(&si->free_clusters, ci, idx); | |
474 | } | |
475 | ||
815c2c54 SL |
476 | /* |
477 | * Doing discard actually. After a cluster discard is finished, the cluster | |
478 | * will be added to free cluster list. caller should hold si->lock. | |
479 | */ | |
480 | static void swap_do_scheduled_discard(struct swap_info_struct *si) | |
481 | { | |
235b6217 | 482 | struct swap_cluster_info *info, *ci; |
815c2c54 SL |
483 | unsigned int idx; |
484 | ||
485 | info = si->cluster_info; | |
486 | ||
6b534915 HY |
487 | while (!cluster_list_empty(&si->discard_clusters)) { |
488 | idx = cluster_list_del_first(&si->discard_clusters, info); | |
815c2c54 SL |
489 | spin_unlock(&si->lock); |
490 | ||
491 | discard_swap_cluster(si, idx * SWAPFILE_CLUSTER, | |
492 | SWAPFILE_CLUSTER); | |
493 | ||
494 | spin_lock(&si->lock); | |
235b6217 | 495 | ci = lock_cluster(si, idx * SWAPFILE_CLUSTER); |
38d8b4e6 | 496 | __free_cluster(si, idx); |
815c2c54 SL |
497 | memset(si->swap_map + idx * SWAPFILE_CLUSTER, |
498 | 0, SWAPFILE_CLUSTER); | |
235b6217 | 499 | unlock_cluster(ci); |
815c2c54 SL |
500 | } |
501 | } | |
502 | ||
503 | static void swap_discard_work(struct work_struct *work) | |
504 | { | |
505 | struct swap_info_struct *si; | |
506 | ||
507 | si = container_of(work, struct swap_info_struct, discard_work); | |
508 | ||
509 | spin_lock(&si->lock); | |
510 | swap_do_scheduled_discard(si); | |
511 | spin_unlock(&si->lock); | |
512 | } | |
513 | ||
63d8620e ML |
514 | static void swap_users_ref_free(struct percpu_ref *ref) |
515 | { | |
516 | struct swap_info_struct *si; | |
517 | ||
518 | si = container_of(ref, struct swap_info_struct, users); | |
519 | complete(&si->comp); | |
520 | } | |
521 | ||
38d8b4e6 HY |
522 | static void alloc_cluster(struct swap_info_struct *si, unsigned long idx) |
523 | { | |
524 | struct swap_cluster_info *ci = si->cluster_info; | |
525 | ||
526 | VM_BUG_ON(cluster_list_first(&si->free_clusters) != idx); | |
527 | cluster_list_del_first(&si->free_clusters, ci); | |
528 | cluster_set_count_flag(ci + idx, 0, 0); | |
529 | } | |
530 | ||
531 | static void free_cluster(struct swap_info_struct *si, unsigned long idx) | |
532 | { | |
533 | struct swap_cluster_info *ci = si->cluster_info + idx; | |
534 | ||
535 | VM_BUG_ON(cluster_count(ci) != 0); | |
536 | /* | |
537 | * If the swap is discardable, prepare discard the cluster | |
538 | * instead of free it immediately. The cluster will be freed | |
539 | * after discard. | |
540 | */ | |
541 | if ((si->flags & (SWP_WRITEOK | SWP_PAGE_DISCARD)) == | |
542 | (SWP_WRITEOK | SWP_PAGE_DISCARD)) { | |
543 | swap_cluster_schedule_discard(si, idx); | |
544 | return; | |
545 | } | |
546 | ||
547 | __free_cluster(si, idx); | |
548 | } | |
549 | ||
2a8f9449 SL |
550 | /* |
551 | * The cluster corresponding to page_nr will be used. The cluster will be | |
552 | * removed from free cluster list and its usage counter will be increased. | |
553 | */ | |
554 | static void inc_cluster_info_page(struct swap_info_struct *p, | |
555 | struct swap_cluster_info *cluster_info, unsigned long page_nr) | |
556 | { | |
557 | unsigned long idx = page_nr / SWAPFILE_CLUSTER; | |
558 | ||
559 | if (!cluster_info) | |
560 | return; | |
38d8b4e6 HY |
561 | if (cluster_is_free(&cluster_info[idx])) |
562 | alloc_cluster(p, idx); | |
2a8f9449 SL |
563 | |
564 | VM_BUG_ON(cluster_count(&cluster_info[idx]) >= SWAPFILE_CLUSTER); | |
565 | cluster_set_count(&cluster_info[idx], | |
566 | cluster_count(&cluster_info[idx]) + 1); | |
567 | } | |
568 | ||
569 | /* | |
570 | * The cluster corresponding to page_nr decreases one usage. If the usage | |
571 | * counter becomes 0, which means no page in the cluster is in using, we can | |
572 | * optionally discard the cluster and add it to free cluster list. | |
573 | */ | |
574 | static void dec_cluster_info_page(struct swap_info_struct *p, | |
575 | struct swap_cluster_info *cluster_info, unsigned long page_nr) | |
576 | { | |
577 | unsigned long idx = page_nr / SWAPFILE_CLUSTER; | |
578 | ||
579 | if (!cluster_info) | |
580 | return; | |
581 | ||
582 | VM_BUG_ON(cluster_count(&cluster_info[idx]) == 0); | |
583 | cluster_set_count(&cluster_info[idx], | |
584 | cluster_count(&cluster_info[idx]) - 1); | |
585 | ||
38d8b4e6 HY |
586 | if (cluster_count(&cluster_info[idx]) == 0) |
587 | free_cluster(p, idx); | |
2a8f9449 SL |
588 | } |
589 | ||
590 | /* | |
bb243f7d | 591 | * It's possible scan_swap_map_slots() uses a free cluster in the middle of free |
2a8f9449 SL |
592 | * cluster list. Avoiding such abuse to avoid list corruption. |
593 | */ | |
ebc2a1a6 SL |
594 | static bool |
595 | scan_swap_map_ssd_cluster_conflict(struct swap_info_struct *si, | |
2a8f9449 SL |
596 | unsigned long offset) |
597 | { | |
ebc2a1a6 SL |
598 | struct percpu_cluster *percpu_cluster; |
599 | bool conflict; | |
600 | ||
2a8f9449 | 601 | offset /= SWAPFILE_CLUSTER; |
6b534915 HY |
602 | conflict = !cluster_list_empty(&si->free_clusters) && |
603 | offset != cluster_list_first(&si->free_clusters) && | |
2a8f9449 | 604 | cluster_is_free(&si->cluster_info[offset]); |
ebc2a1a6 SL |
605 | |
606 | if (!conflict) | |
607 | return false; | |
608 | ||
609 | percpu_cluster = this_cpu_ptr(si->percpu_cluster); | |
610 | cluster_set_null(&percpu_cluster->index); | |
611 | return true; | |
612 | } | |
613 | ||
614 | /* | |
615 | * Try to get a swap entry from current cpu's swap entry pool (a cluster). This | |
616 | * might involve allocating a new cluster for current CPU too. | |
617 | */ | |
36005bae | 618 | static bool scan_swap_map_try_ssd_cluster(struct swap_info_struct *si, |
ebc2a1a6 SL |
619 | unsigned long *offset, unsigned long *scan_base) |
620 | { | |
621 | struct percpu_cluster *cluster; | |
235b6217 | 622 | struct swap_cluster_info *ci; |
235b6217 | 623 | unsigned long tmp, max; |
ebc2a1a6 SL |
624 | |
625 | new_cluster: | |
626 | cluster = this_cpu_ptr(si->percpu_cluster); | |
627 | if (cluster_is_null(&cluster->index)) { | |
6b534915 HY |
628 | if (!cluster_list_empty(&si->free_clusters)) { |
629 | cluster->index = si->free_clusters.head; | |
ebc2a1a6 SL |
630 | cluster->next = cluster_next(&cluster->index) * |
631 | SWAPFILE_CLUSTER; | |
6b534915 | 632 | } else if (!cluster_list_empty(&si->discard_clusters)) { |
ebc2a1a6 SL |
633 | /* |
634 | * we don't have free cluster but have some clusters in | |
49070588 HY |
635 | * discarding, do discard now and reclaim them, then |
636 | * reread cluster_next_cpu since we dropped si->lock | |
ebc2a1a6 SL |
637 | */ |
638 | swap_do_scheduled_discard(si); | |
49070588 HY |
639 | *scan_base = this_cpu_read(*si->cluster_next_cpu); |
640 | *offset = *scan_base; | |
ebc2a1a6 SL |
641 | goto new_cluster; |
642 | } else | |
36005bae | 643 | return false; |
ebc2a1a6 SL |
644 | } |
645 | ||
ebc2a1a6 SL |
646 | /* |
647 | * Other CPUs can use our cluster if they can't find a free cluster, | |
648 | * check if there is still free entry in the cluster | |
649 | */ | |
650 | tmp = cluster->next; | |
235b6217 HY |
651 | max = min_t(unsigned long, si->max, |
652 | (cluster_next(&cluster->index) + 1) * SWAPFILE_CLUSTER); | |
7b9e2de1 WY |
653 | if (tmp < max) { |
654 | ci = lock_cluster(si, tmp); | |
655 | while (tmp < max) { | |
656 | if (!si->swap_map[tmp]) | |
657 | break; | |
658 | tmp++; | |
659 | } | |
660 | unlock_cluster(ci); | |
ebc2a1a6 | 661 | } |
0fd0e19e | 662 | if (tmp >= max) { |
ebc2a1a6 SL |
663 | cluster_set_null(&cluster->index); |
664 | goto new_cluster; | |
665 | } | |
666 | cluster->next = tmp + 1; | |
667 | *offset = tmp; | |
668 | *scan_base = tmp; | |
fdff1deb | 669 | return true; |
2a8f9449 SL |
670 | } |
671 | ||
a2468cc9 AL |
672 | static void __del_from_avail_list(struct swap_info_struct *p) |
673 | { | |
674 | int nid; | |
675 | ||
676 | for_each_node(nid) | |
677 | plist_del(&p->avail_lists[nid], &swap_avail_heads[nid]); | |
678 | } | |
679 | ||
680 | static void del_from_avail_list(struct swap_info_struct *p) | |
681 | { | |
682 | spin_lock(&swap_avail_lock); | |
683 | __del_from_avail_list(p); | |
684 | spin_unlock(&swap_avail_lock); | |
685 | } | |
686 | ||
38d8b4e6 HY |
687 | static void swap_range_alloc(struct swap_info_struct *si, unsigned long offset, |
688 | unsigned int nr_entries) | |
689 | { | |
690 | unsigned int end = offset + nr_entries - 1; | |
691 | ||
692 | if (offset == si->lowest_bit) | |
693 | si->lowest_bit += nr_entries; | |
694 | if (end == si->highest_bit) | |
a449bf58 | 695 | WRITE_ONCE(si->highest_bit, si->highest_bit - nr_entries); |
38d8b4e6 HY |
696 | si->inuse_pages += nr_entries; |
697 | if (si->inuse_pages == si->pages) { | |
698 | si->lowest_bit = si->max; | |
699 | si->highest_bit = 0; | |
a2468cc9 | 700 | del_from_avail_list(si); |
38d8b4e6 HY |
701 | } |
702 | } | |
703 | ||
a2468cc9 AL |
704 | static void add_to_avail_list(struct swap_info_struct *p) |
705 | { | |
706 | int nid; | |
707 | ||
708 | spin_lock(&swap_avail_lock); | |
709 | for_each_node(nid) { | |
710 | WARN_ON(!plist_node_empty(&p->avail_lists[nid])); | |
711 | plist_add(&p->avail_lists[nid], &swap_avail_heads[nid]); | |
712 | } | |
713 | spin_unlock(&swap_avail_lock); | |
714 | } | |
715 | ||
38d8b4e6 HY |
716 | static void swap_range_free(struct swap_info_struct *si, unsigned long offset, |
717 | unsigned int nr_entries) | |
718 | { | |
3852f676 | 719 | unsigned long begin = offset; |
38d8b4e6 HY |
720 | unsigned long end = offset + nr_entries - 1; |
721 | void (*swap_slot_free_notify)(struct block_device *, unsigned long); | |
722 | ||
723 | if (offset < si->lowest_bit) | |
724 | si->lowest_bit = offset; | |
725 | if (end > si->highest_bit) { | |
726 | bool was_full = !si->highest_bit; | |
727 | ||
a449bf58 | 728 | WRITE_ONCE(si->highest_bit, end); |
a2468cc9 AL |
729 | if (was_full && (si->flags & SWP_WRITEOK)) |
730 | add_to_avail_list(si); | |
38d8b4e6 HY |
731 | } |
732 | atomic_long_add(nr_entries, &nr_swap_pages); | |
733 | si->inuse_pages -= nr_entries; | |
734 | if (si->flags & SWP_BLKDEV) | |
735 | swap_slot_free_notify = | |
736 | si->bdev->bd_disk->fops->swap_slot_free_notify; | |
737 | else | |
738 | swap_slot_free_notify = NULL; | |
739 | while (offset <= end) { | |
8a84802e | 740 | arch_swap_invalidate_page(si->type, offset); |
38d8b4e6 HY |
741 | frontswap_invalidate_page(si->type, offset); |
742 | if (swap_slot_free_notify) | |
743 | swap_slot_free_notify(si->bdev, offset); | |
744 | offset++; | |
745 | } | |
3852f676 | 746 | clear_shadow_from_swap_cache(si->type, begin, end); |
38d8b4e6 HY |
747 | } |
748 | ||
49070588 HY |
749 | static void set_cluster_next(struct swap_info_struct *si, unsigned long next) |
750 | { | |
751 | unsigned long prev; | |
752 | ||
753 | if (!(si->flags & SWP_SOLIDSTATE)) { | |
754 | si->cluster_next = next; | |
755 | return; | |
756 | } | |
757 | ||
758 | prev = this_cpu_read(*si->cluster_next_cpu); | |
759 | /* | |
760 | * Cross the swap address space size aligned trunk, choose | |
761 | * another trunk randomly to avoid lock contention on swap | |
762 | * address space if possible. | |
763 | */ | |
764 | if ((prev >> SWAP_ADDRESS_SPACE_SHIFT) != | |
765 | (next >> SWAP_ADDRESS_SPACE_SHIFT)) { | |
766 | /* No free swap slots available */ | |
767 | if (si->highest_bit <= si->lowest_bit) | |
768 | return; | |
769 | next = si->lowest_bit + | |
770 | prandom_u32_max(si->highest_bit - si->lowest_bit + 1); | |
771 | next = ALIGN_DOWN(next, SWAP_ADDRESS_SPACE_PAGES); | |
772 | next = max_t(unsigned int, next, si->lowest_bit); | |
773 | } | |
774 | this_cpu_write(*si->cluster_next_cpu, next); | |
775 | } | |
776 | ||
36005bae TC |
777 | static int scan_swap_map_slots(struct swap_info_struct *si, |
778 | unsigned char usage, int nr, | |
779 | swp_entry_t slots[]) | |
1da177e4 | 780 | { |
235b6217 | 781 | struct swap_cluster_info *ci; |
ebebbbe9 | 782 | unsigned long offset; |
c60aa176 | 783 | unsigned long scan_base; |
7992fde7 | 784 | unsigned long last_in_cluster = 0; |
048c27fd | 785 | int latency_ration = LATENCY_LIMIT; |
36005bae | 786 | int n_ret = 0; |
ed43af10 | 787 | bool scanned_many = false; |
36005bae | 788 | |
886bb7e9 | 789 | /* |
7dfad418 HD |
790 | * We try to cluster swap pages by allocating them sequentially |
791 | * in swap. Once we've allocated SWAPFILE_CLUSTER pages this | |
792 | * way, however, we resort to first-free allocation, starting | |
793 | * a new cluster. This prevents us from scattering swap pages | |
794 | * all over the entire swap partition, so that we reduce | |
795 | * overall disk seek times between swap pages. -- sct | |
796 | * But we do now try to find an empty cluster. -Andrea | |
c60aa176 | 797 | * And we let swap pages go all over an SSD partition. Hugh |
7dfad418 HD |
798 | */ |
799 | ||
52b7efdb | 800 | si->flags += SWP_SCANNING; |
49070588 HY |
801 | /* |
802 | * Use percpu scan base for SSD to reduce lock contention on | |
803 | * cluster and swap cache. For HDD, sequential access is more | |
804 | * important. | |
805 | */ | |
806 | if (si->flags & SWP_SOLIDSTATE) | |
807 | scan_base = this_cpu_read(*si->cluster_next_cpu); | |
808 | else | |
809 | scan_base = si->cluster_next; | |
810 | offset = scan_base; | |
ebebbbe9 | 811 | |
ebc2a1a6 SL |
812 | /* SSD algorithm */ |
813 | if (si->cluster_info) { | |
bd2d18da | 814 | if (!scan_swap_map_try_ssd_cluster(si, &offset, &scan_base)) |
36005bae | 815 | goto scan; |
f4eaf51a | 816 | } else if (unlikely(!si->cluster_nr--)) { |
ebebbbe9 HD |
817 | if (si->pages - si->inuse_pages < SWAPFILE_CLUSTER) { |
818 | si->cluster_nr = SWAPFILE_CLUSTER - 1; | |
819 | goto checks; | |
820 | } | |
2a8f9449 | 821 | |
ec8acf20 | 822 | spin_unlock(&si->lock); |
7dfad418 | 823 | |
c60aa176 HD |
824 | /* |
825 | * If seek is expensive, start searching for new cluster from | |
826 | * start of partition, to minimize the span of allocated swap. | |
50088c44 CY |
827 | * If seek is cheap, that is the SWP_SOLIDSTATE si->cluster_info |
828 | * case, just handled by scan_swap_map_try_ssd_cluster() above. | |
c60aa176 | 829 | */ |
50088c44 | 830 | scan_base = offset = si->lowest_bit; |
7dfad418 HD |
831 | last_in_cluster = offset + SWAPFILE_CLUSTER - 1; |
832 | ||
833 | /* Locate the first empty (unaligned) cluster */ | |
834 | for (; last_in_cluster <= si->highest_bit; offset++) { | |
1da177e4 | 835 | if (si->swap_map[offset]) |
7dfad418 HD |
836 | last_in_cluster = offset + SWAPFILE_CLUSTER; |
837 | else if (offset == last_in_cluster) { | |
ec8acf20 | 838 | spin_lock(&si->lock); |
ebebbbe9 HD |
839 | offset -= SWAPFILE_CLUSTER - 1; |
840 | si->cluster_next = offset; | |
841 | si->cluster_nr = SWAPFILE_CLUSTER - 1; | |
c60aa176 HD |
842 | goto checks; |
843 | } | |
844 | if (unlikely(--latency_ration < 0)) { | |
845 | cond_resched(); | |
846 | latency_ration = LATENCY_LIMIT; | |
847 | } | |
848 | } | |
849 | ||
850 | offset = scan_base; | |
ec8acf20 | 851 | spin_lock(&si->lock); |
ebebbbe9 | 852 | si->cluster_nr = SWAPFILE_CLUSTER - 1; |
1da177e4 | 853 | } |
7dfad418 | 854 | |
ebebbbe9 | 855 | checks: |
ebc2a1a6 | 856 | if (si->cluster_info) { |
36005bae TC |
857 | while (scan_swap_map_ssd_cluster_conflict(si, offset)) { |
858 | /* take a break if we already got some slots */ | |
859 | if (n_ret) | |
860 | goto done; | |
861 | if (!scan_swap_map_try_ssd_cluster(si, &offset, | |
862 | &scan_base)) | |
863 | goto scan; | |
864 | } | |
ebc2a1a6 | 865 | } |
ebebbbe9 | 866 | if (!(si->flags & SWP_WRITEOK)) |
52b7efdb | 867 | goto no_page; |
7dfad418 HD |
868 | if (!si->highest_bit) |
869 | goto no_page; | |
ebebbbe9 | 870 | if (offset > si->highest_bit) |
c60aa176 | 871 | scan_base = offset = si->lowest_bit; |
c9e44410 | 872 | |
235b6217 | 873 | ci = lock_cluster(si, offset); |
b73d7fce HD |
874 | /* reuse swap entry of cache-only swap if not busy. */ |
875 | if (vm_swap_full() && si->swap_map[offset] == SWAP_HAS_CACHE) { | |
c9e44410 | 876 | int swap_was_freed; |
235b6217 | 877 | unlock_cluster(ci); |
ec8acf20 | 878 | spin_unlock(&si->lock); |
bcd49e86 | 879 | swap_was_freed = __try_to_reclaim_swap(si, offset, TTRS_ANYWAY); |
ec8acf20 | 880 | spin_lock(&si->lock); |
c9e44410 KH |
881 | /* entry was freed successfully, try to use this again */ |
882 | if (swap_was_freed) | |
883 | goto checks; | |
884 | goto scan; /* check next one */ | |
885 | } | |
886 | ||
235b6217 HY |
887 | if (si->swap_map[offset]) { |
888 | unlock_cluster(ci); | |
36005bae TC |
889 | if (!n_ret) |
890 | goto scan; | |
891 | else | |
892 | goto done; | |
235b6217 | 893 | } |
a449bf58 | 894 | WRITE_ONCE(si->swap_map[offset], usage); |
2872bb2d HY |
895 | inc_cluster_info_page(si, si->cluster_info, offset); |
896 | unlock_cluster(ci); | |
ebebbbe9 | 897 | |
38d8b4e6 | 898 | swap_range_alloc(si, offset, 1); |
36005bae TC |
899 | slots[n_ret++] = swp_entry(si->type, offset); |
900 | ||
901 | /* got enough slots or reach max slots? */ | |
902 | if ((n_ret == nr) || (offset >= si->highest_bit)) | |
903 | goto done; | |
904 | ||
905 | /* search for next available slot */ | |
906 | ||
907 | /* time to take a break? */ | |
908 | if (unlikely(--latency_ration < 0)) { | |
909 | if (n_ret) | |
910 | goto done; | |
911 | spin_unlock(&si->lock); | |
912 | cond_resched(); | |
913 | spin_lock(&si->lock); | |
914 | latency_ration = LATENCY_LIMIT; | |
915 | } | |
916 | ||
917 | /* try to get more slots in cluster */ | |
918 | if (si->cluster_info) { | |
919 | if (scan_swap_map_try_ssd_cluster(si, &offset, &scan_base)) | |
920 | goto checks; | |
f4eaf51a WY |
921 | } else if (si->cluster_nr && !si->swap_map[++offset]) { |
922 | /* non-ssd case, still more slots in cluster? */ | |
36005bae TC |
923 | --si->cluster_nr; |
924 | goto checks; | |
925 | } | |
7992fde7 | 926 | |
ed43af10 HY |
927 | /* |
928 | * Even if there's no free clusters available (fragmented), | |
929 | * try to scan a little more quickly with lock held unless we | |
930 | * have scanned too many slots already. | |
931 | */ | |
932 | if (!scanned_many) { | |
933 | unsigned long scan_limit; | |
934 | ||
935 | if (offset < scan_base) | |
936 | scan_limit = scan_base; | |
937 | else | |
938 | scan_limit = si->highest_bit; | |
939 | for (; offset <= scan_limit && --latency_ration > 0; | |
940 | offset++) { | |
941 | if (!si->swap_map[offset]) | |
942 | goto checks; | |
943 | } | |
944 | } | |
945 | ||
36005bae | 946 | done: |
49070588 | 947 | set_cluster_next(si, offset + 1); |
36005bae TC |
948 | si->flags -= SWP_SCANNING; |
949 | return n_ret; | |
7dfad418 | 950 | |
ebebbbe9 | 951 | scan: |
ec8acf20 | 952 | spin_unlock(&si->lock); |
a449bf58 QC |
953 | while (++offset <= READ_ONCE(si->highest_bit)) { |
954 | if (data_race(!si->swap_map[offset])) { | |
ec8acf20 | 955 | spin_lock(&si->lock); |
52b7efdb HD |
956 | goto checks; |
957 | } | |
a449bf58 QC |
958 | if (vm_swap_full() && |
959 | READ_ONCE(si->swap_map[offset]) == SWAP_HAS_CACHE) { | |
ec8acf20 | 960 | spin_lock(&si->lock); |
c9e44410 KH |
961 | goto checks; |
962 | } | |
048c27fd HD |
963 | if (unlikely(--latency_ration < 0)) { |
964 | cond_resched(); | |
965 | latency_ration = LATENCY_LIMIT; | |
ed43af10 | 966 | scanned_many = true; |
048c27fd | 967 | } |
7dfad418 | 968 | } |
c60aa176 | 969 | offset = si->lowest_bit; |
a5998061 | 970 | while (offset < scan_base) { |
a449bf58 | 971 | if (data_race(!si->swap_map[offset])) { |
ec8acf20 | 972 | spin_lock(&si->lock); |
c60aa176 HD |
973 | goto checks; |
974 | } | |
a449bf58 QC |
975 | if (vm_swap_full() && |
976 | READ_ONCE(si->swap_map[offset]) == SWAP_HAS_CACHE) { | |
ec8acf20 | 977 | spin_lock(&si->lock); |
c9e44410 KH |
978 | goto checks; |
979 | } | |
c60aa176 HD |
980 | if (unlikely(--latency_ration < 0)) { |
981 | cond_resched(); | |
982 | latency_ration = LATENCY_LIMIT; | |
ed43af10 | 983 | scanned_many = true; |
c60aa176 | 984 | } |
a5998061 | 985 | offset++; |
c60aa176 | 986 | } |
ec8acf20 | 987 | spin_lock(&si->lock); |
7dfad418 HD |
988 | |
989 | no_page: | |
52b7efdb | 990 | si->flags -= SWP_SCANNING; |
36005bae | 991 | return n_ret; |
1da177e4 LT |
992 | } |
993 | ||
38d8b4e6 HY |
994 | static int swap_alloc_cluster(struct swap_info_struct *si, swp_entry_t *slot) |
995 | { | |
996 | unsigned long idx; | |
997 | struct swap_cluster_info *ci; | |
661c7566 | 998 | unsigned long offset; |
38d8b4e6 | 999 | |
fe5266d5 HY |
1000 | /* |
1001 | * Should not even be attempting cluster allocations when huge | |
1002 | * page swap is disabled. Warn and fail the allocation. | |
1003 | */ | |
1004 | if (!IS_ENABLED(CONFIG_THP_SWAP)) { | |
1005 | VM_WARN_ON_ONCE(1); | |
1006 | return 0; | |
1007 | } | |
1008 | ||
38d8b4e6 HY |
1009 | if (cluster_list_empty(&si->free_clusters)) |
1010 | return 0; | |
1011 | ||
1012 | idx = cluster_list_first(&si->free_clusters); | |
1013 | offset = idx * SWAPFILE_CLUSTER; | |
1014 | ci = lock_cluster(si, offset); | |
1015 | alloc_cluster(si, idx); | |
e0709829 | 1016 | cluster_set_count_flag(ci, SWAPFILE_CLUSTER, CLUSTER_FLAG_HUGE); |
38d8b4e6 | 1017 | |
661c7566 | 1018 | memset(si->swap_map + offset, SWAP_HAS_CACHE, SWAPFILE_CLUSTER); |
38d8b4e6 HY |
1019 | unlock_cluster(ci); |
1020 | swap_range_alloc(si, offset, SWAPFILE_CLUSTER); | |
1021 | *slot = swp_entry(si->type, offset); | |
1022 | ||
1023 | return 1; | |
1024 | } | |
1025 | ||
1026 | static void swap_free_cluster(struct swap_info_struct *si, unsigned long idx) | |
1027 | { | |
1028 | unsigned long offset = idx * SWAPFILE_CLUSTER; | |
1029 | struct swap_cluster_info *ci; | |
1030 | ||
1031 | ci = lock_cluster(si, offset); | |
979aafa5 | 1032 | memset(si->swap_map + offset, 0, SWAPFILE_CLUSTER); |
38d8b4e6 HY |
1033 | cluster_set_count_flag(ci, 0, 0); |
1034 | free_cluster(si, idx); | |
1035 | unlock_cluster(ci); | |
1036 | swap_range_free(si, offset, SWAPFILE_CLUSTER); | |
1037 | } | |
38d8b4e6 | 1038 | |
5d5e8f19 | 1039 | int get_swap_pages(int n_goal, swp_entry_t swp_entries[], int entry_size) |
1da177e4 | 1040 | { |
5d5e8f19 | 1041 | unsigned long size = swap_entry_size(entry_size); |
adfab836 | 1042 | struct swap_info_struct *si, *next; |
36005bae TC |
1043 | long avail_pgs; |
1044 | int n_ret = 0; | |
a2468cc9 | 1045 | int node; |
1da177e4 | 1046 | |
38d8b4e6 | 1047 | /* Only single cluster request supported */ |
5d5e8f19 | 1048 | WARN_ON_ONCE(n_goal > 1 && size == SWAPFILE_CLUSTER); |
38d8b4e6 | 1049 | |
b50da6e9 ZH |
1050 | spin_lock(&swap_avail_lock); |
1051 | ||
5d5e8f19 | 1052 | avail_pgs = atomic_long_read(&nr_swap_pages) / size; |
b50da6e9 ZH |
1053 | if (avail_pgs <= 0) { |
1054 | spin_unlock(&swap_avail_lock); | |
fb4f88dc | 1055 | goto noswap; |
b50da6e9 | 1056 | } |
36005bae | 1057 | |
08d3090f | 1058 | n_goal = min3((long)n_goal, (long)SWAP_BATCH, avail_pgs); |
36005bae | 1059 | |
5d5e8f19 | 1060 | atomic_long_sub(n_goal * size, &nr_swap_pages); |
fb4f88dc | 1061 | |
18ab4d4c | 1062 | start_over: |
a2468cc9 AL |
1063 | node = numa_node_id(); |
1064 | plist_for_each_entry_safe(si, next, &swap_avail_heads[node], avail_lists[node]) { | |
18ab4d4c | 1065 | /* requeue si to after same-priority siblings */ |
a2468cc9 | 1066 | plist_requeue(&si->avail_lists[node], &swap_avail_heads[node]); |
18ab4d4c | 1067 | spin_unlock(&swap_avail_lock); |
ec8acf20 | 1068 | spin_lock(&si->lock); |
adfab836 | 1069 | if (!si->highest_bit || !(si->flags & SWP_WRITEOK)) { |
18ab4d4c | 1070 | spin_lock(&swap_avail_lock); |
a2468cc9 | 1071 | if (plist_node_empty(&si->avail_lists[node])) { |
18ab4d4c DS |
1072 | spin_unlock(&si->lock); |
1073 | goto nextsi; | |
1074 | } | |
1075 | WARN(!si->highest_bit, | |
1076 | "swap_info %d in list but !highest_bit\n", | |
1077 | si->type); | |
1078 | WARN(!(si->flags & SWP_WRITEOK), | |
1079 | "swap_info %d in list but !SWP_WRITEOK\n", | |
1080 | si->type); | |
a2468cc9 | 1081 | __del_from_avail_list(si); |
ec8acf20 | 1082 | spin_unlock(&si->lock); |
18ab4d4c | 1083 | goto nextsi; |
ec8acf20 | 1084 | } |
5d5e8f19 | 1085 | if (size == SWAPFILE_CLUSTER) { |
41663430 | 1086 | if (si->flags & SWP_BLKDEV) |
f0eea189 HY |
1087 | n_ret = swap_alloc_cluster(si, swp_entries); |
1088 | } else | |
38d8b4e6 HY |
1089 | n_ret = scan_swap_map_slots(si, SWAP_HAS_CACHE, |
1090 | n_goal, swp_entries); | |
ec8acf20 | 1091 | spin_unlock(&si->lock); |
5d5e8f19 | 1092 | if (n_ret || size == SWAPFILE_CLUSTER) |
36005bae | 1093 | goto check_out; |
18ab4d4c | 1094 | pr_debug("scan_swap_map of si %d failed to find offset\n", |
36005bae TC |
1095 | si->type); |
1096 | ||
18ab4d4c DS |
1097 | spin_lock(&swap_avail_lock); |
1098 | nextsi: | |
adfab836 DS |
1099 | /* |
1100 | * if we got here, it's likely that si was almost full before, | |
bb243f7d ML |
1101 | * and since scan_swap_map_slots() can drop the si->lock, |
1102 | * multiple callers probably all tried to get a page from the | |
1103 | * same si and it filled up before we could get one; or, the si | |
1104 | * filled up between us dropping swap_avail_lock and taking | |
1105 | * si->lock. Since we dropped the swap_avail_lock, the | |
1106 | * swap_avail_head list may have been modified; so if next is | |
1107 | * still in the swap_avail_head list then try it, otherwise | |
1108 | * start over if we have not gotten any slots. | |
adfab836 | 1109 | */ |
a2468cc9 | 1110 | if (plist_node_empty(&next->avail_lists[node])) |
18ab4d4c | 1111 | goto start_over; |
1da177e4 | 1112 | } |
fb4f88dc | 1113 | |
18ab4d4c DS |
1114 | spin_unlock(&swap_avail_lock); |
1115 | ||
36005bae TC |
1116 | check_out: |
1117 | if (n_ret < n_goal) | |
5d5e8f19 | 1118 | atomic_long_add((long)(n_goal - n_ret) * size, |
38d8b4e6 | 1119 | &nr_swap_pages); |
fb4f88dc | 1120 | noswap: |
36005bae TC |
1121 | return n_ret; |
1122 | } | |
1123 | ||
e8c26ab6 | 1124 | static struct swap_info_struct *__swap_info_get(swp_entry_t entry) |
1da177e4 | 1125 | { |
73c34b6a | 1126 | struct swap_info_struct *p; |
eb085574 | 1127 | unsigned long offset; |
1da177e4 LT |
1128 | |
1129 | if (!entry.val) | |
1130 | goto out; | |
eb085574 | 1131 | p = swp_swap_info(entry); |
c10d38cc | 1132 | if (!p) |
1da177e4 | 1133 | goto bad_nofile; |
a449bf58 | 1134 | if (data_race(!(p->flags & SWP_USED))) |
1da177e4 LT |
1135 | goto bad_device; |
1136 | offset = swp_offset(entry); | |
1137 | if (offset >= p->max) | |
1138 | goto bad_offset; | |
1da177e4 LT |
1139 | return p; |
1140 | ||
1da177e4 | 1141 | bad_offset: |
cf532faa | 1142 | pr_err("%s: %s%08lx\n", __func__, Bad_offset, entry.val); |
1da177e4 LT |
1143 | goto out; |
1144 | bad_device: | |
cf532faa | 1145 | pr_err("%s: %s%08lx\n", __func__, Unused_file, entry.val); |
1da177e4 LT |
1146 | goto out; |
1147 | bad_nofile: | |
cf532faa | 1148 | pr_err("%s: %s%08lx\n", __func__, Bad_file, entry.val); |
1da177e4 LT |
1149 | out: |
1150 | return NULL; | |
886bb7e9 | 1151 | } |
1da177e4 | 1152 | |
e8c26ab6 TC |
1153 | static struct swap_info_struct *_swap_info_get(swp_entry_t entry) |
1154 | { | |
1155 | struct swap_info_struct *p; | |
1156 | ||
1157 | p = __swap_info_get(entry); | |
1158 | if (!p) | |
1159 | goto out; | |
a449bf58 | 1160 | if (data_race(!p->swap_map[swp_offset(entry)])) |
e8c26ab6 TC |
1161 | goto bad_free; |
1162 | return p; | |
1163 | ||
1164 | bad_free: | |
cf532faa | 1165 | pr_err("%s: %s%08lx\n", __func__, Unused_offset, entry.val); |
e8c26ab6 TC |
1166 | out: |
1167 | return NULL; | |
1168 | } | |
1169 | ||
235b6217 HY |
1170 | static struct swap_info_struct *swap_info_get(swp_entry_t entry) |
1171 | { | |
1172 | struct swap_info_struct *p; | |
1173 | ||
1174 | p = _swap_info_get(entry); | |
1175 | if (p) | |
1176 | spin_lock(&p->lock); | |
1177 | return p; | |
1178 | } | |
1179 | ||
7c00bafe TC |
1180 | static struct swap_info_struct *swap_info_get_cont(swp_entry_t entry, |
1181 | struct swap_info_struct *q) | |
1182 | { | |
1183 | struct swap_info_struct *p; | |
1184 | ||
1185 | p = _swap_info_get(entry); | |
1186 | ||
1187 | if (p != q) { | |
1188 | if (q != NULL) | |
1189 | spin_unlock(&q->lock); | |
1190 | if (p != NULL) | |
1191 | spin_lock(&p->lock); | |
1192 | } | |
1193 | return p; | |
1194 | } | |
1195 | ||
b32d5f32 HY |
1196 | static unsigned char __swap_entry_free_locked(struct swap_info_struct *p, |
1197 | unsigned long offset, | |
1198 | unsigned char usage) | |
1da177e4 | 1199 | { |
8d69aaee HD |
1200 | unsigned char count; |
1201 | unsigned char has_cache; | |
235b6217 | 1202 | |
253d553b | 1203 | count = p->swap_map[offset]; |
235b6217 | 1204 | |
253d553b HD |
1205 | has_cache = count & SWAP_HAS_CACHE; |
1206 | count &= ~SWAP_HAS_CACHE; | |
355cfa73 | 1207 | |
253d553b | 1208 | if (usage == SWAP_HAS_CACHE) { |
355cfa73 | 1209 | VM_BUG_ON(!has_cache); |
253d553b | 1210 | has_cache = 0; |
aaa46865 HD |
1211 | } else if (count == SWAP_MAP_SHMEM) { |
1212 | /* | |
1213 | * Or we could insist on shmem.c using a special | |
1214 | * swap_shmem_free() and free_shmem_swap_and_cache()... | |
1215 | */ | |
1216 | count = 0; | |
570a335b HD |
1217 | } else if ((count & ~COUNT_CONTINUED) <= SWAP_MAP_MAX) { |
1218 | if (count == COUNT_CONTINUED) { | |
1219 | if (swap_count_continued(p, offset, count)) | |
1220 | count = SWAP_MAP_MAX | COUNT_CONTINUED; | |
1221 | else | |
1222 | count = SWAP_MAP_MAX; | |
1223 | } else | |
1224 | count--; | |
1225 | } | |
253d553b | 1226 | |
253d553b | 1227 | usage = count | has_cache; |
a449bf58 QC |
1228 | if (usage) |
1229 | WRITE_ONCE(p->swap_map[offset], usage); | |
1230 | else | |
1231 | WRITE_ONCE(p->swap_map[offset], SWAP_HAS_CACHE); | |
7c00bafe | 1232 | |
b32d5f32 HY |
1233 | return usage; |
1234 | } | |
1235 | ||
eb085574 HY |
1236 | /* |
1237 | * Check whether swap entry is valid in the swap device. If so, | |
1238 | * return pointer to swap_info_struct, and keep the swap entry valid | |
1239 | * via preventing the swap device from being swapoff, until | |
1240 | * put_swap_device() is called. Otherwise return NULL. | |
1241 | * | |
eb085574 | 1242 | * Notice that swapoff or swapoff+swapon can still happen before the |
63d8620e ML |
1243 | * percpu_ref_tryget_live() in get_swap_device() or after the |
1244 | * percpu_ref_put() in put_swap_device() if there isn't any other way | |
1245 | * to prevent swapoff, such as page lock, page table lock, etc. The | |
1246 | * caller must be prepared for that. For example, the following | |
1247 | * situation is possible. | |
eb085574 HY |
1248 | * |
1249 | * CPU1 CPU2 | |
1250 | * do_swap_page() | |
1251 | * ... swapoff+swapon | |
1252 | * __read_swap_cache_async() | |
1253 | * swapcache_prepare() | |
1254 | * __swap_duplicate() | |
1255 | * // check swap_map | |
1256 | * // verify PTE not changed | |
1257 | * | |
1258 | * In __swap_duplicate(), the swap_map need to be checked before | |
1259 | * changing partly because the specified swap entry may be for another | |
1260 | * swap device which has been swapoff. And in do_swap_page(), after | |
1261 | * the page is read from the swap device, the PTE is verified not | |
1262 | * changed with the page table locked to check whether the swap device | |
1263 | * has been swapoff or swapoff+swapon. | |
1264 | */ | |
1265 | struct swap_info_struct *get_swap_device(swp_entry_t entry) | |
1266 | { | |
1267 | struct swap_info_struct *si; | |
1268 | unsigned long offset; | |
1269 | ||
1270 | if (!entry.val) | |
1271 | goto out; | |
1272 | si = swp_swap_info(entry); | |
1273 | if (!si) | |
1274 | goto bad_nofile; | |
63d8620e ML |
1275 | if (!percpu_ref_tryget_live(&si->users)) |
1276 | goto out; | |
1277 | /* | |
1278 | * Guarantee the si->users are checked before accessing other | |
1279 | * fields of swap_info_struct. | |
1280 | * | |
1281 | * Paired with the spin_unlock() after setup_swap_info() in | |
1282 | * enable_swap_info(). | |
1283 | */ | |
1284 | smp_rmb(); | |
eb085574 HY |
1285 | offset = swp_offset(entry); |
1286 | if (offset >= si->max) | |
63d8620e | 1287 | goto put_out; |
eb085574 HY |
1288 | |
1289 | return si; | |
1290 | bad_nofile: | |
1291 | pr_err("%s: %s%08lx\n", __func__, Bad_file, entry.val); | |
1292 | out: | |
1293 | return NULL; | |
63d8620e ML |
1294 | put_out: |
1295 | percpu_ref_put(&si->users); | |
eb085574 HY |
1296 | return NULL; |
1297 | } | |
1298 | ||
b32d5f32 | 1299 | static unsigned char __swap_entry_free(struct swap_info_struct *p, |
33e16272 | 1300 | swp_entry_t entry) |
b32d5f32 HY |
1301 | { |
1302 | struct swap_cluster_info *ci; | |
1303 | unsigned long offset = swp_offset(entry); | |
33e16272 | 1304 | unsigned char usage; |
b32d5f32 HY |
1305 | |
1306 | ci = lock_cluster_or_swap_info(p, offset); | |
33e16272 | 1307 | usage = __swap_entry_free_locked(p, offset, 1); |
7c00bafe | 1308 | unlock_cluster_or_swap_info(p, ci); |
10e364da HY |
1309 | if (!usage) |
1310 | free_swap_slot(entry); | |
7c00bafe TC |
1311 | |
1312 | return usage; | |
1313 | } | |
355cfa73 | 1314 | |
7c00bafe TC |
1315 | static void swap_entry_free(struct swap_info_struct *p, swp_entry_t entry) |
1316 | { | |
1317 | struct swap_cluster_info *ci; | |
1318 | unsigned long offset = swp_offset(entry); | |
1319 | unsigned char count; | |
1320 | ||
1321 | ci = lock_cluster(p, offset); | |
1322 | count = p->swap_map[offset]; | |
1323 | VM_BUG_ON(count != SWAP_HAS_CACHE); | |
1324 | p->swap_map[offset] = 0; | |
1325 | dec_cluster_info_page(p, p->cluster_info, offset); | |
235b6217 HY |
1326 | unlock_cluster(ci); |
1327 | ||
38d8b4e6 HY |
1328 | mem_cgroup_uncharge_swap(entry, 1); |
1329 | swap_range_free(p, offset, 1); | |
1da177e4 LT |
1330 | } |
1331 | ||
1332 | /* | |
2de1a7e4 | 1333 | * Caller has made sure that the swap device corresponding to entry |
1da177e4 LT |
1334 | * is still around or has not been recycled. |
1335 | */ | |
1336 | void swap_free(swp_entry_t entry) | |
1337 | { | |
73c34b6a | 1338 | struct swap_info_struct *p; |
1da177e4 | 1339 | |
235b6217 | 1340 | p = _swap_info_get(entry); |
10e364da | 1341 | if (p) |
33e16272 | 1342 | __swap_entry_free(p, entry); |
1da177e4 LT |
1343 | } |
1344 | ||
cb4b86ba KH |
1345 | /* |
1346 | * Called after dropping swapcache to decrease refcnt to swap entries. | |
1347 | */ | |
a448f2d0 | 1348 | void put_swap_page(struct page *page, swp_entry_t entry) |
38d8b4e6 HY |
1349 | { |
1350 | unsigned long offset = swp_offset(entry); | |
1351 | unsigned long idx = offset / SWAPFILE_CLUSTER; | |
1352 | struct swap_cluster_info *ci; | |
1353 | struct swap_info_struct *si; | |
1354 | unsigned char *map; | |
a3aea839 HY |
1355 | unsigned int i, free_entries = 0; |
1356 | unsigned char val; | |
6c357848 | 1357 | int size = swap_entry_size(thp_nr_pages(page)); |
fe5266d5 | 1358 | |
a3aea839 | 1359 | si = _swap_info_get(entry); |
38d8b4e6 HY |
1360 | if (!si) |
1361 | return; | |
1362 | ||
c2343d27 | 1363 | ci = lock_cluster_or_swap_info(si, offset); |
a448f2d0 | 1364 | if (size == SWAPFILE_CLUSTER) { |
a448f2d0 HY |
1365 | VM_BUG_ON(!cluster_is_huge(ci)); |
1366 | map = si->swap_map + offset; | |
1367 | for (i = 0; i < SWAPFILE_CLUSTER; i++) { | |
1368 | val = map[i]; | |
1369 | VM_BUG_ON(!(val & SWAP_HAS_CACHE)); | |
1370 | if (val == SWAP_HAS_CACHE) | |
1371 | free_entries++; | |
1372 | } | |
a448f2d0 | 1373 | cluster_clear_huge(ci); |
a448f2d0 | 1374 | if (free_entries == SWAPFILE_CLUSTER) { |
c2343d27 | 1375 | unlock_cluster_or_swap_info(si, ci); |
a448f2d0 | 1376 | spin_lock(&si->lock); |
a448f2d0 HY |
1377 | mem_cgroup_uncharge_swap(entry, SWAPFILE_CLUSTER); |
1378 | swap_free_cluster(si, idx); | |
1379 | spin_unlock(&si->lock); | |
1380 | return; | |
1381 | } | |
1382 | } | |
c2343d27 HY |
1383 | for (i = 0; i < size; i++, entry.val++) { |
1384 | if (!__swap_entry_free_locked(si, offset + i, SWAP_HAS_CACHE)) { | |
1385 | unlock_cluster_or_swap_info(si, ci); | |
1386 | free_swap_slot(entry); | |
1387 | if (i == size - 1) | |
1388 | return; | |
1389 | lock_cluster_or_swap_info(si, offset); | |
a3aea839 HY |
1390 | } |
1391 | } | |
c2343d27 | 1392 | unlock_cluster_or_swap_info(si, ci); |
38d8b4e6 | 1393 | } |
59807685 | 1394 | |
fe5266d5 | 1395 | #ifdef CONFIG_THP_SWAP |
59807685 HY |
1396 | int split_swap_cluster(swp_entry_t entry) |
1397 | { | |
1398 | struct swap_info_struct *si; | |
1399 | struct swap_cluster_info *ci; | |
1400 | unsigned long offset = swp_offset(entry); | |
1401 | ||
1402 | si = _swap_info_get(entry); | |
1403 | if (!si) | |
1404 | return -EBUSY; | |
1405 | ci = lock_cluster(si, offset); | |
1406 | cluster_clear_huge(ci); | |
1407 | unlock_cluster(ci); | |
1408 | return 0; | |
1409 | } | |
fe5266d5 | 1410 | #endif |
38d8b4e6 | 1411 | |
155b5f88 HY |
1412 | static int swp_entry_cmp(const void *ent1, const void *ent2) |
1413 | { | |
1414 | const swp_entry_t *e1 = ent1, *e2 = ent2; | |
1415 | ||
1416 | return (int)swp_type(*e1) - (int)swp_type(*e2); | |
1417 | } | |
1418 | ||
7c00bafe TC |
1419 | void swapcache_free_entries(swp_entry_t *entries, int n) |
1420 | { | |
1421 | struct swap_info_struct *p, *prev; | |
1422 | int i; | |
1423 | ||
1424 | if (n <= 0) | |
1425 | return; | |
1426 | ||
1427 | prev = NULL; | |
1428 | p = NULL; | |
155b5f88 HY |
1429 | |
1430 | /* | |
1431 | * Sort swap entries by swap device, so each lock is only taken once. | |
1432 | * nr_swapfiles isn't absolutely correct, but the overhead of sort() is | |
1433 | * so low that it isn't necessary to optimize further. | |
1434 | */ | |
1435 | if (nr_swapfiles > 1) | |
1436 | sort(entries, n, sizeof(entries[0]), swp_entry_cmp, NULL); | |
7c00bafe TC |
1437 | for (i = 0; i < n; ++i) { |
1438 | p = swap_info_get_cont(entries[i], prev); | |
1439 | if (p) | |
1440 | swap_entry_free(p, entries[i]); | |
7c00bafe TC |
1441 | prev = p; |
1442 | } | |
235b6217 | 1443 | if (p) |
7c00bafe | 1444 | spin_unlock(&p->lock); |
cb4b86ba KH |
1445 | } |
1446 | ||
1da177e4 | 1447 | /* |
c475a8ab | 1448 | * How many references to page are currently swapped out? |
570a335b HD |
1449 | * This does not give an exact answer when swap count is continued, |
1450 | * but does include the high COUNT_CONTINUED flag to allow for that. | |
1da177e4 | 1451 | */ |
bde05d1c | 1452 | int page_swapcount(struct page *page) |
1da177e4 | 1453 | { |
c475a8ab HD |
1454 | int count = 0; |
1455 | struct swap_info_struct *p; | |
235b6217 | 1456 | struct swap_cluster_info *ci; |
1da177e4 | 1457 | swp_entry_t entry; |
235b6217 | 1458 | unsigned long offset; |
1da177e4 | 1459 | |
4c21e2f2 | 1460 | entry.val = page_private(page); |
235b6217 | 1461 | p = _swap_info_get(entry); |
1da177e4 | 1462 | if (p) { |
235b6217 HY |
1463 | offset = swp_offset(entry); |
1464 | ci = lock_cluster_or_swap_info(p, offset); | |
1465 | count = swap_count(p->swap_map[offset]); | |
1466 | unlock_cluster_or_swap_info(p, ci); | |
1da177e4 | 1467 | } |
c475a8ab | 1468 | return count; |
1da177e4 LT |
1469 | } |
1470 | ||
eb085574 | 1471 | int __swap_count(swp_entry_t entry) |
aa8d22a1 | 1472 | { |
eb085574 | 1473 | struct swap_info_struct *si; |
aa8d22a1 | 1474 | pgoff_t offset = swp_offset(entry); |
eb085574 | 1475 | int count = 0; |
aa8d22a1 | 1476 | |
eb085574 HY |
1477 | si = get_swap_device(entry); |
1478 | if (si) { | |
1479 | count = swap_count(si->swap_map[offset]); | |
1480 | put_swap_device(si); | |
1481 | } | |
1482 | return count; | |
aa8d22a1 MK |
1483 | } |
1484 | ||
322b8afe HY |
1485 | static int swap_swapcount(struct swap_info_struct *si, swp_entry_t entry) |
1486 | { | |
1487 | int count = 0; | |
1488 | pgoff_t offset = swp_offset(entry); | |
1489 | struct swap_cluster_info *ci; | |
1490 | ||
1491 | ci = lock_cluster_or_swap_info(si, offset); | |
1492 | count = swap_count(si->swap_map[offset]); | |
1493 | unlock_cluster_or_swap_info(si, ci); | |
1494 | return count; | |
1495 | } | |
1496 | ||
e8c26ab6 TC |
1497 | /* |
1498 | * How many references to @entry are currently swapped out? | |
1499 | * This does not give an exact answer when swap count is continued, | |
1500 | * but does include the high COUNT_CONTINUED flag to allow for that. | |
1501 | */ | |
1502 | int __swp_swapcount(swp_entry_t entry) | |
1503 | { | |
1504 | int count = 0; | |
e8c26ab6 | 1505 | struct swap_info_struct *si; |
e8c26ab6 | 1506 | |
eb085574 HY |
1507 | si = get_swap_device(entry); |
1508 | if (si) { | |
322b8afe | 1509 | count = swap_swapcount(si, entry); |
eb085574 HY |
1510 | put_swap_device(si); |
1511 | } | |
e8c26ab6 TC |
1512 | return count; |
1513 | } | |
1514 | ||
8334b962 MK |
1515 | /* |
1516 | * How many references to @entry are currently swapped out? | |
1517 | * This considers COUNT_CONTINUED so it returns exact answer. | |
1518 | */ | |
1519 | int swp_swapcount(swp_entry_t entry) | |
1520 | { | |
1521 | int count, tmp_count, n; | |
1522 | struct swap_info_struct *p; | |
235b6217 | 1523 | struct swap_cluster_info *ci; |
8334b962 MK |
1524 | struct page *page; |
1525 | pgoff_t offset; | |
1526 | unsigned char *map; | |
1527 | ||
235b6217 | 1528 | p = _swap_info_get(entry); |
8334b962 MK |
1529 | if (!p) |
1530 | return 0; | |
1531 | ||
235b6217 HY |
1532 | offset = swp_offset(entry); |
1533 | ||
1534 | ci = lock_cluster_or_swap_info(p, offset); | |
1535 | ||
1536 | count = swap_count(p->swap_map[offset]); | |
8334b962 MK |
1537 | if (!(count & COUNT_CONTINUED)) |
1538 | goto out; | |
1539 | ||
1540 | count &= ~COUNT_CONTINUED; | |
1541 | n = SWAP_MAP_MAX + 1; | |
1542 | ||
8334b962 MK |
1543 | page = vmalloc_to_page(p->swap_map + offset); |
1544 | offset &= ~PAGE_MASK; | |
1545 | VM_BUG_ON(page_private(page) != SWP_CONTINUED); | |
1546 | ||
1547 | do { | |
a8ae4991 | 1548 | page = list_next_entry(page, lru); |
8334b962 MK |
1549 | map = kmap_atomic(page); |
1550 | tmp_count = map[offset]; | |
1551 | kunmap_atomic(map); | |
1552 | ||
1553 | count += (tmp_count & ~COUNT_CONTINUED) * n; | |
1554 | n *= (SWAP_CONT_MAX + 1); | |
1555 | } while (tmp_count & COUNT_CONTINUED); | |
1556 | out: | |
235b6217 | 1557 | unlock_cluster_or_swap_info(p, ci); |
8334b962 MK |
1558 | return count; |
1559 | } | |
1560 | ||
e0709829 HY |
1561 | static bool swap_page_trans_huge_swapped(struct swap_info_struct *si, |
1562 | swp_entry_t entry) | |
1563 | { | |
1564 | struct swap_cluster_info *ci; | |
1565 | unsigned char *map = si->swap_map; | |
1566 | unsigned long roffset = swp_offset(entry); | |
1567 | unsigned long offset = round_down(roffset, SWAPFILE_CLUSTER); | |
1568 | int i; | |
1569 | bool ret = false; | |
1570 | ||
1571 | ci = lock_cluster_or_swap_info(si, offset); | |
1572 | if (!ci || !cluster_is_huge(ci)) { | |
afa4711e | 1573 | if (swap_count(map[roffset])) |
e0709829 HY |
1574 | ret = true; |
1575 | goto unlock_out; | |
1576 | } | |
1577 | for (i = 0; i < SWAPFILE_CLUSTER; i++) { | |
afa4711e | 1578 | if (swap_count(map[offset + i])) { |
e0709829 HY |
1579 | ret = true; |
1580 | break; | |
1581 | } | |
1582 | } | |
1583 | unlock_out: | |
1584 | unlock_cluster_or_swap_info(si, ci); | |
1585 | return ret; | |
1586 | } | |
1587 | ||
1588 | static bool page_swapped(struct page *page) | |
1589 | { | |
1590 | swp_entry_t entry; | |
1591 | struct swap_info_struct *si; | |
1592 | ||
fe5266d5 | 1593 | if (!IS_ENABLED(CONFIG_THP_SWAP) || likely(!PageTransCompound(page))) |
e0709829 HY |
1594 | return page_swapcount(page) != 0; |
1595 | ||
1596 | page = compound_head(page); | |
1597 | entry.val = page_private(page); | |
1598 | si = _swap_info_get(entry); | |
1599 | if (si) | |
1600 | return swap_page_trans_huge_swapped(si, entry); | |
1601 | return false; | |
1602 | } | |
ba3c4ce6 | 1603 | |
66c7f7a6 | 1604 | static int page_trans_huge_map_swapcount(struct page *page, |
ba3c4ce6 HY |
1605 | int *total_swapcount) |
1606 | { | |
66c7f7a6 | 1607 | int i, map_swapcount, _total_swapcount; |
ba3c4ce6 HY |
1608 | unsigned long offset = 0; |
1609 | struct swap_info_struct *si; | |
1610 | struct swap_cluster_info *ci = NULL; | |
1611 | unsigned char *map = NULL; | |
66c7f7a6 | 1612 | int swapcount = 0; |
ba3c4ce6 HY |
1613 | |
1614 | /* hugetlbfs shouldn't call it */ | |
1615 | VM_BUG_ON_PAGE(PageHuge(page), page); | |
1616 | ||
fe5266d5 | 1617 | if (!IS_ENABLED(CONFIG_THP_SWAP) || likely(!PageTransCompound(page))) { |
ba3c4ce6 HY |
1618 | if (PageSwapCache(page)) |
1619 | swapcount = page_swapcount(page); | |
1620 | if (total_swapcount) | |
1621 | *total_swapcount = swapcount; | |
d08d2b62 | 1622 | return swapcount + page_trans_huge_mapcount(page); |
ba3c4ce6 HY |
1623 | } |
1624 | ||
1625 | page = compound_head(page); | |
1626 | ||
66c7f7a6 | 1627 | _total_swapcount = map_swapcount = 0; |
ba3c4ce6 HY |
1628 | if (PageSwapCache(page)) { |
1629 | swp_entry_t entry; | |
1630 | ||
1631 | entry.val = page_private(page); | |
1632 | si = _swap_info_get(entry); | |
1633 | if (si) { | |
1634 | map = si->swap_map; | |
1635 | offset = swp_offset(entry); | |
1636 | } | |
1637 | } | |
1638 | if (map) | |
1639 | ci = lock_cluster(si, offset); | |
1640 | for (i = 0; i < HPAGE_PMD_NR; i++) { | |
66c7f7a6 | 1641 | int mapcount = atomic_read(&page[i]._mapcount) + 1; |
ba3c4ce6 HY |
1642 | if (map) { |
1643 | swapcount = swap_count(map[offset + i]); | |
1644 | _total_swapcount += swapcount; | |
1645 | } | |
1646 | map_swapcount = max(map_swapcount, mapcount + swapcount); | |
1647 | } | |
1648 | unlock_cluster(ci); | |
66c7f7a6 MWO |
1649 | |
1650 | if (PageDoubleMap(page)) | |
ba3c4ce6 | 1651 | map_swapcount -= 1; |
66c7f7a6 | 1652 | |
ba3c4ce6 HY |
1653 | if (total_swapcount) |
1654 | *total_swapcount = _total_swapcount; | |
1655 | ||
66c7f7a6 | 1656 | return map_swapcount + compound_mapcount(page); |
ba3c4ce6 | 1657 | } |
e0709829 | 1658 | |
1da177e4 | 1659 | /* |
7b1fe597 HD |
1660 | * We can write to an anon page without COW if there are no other references |
1661 | * to it. And as a side-effect, free up its swap: because the old content | |
1662 | * on disk will never be read, and seeking back there to write new content | |
1663 | * later would only waste time away from clustering. | |
1da177e4 | 1664 | */ |
020e8765 | 1665 | bool reuse_swap_page(struct page *page) |
1da177e4 | 1666 | { |
66c7f7a6 | 1667 | int count, total_swapcount; |
c475a8ab | 1668 | |
309381fe | 1669 | VM_BUG_ON_PAGE(!PageLocked(page), page); |
5ad64688 | 1670 | if (unlikely(PageKsm(page))) |
6d0a07ed | 1671 | return false; |
66c7f7a6 | 1672 | count = page_trans_huge_map_swapcount(page, &total_swapcount); |
ba3c4ce6 HY |
1673 | if (count == 1 && PageSwapCache(page) && |
1674 | (likely(!PageTransCompound(page)) || | |
1675 | /* The remaining swap count will be freed soon */ | |
1676 | total_swapcount == page_swapcount(page))) { | |
f0571429 | 1677 | if (!PageWriteback(page)) { |
ba3c4ce6 | 1678 | page = compound_head(page); |
7b1fe597 HD |
1679 | delete_from_swap_cache(page); |
1680 | SetPageDirty(page); | |
f0571429 MK |
1681 | } else { |
1682 | swp_entry_t entry; | |
1683 | struct swap_info_struct *p; | |
1684 | ||
1685 | entry.val = page_private(page); | |
1686 | p = swap_info_get(entry); | |
1687 | if (p->flags & SWP_STABLE_WRITES) { | |
1688 | spin_unlock(&p->lock); | |
1689 | return false; | |
1690 | } | |
1691 | spin_unlock(&p->lock); | |
7b1fe597 HD |
1692 | } |
1693 | } | |
ba3c4ce6 | 1694 | |
5ad64688 | 1695 | return count <= 1; |
1da177e4 LT |
1696 | } |
1697 | ||
1698 | /* | |
a2c43eed HD |
1699 | * If swap is getting full, or if there are no more mappings of this page, |
1700 | * then try_to_free_swap is called to free its swap space. | |
1da177e4 | 1701 | */ |
a2c43eed | 1702 | int try_to_free_swap(struct page *page) |
1da177e4 | 1703 | { |
309381fe | 1704 | VM_BUG_ON_PAGE(!PageLocked(page), page); |
1da177e4 LT |
1705 | |
1706 | if (!PageSwapCache(page)) | |
1707 | return 0; | |
1708 | if (PageWriteback(page)) | |
1709 | return 0; | |
e0709829 | 1710 | if (page_swapped(page)) |
1da177e4 LT |
1711 | return 0; |
1712 | ||
b73d7fce HD |
1713 | /* |
1714 | * Once hibernation has begun to create its image of memory, | |
1715 | * there's a danger that one of the calls to try_to_free_swap() | |
1716 | * - most probably a call from __try_to_reclaim_swap() while | |
1717 | * hibernation is allocating its own swap pages for the image, | |
1718 | * but conceivably even a call from memory reclaim - will free | |
1719 | * the swap from a page which has already been recorded in the | |
1720 | * image as a clean swapcache page, and then reuse its swap for | |
1721 | * another page of the image. On waking from hibernation, the | |
1722 | * original page might be freed under memory pressure, then | |
1723 | * later read back in from swap, now with the wrong data. | |
1724 | * | |
2de1a7e4 | 1725 | * Hibernation suspends storage while it is writing the image |
f90ac398 | 1726 | * to disk so check that here. |
b73d7fce | 1727 | */ |
f90ac398 | 1728 | if (pm_suspended_storage()) |
b73d7fce HD |
1729 | return 0; |
1730 | ||
e0709829 | 1731 | page = compound_head(page); |
a2c43eed HD |
1732 | delete_from_swap_cache(page); |
1733 | SetPageDirty(page); | |
1734 | return 1; | |
68a22394 RR |
1735 | } |
1736 | ||
1da177e4 LT |
1737 | /* |
1738 | * Free the swap entry like above, but also try to | |
1739 | * free the page cache entry if it is the last user. | |
1740 | */ | |
2509ef26 | 1741 | int free_swap_and_cache(swp_entry_t entry) |
1da177e4 | 1742 | { |
2509ef26 | 1743 | struct swap_info_struct *p; |
7c00bafe | 1744 | unsigned char count; |
1da177e4 | 1745 | |
a7420aa5 | 1746 | if (non_swap_entry(entry)) |
2509ef26 | 1747 | return 1; |
0697212a | 1748 | |
7c00bafe | 1749 | p = _swap_info_get(entry); |
1da177e4 | 1750 | if (p) { |
33e16272 | 1751 | count = __swap_entry_free(p, entry); |
e0709829 | 1752 | if (count == SWAP_HAS_CACHE && |
bcd49e86 HY |
1753 | !swap_page_trans_huge_swapped(p, entry)) |
1754 | __try_to_reclaim_swap(p, swp_offset(entry), | |
1755 | TTRS_UNMAPPED | TTRS_FULL); | |
1da177e4 | 1756 | } |
2509ef26 | 1757 | return p != NULL; |
1da177e4 LT |
1758 | } |
1759 | ||
b0cb1a19 | 1760 | #ifdef CONFIG_HIBERNATION |
bb243f7d ML |
1761 | |
1762 | swp_entry_t get_swap_page_of_type(int type) | |
1763 | { | |
1764 | struct swap_info_struct *si = swap_type_to_swap_info(type); | |
1765 | swp_entry_t entry = {0}; | |
1766 | ||
1767 | if (!si) | |
1768 | goto fail; | |
1769 | ||
1770 | /* This is called for allocating swap entry, not cache */ | |
1771 | spin_lock(&si->lock); | |
1772 | if ((si->flags & SWP_WRITEOK) && scan_swap_map_slots(si, 1, 1, &entry)) | |
1773 | atomic_long_dec(&nr_swap_pages); | |
1774 | spin_unlock(&si->lock); | |
1775 | fail: | |
1776 | return entry; | |
1777 | } | |
1778 | ||
f577eb30 | 1779 | /* |
915bae9e | 1780 | * Find the swap type that corresponds to given device (if any). |
f577eb30 | 1781 | * |
915bae9e RW |
1782 | * @offset - number of the PAGE_SIZE-sized block of the device, starting |
1783 | * from 0, in which the swap header is expected to be located. | |
1784 | * | |
1785 | * This is needed for the suspend to disk (aka swsusp). | |
f577eb30 | 1786 | */ |
21bd9005 | 1787 | int swap_type_of(dev_t device, sector_t offset) |
f577eb30 | 1788 | { |
efa90a98 | 1789 | int type; |
f577eb30 | 1790 | |
21bd9005 CH |
1791 | if (!device) |
1792 | return -1; | |
915bae9e | 1793 | |
f577eb30 | 1794 | spin_lock(&swap_lock); |
efa90a98 HD |
1795 | for (type = 0; type < nr_swapfiles; type++) { |
1796 | struct swap_info_struct *sis = swap_info[type]; | |
f577eb30 | 1797 | |
915bae9e | 1798 | if (!(sis->flags & SWP_WRITEOK)) |
f577eb30 | 1799 | continue; |
b6b5bce3 | 1800 | |
21bd9005 | 1801 | if (device == sis->bdev->bd_dev) { |
4efaceb1 | 1802 | struct swap_extent *se = first_se(sis); |
915bae9e | 1803 | |
915bae9e RW |
1804 | if (se->start_block == offset) { |
1805 | spin_unlock(&swap_lock); | |
efa90a98 | 1806 | return type; |
915bae9e | 1807 | } |
f577eb30 RW |
1808 | } |
1809 | } | |
1810 | spin_unlock(&swap_lock); | |
21bd9005 CH |
1811 | return -ENODEV; |
1812 | } | |
915bae9e | 1813 | |
21bd9005 CH |
1814 | int find_first_swap(dev_t *device) |
1815 | { | |
1816 | int type; | |
915bae9e | 1817 | |
21bd9005 CH |
1818 | spin_lock(&swap_lock); |
1819 | for (type = 0; type < nr_swapfiles; type++) { | |
1820 | struct swap_info_struct *sis = swap_info[type]; | |
1821 | ||
1822 | if (!(sis->flags & SWP_WRITEOK)) | |
1823 | continue; | |
1824 | *device = sis->bdev->bd_dev; | |
1825 | spin_unlock(&swap_lock); | |
1826 | return type; | |
1827 | } | |
1828 | spin_unlock(&swap_lock); | |
f577eb30 RW |
1829 | return -ENODEV; |
1830 | } | |
1831 | ||
73c34b6a HD |
1832 | /* |
1833 | * Get the (PAGE_SIZE) block corresponding to given offset on the swapdev | |
1834 | * corresponding to given index in swap_info (swap type). | |
1835 | */ | |
1836 | sector_t swapdev_block(int type, pgoff_t offset) | |
1837 | { | |
c10d38cc | 1838 | struct swap_info_struct *si = swap_type_to_swap_info(type); |
f885056a | 1839 | struct swap_extent *se; |
73c34b6a | 1840 | |
c10d38cc | 1841 | if (!si || !(si->flags & SWP_WRITEOK)) |
73c34b6a | 1842 | return 0; |
f885056a CH |
1843 | se = offset_to_swap_extent(si, offset); |
1844 | return se->start_block + (offset - se->start_page); | |
73c34b6a HD |
1845 | } |
1846 | ||
f577eb30 RW |
1847 | /* |
1848 | * Return either the total number of swap pages of given type, or the number | |
1849 | * of free pages of that type (depending on @free) | |
1850 | * | |
1851 | * This is needed for software suspend | |
1852 | */ | |
1853 | unsigned int count_swap_pages(int type, int free) | |
1854 | { | |
1855 | unsigned int n = 0; | |
1856 | ||
efa90a98 HD |
1857 | spin_lock(&swap_lock); |
1858 | if ((unsigned int)type < nr_swapfiles) { | |
1859 | struct swap_info_struct *sis = swap_info[type]; | |
1860 | ||
ec8acf20 | 1861 | spin_lock(&sis->lock); |
efa90a98 HD |
1862 | if (sis->flags & SWP_WRITEOK) { |
1863 | n = sis->pages; | |
f577eb30 | 1864 | if (free) |
efa90a98 | 1865 | n -= sis->inuse_pages; |
f577eb30 | 1866 | } |
ec8acf20 | 1867 | spin_unlock(&sis->lock); |
f577eb30 | 1868 | } |
efa90a98 | 1869 | spin_unlock(&swap_lock); |
f577eb30 RW |
1870 | return n; |
1871 | } | |
73c34b6a | 1872 | #endif /* CONFIG_HIBERNATION */ |
f577eb30 | 1873 | |
9f8bdb3f | 1874 | static inline int pte_same_as_swp(pte_t pte, pte_t swp_pte) |
179ef71c | 1875 | { |
099dd687 | 1876 | return pte_same(pte_swp_clear_flags(pte), swp_pte); |
179ef71c CG |
1877 | } |
1878 | ||
1da177e4 | 1879 | /* |
72866f6f HD |
1880 | * No need to decide whether this PTE shares the swap entry with others, |
1881 | * just let do_wp_page work it out if a write is requested later - to | |
1882 | * force COW, vm_page_prot omits write permission from any private vma. | |
1da177e4 | 1883 | */ |
044d66c1 | 1884 | static int unuse_pte(struct vm_area_struct *vma, pmd_t *pmd, |
1da177e4 LT |
1885 | unsigned long addr, swp_entry_t entry, struct page *page) |
1886 | { | |
9e16b7fb | 1887 | struct page *swapcache; |
044d66c1 HD |
1888 | spinlock_t *ptl; |
1889 | pte_t *pte; | |
1890 | int ret = 1; | |
1891 | ||
9e16b7fb HD |
1892 | swapcache = page; |
1893 | page = ksm_might_need_to_copy(page, vma, addr); | |
1894 | if (unlikely(!page)) | |
1895 | return -ENOMEM; | |
1896 | ||
044d66c1 | 1897 | pte = pte_offset_map_lock(vma->vm_mm, pmd, addr, &ptl); |
9f8bdb3f | 1898 | if (unlikely(!pte_same_as_swp(*pte, swp_entry_to_pte(entry)))) { |
044d66c1 HD |
1899 | ret = 0; |
1900 | goto out; | |
1901 | } | |
8a9f3ccd | 1902 | |
b084d435 | 1903 | dec_mm_counter(vma->vm_mm, MM_SWAPENTS); |
d559db08 | 1904 | inc_mm_counter(vma->vm_mm, MM_ANONPAGES); |
1da177e4 | 1905 | get_page(page); |
00501b53 | 1906 | if (page == swapcache) { |
be5d0a74 | 1907 | page_add_anon_rmap(page, vma, addr, false); |
00501b53 | 1908 | } else { /* ksm created a completely new copy */ |
be5d0a74 | 1909 | page_add_new_anon_rmap(page, vma, addr, false); |
b518154e | 1910 | lru_cache_add_inactive_or_unevictable(page, vma); |
00501b53 | 1911 | } |
1eba86c0 PT |
1912 | set_pte_at(vma->vm_mm, addr, pte, |
1913 | pte_mkold(mk_pte(page, vma->vm_page_prot))); | |
1da177e4 | 1914 | swap_free(entry); |
044d66c1 HD |
1915 | out: |
1916 | pte_unmap_unlock(pte, ptl); | |
9e16b7fb HD |
1917 | if (page != swapcache) { |
1918 | unlock_page(page); | |
1919 | put_page(page); | |
1920 | } | |
044d66c1 | 1921 | return ret; |
1da177e4 LT |
1922 | } |
1923 | ||
1924 | static int unuse_pte_range(struct vm_area_struct *vma, pmd_t *pmd, | |
b56a2d8a VRP |
1925 | unsigned long addr, unsigned long end, |
1926 | unsigned int type, bool frontswap, | |
1927 | unsigned long *fs_pages_to_unuse) | |
1da177e4 | 1928 | { |
b56a2d8a VRP |
1929 | struct page *page; |
1930 | swp_entry_t entry; | |
705e87c0 | 1931 | pte_t *pte; |
b56a2d8a VRP |
1932 | struct swap_info_struct *si; |
1933 | unsigned long offset; | |
8a9f3ccd | 1934 | int ret = 0; |
b56a2d8a | 1935 | volatile unsigned char *swap_map; |
1da177e4 | 1936 | |
b56a2d8a | 1937 | si = swap_info[type]; |
044d66c1 | 1938 | pte = pte_offset_map(pmd, addr); |
1da177e4 | 1939 | do { |
b56a2d8a VRP |
1940 | if (!is_swap_pte(*pte)) |
1941 | continue; | |
1942 | ||
1943 | entry = pte_to_swp_entry(*pte); | |
1944 | if (swp_type(entry) != type) | |
1945 | continue; | |
1946 | ||
1947 | offset = swp_offset(entry); | |
1948 | if (frontswap && !frontswap_test(si, offset)) | |
1949 | continue; | |
1950 | ||
1951 | pte_unmap(pte); | |
1952 | swap_map = &si->swap_map[offset]; | |
ebc5951e AR |
1953 | page = lookup_swap_cache(entry, vma, addr); |
1954 | if (!page) { | |
8c63ca5b WD |
1955 | struct vm_fault vmf = { |
1956 | .vma = vma, | |
1957 | .address = addr, | |
1958 | .pmd = pmd, | |
1959 | }; | |
1960 | ||
ebc5951e AR |
1961 | page = swapin_readahead(entry, GFP_HIGHUSER_MOVABLE, |
1962 | &vmf); | |
1963 | } | |
b56a2d8a VRP |
1964 | if (!page) { |
1965 | if (*swap_map == 0 || *swap_map == SWAP_MAP_BAD) | |
1966 | goto try_next; | |
1967 | return -ENOMEM; | |
1968 | } | |
1969 | ||
1970 | lock_page(page); | |
1971 | wait_on_page_writeback(page); | |
1972 | ret = unuse_pte(vma, pmd, addr, entry, page); | |
1973 | if (ret < 0) { | |
1974 | unlock_page(page); | |
1975 | put_page(page); | |
1976 | goto out; | |
1977 | } | |
1978 | ||
1979 | try_to_free_swap(page); | |
1980 | unlock_page(page); | |
1981 | put_page(page); | |
1982 | ||
1983 | if (*fs_pages_to_unuse && !--(*fs_pages_to_unuse)) { | |
1984 | ret = FRONTSWAP_PAGES_UNUSED; | |
1985 | goto out; | |
1da177e4 | 1986 | } |
b56a2d8a VRP |
1987 | try_next: |
1988 | pte = pte_offset_map(pmd, addr); | |
1da177e4 | 1989 | } while (pte++, addr += PAGE_SIZE, addr != end); |
044d66c1 | 1990 | pte_unmap(pte - 1); |
b56a2d8a VRP |
1991 | |
1992 | ret = 0; | |
044d66c1 | 1993 | out: |
8a9f3ccd | 1994 | return ret; |
1da177e4 LT |
1995 | } |
1996 | ||
1997 | static inline int unuse_pmd_range(struct vm_area_struct *vma, pud_t *pud, | |
1998 | unsigned long addr, unsigned long end, | |
b56a2d8a VRP |
1999 | unsigned int type, bool frontswap, |
2000 | unsigned long *fs_pages_to_unuse) | |
1da177e4 LT |
2001 | { |
2002 | pmd_t *pmd; | |
2003 | unsigned long next; | |
8a9f3ccd | 2004 | int ret; |
1da177e4 LT |
2005 | |
2006 | pmd = pmd_offset(pud, addr); | |
2007 | do { | |
dc644a07 | 2008 | cond_resched(); |
1da177e4 | 2009 | next = pmd_addr_end(addr, end); |
1a5a9906 | 2010 | if (pmd_none_or_trans_huge_or_clear_bad(pmd)) |
1da177e4 | 2011 | continue; |
b56a2d8a VRP |
2012 | ret = unuse_pte_range(vma, pmd, addr, next, type, |
2013 | frontswap, fs_pages_to_unuse); | |
8a9f3ccd BS |
2014 | if (ret) |
2015 | return ret; | |
1da177e4 LT |
2016 | } while (pmd++, addr = next, addr != end); |
2017 | return 0; | |
2018 | } | |
2019 | ||
c2febafc | 2020 | static inline int unuse_pud_range(struct vm_area_struct *vma, p4d_t *p4d, |
1da177e4 | 2021 | unsigned long addr, unsigned long end, |
b56a2d8a VRP |
2022 | unsigned int type, bool frontswap, |
2023 | unsigned long *fs_pages_to_unuse) | |
1da177e4 LT |
2024 | { |
2025 | pud_t *pud; | |
2026 | unsigned long next; | |
8a9f3ccd | 2027 | int ret; |
1da177e4 | 2028 | |
c2febafc | 2029 | pud = pud_offset(p4d, addr); |
1da177e4 LT |
2030 | do { |
2031 | next = pud_addr_end(addr, end); | |
2032 | if (pud_none_or_clear_bad(pud)) | |
2033 | continue; | |
b56a2d8a VRP |
2034 | ret = unuse_pmd_range(vma, pud, addr, next, type, |
2035 | frontswap, fs_pages_to_unuse); | |
8a9f3ccd BS |
2036 | if (ret) |
2037 | return ret; | |
1da177e4 LT |
2038 | } while (pud++, addr = next, addr != end); |
2039 | return 0; | |
2040 | } | |
2041 | ||
c2febafc KS |
2042 | static inline int unuse_p4d_range(struct vm_area_struct *vma, pgd_t *pgd, |
2043 | unsigned long addr, unsigned long end, | |
b56a2d8a VRP |
2044 | unsigned int type, bool frontswap, |
2045 | unsigned long *fs_pages_to_unuse) | |
c2febafc KS |
2046 | { |
2047 | p4d_t *p4d; | |
2048 | unsigned long next; | |
2049 | int ret; | |
2050 | ||
2051 | p4d = p4d_offset(pgd, addr); | |
2052 | do { | |
2053 | next = p4d_addr_end(addr, end); | |
2054 | if (p4d_none_or_clear_bad(p4d)) | |
2055 | continue; | |
b56a2d8a VRP |
2056 | ret = unuse_pud_range(vma, p4d, addr, next, type, |
2057 | frontswap, fs_pages_to_unuse); | |
c2febafc KS |
2058 | if (ret) |
2059 | return ret; | |
2060 | } while (p4d++, addr = next, addr != end); | |
2061 | return 0; | |
2062 | } | |
2063 | ||
b56a2d8a VRP |
2064 | static int unuse_vma(struct vm_area_struct *vma, unsigned int type, |
2065 | bool frontswap, unsigned long *fs_pages_to_unuse) | |
1da177e4 LT |
2066 | { |
2067 | pgd_t *pgd; | |
2068 | unsigned long addr, end, next; | |
8a9f3ccd | 2069 | int ret; |
1da177e4 | 2070 | |
b56a2d8a VRP |
2071 | addr = vma->vm_start; |
2072 | end = vma->vm_end; | |
1da177e4 LT |
2073 | |
2074 | pgd = pgd_offset(vma->vm_mm, addr); | |
2075 | do { | |
2076 | next = pgd_addr_end(addr, end); | |
2077 | if (pgd_none_or_clear_bad(pgd)) | |
2078 | continue; | |
b56a2d8a VRP |
2079 | ret = unuse_p4d_range(vma, pgd, addr, next, type, |
2080 | frontswap, fs_pages_to_unuse); | |
8a9f3ccd BS |
2081 | if (ret) |
2082 | return ret; | |
1da177e4 LT |
2083 | } while (pgd++, addr = next, addr != end); |
2084 | return 0; | |
2085 | } | |
2086 | ||
b56a2d8a VRP |
2087 | static int unuse_mm(struct mm_struct *mm, unsigned int type, |
2088 | bool frontswap, unsigned long *fs_pages_to_unuse) | |
1da177e4 LT |
2089 | { |
2090 | struct vm_area_struct *vma; | |
8a9f3ccd | 2091 | int ret = 0; |
1da177e4 | 2092 | |
d8ed45c5 | 2093 | mmap_read_lock(mm); |
1da177e4 | 2094 | for (vma = mm->mmap; vma; vma = vma->vm_next) { |
b56a2d8a VRP |
2095 | if (vma->anon_vma) { |
2096 | ret = unuse_vma(vma, type, frontswap, | |
2097 | fs_pages_to_unuse); | |
2098 | if (ret) | |
2099 | break; | |
2100 | } | |
dc644a07 | 2101 | cond_resched(); |
1da177e4 | 2102 | } |
d8ed45c5 | 2103 | mmap_read_unlock(mm); |
b56a2d8a | 2104 | return ret; |
1da177e4 LT |
2105 | } |
2106 | ||
2107 | /* | |
38b5faf4 | 2108 | * Scan swap_map (or frontswap_map if frontswap parameter is true) |
b56a2d8a VRP |
2109 | * from current position to next entry still in use. Return 0 |
2110 | * if there are no inuse entries after prev till end of the map. | |
1da177e4 | 2111 | */ |
6eb396dc | 2112 | static unsigned int find_next_to_unuse(struct swap_info_struct *si, |
38b5faf4 | 2113 | unsigned int prev, bool frontswap) |
1da177e4 | 2114 | { |
b56a2d8a | 2115 | unsigned int i; |
8d69aaee | 2116 | unsigned char count; |
1da177e4 LT |
2117 | |
2118 | /* | |
5d337b91 | 2119 | * No need for swap_lock here: we're just looking |
1da177e4 LT |
2120 | * for whether an entry is in use, not modifying it; false |
2121 | * hits are okay, and sys_swapoff() has already prevented new | |
5d337b91 | 2122 | * allocations from this area (while holding swap_lock). |
1da177e4 | 2123 | */ |
b56a2d8a | 2124 | for (i = prev + 1; i < si->max; i++) { |
4db0c3c2 | 2125 | count = READ_ONCE(si->swap_map[i]); |
355cfa73 | 2126 | if (count && swap_count(count) != SWAP_MAP_BAD) |
dc644a07 HD |
2127 | if (!frontswap || frontswap_test(si, i)) |
2128 | break; | |
2129 | if ((i % LATENCY_LIMIT) == 0) | |
2130 | cond_resched(); | |
1da177e4 | 2131 | } |
b56a2d8a VRP |
2132 | |
2133 | if (i == si->max) | |
2134 | i = 0; | |
2135 | ||
1da177e4 LT |
2136 | return i; |
2137 | } | |
2138 | ||
2139 | /* | |
b56a2d8a | 2140 | * If the boolean frontswap is true, only unuse pages_to_unuse pages; |
38b5faf4 | 2141 | * pages_to_unuse==0 means all pages; ignored if frontswap is false |
1da177e4 | 2142 | */ |
38b5faf4 DM |
2143 | int try_to_unuse(unsigned int type, bool frontswap, |
2144 | unsigned long pages_to_unuse) | |
1da177e4 | 2145 | { |
b56a2d8a VRP |
2146 | struct mm_struct *prev_mm; |
2147 | struct mm_struct *mm; | |
2148 | struct list_head *p; | |
2149 | int retval = 0; | |
efa90a98 | 2150 | struct swap_info_struct *si = swap_info[type]; |
1da177e4 LT |
2151 | struct page *page; |
2152 | swp_entry_t entry; | |
b56a2d8a | 2153 | unsigned int i; |
1da177e4 | 2154 | |
21820948 | 2155 | if (!READ_ONCE(si->inuse_pages)) |
b56a2d8a | 2156 | return 0; |
1da177e4 | 2157 | |
b56a2d8a VRP |
2158 | if (!frontswap) |
2159 | pages_to_unuse = 0; | |
2160 | ||
2161 | retry: | |
2162 | retval = shmem_unuse(type, frontswap, &pages_to_unuse); | |
2163 | if (retval) | |
2164 | goto out; | |
2165 | ||
2166 | prev_mm = &init_mm; | |
2167 | mmget(prev_mm); | |
2168 | ||
2169 | spin_lock(&mmlist_lock); | |
2170 | p = &init_mm.mmlist; | |
21820948 | 2171 | while (READ_ONCE(si->inuse_pages) && |
64165b1a HD |
2172 | !signal_pending(current) && |
2173 | (p = p->next) != &init_mm.mmlist) { | |
1da177e4 | 2174 | |
b56a2d8a VRP |
2175 | mm = list_entry(p, struct mm_struct, mmlist); |
2176 | if (!mmget_not_zero(mm)) | |
2177 | continue; | |
2178 | spin_unlock(&mmlist_lock); | |
2179 | mmput(prev_mm); | |
2180 | prev_mm = mm; | |
2181 | retval = unuse_mm(mm, type, frontswap, &pages_to_unuse); | |
1da177e4 | 2182 | |
b56a2d8a VRP |
2183 | if (retval) { |
2184 | mmput(prev_mm); | |
2185 | goto out; | |
1da177e4 LT |
2186 | } |
2187 | ||
2188 | /* | |
b56a2d8a VRP |
2189 | * Make sure that we aren't completely killing |
2190 | * interactive performance. | |
1da177e4 | 2191 | */ |
b56a2d8a VRP |
2192 | cond_resched(); |
2193 | spin_lock(&mmlist_lock); | |
2194 | } | |
2195 | spin_unlock(&mmlist_lock); | |
1da177e4 | 2196 | |
b56a2d8a | 2197 | mmput(prev_mm); |
1da177e4 | 2198 | |
b56a2d8a | 2199 | i = 0; |
21820948 | 2200 | while (READ_ONCE(si->inuse_pages) && |
64165b1a HD |
2201 | !signal_pending(current) && |
2202 | (i = find_next_to_unuse(si, i, frontswap)) != 0) { | |
1da177e4 | 2203 | |
b56a2d8a VRP |
2204 | entry = swp_entry(type, i); |
2205 | page = find_get_page(swap_address_space(entry), i); | |
2206 | if (!page) | |
2207 | continue; | |
68bdc8d6 HD |
2208 | |
2209 | /* | |
2210 | * It is conceivable that a racing task removed this page from | |
b56a2d8a VRP |
2211 | * swap cache just before we acquired the page lock. The page |
2212 | * might even be back in swap cache on another swap area. But | |
2213 | * that is okay, try_to_free_swap() only removes stale pages. | |
1da177e4 | 2214 | */ |
b56a2d8a VRP |
2215 | lock_page(page); |
2216 | wait_on_page_writeback(page); | |
2217 | try_to_free_swap(page); | |
1da177e4 | 2218 | unlock_page(page); |
09cbfeaf | 2219 | put_page(page); |
1da177e4 LT |
2220 | |
2221 | /* | |
b56a2d8a VRP |
2222 | * For frontswap, we just need to unuse pages_to_unuse, if |
2223 | * it was specified. Need not check frontswap again here as | |
2224 | * we already zeroed out pages_to_unuse if not frontswap. | |
1da177e4 | 2225 | */ |
b56a2d8a VRP |
2226 | if (pages_to_unuse && --pages_to_unuse == 0) |
2227 | goto out; | |
1da177e4 LT |
2228 | } |
2229 | ||
b56a2d8a VRP |
2230 | /* |
2231 | * Lets check again to see if there are still swap entries in the map. | |
2232 | * If yes, we would need to do retry the unuse logic again. | |
2233 | * Under global memory pressure, swap entries can be reinserted back | |
2234 | * into process space after the mmlist loop above passes over them. | |
dd862deb | 2235 | * |
af53d3e9 HD |
2236 | * Limit the number of retries? No: when mmget_not_zero() above fails, |
2237 | * that mm is likely to be freeing swap from exit_mmap(), which proceeds | |
2238 | * at its own independent pace; and even shmem_writepage() could have | |
2239 | * been preempted after get_swap_page(), temporarily hiding that swap. | |
2240 | * It's easy and robust (though cpu-intensive) just to keep retrying. | |
b56a2d8a | 2241 | */ |
21820948 | 2242 | if (READ_ONCE(si->inuse_pages)) { |
64165b1a HD |
2243 | if (!signal_pending(current)) |
2244 | goto retry; | |
2245 | retval = -EINTR; | |
2246 | } | |
b56a2d8a VRP |
2247 | out: |
2248 | return (retval == FRONTSWAP_PAGES_UNUSED) ? 0 : retval; | |
1da177e4 LT |
2249 | } |
2250 | ||
2251 | /* | |
5d337b91 HD |
2252 | * After a successful try_to_unuse, if no swap is now in use, we know |
2253 | * we can empty the mmlist. swap_lock must be held on entry and exit. | |
2254 | * Note that mmlist_lock nests inside swap_lock, and an mm must be | |
1da177e4 LT |
2255 | * added to the mmlist just after page_duplicate - before would be racy. |
2256 | */ | |
2257 | static void drain_mmlist(void) | |
2258 | { | |
2259 | struct list_head *p, *next; | |
efa90a98 | 2260 | unsigned int type; |
1da177e4 | 2261 | |
efa90a98 HD |
2262 | for (type = 0; type < nr_swapfiles; type++) |
2263 | if (swap_info[type]->inuse_pages) | |
1da177e4 LT |
2264 | return; |
2265 | spin_lock(&mmlist_lock); | |
2266 | list_for_each_safe(p, next, &init_mm.mmlist) | |
2267 | list_del_init(p); | |
2268 | spin_unlock(&mmlist_lock); | |
2269 | } | |
2270 | ||
1da177e4 LT |
2271 | /* |
2272 | * Free all of a swapdev's extent information | |
2273 | */ | |
2274 | static void destroy_swap_extents(struct swap_info_struct *sis) | |
2275 | { | |
4efaceb1 AL |
2276 | while (!RB_EMPTY_ROOT(&sis->swap_extent_root)) { |
2277 | struct rb_node *rb = sis->swap_extent_root.rb_node; | |
2278 | struct swap_extent *se = rb_entry(rb, struct swap_extent, rb_node); | |
1da177e4 | 2279 | |
4efaceb1 | 2280 | rb_erase(rb, &sis->swap_extent_root); |
1da177e4 LT |
2281 | kfree(se); |
2282 | } | |
62c230bc | 2283 | |
bc4ae27d | 2284 | if (sis->flags & SWP_ACTIVATED) { |
62c230bc MG |
2285 | struct file *swap_file = sis->swap_file; |
2286 | struct address_space *mapping = swap_file->f_mapping; | |
2287 | ||
bc4ae27d OS |
2288 | sis->flags &= ~SWP_ACTIVATED; |
2289 | if (mapping->a_ops->swap_deactivate) | |
2290 | mapping->a_ops->swap_deactivate(swap_file); | |
62c230bc | 2291 | } |
1da177e4 LT |
2292 | } |
2293 | ||
2294 | /* | |
2295 | * Add a block range (and the corresponding page range) into this swapdev's | |
4efaceb1 | 2296 | * extent tree. |
1da177e4 | 2297 | * |
11d31886 | 2298 | * This function rather assumes that it is called in ascending page order. |
1da177e4 | 2299 | */ |
a509bc1a | 2300 | int |
1da177e4 LT |
2301 | add_swap_extent(struct swap_info_struct *sis, unsigned long start_page, |
2302 | unsigned long nr_pages, sector_t start_block) | |
2303 | { | |
4efaceb1 | 2304 | struct rb_node **link = &sis->swap_extent_root.rb_node, *parent = NULL; |
1da177e4 LT |
2305 | struct swap_extent *se; |
2306 | struct swap_extent *new_se; | |
4efaceb1 AL |
2307 | |
2308 | /* | |
2309 | * place the new node at the right most since the | |
2310 | * function is called in ascending page order. | |
2311 | */ | |
2312 | while (*link) { | |
2313 | parent = *link; | |
2314 | link = &parent->rb_right; | |
2315 | } | |
2316 | ||
2317 | if (parent) { | |
2318 | se = rb_entry(parent, struct swap_extent, rb_node); | |
11d31886 HD |
2319 | BUG_ON(se->start_page + se->nr_pages != start_page); |
2320 | if (se->start_block + se->nr_pages == start_block) { | |
1da177e4 LT |
2321 | /* Merge it */ |
2322 | se->nr_pages += nr_pages; | |
2323 | return 0; | |
2324 | } | |
1da177e4 LT |
2325 | } |
2326 | ||
4efaceb1 | 2327 | /* No merge, insert a new extent. */ |
1da177e4 LT |
2328 | new_se = kmalloc(sizeof(*se), GFP_KERNEL); |
2329 | if (new_se == NULL) | |
2330 | return -ENOMEM; | |
2331 | new_se->start_page = start_page; | |
2332 | new_se->nr_pages = nr_pages; | |
2333 | new_se->start_block = start_block; | |
2334 | ||
4efaceb1 AL |
2335 | rb_link_node(&new_se->rb_node, parent, link); |
2336 | rb_insert_color(&new_se->rb_node, &sis->swap_extent_root); | |
53092a74 | 2337 | return 1; |
1da177e4 | 2338 | } |
aa8aa8a3 | 2339 | EXPORT_SYMBOL_GPL(add_swap_extent); |
1da177e4 LT |
2340 | |
2341 | /* | |
2342 | * A `swap extent' is a simple thing which maps a contiguous range of pages | |
2343 | * onto a contiguous range of disk blocks. An ordered list of swap extents | |
2344 | * is built at swapon time and is then used at swap_writepage/swap_readpage | |
2345 | * time for locating where on disk a page belongs. | |
2346 | * | |
2347 | * If the swapfile is an S_ISBLK block device, a single extent is installed. | |
2348 | * This is done so that the main operating code can treat S_ISBLK and S_ISREG | |
2349 | * swap files identically. | |
2350 | * | |
2351 | * Whether the swapdev is an S_ISREG file or an S_ISBLK blockdev, the swap | |
2352 | * extent list operates in PAGE_SIZE disk blocks. Both S_ISREG and S_ISBLK | |
2353 | * swapfiles are handled *identically* after swapon time. | |
2354 | * | |
2355 | * For S_ISREG swapfiles, setup_swap_extents() will walk all the file's blocks | |
2356 | * and will parse them into an ordered extent list, in PAGE_SIZE chunks. If | |
2357 | * some stray blocks are found which do not fall within the PAGE_SIZE alignment | |
2358 | * requirements, they are simply tossed out - we will never use those blocks | |
2359 | * for swapping. | |
2360 | * | |
1638045c DW |
2361 | * For all swap devices we set S_SWAPFILE across the life of the swapon. This |
2362 | * prevents users from writing to the swap device, which will corrupt memory. | |
1da177e4 LT |
2363 | * |
2364 | * The amount of disk space which a single swap extent represents varies. | |
2365 | * Typically it is in the 1-4 megabyte range. So we can have hundreds of | |
2366 | * extents in the list. To avoid much list walking, we cache the previous | |
2367 | * search location in `curr_swap_extent', and start new searches from there. | |
2368 | * This is extremely effective. The average number of iterations in | |
2369 | * map_swap_page() has been measured at about 0.3 per page. - akpm. | |
2370 | */ | |
53092a74 | 2371 | static int setup_swap_extents(struct swap_info_struct *sis, sector_t *span) |
1da177e4 | 2372 | { |
62c230bc MG |
2373 | struct file *swap_file = sis->swap_file; |
2374 | struct address_space *mapping = swap_file->f_mapping; | |
2375 | struct inode *inode = mapping->host; | |
1da177e4 LT |
2376 | int ret; |
2377 | ||
1da177e4 LT |
2378 | if (S_ISBLK(inode->i_mode)) { |
2379 | ret = add_swap_extent(sis, 0, sis->max, 0); | |
53092a74 | 2380 | *span = sis->pages; |
a509bc1a | 2381 | return ret; |
1da177e4 LT |
2382 | } |
2383 | ||
62c230bc | 2384 | if (mapping->a_ops->swap_activate) { |
a509bc1a | 2385 | ret = mapping->a_ops->swap_activate(sis, swap_file, span); |
bc4ae27d OS |
2386 | if (ret >= 0) |
2387 | sis->flags |= SWP_ACTIVATED; | |
62c230bc | 2388 | if (!ret) { |
32646315 | 2389 | sis->flags |= SWP_FS_OPS; |
62c230bc MG |
2390 | ret = add_swap_extent(sis, 0, sis->max, 0); |
2391 | *span = sis->pages; | |
2392 | } | |
a509bc1a | 2393 | return ret; |
62c230bc MG |
2394 | } |
2395 | ||
a509bc1a | 2396 | return generic_swapfile_activate(sis, swap_file, span); |
1da177e4 LT |
2397 | } |
2398 | ||
a2468cc9 AL |
2399 | static int swap_node(struct swap_info_struct *p) |
2400 | { | |
2401 | struct block_device *bdev; | |
2402 | ||
2403 | if (p->bdev) | |
2404 | bdev = p->bdev; | |
2405 | else | |
2406 | bdev = p->swap_file->f_inode->i_sb->s_bdev; | |
2407 | ||
2408 | return bdev ? bdev->bd_disk->node_id : NUMA_NO_NODE; | |
2409 | } | |
2410 | ||
eb085574 HY |
2411 | static void setup_swap_info(struct swap_info_struct *p, int prio, |
2412 | unsigned char *swap_map, | |
2413 | struct swap_cluster_info *cluster_info) | |
40531542 | 2414 | { |
a2468cc9 AL |
2415 | int i; |
2416 | ||
40531542 CEB |
2417 | if (prio >= 0) |
2418 | p->prio = prio; | |
2419 | else | |
2420 | p->prio = --least_priority; | |
18ab4d4c DS |
2421 | /* |
2422 | * the plist prio is negated because plist ordering is | |
2423 | * low-to-high, while swap ordering is high-to-low | |
2424 | */ | |
2425 | p->list.prio = -p->prio; | |
a2468cc9 AL |
2426 | for_each_node(i) { |
2427 | if (p->prio >= 0) | |
2428 | p->avail_lists[i].prio = -p->prio; | |
2429 | else { | |
2430 | if (swap_node(p) == i) | |
2431 | p->avail_lists[i].prio = 1; | |
2432 | else | |
2433 | p->avail_lists[i].prio = -p->prio; | |
2434 | } | |
2435 | } | |
40531542 | 2436 | p->swap_map = swap_map; |
2a8f9449 | 2437 | p->cluster_info = cluster_info; |
eb085574 HY |
2438 | } |
2439 | ||
2440 | static void _enable_swap_info(struct swap_info_struct *p) | |
2441 | { | |
63d8620e | 2442 | p->flags |= SWP_WRITEOK; |
ec8acf20 | 2443 | atomic_long_add(p->pages, &nr_swap_pages); |
40531542 CEB |
2444 | total_swap_pages += p->pages; |
2445 | ||
adfab836 | 2446 | assert_spin_locked(&swap_lock); |
adfab836 | 2447 | /* |
18ab4d4c DS |
2448 | * both lists are plists, and thus priority ordered. |
2449 | * swap_active_head needs to be priority ordered for swapoff(), | |
2450 | * which on removal of any swap_info_struct with an auto-assigned | |
2451 | * (i.e. negative) priority increments the auto-assigned priority | |
2452 | * of any lower-priority swap_info_structs. | |
2453 | * swap_avail_head needs to be priority ordered for get_swap_page(), | |
2454 | * which allocates swap pages from the highest available priority | |
2455 | * swap_info_struct. | |
adfab836 | 2456 | */ |
18ab4d4c | 2457 | plist_add(&p->list, &swap_active_head); |
a2468cc9 | 2458 | add_to_avail_list(p); |
cf0cac0a CEB |
2459 | } |
2460 | ||
2461 | static void enable_swap_info(struct swap_info_struct *p, int prio, | |
2462 | unsigned char *swap_map, | |
2a8f9449 | 2463 | struct swap_cluster_info *cluster_info, |
cf0cac0a CEB |
2464 | unsigned long *frontswap_map) |
2465 | { | |
4f89849d | 2466 | frontswap_init(p->type, frontswap_map); |
cf0cac0a | 2467 | spin_lock(&swap_lock); |
ec8acf20 | 2468 | spin_lock(&p->lock); |
eb085574 HY |
2469 | setup_swap_info(p, prio, swap_map, cluster_info); |
2470 | spin_unlock(&p->lock); | |
2471 | spin_unlock(&swap_lock); | |
2472 | /* | |
63d8620e | 2473 | * Finished initializing swap device, now it's safe to reference it. |
eb085574 | 2474 | */ |
63d8620e | 2475 | percpu_ref_resurrect(&p->users); |
eb085574 HY |
2476 | spin_lock(&swap_lock); |
2477 | spin_lock(&p->lock); | |
2478 | _enable_swap_info(p); | |
ec8acf20 | 2479 | spin_unlock(&p->lock); |
cf0cac0a CEB |
2480 | spin_unlock(&swap_lock); |
2481 | } | |
2482 | ||
2483 | static void reinsert_swap_info(struct swap_info_struct *p) | |
2484 | { | |
2485 | spin_lock(&swap_lock); | |
ec8acf20 | 2486 | spin_lock(&p->lock); |
eb085574 HY |
2487 | setup_swap_info(p, p->prio, p->swap_map, p->cluster_info); |
2488 | _enable_swap_info(p); | |
ec8acf20 | 2489 | spin_unlock(&p->lock); |
40531542 CEB |
2490 | spin_unlock(&swap_lock); |
2491 | } | |
2492 | ||
67afa38e TC |
2493 | bool has_usable_swap(void) |
2494 | { | |
2495 | bool ret = true; | |
2496 | ||
2497 | spin_lock(&swap_lock); | |
2498 | if (plist_head_empty(&swap_active_head)) | |
2499 | ret = false; | |
2500 | spin_unlock(&swap_lock); | |
2501 | return ret; | |
2502 | } | |
2503 | ||
c4ea37c2 | 2504 | SYSCALL_DEFINE1(swapoff, const char __user *, specialfile) |
1da177e4 | 2505 | { |
73c34b6a | 2506 | struct swap_info_struct *p = NULL; |
8d69aaee | 2507 | unsigned char *swap_map; |
2a8f9449 | 2508 | struct swap_cluster_info *cluster_info; |
4f89849d | 2509 | unsigned long *frontswap_map; |
1da177e4 LT |
2510 | struct file *swap_file, *victim; |
2511 | struct address_space *mapping; | |
2512 | struct inode *inode; | |
91a27b2a | 2513 | struct filename *pathname; |
adfab836 | 2514 | int err, found = 0; |
5b808a23 | 2515 | unsigned int old_block_size; |
886bb7e9 | 2516 | |
1da177e4 LT |
2517 | if (!capable(CAP_SYS_ADMIN)) |
2518 | return -EPERM; | |
2519 | ||
191c5424 AV |
2520 | BUG_ON(!current->mm); |
2521 | ||
1da177e4 | 2522 | pathname = getname(specialfile); |
1da177e4 | 2523 | if (IS_ERR(pathname)) |
f58b59c1 | 2524 | return PTR_ERR(pathname); |
1da177e4 | 2525 | |
669abf4e | 2526 | victim = file_open_name(pathname, O_RDWR|O_LARGEFILE, 0); |
1da177e4 LT |
2527 | err = PTR_ERR(victim); |
2528 | if (IS_ERR(victim)) | |
2529 | goto out; | |
2530 | ||
2531 | mapping = victim->f_mapping; | |
5d337b91 | 2532 | spin_lock(&swap_lock); |
18ab4d4c | 2533 | plist_for_each_entry(p, &swap_active_head, list) { |
22c6f8fd | 2534 | if (p->flags & SWP_WRITEOK) { |
adfab836 DS |
2535 | if (p->swap_file->f_mapping == mapping) { |
2536 | found = 1; | |
1da177e4 | 2537 | break; |
adfab836 | 2538 | } |
1da177e4 | 2539 | } |
1da177e4 | 2540 | } |
adfab836 | 2541 | if (!found) { |
1da177e4 | 2542 | err = -EINVAL; |
5d337b91 | 2543 | spin_unlock(&swap_lock); |
1da177e4 LT |
2544 | goto out_dput; |
2545 | } | |
191c5424 | 2546 | if (!security_vm_enough_memory_mm(current->mm, p->pages)) |
1da177e4 LT |
2547 | vm_unacct_memory(p->pages); |
2548 | else { | |
2549 | err = -ENOMEM; | |
5d337b91 | 2550 | spin_unlock(&swap_lock); |
1da177e4 LT |
2551 | goto out_dput; |
2552 | } | |
a2468cc9 | 2553 | del_from_avail_list(p); |
ec8acf20 | 2554 | spin_lock(&p->lock); |
78ecba08 | 2555 | if (p->prio < 0) { |
adfab836 | 2556 | struct swap_info_struct *si = p; |
a2468cc9 | 2557 | int nid; |
adfab836 | 2558 | |
18ab4d4c | 2559 | plist_for_each_entry_continue(si, &swap_active_head, list) { |
adfab836 | 2560 | si->prio++; |
18ab4d4c | 2561 | si->list.prio--; |
a2468cc9 AL |
2562 | for_each_node(nid) { |
2563 | if (si->avail_lists[nid].prio != 1) | |
2564 | si->avail_lists[nid].prio--; | |
2565 | } | |
adfab836 | 2566 | } |
78ecba08 HD |
2567 | least_priority++; |
2568 | } | |
18ab4d4c | 2569 | plist_del(&p->list, &swap_active_head); |
ec8acf20 | 2570 | atomic_long_sub(p->pages, &nr_swap_pages); |
1da177e4 LT |
2571 | total_swap_pages -= p->pages; |
2572 | p->flags &= ~SWP_WRITEOK; | |
ec8acf20 | 2573 | spin_unlock(&p->lock); |
5d337b91 | 2574 | spin_unlock(&swap_lock); |
fb4f88dc | 2575 | |
039939a6 TC |
2576 | disable_swap_slots_cache_lock(); |
2577 | ||
e1e12d2f | 2578 | set_current_oom_origin(); |
adfab836 | 2579 | err = try_to_unuse(p->type, false, 0); /* force unuse all pages */ |
e1e12d2f | 2580 | clear_current_oom_origin(); |
1da177e4 | 2581 | |
1da177e4 LT |
2582 | if (err) { |
2583 | /* re-insert swap space back into swap_list */ | |
cf0cac0a | 2584 | reinsert_swap_info(p); |
039939a6 | 2585 | reenable_swap_slots_cache_unlock(); |
1da177e4 LT |
2586 | goto out_dput; |
2587 | } | |
52b7efdb | 2588 | |
039939a6 TC |
2589 | reenable_swap_slots_cache_unlock(); |
2590 | ||
eb085574 | 2591 | /* |
63d8620e ML |
2592 | * Wait for swap operations protected by get/put_swap_device() |
2593 | * to complete. | |
2594 | * | |
2595 | * We need synchronize_rcu() here to protect the accessing to | |
2596 | * the swap cache data structure. | |
eb085574 | 2597 | */ |
63d8620e | 2598 | percpu_ref_kill(&p->users); |
eb085574 | 2599 | synchronize_rcu(); |
63d8620e | 2600 | wait_for_completion(&p->comp); |
eb085574 | 2601 | |
815c2c54 SL |
2602 | flush_work(&p->discard_work); |
2603 | ||
5d337b91 | 2604 | destroy_swap_extents(p); |
570a335b HD |
2605 | if (p->flags & SWP_CONTINUED) |
2606 | free_swap_count_continuations(p); | |
2607 | ||
81a0298b HY |
2608 | if (!p->bdev || !blk_queue_nonrot(bdev_get_queue(p->bdev))) |
2609 | atomic_dec(&nr_rotate_swap); | |
2610 | ||
fc0abb14 | 2611 | mutex_lock(&swapon_mutex); |
5d337b91 | 2612 | spin_lock(&swap_lock); |
ec8acf20 | 2613 | spin_lock(&p->lock); |
5d337b91 HD |
2614 | drain_mmlist(); |
2615 | ||
bb243f7d | 2616 | /* wait for anyone still in scan_swap_map_slots */ |
52b7efdb HD |
2617 | p->highest_bit = 0; /* cuts scans short */ |
2618 | while (p->flags >= SWP_SCANNING) { | |
ec8acf20 | 2619 | spin_unlock(&p->lock); |
5d337b91 | 2620 | spin_unlock(&swap_lock); |
13e4b57f | 2621 | schedule_timeout_uninterruptible(1); |
5d337b91 | 2622 | spin_lock(&swap_lock); |
ec8acf20 | 2623 | spin_lock(&p->lock); |
52b7efdb | 2624 | } |
52b7efdb | 2625 | |
1da177e4 | 2626 | swap_file = p->swap_file; |
5b808a23 | 2627 | old_block_size = p->old_block_size; |
1da177e4 LT |
2628 | p->swap_file = NULL; |
2629 | p->max = 0; | |
2630 | swap_map = p->swap_map; | |
2631 | p->swap_map = NULL; | |
2a8f9449 SL |
2632 | cluster_info = p->cluster_info; |
2633 | p->cluster_info = NULL; | |
4f89849d | 2634 | frontswap_map = frontswap_map_get(p); |
ec8acf20 | 2635 | spin_unlock(&p->lock); |
5d337b91 | 2636 | spin_unlock(&swap_lock); |
8a84802e | 2637 | arch_swap_invalidate_area(p->type); |
adfab836 | 2638 | frontswap_invalidate_area(p->type); |
58e97ba6 | 2639 | frontswap_map_set(p, NULL); |
fc0abb14 | 2640 | mutex_unlock(&swapon_mutex); |
ebc2a1a6 SL |
2641 | free_percpu(p->percpu_cluster); |
2642 | p->percpu_cluster = NULL; | |
49070588 HY |
2643 | free_percpu(p->cluster_next_cpu); |
2644 | p->cluster_next_cpu = NULL; | |
1da177e4 | 2645 | vfree(swap_map); |
54f180d3 HY |
2646 | kvfree(cluster_info); |
2647 | kvfree(frontswap_map); | |
2de1a7e4 | 2648 | /* Destroy swap account information */ |
adfab836 | 2649 | swap_cgroup_swapoff(p->type); |
4b3ef9da | 2650 | exit_swap_address_space(p->type); |
27a7faa0 | 2651 | |
1da177e4 LT |
2652 | inode = mapping->host; |
2653 | if (S_ISBLK(inode->i_mode)) { | |
2654 | struct block_device *bdev = I_BDEV(inode); | |
1638045c | 2655 | |
5b808a23 | 2656 | set_blocksize(bdev, old_block_size); |
e525fd89 | 2657 | blkdev_put(bdev, FMODE_READ | FMODE_WRITE | FMODE_EXCL); |
1da177e4 | 2658 | } |
1638045c DW |
2659 | |
2660 | inode_lock(inode); | |
2661 | inode->i_flags &= ~S_SWAPFILE; | |
2662 | inode_unlock(inode); | |
1da177e4 | 2663 | filp_close(swap_file, NULL); |
f893ab41 WY |
2664 | |
2665 | /* | |
2666 | * Clear the SWP_USED flag after all resources are freed so that swapon | |
2667 | * can reuse this swap_info in alloc_swap_info() safely. It is ok to | |
2668 | * not hold p->lock after we cleared its SWP_WRITEOK. | |
2669 | */ | |
2670 | spin_lock(&swap_lock); | |
2671 | p->flags = 0; | |
2672 | spin_unlock(&swap_lock); | |
2673 | ||
1da177e4 | 2674 | err = 0; |
66d7dd51 KS |
2675 | atomic_inc(&proc_poll_event); |
2676 | wake_up_interruptible(&proc_poll_wait); | |
1da177e4 LT |
2677 | |
2678 | out_dput: | |
2679 | filp_close(victim, NULL); | |
2680 | out: | |
f58b59c1 | 2681 | putname(pathname); |
1da177e4 LT |
2682 | return err; |
2683 | } | |
2684 | ||
2685 | #ifdef CONFIG_PROC_FS | |
9dd95748 | 2686 | static __poll_t swaps_poll(struct file *file, poll_table *wait) |
66d7dd51 | 2687 | { |
f1514638 | 2688 | struct seq_file *seq = file->private_data; |
66d7dd51 KS |
2689 | |
2690 | poll_wait(file, &proc_poll_wait, wait); | |
2691 | ||
f1514638 KS |
2692 | if (seq->poll_event != atomic_read(&proc_poll_event)) { |
2693 | seq->poll_event = atomic_read(&proc_poll_event); | |
a9a08845 | 2694 | return EPOLLIN | EPOLLRDNORM | EPOLLERR | EPOLLPRI; |
66d7dd51 KS |
2695 | } |
2696 | ||
a9a08845 | 2697 | return EPOLLIN | EPOLLRDNORM; |
66d7dd51 KS |
2698 | } |
2699 | ||
1da177e4 LT |
2700 | /* iterator */ |
2701 | static void *swap_start(struct seq_file *swap, loff_t *pos) | |
2702 | { | |
efa90a98 HD |
2703 | struct swap_info_struct *si; |
2704 | int type; | |
1da177e4 LT |
2705 | loff_t l = *pos; |
2706 | ||
fc0abb14 | 2707 | mutex_lock(&swapon_mutex); |
1da177e4 | 2708 | |
881e4aab SS |
2709 | if (!l) |
2710 | return SEQ_START_TOKEN; | |
2711 | ||
c10d38cc | 2712 | for (type = 0; (si = swap_type_to_swap_info(type)); type++) { |
efa90a98 | 2713 | if (!(si->flags & SWP_USED) || !si->swap_map) |
1da177e4 | 2714 | continue; |
881e4aab | 2715 | if (!--l) |
efa90a98 | 2716 | return si; |
1da177e4 LT |
2717 | } |
2718 | ||
2719 | return NULL; | |
2720 | } | |
2721 | ||
2722 | static void *swap_next(struct seq_file *swap, void *v, loff_t *pos) | |
2723 | { | |
efa90a98 HD |
2724 | struct swap_info_struct *si = v; |
2725 | int type; | |
1da177e4 | 2726 | |
881e4aab | 2727 | if (v == SEQ_START_TOKEN) |
efa90a98 HD |
2728 | type = 0; |
2729 | else | |
2730 | type = si->type + 1; | |
881e4aab | 2731 | |
10c8d69f | 2732 | ++(*pos); |
c10d38cc | 2733 | for (; (si = swap_type_to_swap_info(type)); type++) { |
efa90a98 | 2734 | if (!(si->flags & SWP_USED) || !si->swap_map) |
1da177e4 | 2735 | continue; |
efa90a98 | 2736 | return si; |
1da177e4 LT |
2737 | } |
2738 | ||
2739 | return NULL; | |
2740 | } | |
2741 | ||
2742 | static void swap_stop(struct seq_file *swap, void *v) | |
2743 | { | |
fc0abb14 | 2744 | mutex_unlock(&swapon_mutex); |
1da177e4 LT |
2745 | } |
2746 | ||
2747 | static int swap_show(struct seq_file *swap, void *v) | |
2748 | { | |
efa90a98 | 2749 | struct swap_info_struct *si = v; |
1da177e4 LT |
2750 | struct file *file; |
2751 | int len; | |
642929a2 | 2752 | unsigned long bytes, inuse; |
1da177e4 | 2753 | |
efa90a98 | 2754 | if (si == SEQ_START_TOKEN) { |
68d68ff6 | 2755 | seq_puts(swap, "Filename\t\t\t\tType\t\tSize\t\tUsed\t\tPriority\n"); |
881e4aab SS |
2756 | return 0; |
2757 | } | |
1da177e4 | 2758 | |
6f793940 RD |
2759 | bytes = si->pages << (PAGE_SHIFT - 10); |
2760 | inuse = si->inuse_pages << (PAGE_SHIFT - 10); | |
2761 | ||
efa90a98 | 2762 | file = si->swap_file; |
2726d566 | 2763 | len = seq_file_path(swap, file, " \t\n\\"); |
642929a2 | 2764 | seq_printf(swap, "%*s%s\t%lu\t%s%lu\t%s%d\n", |
886bb7e9 | 2765 | len < 40 ? 40 - len : 1, " ", |
496ad9aa | 2766 | S_ISBLK(file_inode(file)->i_mode) ? |
1da177e4 | 2767 | "partition" : "file\t", |
6f793940 RD |
2768 | bytes, bytes < 10000000 ? "\t" : "", |
2769 | inuse, inuse < 10000000 ? "\t" : "", | |
efa90a98 | 2770 | si->prio); |
1da177e4 LT |
2771 | return 0; |
2772 | } | |
2773 | ||
15ad7cdc | 2774 | static const struct seq_operations swaps_op = { |
1da177e4 LT |
2775 | .start = swap_start, |
2776 | .next = swap_next, | |
2777 | .stop = swap_stop, | |
2778 | .show = swap_show | |
2779 | }; | |
2780 | ||
2781 | static int swaps_open(struct inode *inode, struct file *file) | |
2782 | { | |
f1514638 | 2783 | struct seq_file *seq; |
66d7dd51 KS |
2784 | int ret; |
2785 | ||
66d7dd51 | 2786 | ret = seq_open(file, &swaps_op); |
f1514638 | 2787 | if (ret) |
66d7dd51 | 2788 | return ret; |
66d7dd51 | 2789 | |
f1514638 KS |
2790 | seq = file->private_data; |
2791 | seq->poll_event = atomic_read(&proc_poll_event); | |
2792 | return 0; | |
1da177e4 LT |
2793 | } |
2794 | ||
97a32539 | 2795 | static const struct proc_ops swaps_proc_ops = { |
d919b33d | 2796 | .proc_flags = PROC_ENTRY_PERMANENT, |
97a32539 AD |
2797 | .proc_open = swaps_open, |
2798 | .proc_read = seq_read, | |
2799 | .proc_lseek = seq_lseek, | |
2800 | .proc_release = seq_release, | |
2801 | .proc_poll = swaps_poll, | |
1da177e4 LT |
2802 | }; |
2803 | ||
2804 | static int __init procswaps_init(void) | |
2805 | { | |
97a32539 | 2806 | proc_create("swaps", 0, NULL, &swaps_proc_ops); |
1da177e4 LT |
2807 | return 0; |
2808 | } | |
2809 | __initcall(procswaps_init); | |
2810 | #endif /* CONFIG_PROC_FS */ | |
2811 | ||
1796316a JB |
2812 | #ifdef MAX_SWAPFILES_CHECK |
2813 | static int __init max_swapfiles_check(void) | |
2814 | { | |
2815 | MAX_SWAPFILES_CHECK(); | |
2816 | return 0; | |
2817 | } | |
2818 | late_initcall(max_swapfiles_check); | |
2819 | #endif | |
2820 | ||
53cbb243 | 2821 | static struct swap_info_struct *alloc_swap_info(void) |
1da177e4 | 2822 | { |
73c34b6a | 2823 | struct swap_info_struct *p; |
b11a76b3 | 2824 | struct swap_info_struct *defer = NULL; |
1da177e4 | 2825 | unsigned int type; |
a2468cc9 | 2826 | int i; |
efa90a98 | 2827 | |
96008744 | 2828 | p = kvzalloc(struct_size(p, avail_lists, nr_node_ids), GFP_KERNEL); |
efa90a98 | 2829 | if (!p) |
53cbb243 | 2830 | return ERR_PTR(-ENOMEM); |
efa90a98 | 2831 | |
63d8620e ML |
2832 | if (percpu_ref_init(&p->users, swap_users_ref_free, |
2833 | PERCPU_REF_INIT_DEAD, GFP_KERNEL)) { | |
2834 | kvfree(p); | |
2835 | return ERR_PTR(-ENOMEM); | |
2836 | } | |
2837 | ||
5d337b91 | 2838 | spin_lock(&swap_lock); |
efa90a98 HD |
2839 | for (type = 0; type < nr_swapfiles; type++) { |
2840 | if (!(swap_info[type]->flags & SWP_USED)) | |
1da177e4 | 2841 | break; |
efa90a98 | 2842 | } |
0697212a | 2843 | if (type >= MAX_SWAPFILES) { |
5d337b91 | 2844 | spin_unlock(&swap_lock); |
63d8620e | 2845 | percpu_ref_exit(&p->users); |
873d7bcf | 2846 | kvfree(p); |
730c0581 | 2847 | return ERR_PTR(-EPERM); |
1da177e4 | 2848 | } |
efa90a98 HD |
2849 | if (type >= nr_swapfiles) { |
2850 | p->type = type; | |
efa90a98 | 2851 | /* |
a4b45114 HY |
2852 | * Publish the swap_info_struct after initializing it. |
2853 | * Note that kvzalloc() above zeroes all its fields. | |
efa90a98 | 2854 | */ |
a4b45114 HY |
2855 | smp_store_release(&swap_info[type], p); /* rcu_assign_pointer() */ |
2856 | nr_swapfiles++; | |
efa90a98 | 2857 | } else { |
b11a76b3 | 2858 | defer = p; |
efa90a98 HD |
2859 | p = swap_info[type]; |
2860 | /* | |
2861 | * Do not memset this entry: a racing procfs swap_next() | |
2862 | * would be relying on p->type to remain valid. | |
2863 | */ | |
2864 | } | |
4efaceb1 | 2865 | p->swap_extent_root = RB_ROOT; |
18ab4d4c | 2866 | plist_node_init(&p->list, 0); |
a2468cc9 AL |
2867 | for_each_node(i) |
2868 | plist_node_init(&p->avail_lists[i], 0); | |
1da177e4 | 2869 | p->flags = SWP_USED; |
5d337b91 | 2870 | spin_unlock(&swap_lock); |
63d8620e ML |
2871 | if (defer) { |
2872 | percpu_ref_exit(&defer->users); | |
2873 | kvfree(defer); | |
2874 | } | |
ec8acf20 | 2875 | spin_lock_init(&p->lock); |
2628bd6f | 2876 | spin_lock_init(&p->cont_lock); |
63d8620e | 2877 | init_completion(&p->comp); |
efa90a98 | 2878 | |
53cbb243 | 2879 | return p; |
53cbb243 CEB |
2880 | } |
2881 | ||
4d0e1e10 CEB |
2882 | static int claim_swapfile(struct swap_info_struct *p, struct inode *inode) |
2883 | { | |
2884 | int error; | |
2885 | ||
2886 | if (S_ISBLK(inode->i_mode)) { | |
ef16e1d9 | 2887 | p->bdev = blkdev_get_by_dev(inode->i_rdev, |
6f179af8 | 2888 | FMODE_READ | FMODE_WRITE | FMODE_EXCL, p); |
ef16e1d9 CH |
2889 | if (IS_ERR(p->bdev)) { |
2890 | error = PTR_ERR(p->bdev); | |
4d0e1e10 | 2891 | p->bdev = NULL; |
6f179af8 | 2892 | return error; |
4d0e1e10 CEB |
2893 | } |
2894 | p->old_block_size = block_size(p->bdev); | |
2895 | error = set_blocksize(p->bdev, PAGE_SIZE); | |
2896 | if (error < 0) | |
87ade72a | 2897 | return error; |
12d2966d NA |
2898 | /* |
2899 | * Zoned block devices contain zones that have a sequential | |
2900 | * write only restriction. Hence zoned block devices are not | |
2901 | * suitable for swapping. Disallow them here. | |
2902 | */ | |
e556f6ba | 2903 | if (blk_queue_is_zoned(p->bdev->bd_disk->queue)) |
12d2966d | 2904 | return -EINVAL; |
4d0e1e10 CEB |
2905 | p->flags |= SWP_BLKDEV; |
2906 | } else if (S_ISREG(inode->i_mode)) { | |
2907 | p->bdev = inode->i_sb->s_bdev; | |
1638045c DW |
2908 | } |
2909 | ||
4d0e1e10 | 2910 | return 0; |
4d0e1e10 CEB |
2911 | } |
2912 | ||
377eeaa8 AK |
2913 | |
2914 | /* | |
2915 | * Find out how many pages are allowed for a single swap device. There | |
2916 | * are two limiting factors: | |
2917 | * 1) the number of bits for the swap offset in the swp_entry_t type, and | |
2918 | * 2) the number of bits in the swap pte, as defined by the different | |
2919 | * architectures. | |
2920 | * | |
2921 | * In order to find the largest possible bit mask, a swap entry with | |
2922 | * swap type 0 and swap offset ~0UL is created, encoded to a swap pte, | |
2923 | * decoded to a swp_entry_t again, and finally the swap offset is | |
2924 | * extracted. | |
2925 | * | |
2926 | * This will mask all the bits from the initial ~0UL mask that can't | |
2927 | * be encoded in either the swp_entry_t or the architecture definition | |
2928 | * of a swap pte. | |
2929 | */ | |
2930 | unsigned long generic_max_swapfile_size(void) | |
2931 | { | |
2932 | return swp_offset(pte_to_swp_entry( | |
2933 | swp_entry_to_pte(swp_entry(0, ~0UL)))) + 1; | |
2934 | } | |
2935 | ||
2936 | /* Can be overridden by an architecture for additional checks. */ | |
2937 | __weak unsigned long max_swapfile_size(void) | |
2938 | { | |
2939 | return generic_max_swapfile_size(); | |
2940 | } | |
2941 | ||
ca8bd38b CEB |
2942 | static unsigned long read_swap_header(struct swap_info_struct *p, |
2943 | union swap_header *swap_header, | |
2944 | struct inode *inode) | |
2945 | { | |
2946 | int i; | |
2947 | unsigned long maxpages; | |
2948 | unsigned long swapfilepages; | |
d6bbbd29 | 2949 | unsigned long last_page; |
ca8bd38b CEB |
2950 | |
2951 | if (memcmp("SWAPSPACE2", swap_header->magic.magic, 10)) { | |
465c47fd | 2952 | pr_err("Unable to find swap-space signature\n"); |
38719025 | 2953 | return 0; |
ca8bd38b CEB |
2954 | } |
2955 | ||
041711ce | 2956 | /* swap partition endianness hack... */ |
ca8bd38b CEB |
2957 | if (swab32(swap_header->info.version) == 1) { |
2958 | swab32s(&swap_header->info.version); | |
2959 | swab32s(&swap_header->info.last_page); | |
2960 | swab32s(&swap_header->info.nr_badpages); | |
dd111be6 JH |
2961 | if (swap_header->info.nr_badpages > MAX_SWAP_BADPAGES) |
2962 | return 0; | |
ca8bd38b CEB |
2963 | for (i = 0; i < swap_header->info.nr_badpages; i++) |
2964 | swab32s(&swap_header->info.badpages[i]); | |
2965 | } | |
2966 | /* Check the swap header's sub-version */ | |
2967 | if (swap_header->info.version != 1) { | |
465c47fd AM |
2968 | pr_warn("Unable to handle swap header version %d\n", |
2969 | swap_header->info.version); | |
38719025 | 2970 | return 0; |
ca8bd38b CEB |
2971 | } |
2972 | ||
2973 | p->lowest_bit = 1; | |
2974 | p->cluster_next = 1; | |
2975 | p->cluster_nr = 0; | |
2976 | ||
377eeaa8 | 2977 | maxpages = max_swapfile_size(); |
d6bbbd29 | 2978 | last_page = swap_header->info.last_page; |
a06ad633 TA |
2979 | if (!last_page) { |
2980 | pr_warn("Empty swap-file\n"); | |
2981 | return 0; | |
2982 | } | |
d6bbbd29 | 2983 | if (last_page > maxpages) { |
465c47fd | 2984 | pr_warn("Truncating oversized swap area, only using %luk out of %luk\n", |
d6bbbd29 RJ |
2985 | maxpages << (PAGE_SHIFT - 10), |
2986 | last_page << (PAGE_SHIFT - 10)); | |
2987 | } | |
2988 | if (maxpages > last_page) { | |
2989 | maxpages = last_page + 1; | |
ca8bd38b CEB |
2990 | /* p->max is an unsigned int: don't overflow it */ |
2991 | if ((unsigned int)maxpages == 0) | |
2992 | maxpages = UINT_MAX; | |
2993 | } | |
2994 | p->highest_bit = maxpages - 1; | |
2995 | ||
2996 | if (!maxpages) | |
38719025 | 2997 | return 0; |
ca8bd38b CEB |
2998 | swapfilepages = i_size_read(inode) >> PAGE_SHIFT; |
2999 | if (swapfilepages && maxpages > swapfilepages) { | |
465c47fd | 3000 | pr_warn("Swap area shorter than signature indicates\n"); |
38719025 | 3001 | return 0; |
ca8bd38b CEB |
3002 | } |
3003 | if (swap_header->info.nr_badpages && S_ISREG(inode->i_mode)) | |
38719025 | 3004 | return 0; |
ca8bd38b | 3005 | if (swap_header->info.nr_badpages > MAX_SWAP_BADPAGES) |
38719025 | 3006 | return 0; |
ca8bd38b CEB |
3007 | |
3008 | return maxpages; | |
ca8bd38b CEB |
3009 | } |
3010 | ||
4b3ef9da | 3011 | #define SWAP_CLUSTER_INFO_COLS \ |
235b6217 | 3012 | DIV_ROUND_UP(L1_CACHE_BYTES, sizeof(struct swap_cluster_info)) |
4b3ef9da HY |
3013 | #define SWAP_CLUSTER_SPACE_COLS \ |
3014 | DIV_ROUND_UP(SWAP_ADDRESS_SPACE_PAGES, SWAPFILE_CLUSTER) | |
3015 | #define SWAP_CLUSTER_COLS \ | |
3016 | max_t(unsigned int, SWAP_CLUSTER_INFO_COLS, SWAP_CLUSTER_SPACE_COLS) | |
235b6217 | 3017 | |
915d4d7b CEB |
3018 | static int setup_swap_map_and_extents(struct swap_info_struct *p, |
3019 | union swap_header *swap_header, | |
3020 | unsigned char *swap_map, | |
2a8f9449 | 3021 | struct swap_cluster_info *cluster_info, |
915d4d7b CEB |
3022 | unsigned long maxpages, |
3023 | sector_t *span) | |
3024 | { | |
235b6217 | 3025 | unsigned int j, k; |
915d4d7b CEB |
3026 | unsigned int nr_good_pages; |
3027 | int nr_extents; | |
2a8f9449 | 3028 | unsigned long nr_clusters = DIV_ROUND_UP(maxpages, SWAPFILE_CLUSTER); |
235b6217 HY |
3029 | unsigned long col = p->cluster_next / SWAPFILE_CLUSTER % SWAP_CLUSTER_COLS; |
3030 | unsigned long i, idx; | |
915d4d7b CEB |
3031 | |
3032 | nr_good_pages = maxpages - 1; /* omit header page */ | |
3033 | ||
6b534915 HY |
3034 | cluster_list_init(&p->free_clusters); |
3035 | cluster_list_init(&p->discard_clusters); | |
2a8f9449 | 3036 | |
915d4d7b CEB |
3037 | for (i = 0; i < swap_header->info.nr_badpages; i++) { |
3038 | unsigned int page_nr = swap_header->info.badpages[i]; | |
bdb8e3f6 CEB |
3039 | if (page_nr == 0 || page_nr > swap_header->info.last_page) |
3040 | return -EINVAL; | |
915d4d7b CEB |
3041 | if (page_nr < maxpages) { |
3042 | swap_map[page_nr] = SWAP_MAP_BAD; | |
3043 | nr_good_pages--; | |
2a8f9449 SL |
3044 | /* |
3045 | * Haven't marked the cluster free yet, no list | |
3046 | * operation involved | |
3047 | */ | |
3048 | inc_cluster_info_page(p, cluster_info, page_nr); | |
915d4d7b CEB |
3049 | } |
3050 | } | |
3051 | ||
2a8f9449 SL |
3052 | /* Haven't marked the cluster free yet, no list operation involved */ |
3053 | for (i = maxpages; i < round_up(maxpages, SWAPFILE_CLUSTER); i++) | |
3054 | inc_cluster_info_page(p, cluster_info, i); | |
3055 | ||
915d4d7b CEB |
3056 | if (nr_good_pages) { |
3057 | swap_map[0] = SWAP_MAP_BAD; | |
2a8f9449 SL |
3058 | /* |
3059 | * Not mark the cluster free yet, no list | |
3060 | * operation involved | |
3061 | */ | |
3062 | inc_cluster_info_page(p, cluster_info, 0); | |
915d4d7b CEB |
3063 | p->max = maxpages; |
3064 | p->pages = nr_good_pages; | |
3065 | nr_extents = setup_swap_extents(p, span); | |
bdb8e3f6 CEB |
3066 | if (nr_extents < 0) |
3067 | return nr_extents; | |
915d4d7b CEB |
3068 | nr_good_pages = p->pages; |
3069 | } | |
3070 | if (!nr_good_pages) { | |
465c47fd | 3071 | pr_warn("Empty swap-file\n"); |
bdb8e3f6 | 3072 | return -EINVAL; |
915d4d7b CEB |
3073 | } |
3074 | ||
2a8f9449 SL |
3075 | if (!cluster_info) |
3076 | return nr_extents; | |
3077 | ||
235b6217 | 3078 | |
4b3ef9da HY |
3079 | /* |
3080 | * Reduce false cache line sharing between cluster_info and | |
3081 | * sharing same address space. | |
3082 | */ | |
235b6217 HY |
3083 | for (k = 0; k < SWAP_CLUSTER_COLS; k++) { |
3084 | j = (k + col) % SWAP_CLUSTER_COLS; | |
3085 | for (i = 0; i < DIV_ROUND_UP(nr_clusters, SWAP_CLUSTER_COLS); i++) { | |
3086 | idx = i * SWAP_CLUSTER_COLS + j; | |
3087 | if (idx >= nr_clusters) | |
3088 | continue; | |
3089 | if (cluster_count(&cluster_info[idx])) | |
3090 | continue; | |
2a8f9449 | 3091 | cluster_set_flag(&cluster_info[idx], CLUSTER_FLAG_FREE); |
6b534915 HY |
3092 | cluster_list_add_tail(&p->free_clusters, cluster_info, |
3093 | idx); | |
2a8f9449 | 3094 | } |
2a8f9449 | 3095 | } |
915d4d7b | 3096 | return nr_extents; |
915d4d7b CEB |
3097 | } |
3098 | ||
dcf6b7dd RA |
3099 | /* |
3100 | * Helper to sys_swapon determining if a given swap | |
3101 | * backing device queue supports DISCARD operations. | |
3102 | */ | |
3103 | static bool swap_discardable(struct swap_info_struct *si) | |
3104 | { | |
3105 | struct request_queue *q = bdev_get_queue(si->bdev); | |
3106 | ||
363dc512 | 3107 | if (!blk_queue_discard(q)) |
dcf6b7dd RA |
3108 | return false; |
3109 | ||
3110 | return true; | |
3111 | } | |
3112 | ||
53cbb243 CEB |
3113 | SYSCALL_DEFINE2(swapon, const char __user *, specialfile, int, swap_flags) |
3114 | { | |
3115 | struct swap_info_struct *p; | |
91a27b2a | 3116 | struct filename *name; |
53cbb243 CEB |
3117 | struct file *swap_file = NULL; |
3118 | struct address_space *mapping; | |
51cc3a66 | 3119 | struct dentry *dentry; |
40531542 | 3120 | int prio; |
53cbb243 CEB |
3121 | int error; |
3122 | union swap_header *swap_header; | |
915d4d7b | 3123 | int nr_extents; |
53cbb243 CEB |
3124 | sector_t span; |
3125 | unsigned long maxpages; | |
53cbb243 | 3126 | unsigned char *swap_map = NULL; |
2a8f9449 | 3127 | struct swap_cluster_info *cluster_info = NULL; |
38b5faf4 | 3128 | unsigned long *frontswap_map = NULL; |
53cbb243 CEB |
3129 | struct page *page = NULL; |
3130 | struct inode *inode = NULL; | |
7cbf3192 | 3131 | bool inced_nr_rotate_swap = false; |
53cbb243 | 3132 | |
d15cab97 HD |
3133 | if (swap_flags & ~SWAP_FLAGS_VALID) |
3134 | return -EINVAL; | |
3135 | ||
53cbb243 CEB |
3136 | if (!capable(CAP_SYS_ADMIN)) |
3137 | return -EPERM; | |
3138 | ||
a2468cc9 AL |
3139 | if (!swap_avail_heads) |
3140 | return -ENOMEM; | |
3141 | ||
53cbb243 | 3142 | p = alloc_swap_info(); |
2542e513 CEB |
3143 | if (IS_ERR(p)) |
3144 | return PTR_ERR(p); | |
53cbb243 | 3145 | |
815c2c54 SL |
3146 | INIT_WORK(&p->discard_work, swap_discard_work); |
3147 | ||
1da177e4 | 3148 | name = getname(specialfile); |
1da177e4 | 3149 | if (IS_ERR(name)) { |
7de7fb6b | 3150 | error = PTR_ERR(name); |
1da177e4 | 3151 | name = NULL; |
bd69010b | 3152 | goto bad_swap; |
1da177e4 | 3153 | } |
669abf4e | 3154 | swap_file = file_open_name(name, O_RDWR|O_LARGEFILE, 0); |
1da177e4 | 3155 | if (IS_ERR(swap_file)) { |
7de7fb6b | 3156 | error = PTR_ERR(swap_file); |
1da177e4 | 3157 | swap_file = NULL; |
bd69010b | 3158 | goto bad_swap; |
1da177e4 LT |
3159 | } |
3160 | ||
3161 | p->swap_file = swap_file; | |
3162 | mapping = swap_file->f_mapping; | |
51cc3a66 | 3163 | dentry = swap_file->f_path.dentry; |
2130781e | 3164 | inode = mapping->host; |
6f179af8 | 3165 | |
4d0e1e10 CEB |
3166 | error = claim_swapfile(p, inode); |
3167 | if (unlikely(error)) | |
1da177e4 | 3168 | goto bad_swap; |
1da177e4 | 3169 | |
d795a90e | 3170 | inode_lock(inode); |
51cc3a66 HD |
3171 | if (d_unlinked(dentry) || cant_mount(dentry)) { |
3172 | error = -ENOENT; | |
3173 | goto bad_swap_unlock_inode; | |
3174 | } | |
d795a90e NA |
3175 | if (IS_SWAPFILE(inode)) { |
3176 | error = -EBUSY; | |
3177 | goto bad_swap_unlock_inode; | |
3178 | } | |
3179 | ||
1da177e4 LT |
3180 | /* |
3181 | * Read the swap header. | |
3182 | */ | |
3183 | if (!mapping->a_ops->readpage) { | |
3184 | error = -EINVAL; | |
d795a90e | 3185 | goto bad_swap_unlock_inode; |
1da177e4 | 3186 | } |
090d2b18 | 3187 | page = read_mapping_page(mapping, 0, swap_file); |
1da177e4 LT |
3188 | if (IS_ERR(page)) { |
3189 | error = PTR_ERR(page); | |
d795a90e | 3190 | goto bad_swap_unlock_inode; |
1da177e4 | 3191 | } |
81e33971 | 3192 | swap_header = kmap(page); |
1da177e4 | 3193 | |
ca8bd38b CEB |
3194 | maxpages = read_swap_header(p, swap_header, inode); |
3195 | if (unlikely(!maxpages)) { | |
1da177e4 | 3196 | error = -EINVAL; |
d795a90e | 3197 | goto bad_swap_unlock_inode; |
1da177e4 | 3198 | } |
886bb7e9 | 3199 | |
81e33971 | 3200 | /* OK, set up the swap map and apply the bad block list */ |
803d0c83 | 3201 | swap_map = vzalloc(maxpages); |
81e33971 HD |
3202 | if (!swap_map) { |
3203 | error = -ENOMEM; | |
d795a90e | 3204 | goto bad_swap_unlock_inode; |
81e33971 | 3205 | } |
f0571429 | 3206 | |
1cb039f3 | 3207 | if (p->bdev && blk_queue_stable_writes(p->bdev->bd_disk->queue)) |
f0571429 MK |
3208 | p->flags |= SWP_STABLE_WRITES; |
3209 | ||
a8b456d0 | 3210 | if (p->bdev && p->bdev->bd_disk->fops->rw_page) |
539a6fea MK |
3211 | p->flags |= SWP_SYNCHRONOUS_IO; |
3212 | ||
2a8f9449 | 3213 | if (p->bdev && blk_queue_nonrot(bdev_get_queue(p->bdev))) { |
6f179af8 | 3214 | int cpu; |
235b6217 | 3215 | unsigned long ci, nr_cluster; |
6f179af8 | 3216 | |
2a8f9449 | 3217 | p->flags |= SWP_SOLIDSTATE; |
49070588 HY |
3218 | p->cluster_next_cpu = alloc_percpu(unsigned int); |
3219 | if (!p->cluster_next_cpu) { | |
3220 | error = -ENOMEM; | |
3221 | goto bad_swap_unlock_inode; | |
3222 | } | |
2a8f9449 SL |
3223 | /* |
3224 | * select a random position to start with to help wear leveling | |
3225 | * SSD | |
3226 | */ | |
49070588 HY |
3227 | for_each_possible_cpu(cpu) { |
3228 | per_cpu(*p->cluster_next_cpu, cpu) = | |
3229 | 1 + prandom_u32_max(p->highest_bit); | |
3230 | } | |
235b6217 | 3231 | nr_cluster = DIV_ROUND_UP(maxpages, SWAPFILE_CLUSTER); |
2a8f9449 | 3232 | |
778e1cdd | 3233 | cluster_info = kvcalloc(nr_cluster, sizeof(*cluster_info), |
54f180d3 | 3234 | GFP_KERNEL); |
2a8f9449 SL |
3235 | if (!cluster_info) { |
3236 | error = -ENOMEM; | |
d795a90e | 3237 | goto bad_swap_unlock_inode; |
2a8f9449 | 3238 | } |
235b6217 HY |
3239 | |
3240 | for (ci = 0; ci < nr_cluster; ci++) | |
3241 | spin_lock_init(&((cluster_info + ci)->lock)); | |
3242 | ||
ebc2a1a6 SL |
3243 | p->percpu_cluster = alloc_percpu(struct percpu_cluster); |
3244 | if (!p->percpu_cluster) { | |
3245 | error = -ENOMEM; | |
d795a90e | 3246 | goto bad_swap_unlock_inode; |
ebc2a1a6 | 3247 | } |
6f179af8 | 3248 | for_each_possible_cpu(cpu) { |
ebc2a1a6 | 3249 | struct percpu_cluster *cluster; |
6f179af8 | 3250 | cluster = per_cpu_ptr(p->percpu_cluster, cpu); |
ebc2a1a6 SL |
3251 | cluster_set_null(&cluster->index); |
3252 | } | |
7cbf3192 | 3253 | } else { |
81a0298b | 3254 | atomic_inc(&nr_rotate_swap); |
7cbf3192 OS |
3255 | inced_nr_rotate_swap = true; |
3256 | } | |
1da177e4 | 3257 | |
1421ef3c CEB |
3258 | error = swap_cgroup_swapon(p->type, maxpages); |
3259 | if (error) | |
d795a90e | 3260 | goto bad_swap_unlock_inode; |
1421ef3c | 3261 | |
915d4d7b | 3262 | nr_extents = setup_swap_map_and_extents(p, swap_header, swap_map, |
2a8f9449 | 3263 | cluster_info, maxpages, &span); |
915d4d7b CEB |
3264 | if (unlikely(nr_extents < 0)) { |
3265 | error = nr_extents; | |
d795a90e | 3266 | goto bad_swap_unlock_inode; |
1da177e4 | 3267 | } |
38b5faf4 | 3268 | /* frontswap enabled? set up bit-per-page map for frontswap */ |
8ea1d2a1 | 3269 | if (IS_ENABLED(CONFIG_FRONTSWAP)) |
778e1cdd KC |
3270 | frontswap_map = kvcalloc(BITS_TO_LONGS(maxpages), |
3271 | sizeof(long), | |
54f180d3 | 3272 | GFP_KERNEL); |
1da177e4 | 3273 | |
68d68ff6 | 3274 | if (p->bdev && (swap_flags & SWAP_FLAG_DISCARD) && swap_discardable(p)) { |
2a8f9449 SL |
3275 | /* |
3276 | * When discard is enabled for swap with no particular | |
3277 | * policy flagged, we set all swap discard flags here in | |
3278 | * order to sustain backward compatibility with older | |
3279 | * swapon(8) releases. | |
3280 | */ | |
3281 | p->flags |= (SWP_DISCARDABLE | SWP_AREA_DISCARD | | |
3282 | SWP_PAGE_DISCARD); | |
dcf6b7dd | 3283 | |
2a8f9449 SL |
3284 | /* |
3285 | * By flagging sys_swapon, a sysadmin can tell us to | |
3286 | * either do single-time area discards only, or to just | |
3287 | * perform discards for released swap page-clusters. | |
3288 | * Now it's time to adjust the p->flags accordingly. | |
3289 | */ | |
3290 | if (swap_flags & SWAP_FLAG_DISCARD_ONCE) | |
3291 | p->flags &= ~SWP_PAGE_DISCARD; | |
3292 | else if (swap_flags & SWAP_FLAG_DISCARD_PAGES) | |
3293 | p->flags &= ~SWP_AREA_DISCARD; | |
3294 | ||
3295 | /* issue a swapon-time discard if it's still required */ | |
3296 | if (p->flags & SWP_AREA_DISCARD) { | |
3297 | int err = discard_swap(p); | |
3298 | if (unlikely(err)) | |
3299 | pr_err("swapon: discard_swap(%p): %d\n", | |
3300 | p, err); | |
dcf6b7dd | 3301 | } |
20137a49 | 3302 | } |
6a6ba831 | 3303 | |
4b3ef9da HY |
3304 | error = init_swap_address_space(p->type, maxpages); |
3305 | if (error) | |
d795a90e | 3306 | goto bad_swap_unlock_inode; |
4b3ef9da | 3307 | |
dc617f29 DW |
3308 | /* |
3309 | * Flush any pending IO and dirty mappings before we start using this | |
3310 | * swap device. | |
3311 | */ | |
3312 | inode->i_flags |= S_SWAPFILE; | |
3313 | error = inode_drain_writes(inode); | |
3314 | if (error) { | |
3315 | inode->i_flags &= ~S_SWAPFILE; | |
822bca52 | 3316 | goto free_swap_address_space; |
dc617f29 DW |
3317 | } |
3318 | ||
fc0abb14 | 3319 | mutex_lock(&swapon_mutex); |
40531542 | 3320 | prio = -1; |
78ecba08 | 3321 | if (swap_flags & SWAP_FLAG_PREFER) |
40531542 | 3322 | prio = |
78ecba08 | 3323 | (swap_flags & SWAP_FLAG_PRIO_MASK) >> SWAP_FLAG_PRIO_SHIFT; |
2a8f9449 | 3324 | enable_swap_info(p, prio, swap_map, cluster_info, frontswap_map); |
c69dbfb8 | 3325 | |
756a025f | 3326 | pr_info("Adding %uk swap on %s. Priority:%d extents:%d across:%lluk %s%s%s%s%s\n", |
91a27b2a | 3327 | p->pages<<(PAGE_SHIFT-10), name->name, p->prio, |
c69dbfb8 CEB |
3328 | nr_extents, (unsigned long long)span<<(PAGE_SHIFT-10), |
3329 | (p->flags & SWP_SOLIDSTATE) ? "SS" : "", | |
38b5faf4 | 3330 | (p->flags & SWP_DISCARDABLE) ? "D" : "", |
dcf6b7dd RA |
3331 | (p->flags & SWP_AREA_DISCARD) ? "s" : "", |
3332 | (p->flags & SWP_PAGE_DISCARD) ? "c" : "", | |
38b5faf4 | 3333 | (frontswap_map) ? "FS" : ""); |
c69dbfb8 | 3334 | |
fc0abb14 | 3335 | mutex_unlock(&swapon_mutex); |
66d7dd51 KS |
3336 | atomic_inc(&proc_poll_event); |
3337 | wake_up_interruptible(&proc_poll_wait); | |
3338 | ||
1da177e4 LT |
3339 | error = 0; |
3340 | goto out; | |
822bca52 ML |
3341 | free_swap_address_space: |
3342 | exit_swap_address_space(p->type); | |
d795a90e NA |
3343 | bad_swap_unlock_inode: |
3344 | inode_unlock(inode); | |
1da177e4 | 3345 | bad_swap: |
ebc2a1a6 SL |
3346 | free_percpu(p->percpu_cluster); |
3347 | p->percpu_cluster = NULL; | |
49070588 HY |
3348 | free_percpu(p->cluster_next_cpu); |
3349 | p->cluster_next_cpu = NULL; | |
bd69010b | 3350 | if (inode && S_ISBLK(inode->i_mode) && p->bdev) { |
f2090d2d CEB |
3351 | set_blocksize(p->bdev, p->old_block_size); |
3352 | blkdev_put(p->bdev, FMODE_READ | FMODE_WRITE | FMODE_EXCL); | |
1da177e4 | 3353 | } |
d795a90e | 3354 | inode = NULL; |
4cd3bb10 | 3355 | destroy_swap_extents(p); |
e8e6c2ec | 3356 | swap_cgroup_swapoff(p->type); |
5d337b91 | 3357 | spin_lock(&swap_lock); |
1da177e4 | 3358 | p->swap_file = NULL; |
1da177e4 | 3359 | p->flags = 0; |
5d337b91 | 3360 | spin_unlock(&swap_lock); |
1da177e4 | 3361 | vfree(swap_map); |
8606a1a9 | 3362 | kvfree(cluster_info); |
b6b1fd2a | 3363 | kvfree(frontswap_map); |
7cbf3192 OS |
3364 | if (inced_nr_rotate_swap) |
3365 | atomic_dec(&nr_rotate_swap); | |
d795a90e | 3366 | if (swap_file) |
1da177e4 LT |
3367 | filp_close(swap_file, NULL); |
3368 | out: | |
3369 | if (page && !IS_ERR(page)) { | |
3370 | kunmap(page); | |
09cbfeaf | 3371 | put_page(page); |
1da177e4 LT |
3372 | } |
3373 | if (name) | |
3374 | putname(name); | |
1638045c | 3375 | if (inode) |
5955102c | 3376 | inode_unlock(inode); |
039939a6 TC |
3377 | if (!error) |
3378 | enable_swap_slots_cache(); | |
1da177e4 LT |
3379 | return error; |
3380 | } | |
3381 | ||
3382 | void si_swapinfo(struct sysinfo *val) | |
3383 | { | |
efa90a98 | 3384 | unsigned int type; |
1da177e4 LT |
3385 | unsigned long nr_to_be_unused = 0; |
3386 | ||
5d337b91 | 3387 | spin_lock(&swap_lock); |
efa90a98 HD |
3388 | for (type = 0; type < nr_swapfiles; type++) { |
3389 | struct swap_info_struct *si = swap_info[type]; | |
3390 | ||
3391 | if ((si->flags & SWP_USED) && !(si->flags & SWP_WRITEOK)) | |
3392 | nr_to_be_unused += si->inuse_pages; | |
1da177e4 | 3393 | } |
ec8acf20 | 3394 | val->freeswap = atomic_long_read(&nr_swap_pages) + nr_to_be_unused; |
1da177e4 | 3395 | val->totalswap = total_swap_pages + nr_to_be_unused; |
5d337b91 | 3396 | spin_unlock(&swap_lock); |
1da177e4 LT |
3397 | } |
3398 | ||
3399 | /* | |
3400 | * Verify that a swap entry is valid and increment its swap map count. | |
3401 | * | |
355cfa73 KH |
3402 | * Returns error code in following case. |
3403 | * - success -> 0 | |
3404 | * - swp_entry is invalid -> EINVAL | |
3405 | * - swp_entry is migration entry -> EINVAL | |
3406 | * - swap-cache reference is requested but there is already one. -> EEXIST | |
3407 | * - swap-cache reference is requested but the entry is not used. -> ENOENT | |
570a335b | 3408 | * - swap-mapped reference requested but needs continued swap count. -> ENOMEM |
1da177e4 | 3409 | */ |
8d69aaee | 3410 | static int __swap_duplicate(swp_entry_t entry, unsigned char usage) |
1da177e4 | 3411 | { |
73c34b6a | 3412 | struct swap_info_struct *p; |
235b6217 | 3413 | struct swap_cluster_info *ci; |
c10d38cc | 3414 | unsigned long offset; |
8d69aaee HD |
3415 | unsigned char count; |
3416 | unsigned char has_cache; | |
9d9a0334 | 3417 | int err; |
1da177e4 | 3418 | |
eb085574 | 3419 | p = get_swap_device(entry); |
c10d38cc | 3420 | if (!p) |
9d9a0334 | 3421 | return -EINVAL; |
235b6217 | 3422 | |
eb085574 | 3423 | offset = swp_offset(entry); |
235b6217 | 3424 | ci = lock_cluster_or_swap_info(p, offset); |
355cfa73 | 3425 | |
253d553b | 3426 | count = p->swap_map[offset]; |
edfe23da SL |
3427 | |
3428 | /* | |
3429 | * swapin_readahead() doesn't check if a swap entry is valid, so the | |
3430 | * swap entry could be SWAP_MAP_BAD. Check here with lock held. | |
3431 | */ | |
3432 | if (unlikely(swap_count(count) == SWAP_MAP_BAD)) { | |
3433 | err = -ENOENT; | |
3434 | goto unlock_out; | |
3435 | } | |
3436 | ||
253d553b HD |
3437 | has_cache = count & SWAP_HAS_CACHE; |
3438 | count &= ~SWAP_HAS_CACHE; | |
3439 | err = 0; | |
355cfa73 | 3440 | |
253d553b | 3441 | if (usage == SWAP_HAS_CACHE) { |
355cfa73 KH |
3442 | |
3443 | /* set SWAP_HAS_CACHE if there is no cache and entry is used */ | |
253d553b HD |
3444 | if (!has_cache && count) |
3445 | has_cache = SWAP_HAS_CACHE; | |
3446 | else if (has_cache) /* someone else added cache */ | |
3447 | err = -EEXIST; | |
3448 | else /* no users remaining */ | |
3449 | err = -ENOENT; | |
355cfa73 KH |
3450 | |
3451 | } else if (count || has_cache) { | |
253d553b | 3452 | |
570a335b HD |
3453 | if ((count & ~COUNT_CONTINUED) < SWAP_MAP_MAX) |
3454 | count += usage; | |
3455 | else if ((count & ~COUNT_CONTINUED) > SWAP_MAP_MAX) | |
253d553b | 3456 | err = -EINVAL; |
570a335b HD |
3457 | else if (swap_count_continued(p, offset, count)) |
3458 | count = COUNT_CONTINUED; | |
3459 | else | |
3460 | err = -ENOMEM; | |
355cfa73 | 3461 | } else |
253d553b HD |
3462 | err = -ENOENT; /* unused swap entry */ |
3463 | ||
a449bf58 | 3464 | WRITE_ONCE(p->swap_map[offset], count | has_cache); |
253d553b | 3465 | |
355cfa73 | 3466 | unlock_out: |
235b6217 | 3467 | unlock_cluster_or_swap_info(p, ci); |
eb085574 HY |
3468 | if (p) |
3469 | put_swap_device(p); | |
253d553b | 3470 | return err; |
1da177e4 | 3471 | } |
253d553b | 3472 | |
aaa46865 HD |
3473 | /* |
3474 | * Help swapoff by noting that swap entry belongs to shmem/tmpfs | |
3475 | * (in which case its reference count is never incremented). | |
3476 | */ | |
3477 | void swap_shmem_alloc(swp_entry_t entry) | |
3478 | { | |
3479 | __swap_duplicate(entry, SWAP_MAP_SHMEM); | |
3480 | } | |
3481 | ||
355cfa73 | 3482 | /* |
08259d58 HD |
3483 | * Increase reference count of swap entry by 1. |
3484 | * Returns 0 for success, or -ENOMEM if a swap_count_continuation is required | |
3485 | * but could not be atomically allocated. Returns 0, just as if it succeeded, | |
3486 | * if __swap_duplicate() fails for another reason (-EINVAL or -ENOENT), which | |
3487 | * might occur if a page table entry has got corrupted. | |
355cfa73 | 3488 | */ |
570a335b | 3489 | int swap_duplicate(swp_entry_t entry) |
355cfa73 | 3490 | { |
570a335b HD |
3491 | int err = 0; |
3492 | ||
3493 | while (!err && __swap_duplicate(entry, 1) == -ENOMEM) | |
3494 | err = add_swap_count_continuation(entry, GFP_ATOMIC); | |
3495 | return err; | |
355cfa73 | 3496 | } |
1da177e4 | 3497 | |
cb4b86ba | 3498 | /* |
355cfa73 KH |
3499 | * @entry: swap entry for which we allocate swap cache. |
3500 | * | |
73c34b6a | 3501 | * Called when allocating swap cache for existing swap entry, |
355cfa73 | 3502 | * This can return error codes. Returns 0 at success. |
3eeba135 | 3503 | * -EEXIST means there is a swap cache. |
355cfa73 | 3504 | * Note: return code is different from swap_duplicate(). |
cb4b86ba KH |
3505 | */ |
3506 | int swapcache_prepare(swp_entry_t entry) | |
3507 | { | |
253d553b | 3508 | return __swap_duplicate(entry, SWAP_HAS_CACHE); |
cb4b86ba KH |
3509 | } |
3510 | ||
0bcac06f MK |
3511 | struct swap_info_struct *swp_swap_info(swp_entry_t entry) |
3512 | { | |
c10d38cc | 3513 | return swap_type_to_swap_info(swp_type(entry)); |
0bcac06f MK |
3514 | } |
3515 | ||
f981c595 MG |
3516 | struct swap_info_struct *page_swap_info(struct page *page) |
3517 | { | |
0bcac06f MK |
3518 | swp_entry_t entry = { .val = page_private(page) }; |
3519 | return swp_swap_info(entry); | |
f981c595 MG |
3520 | } |
3521 | ||
3522 | /* | |
2f52578f | 3523 | * out-of-line methods to avoid include hell. |
f981c595 | 3524 | */ |
2f52578f | 3525 | struct address_space *swapcache_mapping(struct folio *folio) |
f981c595 | 3526 | { |
2f52578f | 3527 | return page_swap_info(&folio->page)->swap_file->f_mapping; |
f981c595 | 3528 | } |
2f52578f | 3529 | EXPORT_SYMBOL_GPL(swapcache_mapping); |
f981c595 MG |
3530 | |
3531 | pgoff_t __page_file_index(struct page *page) | |
3532 | { | |
3533 | swp_entry_t swap = { .val = page_private(page) }; | |
f981c595 MG |
3534 | return swp_offset(swap); |
3535 | } | |
3536 | EXPORT_SYMBOL_GPL(__page_file_index); | |
3537 | ||
570a335b HD |
3538 | /* |
3539 | * add_swap_count_continuation - called when a swap count is duplicated | |
3540 | * beyond SWAP_MAP_MAX, it allocates a new page and links that to the entry's | |
3541 | * page of the original vmalloc'ed swap_map, to hold the continuation count | |
3542 | * (for that entry and for its neighbouring PAGE_SIZE swap entries). Called | |
3543 | * again when count is duplicated beyond SWAP_MAP_MAX * SWAP_CONT_MAX, etc. | |
3544 | * | |
3545 | * These continuation pages are seldom referenced: the common paths all work | |
3546 | * on the original swap_map, only referring to a continuation page when the | |
3547 | * low "digit" of a count is incremented or decremented through SWAP_MAP_MAX. | |
3548 | * | |
3549 | * add_swap_count_continuation(, GFP_ATOMIC) can be called while holding | |
3550 | * page table locks; if it fails, add_swap_count_continuation(, GFP_KERNEL) | |
3551 | * can be called after dropping locks. | |
3552 | */ | |
3553 | int add_swap_count_continuation(swp_entry_t entry, gfp_t gfp_mask) | |
3554 | { | |
3555 | struct swap_info_struct *si; | |
235b6217 | 3556 | struct swap_cluster_info *ci; |
570a335b HD |
3557 | struct page *head; |
3558 | struct page *page; | |
3559 | struct page *list_page; | |
3560 | pgoff_t offset; | |
3561 | unsigned char count; | |
eb085574 | 3562 | int ret = 0; |
570a335b HD |
3563 | |
3564 | /* | |
3565 | * When debugging, it's easier to use __GFP_ZERO here; but it's better | |
3566 | * for latency not to zero a page while GFP_ATOMIC and holding locks. | |
3567 | */ | |
3568 | page = alloc_page(gfp_mask | __GFP_HIGHMEM); | |
3569 | ||
eb085574 | 3570 | si = get_swap_device(entry); |
570a335b HD |
3571 | if (!si) { |
3572 | /* | |
3573 | * An acceptable race has occurred since the failing | |
eb085574 | 3574 | * __swap_duplicate(): the swap device may be swapoff |
570a335b HD |
3575 | */ |
3576 | goto outer; | |
3577 | } | |
eb085574 | 3578 | spin_lock(&si->lock); |
570a335b HD |
3579 | |
3580 | offset = swp_offset(entry); | |
235b6217 HY |
3581 | |
3582 | ci = lock_cluster(si, offset); | |
3583 | ||
d8aa24e0 | 3584 | count = swap_count(si->swap_map[offset]); |
570a335b HD |
3585 | |
3586 | if ((count & ~COUNT_CONTINUED) != SWAP_MAP_MAX) { | |
3587 | /* | |
3588 | * The higher the swap count, the more likely it is that tasks | |
3589 | * will race to add swap count continuation: we need to avoid | |
3590 | * over-provisioning. | |
3591 | */ | |
3592 | goto out; | |
3593 | } | |
3594 | ||
3595 | if (!page) { | |
eb085574 HY |
3596 | ret = -ENOMEM; |
3597 | goto out; | |
570a335b HD |
3598 | } |
3599 | ||
3600 | /* | |
3601 | * We are fortunate that although vmalloc_to_page uses pte_offset_map, | |
2de1a7e4 SJ |
3602 | * no architecture is using highmem pages for kernel page tables: so it |
3603 | * will not corrupt the GFP_ATOMIC caller's atomic page table kmaps. | |
570a335b HD |
3604 | */ |
3605 | head = vmalloc_to_page(si->swap_map + offset); | |
3606 | offset &= ~PAGE_MASK; | |
3607 | ||
2628bd6f | 3608 | spin_lock(&si->cont_lock); |
570a335b HD |
3609 | /* |
3610 | * Page allocation does not initialize the page's lru field, | |
3611 | * but it does always reset its private field. | |
3612 | */ | |
3613 | if (!page_private(head)) { | |
3614 | BUG_ON(count & COUNT_CONTINUED); | |
3615 | INIT_LIST_HEAD(&head->lru); | |
3616 | set_page_private(head, SWP_CONTINUED); | |
3617 | si->flags |= SWP_CONTINUED; | |
3618 | } | |
3619 | ||
3620 | list_for_each_entry(list_page, &head->lru, lru) { | |
3621 | unsigned char *map; | |
3622 | ||
3623 | /* | |
3624 | * If the previous map said no continuation, but we've found | |
3625 | * a continuation page, free our allocation and use this one. | |
3626 | */ | |
3627 | if (!(count & COUNT_CONTINUED)) | |
2628bd6f | 3628 | goto out_unlock_cont; |
570a335b | 3629 | |
9b04c5fe | 3630 | map = kmap_atomic(list_page) + offset; |
570a335b | 3631 | count = *map; |
9b04c5fe | 3632 | kunmap_atomic(map); |
570a335b HD |
3633 | |
3634 | /* | |
3635 | * If this continuation count now has some space in it, | |
3636 | * free our allocation and use this one. | |
3637 | */ | |
3638 | if ((count & ~COUNT_CONTINUED) != SWAP_CONT_MAX) | |
2628bd6f | 3639 | goto out_unlock_cont; |
570a335b HD |
3640 | } |
3641 | ||
3642 | list_add_tail(&page->lru, &head->lru); | |
3643 | page = NULL; /* now it's attached, don't free it */ | |
2628bd6f HY |
3644 | out_unlock_cont: |
3645 | spin_unlock(&si->cont_lock); | |
570a335b | 3646 | out: |
235b6217 | 3647 | unlock_cluster(ci); |
ec8acf20 | 3648 | spin_unlock(&si->lock); |
eb085574 | 3649 | put_swap_device(si); |
570a335b HD |
3650 | outer: |
3651 | if (page) | |
3652 | __free_page(page); | |
eb085574 | 3653 | return ret; |
570a335b HD |
3654 | } |
3655 | ||
3656 | /* | |
3657 | * swap_count_continued - when the original swap_map count is incremented | |
3658 | * from SWAP_MAP_MAX, check if there is already a continuation page to carry | |
3659 | * into, carry if so, or else fail until a new continuation page is allocated; | |
3660 | * when the original swap_map count is decremented from 0 with continuation, | |
3661 | * borrow from the continuation and report whether it still holds more. | |
235b6217 HY |
3662 | * Called while __swap_duplicate() or swap_entry_free() holds swap or cluster |
3663 | * lock. | |
570a335b HD |
3664 | */ |
3665 | static bool swap_count_continued(struct swap_info_struct *si, | |
3666 | pgoff_t offset, unsigned char count) | |
3667 | { | |
3668 | struct page *head; | |
3669 | struct page *page; | |
3670 | unsigned char *map; | |
2628bd6f | 3671 | bool ret; |
570a335b HD |
3672 | |
3673 | head = vmalloc_to_page(si->swap_map + offset); | |
3674 | if (page_private(head) != SWP_CONTINUED) { | |
3675 | BUG_ON(count & COUNT_CONTINUED); | |
3676 | return false; /* need to add count continuation */ | |
3677 | } | |
3678 | ||
2628bd6f | 3679 | spin_lock(&si->cont_lock); |
570a335b | 3680 | offset &= ~PAGE_MASK; |
213516ac | 3681 | page = list_next_entry(head, lru); |
9b04c5fe | 3682 | map = kmap_atomic(page) + offset; |
570a335b HD |
3683 | |
3684 | if (count == SWAP_MAP_MAX) /* initial increment from swap_map */ | |
3685 | goto init_map; /* jump over SWAP_CONT_MAX checks */ | |
3686 | ||
3687 | if (count == (SWAP_MAP_MAX | COUNT_CONTINUED)) { /* incrementing */ | |
3688 | /* | |
3689 | * Think of how you add 1 to 999 | |
3690 | */ | |
3691 | while (*map == (SWAP_CONT_MAX | COUNT_CONTINUED)) { | |
9b04c5fe | 3692 | kunmap_atomic(map); |
213516ac | 3693 | page = list_next_entry(page, lru); |
570a335b | 3694 | BUG_ON(page == head); |
9b04c5fe | 3695 | map = kmap_atomic(page) + offset; |
570a335b HD |
3696 | } |
3697 | if (*map == SWAP_CONT_MAX) { | |
9b04c5fe | 3698 | kunmap_atomic(map); |
213516ac | 3699 | page = list_next_entry(page, lru); |
2628bd6f HY |
3700 | if (page == head) { |
3701 | ret = false; /* add count continuation */ | |
3702 | goto out; | |
3703 | } | |
9b04c5fe | 3704 | map = kmap_atomic(page) + offset; |
570a335b HD |
3705 | init_map: *map = 0; /* we didn't zero the page */ |
3706 | } | |
3707 | *map += 1; | |
9b04c5fe | 3708 | kunmap_atomic(map); |
213516ac | 3709 | while ((page = list_prev_entry(page, lru)) != head) { |
9b04c5fe | 3710 | map = kmap_atomic(page) + offset; |
570a335b | 3711 | *map = COUNT_CONTINUED; |
9b04c5fe | 3712 | kunmap_atomic(map); |
570a335b | 3713 | } |
2628bd6f | 3714 | ret = true; /* incremented */ |
570a335b HD |
3715 | |
3716 | } else { /* decrementing */ | |
3717 | /* | |
3718 | * Think of how you subtract 1 from 1000 | |
3719 | */ | |
3720 | BUG_ON(count != COUNT_CONTINUED); | |
3721 | while (*map == COUNT_CONTINUED) { | |
9b04c5fe | 3722 | kunmap_atomic(map); |
213516ac | 3723 | page = list_next_entry(page, lru); |
570a335b | 3724 | BUG_ON(page == head); |
9b04c5fe | 3725 | map = kmap_atomic(page) + offset; |
570a335b HD |
3726 | } |
3727 | BUG_ON(*map == 0); | |
3728 | *map -= 1; | |
3729 | if (*map == 0) | |
3730 | count = 0; | |
9b04c5fe | 3731 | kunmap_atomic(map); |
213516ac | 3732 | while ((page = list_prev_entry(page, lru)) != head) { |
9b04c5fe | 3733 | map = kmap_atomic(page) + offset; |
570a335b HD |
3734 | *map = SWAP_CONT_MAX | count; |
3735 | count = COUNT_CONTINUED; | |
9b04c5fe | 3736 | kunmap_atomic(map); |
570a335b | 3737 | } |
2628bd6f | 3738 | ret = count == COUNT_CONTINUED; |
570a335b | 3739 | } |
2628bd6f HY |
3740 | out: |
3741 | spin_unlock(&si->cont_lock); | |
3742 | return ret; | |
570a335b HD |
3743 | } |
3744 | ||
3745 | /* | |
3746 | * free_swap_count_continuations - swapoff free all the continuation pages | |
3747 | * appended to the swap_map, after swap_map is quiesced, before vfree'ing it. | |
3748 | */ | |
3749 | static void free_swap_count_continuations(struct swap_info_struct *si) | |
3750 | { | |
3751 | pgoff_t offset; | |
3752 | ||
3753 | for (offset = 0; offset < si->max; offset += PAGE_SIZE) { | |
3754 | struct page *head; | |
3755 | head = vmalloc_to_page(si->swap_map + offset); | |
3756 | if (page_private(head)) { | |
0d576d20 GT |
3757 | struct page *page, *next; |
3758 | ||
3759 | list_for_each_entry_safe(page, next, &head->lru, lru) { | |
3760 | list_del(&page->lru); | |
570a335b HD |
3761 | __free_page(page); |
3762 | } | |
3763 | } | |
3764 | } | |
3765 | } | |
a2468cc9 | 3766 | |
2cf85583 | 3767 | #if defined(CONFIG_MEMCG) && defined(CONFIG_BLK_CGROUP) |
01c4b28c | 3768 | void __cgroup_throttle_swaprate(struct page *page, gfp_t gfp_mask) |
2cf85583 TH |
3769 | { |
3770 | struct swap_info_struct *si, *next; | |
6caa6a07 JW |
3771 | int nid = page_to_nid(page); |
3772 | ||
3773 | if (!(gfp_mask & __GFP_IO)) | |
2cf85583 TH |
3774 | return; |
3775 | ||
3776 | if (!blk_cgroup_congested()) | |
3777 | return; | |
3778 | ||
3779 | /* | |
3780 | * We've already scheduled a throttle, avoid taking the global swap | |
3781 | * lock. | |
3782 | */ | |
3783 | if (current->throttle_queue) | |
3784 | return; | |
3785 | ||
3786 | spin_lock(&swap_avail_lock); | |
6caa6a07 JW |
3787 | plist_for_each_entry_safe(si, next, &swap_avail_heads[nid], |
3788 | avail_lists[nid]) { | |
2cf85583 | 3789 | if (si->bdev) { |
6caa6a07 | 3790 | blkcg_schedule_throttle(bdev_get_queue(si->bdev), true); |
2cf85583 TH |
3791 | break; |
3792 | } | |
3793 | } | |
3794 | spin_unlock(&swap_avail_lock); | |
3795 | } | |
3796 | #endif | |
3797 | ||
a2468cc9 AL |
3798 | static int __init swapfile_init(void) |
3799 | { | |
3800 | int nid; | |
3801 | ||
3802 | swap_avail_heads = kmalloc_array(nr_node_ids, sizeof(struct plist_head), | |
3803 | GFP_KERNEL); | |
3804 | if (!swap_avail_heads) { | |
3805 | pr_emerg("Not enough memory for swap heads, swap is disabled\n"); | |
3806 | return -ENOMEM; | |
3807 | } | |
3808 | ||
3809 | for_each_node(nid) | |
3810 | plist_head_init(&swap_avail_heads[nid]); | |
3811 | ||
3812 | return 0; | |
3813 | } | |
3814 | subsys_initcall(swapfile_init); |