1 // SPDX-License-Identifier: GPL-2.0
5 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
7 * Swap reorganised 29.12.95, Stephen Tweedie.
8 * kswapd added: 7.1.96 sct
9 * Removed kswapd_ctl limits, and swap out as many pages as needed
10 * to bring the system back to freepages.high: 2.4.97, Rik van Riel.
11 * Zone aware kswapd started 02/00, Kanoj Sarcar (kanoj@sgi.com).
12 * Multiqueue VM started 5.8.00, Rik van Riel.
15 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
18 #include <linux/sched/mm.h>
19 #include <linux/module.h>
20 #include <linux/gfp.h>
21 #include <linux/kernel_stat.h>
22 #include <linux/swap.h>
23 #include <linux/pagemap.h>
24 #include <linux/init.h>
25 #include <linux/highmem.h>
26 #include <linux/vmpressure.h>
27 #include <linux/vmstat.h>
28 #include <linux/file.h>
29 #include <linux/writeback.h>
30 #include <linux/blkdev.h>
31 #include <linux/buffer_head.h> /* for try_to_release_page(),
32 buffer_heads_over_limit */
33 #include <linux/mm_inline.h>
34 #include <linux/backing-dev.h>
35 #include <linux/rmap.h>
36 #include <linux/topology.h>
37 #include <linux/cpu.h>
38 #include <linux/cpuset.h>
39 #include <linux/compaction.h>
40 #include <linux/notifier.h>
41 #include <linux/rwsem.h>
42 #include <linux/delay.h>
43 #include <linux/kthread.h>
44 #include <linux/freezer.h>
45 #include <linux/memcontrol.h>
46 #include <linux/delayacct.h>
47 #include <linux/sysctl.h>
48 #include <linux/oom.h>
49 #include <linux/pagevec.h>
50 #include <linux/prefetch.h>
51 #include <linux/printk.h>
52 #include <linux/dax.h>
53 #include <linux/psi.h>
55 #include <asm/tlbflush.h>
56 #include <asm/div64.h>
58 #include <linux/swapops.h>
59 #include <linux/balloon_compaction.h>
63 #define CREATE_TRACE_POINTS
64 #include <trace/events/vmscan.h>
67 /* How many pages shrink_list() should reclaim */
68 unsigned long nr_to_reclaim
;
71 * Nodemask of nodes allowed by the caller. If NULL, all nodes
77 * The memory cgroup that hit its limit and as a result is the
78 * primary target of this reclaim invocation.
80 struct mem_cgroup
*target_mem_cgroup
;
83 * Scan pressure balancing between anon and file LRUs
85 unsigned long anon_cost
;
86 unsigned long file_cost
;
88 /* Can active pages be deactivated as part of reclaim? */
89 #define DEACTIVATE_ANON 1
90 #define DEACTIVATE_FILE 2
91 unsigned int may_deactivate
:2;
92 unsigned int force_deactivate
:1;
93 unsigned int skipped_deactivate
:1;
95 /* Writepage batching in laptop mode; RECLAIM_WRITE */
96 unsigned int may_writepage
:1;
98 /* Can mapped pages be reclaimed? */
99 unsigned int may_unmap
:1;
101 /* Can pages be swapped as part of reclaim? */
102 unsigned int may_swap
:1;
105 * Cgroups are not reclaimed below their configured memory.low,
106 * unless we threaten to OOM. If any cgroups are skipped due to
107 * memory.low and nothing was reclaimed, go back for memory.low.
109 unsigned int memcg_low_reclaim
:1;
110 unsigned int memcg_low_skipped
:1;
112 unsigned int hibernation_mode
:1;
114 /* One of the zones is ready for compaction */
115 unsigned int compaction_ready
:1;
117 /* There is easily reclaimable cold cache in the current node */
118 unsigned int cache_trim_mode
:1;
120 /* The file pages on the current node are dangerously low */
121 unsigned int file_is_tiny
:1;
123 /* Allocation order */
126 /* Scan (total_size >> priority) pages at once */
129 /* The highest zone to isolate pages for reclaim from */
132 /* This context's GFP mask */
135 /* Incremented by the number of inactive pages that were scanned */
136 unsigned long nr_scanned
;
138 /* Number of pages freed so far during a call to shrink_zones() */
139 unsigned long nr_reclaimed
;
143 unsigned int unqueued_dirty
;
144 unsigned int congested
;
145 unsigned int writeback
;
146 unsigned int immediate
;
147 unsigned int file_taken
;
151 /* for recording the reclaimed slab by now */
152 struct reclaim_state reclaim_state
;
155 #ifdef ARCH_HAS_PREFETCHW
156 #define prefetchw_prev_lru_page(_page, _base, _field) \
158 if ((_page)->lru.prev != _base) { \
161 prev = lru_to_page(&(_page->lru)); \
162 prefetchw(&prev->_field); \
166 #define prefetchw_prev_lru_page(_page, _base, _field) do { } while (0)
170 * From 0 .. 200. Higher means more swappy.
172 int vm_swappiness
= 60;
174 * The total number of pages which are beyond the high watermark within all
177 unsigned long vm_total_pages
;
179 static void set_task_reclaim_state(struct task_struct
*task
,
180 struct reclaim_state
*rs
)
182 /* Check for an overwrite */
183 WARN_ON_ONCE(rs
&& task
->reclaim_state
);
185 /* Check for the nulling of an already-nulled member */
186 WARN_ON_ONCE(!rs
&& !task
->reclaim_state
);
188 task
->reclaim_state
= rs
;
191 static LIST_HEAD(shrinker_list
);
192 static DECLARE_RWSEM(shrinker_rwsem
);
196 * We allow subsystems to populate their shrinker-related
197 * LRU lists before register_shrinker_prepared() is called
198 * for the shrinker, since we don't want to impose
199 * restrictions on their internal registration order.
200 * In this case shrink_slab_memcg() may find corresponding
201 * bit is set in the shrinkers map.
203 * This value is used by the function to detect registering
204 * shrinkers and to skip do_shrink_slab() calls for them.
206 #define SHRINKER_REGISTERING ((struct shrinker *)~0UL)
208 static DEFINE_IDR(shrinker_idr
);
209 static int shrinker_nr_max
;
211 static int prealloc_memcg_shrinker(struct shrinker
*shrinker
)
213 int id
, ret
= -ENOMEM
;
215 down_write(&shrinker_rwsem
);
216 /* This may call shrinker, so it must use down_read_trylock() */
217 id
= idr_alloc(&shrinker_idr
, SHRINKER_REGISTERING
, 0, 0, GFP_KERNEL
);
221 if (id
>= shrinker_nr_max
) {
222 if (memcg_expand_shrinker_maps(id
)) {
223 idr_remove(&shrinker_idr
, id
);
227 shrinker_nr_max
= id
+ 1;
232 up_write(&shrinker_rwsem
);
236 static void unregister_memcg_shrinker(struct shrinker
*shrinker
)
238 int id
= shrinker
->id
;
242 down_write(&shrinker_rwsem
);
243 idr_remove(&shrinker_idr
, id
);
244 up_write(&shrinker_rwsem
);
247 static bool cgroup_reclaim(struct scan_control
*sc
)
249 return sc
->target_mem_cgroup
;
253 * writeback_throttling_sane - is the usual dirty throttling mechanism available?
254 * @sc: scan_control in question
256 * The normal page dirty throttling mechanism in balance_dirty_pages() is
257 * completely broken with the legacy memcg and direct stalling in
258 * shrink_page_list() is used for throttling instead, which lacks all the
259 * niceties such as fairness, adaptive pausing, bandwidth proportional
260 * allocation and configurability.
262 * This function tests whether the vmscan currently in progress can assume
263 * that the normal dirty throttling mechanism is operational.
265 static bool writeback_throttling_sane(struct scan_control
*sc
)
267 if (!cgroup_reclaim(sc
))
269 #ifdef CONFIG_CGROUP_WRITEBACK
270 if (cgroup_subsys_on_dfl(memory_cgrp_subsys
))
276 static int prealloc_memcg_shrinker(struct shrinker
*shrinker
)
281 static void unregister_memcg_shrinker(struct shrinker
*shrinker
)
285 static bool cgroup_reclaim(struct scan_control
*sc
)
290 static bool writeback_throttling_sane(struct scan_control
*sc
)
297 * This misses isolated pages which are not accounted for to save counters.
298 * As the data only determines if reclaim or compaction continues, it is
299 * not expected that isolated pages will be a dominating factor.
301 unsigned long zone_reclaimable_pages(struct zone
*zone
)
305 nr
= zone_page_state_snapshot(zone
, NR_ZONE_INACTIVE_FILE
) +
306 zone_page_state_snapshot(zone
, NR_ZONE_ACTIVE_FILE
);
307 if (get_nr_swap_pages() > 0)
308 nr
+= zone_page_state_snapshot(zone
, NR_ZONE_INACTIVE_ANON
) +
309 zone_page_state_snapshot(zone
, NR_ZONE_ACTIVE_ANON
);
315 * lruvec_lru_size - Returns the number of pages on the given LRU list.
316 * @lruvec: lru vector
318 * @zone_idx: zones to consider (use MAX_NR_ZONES for the whole LRU list)
320 unsigned long lruvec_lru_size(struct lruvec
*lruvec
, enum lru_list lru
, int zone_idx
)
322 unsigned long size
= 0;
325 for (zid
= 0; zid
<= zone_idx
&& zid
< MAX_NR_ZONES
; zid
++) {
326 struct zone
*zone
= &lruvec_pgdat(lruvec
)->node_zones
[zid
];
328 if (!managed_zone(zone
))
331 if (!mem_cgroup_disabled())
332 size
+= mem_cgroup_get_zone_lru_size(lruvec
, lru
, zid
);
334 size
+= zone_page_state(zone
, NR_ZONE_LRU_BASE
+ lru
);
340 * Add a shrinker callback to be called from the vm.
342 int prealloc_shrinker(struct shrinker
*shrinker
)
344 unsigned int size
= sizeof(*shrinker
->nr_deferred
);
346 if (shrinker
->flags
& SHRINKER_NUMA_AWARE
)
349 shrinker
->nr_deferred
= kzalloc(size
, GFP_KERNEL
);
350 if (!shrinker
->nr_deferred
)
353 if (shrinker
->flags
& SHRINKER_MEMCG_AWARE
) {
354 if (prealloc_memcg_shrinker(shrinker
))
361 kfree(shrinker
->nr_deferred
);
362 shrinker
->nr_deferred
= NULL
;
366 void free_prealloced_shrinker(struct shrinker
*shrinker
)
368 if (!shrinker
->nr_deferred
)
371 if (shrinker
->flags
& SHRINKER_MEMCG_AWARE
)
372 unregister_memcg_shrinker(shrinker
);
374 kfree(shrinker
->nr_deferred
);
375 shrinker
->nr_deferred
= NULL
;
378 void register_shrinker_prepared(struct shrinker
*shrinker
)
380 down_write(&shrinker_rwsem
);
381 list_add_tail(&shrinker
->list
, &shrinker_list
);
383 if (shrinker
->flags
& SHRINKER_MEMCG_AWARE
)
384 idr_replace(&shrinker_idr
, shrinker
, shrinker
->id
);
386 up_write(&shrinker_rwsem
);
389 int register_shrinker(struct shrinker
*shrinker
)
391 int err
= prealloc_shrinker(shrinker
);
395 register_shrinker_prepared(shrinker
);
398 EXPORT_SYMBOL(register_shrinker
);
403 void unregister_shrinker(struct shrinker
*shrinker
)
405 if (!shrinker
->nr_deferred
)
407 if (shrinker
->flags
& SHRINKER_MEMCG_AWARE
)
408 unregister_memcg_shrinker(shrinker
);
409 down_write(&shrinker_rwsem
);
410 list_del(&shrinker
->list
);
411 up_write(&shrinker_rwsem
);
412 kfree(shrinker
->nr_deferred
);
413 shrinker
->nr_deferred
= NULL
;
415 EXPORT_SYMBOL(unregister_shrinker
);
417 #define SHRINK_BATCH 128
419 static unsigned long do_shrink_slab(struct shrink_control
*shrinkctl
,
420 struct shrinker
*shrinker
, int priority
)
422 unsigned long freed
= 0;
423 unsigned long long delta
;
428 int nid
= shrinkctl
->nid
;
429 long batch_size
= shrinker
->batch
? shrinker
->batch
431 long scanned
= 0, next_deferred
;
433 if (!(shrinker
->flags
& SHRINKER_NUMA_AWARE
))
436 freeable
= shrinker
->count_objects(shrinker
, shrinkctl
);
437 if (freeable
== 0 || freeable
== SHRINK_EMPTY
)
441 * copy the current shrinker scan count into a local variable
442 * and zero it so that other concurrent shrinker invocations
443 * don't also do this scanning work.
445 nr
= atomic_long_xchg(&shrinker
->nr_deferred
[nid
], 0);
448 if (shrinker
->seeks
) {
449 delta
= freeable
>> priority
;
451 do_div(delta
, shrinker
->seeks
);
454 * These objects don't require any IO to create. Trim
455 * them aggressively under memory pressure to keep
456 * them from causing refetches in the IO caches.
458 delta
= freeable
/ 2;
462 if (total_scan
< 0) {
463 pr_err("shrink_slab: %pS negative objects to delete nr=%ld\n",
464 shrinker
->scan_objects
, total_scan
);
465 total_scan
= freeable
;
468 next_deferred
= total_scan
;
471 * We need to avoid excessive windup on filesystem shrinkers
472 * due to large numbers of GFP_NOFS allocations causing the
473 * shrinkers to return -1 all the time. This results in a large
474 * nr being built up so when a shrink that can do some work
475 * comes along it empties the entire cache due to nr >>>
476 * freeable. This is bad for sustaining a working set in
479 * Hence only allow the shrinker to scan the entire cache when
480 * a large delta change is calculated directly.
482 if (delta
< freeable
/ 4)
483 total_scan
= min(total_scan
, freeable
/ 2);
486 * Avoid risking looping forever due to too large nr value:
487 * never try to free more than twice the estimate number of
490 if (total_scan
> freeable
* 2)
491 total_scan
= freeable
* 2;
493 trace_mm_shrink_slab_start(shrinker
, shrinkctl
, nr
,
494 freeable
, delta
, total_scan
, priority
);
497 * Normally, we should not scan less than batch_size objects in one
498 * pass to avoid too frequent shrinker calls, but if the slab has less
499 * than batch_size objects in total and we are really tight on memory,
500 * we will try to reclaim all available objects, otherwise we can end
501 * up failing allocations although there are plenty of reclaimable
502 * objects spread over several slabs with usage less than the
505 * We detect the "tight on memory" situations by looking at the total
506 * number of objects we want to scan (total_scan). If it is greater
507 * than the total number of objects on slab (freeable), we must be
508 * scanning at high prio and therefore should try to reclaim as much as
511 while (total_scan
>= batch_size
||
512 total_scan
>= freeable
) {
514 unsigned long nr_to_scan
= min(batch_size
, total_scan
);
516 shrinkctl
->nr_to_scan
= nr_to_scan
;
517 shrinkctl
->nr_scanned
= nr_to_scan
;
518 ret
= shrinker
->scan_objects(shrinker
, shrinkctl
);
519 if (ret
== SHRINK_STOP
)
523 count_vm_events(SLABS_SCANNED
, shrinkctl
->nr_scanned
);
524 total_scan
-= shrinkctl
->nr_scanned
;
525 scanned
+= shrinkctl
->nr_scanned
;
530 if (next_deferred
>= scanned
)
531 next_deferred
-= scanned
;
535 * move the unused scan count back into the shrinker in a
536 * manner that handles concurrent updates. If we exhausted the
537 * scan, there is no need to do an update.
539 if (next_deferred
> 0)
540 new_nr
= atomic_long_add_return(next_deferred
,
541 &shrinker
->nr_deferred
[nid
]);
543 new_nr
= atomic_long_read(&shrinker
->nr_deferred
[nid
]);
545 trace_mm_shrink_slab_end(shrinker
, nid
, freed
, nr
, new_nr
, total_scan
);
550 static unsigned long shrink_slab_memcg(gfp_t gfp_mask
, int nid
,
551 struct mem_cgroup
*memcg
, int priority
)
553 struct memcg_shrinker_map
*map
;
554 unsigned long ret
, freed
= 0;
557 if (!mem_cgroup_online(memcg
))
560 if (!down_read_trylock(&shrinker_rwsem
))
563 map
= rcu_dereference_protected(memcg
->nodeinfo
[nid
]->shrinker_map
,
568 for_each_set_bit(i
, map
->map
, shrinker_nr_max
) {
569 struct shrink_control sc
= {
570 .gfp_mask
= gfp_mask
,
574 struct shrinker
*shrinker
;
576 shrinker
= idr_find(&shrinker_idr
, i
);
577 if (unlikely(!shrinker
|| shrinker
== SHRINKER_REGISTERING
)) {
579 clear_bit(i
, map
->map
);
583 /* Call non-slab shrinkers even though kmem is disabled */
584 if (!memcg_kmem_enabled() &&
585 !(shrinker
->flags
& SHRINKER_NONSLAB
))
588 ret
= do_shrink_slab(&sc
, shrinker
, priority
);
589 if (ret
== SHRINK_EMPTY
) {
590 clear_bit(i
, map
->map
);
592 * After the shrinker reported that it had no objects to
593 * free, but before we cleared the corresponding bit in
594 * the memcg shrinker map, a new object might have been
595 * added. To make sure, we have the bit set in this
596 * case, we invoke the shrinker one more time and reset
597 * the bit if it reports that it is not empty anymore.
598 * The memory barrier here pairs with the barrier in
599 * memcg_set_shrinker_bit():
601 * list_lru_add() shrink_slab_memcg()
602 * list_add_tail() clear_bit()
604 * set_bit() do_shrink_slab()
606 smp_mb__after_atomic();
607 ret
= do_shrink_slab(&sc
, shrinker
, priority
);
608 if (ret
== SHRINK_EMPTY
)
611 memcg_set_shrinker_bit(memcg
, nid
, i
);
615 if (rwsem_is_contended(&shrinker_rwsem
)) {
621 up_read(&shrinker_rwsem
);
624 #else /* CONFIG_MEMCG */
625 static unsigned long shrink_slab_memcg(gfp_t gfp_mask
, int nid
,
626 struct mem_cgroup
*memcg
, int priority
)
630 #endif /* CONFIG_MEMCG */
633 * shrink_slab - shrink slab caches
634 * @gfp_mask: allocation context
635 * @nid: node whose slab caches to target
636 * @memcg: memory cgroup whose slab caches to target
637 * @priority: the reclaim priority
639 * Call the shrink functions to age shrinkable caches.
641 * @nid is passed along to shrinkers with SHRINKER_NUMA_AWARE set,
642 * unaware shrinkers will receive a node id of 0 instead.
644 * @memcg specifies the memory cgroup to target. Unaware shrinkers
645 * are called only if it is the root cgroup.
647 * @priority is sc->priority, we take the number of objects and >> by priority
648 * in order to get the scan target.
650 * Returns the number of reclaimed slab objects.
652 static unsigned long shrink_slab(gfp_t gfp_mask
, int nid
,
653 struct mem_cgroup
*memcg
,
656 unsigned long ret
, freed
= 0;
657 struct shrinker
*shrinker
;
660 * The root memcg might be allocated even though memcg is disabled
661 * via "cgroup_disable=memory" boot parameter. This could make
662 * mem_cgroup_is_root() return false, then just run memcg slab
663 * shrink, but skip global shrink. This may result in premature
666 if (!mem_cgroup_disabled() && !mem_cgroup_is_root(memcg
))
667 return shrink_slab_memcg(gfp_mask
, nid
, memcg
, priority
);
669 if (!down_read_trylock(&shrinker_rwsem
))
672 list_for_each_entry(shrinker
, &shrinker_list
, list
) {
673 struct shrink_control sc
= {
674 .gfp_mask
= gfp_mask
,
679 ret
= do_shrink_slab(&sc
, shrinker
, priority
);
680 if (ret
== SHRINK_EMPTY
)
684 * Bail out if someone want to register a new shrinker to
685 * prevent the registration from being stalled for long periods
686 * by parallel ongoing shrinking.
688 if (rwsem_is_contended(&shrinker_rwsem
)) {
694 up_read(&shrinker_rwsem
);
700 void drop_slab_node(int nid
)
705 struct mem_cgroup
*memcg
= NULL
;
708 memcg
= mem_cgroup_iter(NULL
, NULL
, NULL
);
710 freed
+= shrink_slab(GFP_KERNEL
, nid
, memcg
, 0);
711 } while ((memcg
= mem_cgroup_iter(NULL
, memcg
, NULL
)) != NULL
);
712 } while (freed
> 10);
719 for_each_online_node(nid
)
723 static inline int is_page_cache_freeable(struct page
*page
)
726 * A freeable page cache page is referenced only by the caller
727 * that isolated the page, the page cache and optional buffer
728 * heads at page->private.
730 int page_cache_pins
= PageTransHuge(page
) && PageSwapCache(page
) ?
732 return page_count(page
) - page_has_private(page
) == 1 + page_cache_pins
;
735 static int may_write_to_inode(struct inode
*inode
)
737 if (current
->flags
& PF_SWAPWRITE
)
739 if (!inode_write_congested(inode
))
741 if (inode_to_bdi(inode
) == current
->backing_dev_info
)
747 * We detected a synchronous write error writing a page out. Probably
748 * -ENOSPC. We need to propagate that into the address_space for a subsequent
749 * fsync(), msync() or close().
751 * The tricky part is that after writepage we cannot touch the mapping: nothing
752 * prevents it from being freed up. But we have a ref on the page and once
753 * that page is locked, the mapping is pinned.
755 * We're allowed to run sleeping lock_page() here because we know the caller has
758 static void handle_write_error(struct address_space
*mapping
,
759 struct page
*page
, int error
)
762 if (page_mapping(page
) == mapping
)
763 mapping_set_error(mapping
, error
);
767 /* possible outcome of pageout() */
769 /* failed to write page out, page is locked */
771 /* move page to the active list, page is locked */
773 /* page has been sent to the disk successfully, page is unlocked */
775 /* page is clean and locked */
780 * pageout is called by shrink_page_list() for each dirty page.
781 * Calls ->writepage().
783 static pageout_t
pageout(struct page
*page
, struct address_space
*mapping
)
786 * If the page is dirty, only perform writeback if that write
787 * will be non-blocking. To prevent this allocation from being
788 * stalled by pagecache activity. But note that there may be
789 * stalls if we need to run get_block(). We could test
790 * PagePrivate for that.
792 * If this process is currently in __generic_file_write_iter() against
793 * this page's queue, we can perform writeback even if that
796 * If the page is swapcache, write it back even if that would
797 * block, for some throttling. This happens by accident, because
798 * swap_backing_dev_info is bust: it doesn't reflect the
799 * congestion state of the swapdevs. Easy to fix, if needed.
801 if (!is_page_cache_freeable(page
))
805 * Some data journaling orphaned pages can have
806 * page->mapping == NULL while being dirty with clean buffers.
808 if (page_has_private(page
)) {
809 if (try_to_free_buffers(page
)) {
810 ClearPageDirty(page
);
811 pr_info("%s: orphaned page\n", __func__
);
817 if (mapping
->a_ops
->writepage
== NULL
)
818 return PAGE_ACTIVATE
;
819 if (!may_write_to_inode(mapping
->host
))
822 if (clear_page_dirty_for_io(page
)) {
824 struct writeback_control wbc
= {
825 .sync_mode
= WB_SYNC_NONE
,
826 .nr_to_write
= SWAP_CLUSTER_MAX
,
828 .range_end
= LLONG_MAX
,
832 SetPageReclaim(page
);
833 res
= mapping
->a_ops
->writepage(page
, &wbc
);
835 handle_write_error(mapping
, page
, res
);
836 if (res
== AOP_WRITEPAGE_ACTIVATE
) {
837 ClearPageReclaim(page
);
838 return PAGE_ACTIVATE
;
841 if (!PageWriteback(page
)) {
842 /* synchronous write or broken a_ops? */
843 ClearPageReclaim(page
);
845 trace_mm_vmscan_writepage(page
);
846 inc_node_page_state(page
, NR_VMSCAN_WRITE
);
854 * Same as remove_mapping, but if the page is removed from the mapping, it
855 * gets returned with a refcount of 0.
857 static int __remove_mapping(struct address_space
*mapping
, struct page
*page
,
858 bool reclaimed
, struct mem_cgroup
*target_memcg
)
863 BUG_ON(!PageLocked(page
));
864 BUG_ON(mapping
!= page_mapping(page
));
866 xa_lock_irqsave(&mapping
->i_pages
, flags
);
868 * The non racy check for a busy page.
870 * Must be careful with the order of the tests. When someone has
871 * a ref to the page, it may be possible that they dirty it then
872 * drop the reference. So if PageDirty is tested before page_count
873 * here, then the following race may occur:
875 * get_user_pages(&page);
876 * [user mapping goes away]
878 * !PageDirty(page) [good]
879 * SetPageDirty(page);
881 * !page_count(page) [good, discard it]
883 * [oops, our write_to data is lost]
885 * Reversing the order of the tests ensures such a situation cannot
886 * escape unnoticed. The smp_rmb is needed to ensure the page->flags
887 * load is not satisfied before that of page->_refcount.
889 * Note that if SetPageDirty is always performed via set_page_dirty,
890 * and thus under the i_pages lock, then this ordering is not required.
892 refcount
= 1 + compound_nr(page
);
893 if (!page_ref_freeze(page
, refcount
))
895 /* note: atomic_cmpxchg in page_ref_freeze provides the smp_rmb */
896 if (unlikely(PageDirty(page
))) {
897 page_ref_unfreeze(page
, refcount
);
901 if (PageSwapCache(page
)) {
902 swp_entry_t swap
= { .val
= page_private(page
) };
903 mem_cgroup_swapout(page
, swap
);
904 __delete_from_swap_cache(page
, swap
);
905 xa_unlock_irqrestore(&mapping
->i_pages
, flags
);
906 put_swap_page(page
, swap
);
908 void (*freepage
)(struct page
*);
911 freepage
= mapping
->a_ops
->freepage
;
913 * Remember a shadow entry for reclaimed file cache in
914 * order to detect refaults, thus thrashing, later on.
916 * But don't store shadows in an address space that is
917 * already exiting. This is not just an optizimation,
918 * inode reclaim needs to empty out the radix tree or
919 * the nodes are lost. Don't plant shadows behind its
922 * We also don't store shadows for DAX mappings because the
923 * only page cache pages found in these are zero pages
924 * covering holes, and because we don't want to mix DAX
925 * exceptional entries and shadow exceptional entries in the
926 * same address_space.
928 if (reclaimed
&& page_is_file_lru(page
) &&
929 !mapping_exiting(mapping
) && !dax_mapping(mapping
))
930 shadow
= workingset_eviction(page
, target_memcg
);
931 __delete_from_page_cache(page
, shadow
);
932 xa_unlock_irqrestore(&mapping
->i_pages
, flags
);
934 if (freepage
!= NULL
)
941 xa_unlock_irqrestore(&mapping
->i_pages
, flags
);
946 * Attempt to detach a locked page from its ->mapping. If it is dirty or if
947 * someone else has a ref on the page, abort and return 0. If it was
948 * successfully detached, return 1. Assumes the caller has a single ref on
951 int remove_mapping(struct address_space
*mapping
, struct page
*page
)
953 if (__remove_mapping(mapping
, page
, false, NULL
)) {
955 * Unfreezing the refcount with 1 rather than 2 effectively
956 * drops the pagecache ref for us without requiring another
959 page_ref_unfreeze(page
, 1);
966 * putback_lru_page - put previously isolated page onto appropriate LRU list
967 * @page: page to be put back to appropriate lru list
969 * Add previously isolated @page to appropriate LRU list.
970 * Page may still be unevictable for other reasons.
972 * lru_lock must not be held, interrupts must be enabled.
974 void putback_lru_page(struct page
*page
)
977 put_page(page
); /* drop ref from isolate */
980 enum page_references
{
982 PAGEREF_RECLAIM_CLEAN
,
987 static enum page_references
page_check_references(struct page
*page
,
988 struct scan_control
*sc
)
990 int referenced_ptes
, referenced_page
;
991 unsigned long vm_flags
;
993 referenced_ptes
= page_referenced(page
, 1, sc
->target_mem_cgroup
,
995 referenced_page
= TestClearPageReferenced(page
);
998 * Mlock lost the isolation race with us. Let try_to_unmap()
999 * move the page to the unevictable list.
1001 if (vm_flags
& VM_LOCKED
)
1002 return PAGEREF_RECLAIM
;
1004 if (referenced_ptes
) {
1005 if (PageSwapBacked(page
))
1006 return PAGEREF_ACTIVATE
;
1008 * All mapped pages start out with page table
1009 * references from the instantiating fault, so we need
1010 * to look twice if a mapped file page is used more
1013 * Mark it and spare it for another trip around the
1014 * inactive list. Another page table reference will
1015 * lead to its activation.
1017 * Note: the mark is set for activated pages as well
1018 * so that recently deactivated but used pages are
1019 * quickly recovered.
1021 SetPageReferenced(page
);
1023 if (referenced_page
|| referenced_ptes
> 1)
1024 return PAGEREF_ACTIVATE
;
1027 * Activate file-backed executable pages after first usage.
1029 if (vm_flags
& VM_EXEC
)
1030 return PAGEREF_ACTIVATE
;
1032 return PAGEREF_KEEP
;
1035 /* Reclaim if clean, defer dirty pages to writeback */
1036 if (referenced_page
&& !PageSwapBacked(page
))
1037 return PAGEREF_RECLAIM_CLEAN
;
1039 return PAGEREF_RECLAIM
;
1042 /* Check if a page is dirty or under writeback */
1043 static void page_check_dirty_writeback(struct page
*page
,
1044 bool *dirty
, bool *writeback
)
1046 struct address_space
*mapping
;
1049 * Anonymous pages are not handled by flushers and must be written
1050 * from reclaim context. Do not stall reclaim based on them
1052 if (!page_is_file_lru(page
) ||
1053 (PageAnon(page
) && !PageSwapBacked(page
))) {
1059 /* By default assume that the page flags are accurate */
1060 *dirty
= PageDirty(page
);
1061 *writeback
= PageWriteback(page
);
1063 /* Verify dirty/writeback state if the filesystem supports it */
1064 if (!page_has_private(page
))
1067 mapping
= page_mapping(page
);
1068 if (mapping
&& mapping
->a_ops
->is_dirty_writeback
)
1069 mapping
->a_ops
->is_dirty_writeback(page
, dirty
, writeback
);
1073 * shrink_page_list() returns the number of reclaimed pages
1075 static unsigned int shrink_page_list(struct list_head
*page_list
,
1076 struct pglist_data
*pgdat
,
1077 struct scan_control
*sc
,
1078 enum ttu_flags ttu_flags
,
1079 struct reclaim_stat
*stat
,
1080 bool ignore_references
)
1082 LIST_HEAD(ret_pages
);
1083 LIST_HEAD(free_pages
);
1084 unsigned int nr_reclaimed
= 0;
1085 unsigned int pgactivate
= 0;
1087 memset(stat
, 0, sizeof(*stat
));
1090 while (!list_empty(page_list
)) {
1091 struct address_space
*mapping
;
1093 enum page_references references
= PAGEREF_RECLAIM
;
1094 bool dirty
, writeback
, may_enter_fs
;
1095 unsigned int nr_pages
;
1099 page
= lru_to_page(page_list
);
1100 list_del(&page
->lru
);
1102 if (!trylock_page(page
))
1105 VM_BUG_ON_PAGE(PageActive(page
), page
);
1107 nr_pages
= compound_nr(page
);
1109 /* Account the number of base pages even though THP */
1110 sc
->nr_scanned
+= nr_pages
;
1112 if (unlikely(!page_evictable(page
)))
1113 goto activate_locked
;
1115 if (!sc
->may_unmap
&& page_mapped(page
))
1118 may_enter_fs
= (sc
->gfp_mask
& __GFP_FS
) ||
1119 (PageSwapCache(page
) && (sc
->gfp_mask
& __GFP_IO
));
1122 * The number of dirty pages determines if a node is marked
1123 * reclaim_congested which affects wait_iff_congested. kswapd
1124 * will stall and start writing pages if the tail of the LRU
1125 * is all dirty unqueued pages.
1127 page_check_dirty_writeback(page
, &dirty
, &writeback
);
1128 if (dirty
|| writeback
)
1131 if (dirty
&& !writeback
)
1132 stat
->nr_unqueued_dirty
++;
1135 * Treat this page as congested if the underlying BDI is or if
1136 * pages are cycling through the LRU so quickly that the
1137 * pages marked for immediate reclaim are making it to the
1138 * end of the LRU a second time.
1140 mapping
= page_mapping(page
);
1141 if (((dirty
|| writeback
) && mapping
&&
1142 inode_write_congested(mapping
->host
)) ||
1143 (writeback
&& PageReclaim(page
)))
1144 stat
->nr_congested
++;
1147 * If a page at the tail of the LRU is under writeback, there
1148 * are three cases to consider.
1150 * 1) If reclaim is encountering an excessive number of pages
1151 * under writeback and this page is both under writeback and
1152 * PageReclaim then it indicates that pages are being queued
1153 * for IO but are being recycled through the LRU before the
1154 * IO can complete. Waiting on the page itself risks an
1155 * indefinite stall if it is impossible to writeback the
1156 * page due to IO error or disconnected storage so instead
1157 * note that the LRU is being scanned too quickly and the
1158 * caller can stall after page list has been processed.
1160 * 2) Global or new memcg reclaim encounters a page that is
1161 * not marked for immediate reclaim, or the caller does not
1162 * have __GFP_FS (or __GFP_IO if it's simply going to swap,
1163 * not to fs). In this case mark the page for immediate
1164 * reclaim and continue scanning.
1166 * Require may_enter_fs because we would wait on fs, which
1167 * may not have submitted IO yet. And the loop driver might
1168 * enter reclaim, and deadlock if it waits on a page for
1169 * which it is needed to do the write (loop masks off
1170 * __GFP_IO|__GFP_FS for this reason); but more thought
1171 * would probably show more reasons.
1173 * 3) Legacy memcg encounters a page that is already marked
1174 * PageReclaim. memcg does not have any dirty pages
1175 * throttling so we could easily OOM just because too many
1176 * pages are in writeback and there is nothing else to
1177 * reclaim. Wait for the writeback to complete.
1179 * In cases 1) and 2) we activate the pages to get them out of
1180 * the way while we continue scanning for clean pages on the
1181 * inactive list and refilling from the active list. The
1182 * observation here is that waiting for disk writes is more
1183 * expensive than potentially causing reloads down the line.
1184 * Since they're marked for immediate reclaim, they won't put
1185 * memory pressure on the cache working set any longer than it
1186 * takes to write them to disk.
1188 if (PageWriteback(page
)) {
1190 if (current_is_kswapd() &&
1191 PageReclaim(page
) &&
1192 test_bit(PGDAT_WRITEBACK
, &pgdat
->flags
)) {
1193 stat
->nr_immediate
++;
1194 goto activate_locked
;
1197 } else if (writeback_throttling_sane(sc
) ||
1198 !PageReclaim(page
) || !may_enter_fs
) {
1200 * This is slightly racy - end_page_writeback()
1201 * might have just cleared PageReclaim, then
1202 * setting PageReclaim here end up interpreted
1203 * as PageReadahead - but that does not matter
1204 * enough to care. What we do want is for this
1205 * page to have PageReclaim set next time memcg
1206 * reclaim reaches the tests above, so it will
1207 * then wait_on_page_writeback() to avoid OOM;
1208 * and it's also appropriate in global reclaim.
1210 SetPageReclaim(page
);
1211 stat
->nr_writeback
++;
1212 goto activate_locked
;
1217 wait_on_page_writeback(page
);
1218 /* then go back and try same page again */
1219 list_add_tail(&page
->lru
, page_list
);
1224 if (!ignore_references
)
1225 references
= page_check_references(page
, sc
);
1227 switch (references
) {
1228 case PAGEREF_ACTIVATE
:
1229 goto activate_locked
;
1231 stat
->nr_ref_keep
+= nr_pages
;
1233 case PAGEREF_RECLAIM
:
1234 case PAGEREF_RECLAIM_CLEAN
:
1235 ; /* try to reclaim the page below */
1239 * Anonymous process memory has backing store?
1240 * Try to allocate it some swap space here.
1241 * Lazyfree page could be freed directly
1243 if (PageAnon(page
) && PageSwapBacked(page
)) {
1244 if (!PageSwapCache(page
)) {
1245 if (!(sc
->gfp_mask
& __GFP_IO
))
1247 if (PageTransHuge(page
)) {
1248 /* cannot split THP, skip it */
1249 if (!can_split_huge_page(page
, NULL
))
1250 goto activate_locked
;
1252 * Split pages without a PMD map right
1253 * away. Chances are some or all of the
1254 * tail pages can be freed without IO.
1256 if (!compound_mapcount(page
) &&
1257 split_huge_page_to_list(page
,
1259 goto activate_locked
;
1261 if (!add_to_swap(page
)) {
1262 if (!PageTransHuge(page
))
1263 goto activate_locked_split
;
1264 /* Fallback to swap normal pages */
1265 if (split_huge_page_to_list(page
,
1267 goto activate_locked
;
1268 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
1269 count_vm_event(THP_SWPOUT_FALLBACK
);
1271 if (!add_to_swap(page
))
1272 goto activate_locked_split
;
1275 may_enter_fs
= true;
1277 /* Adding to swap updated mapping */
1278 mapping
= page_mapping(page
);
1280 } else if (unlikely(PageTransHuge(page
))) {
1281 /* Split file THP */
1282 if (split_huge_page_to_list(page
, page_list
))
1287 * THP may get split above, need minus tail pages and update
1288 * nr_pages to avoid accounting tail pages twice.
1290 * The tail pages that are added into swap cache successfully
1293 if ((nr_pages
> 1) && !PageTransHuge(page
)) {
1294 sc
->nr_scanned
-= (nr_pages
- 1);
1299 * The page is mapped into the page tables of one or more
1300 * processes. Try to unmap it here.
1302 if (page_mapped(page
)) {
1303 enum ttu_flags flags
= ttu_flags
| TTU_BATCH_FLUSH
;
1304 bool was_swapbacked
= PageSwapBacked(page
);
1306 if (unlikely(PageTransHuge(page
)))
1307 flags
|= TTU_SPLIT_HUGE_PMD
;
1309 if (!try_to_unmap(page
, flags
)) {
1310 stat
->nr_unmap_fail
+= nr_pages
;
1311 if (!was_swapbacked
&& PageSwapBacked(page
))
1312 stat
->nr_lazyfree_fail
+= nr_pages
;
1313 goto activate_locked
;
1317 if (PageDirty(page
)) {
1319 * Only kswapd can writeback filesystem pages
1320 * to avoid risk of stack overflow. But avoid
1321 * injecting inefficient single-page IO into
1322 * flusher writeback as much as possible: only
1323 * write pages when we've encountered many
1324 * dirty pages, and when we've already scanned
1325 * the rest of the LRU for clean pages and see
1326 * the same dirty pages again (PageReclaim).
1328 if (page_is_file_lru(page
) &&
1329 (!current_is_kswapd() || !PageReclaim(page
) ||
1330 !test_bit(PGDAT_DIRTY
, &pgdat
->flags
))) {
1332 * Immediately reclaim when written back.
1333 * Similar in principal to deactivate_page()
1334 * except we already have the page isolated
1335 * and know it's dirty
1337 inc_node_page_state(page
, NR_VMSCAN_IMMEDIATE
);
1338 SetPageReclaim(page
);
1340 goto activate_locked
;
1343 if (references
== PAGEREF_RECLAIM_CLEAN
)
1347 if (!sc
->may_writepage
)
1351 * Page is dirty. Flush the TLB if a writable entry
1352 * potentially exists to avoid CPU writes after IO
1353 * starts and then write it out here.
1355 try_to_unmap_flush_dirty();
1356 switch (pageout(page
, mapping
)) {
1360 goto activate_locked
;
1362 stat
->nr_pageout
+= hpage_nr_pages(page
);
1364 if (PageWriteback(page
))
1366 if (PageDirty(page
))
1370 * A synchronous write - probably a ramdisk. Go
1371 * ahead and try to reclaim the page.
1373 if (!trylock_page(page
))
1375 if (PageDirty(page
) || PageWriteback(page
))
1377 mapping
= page_mapping(page
);
1379 ; /* try to free the page below */
1384 * If the page has buffers, try to free the buffer mappings
1385 * associated with this page. If we succeed we try to free
1388 * We do this even if the page is PageDirty().
1389 * try_to_release_page() does not perform I/O, but it is
1390 * possible for a page to have PageDirty set, but it is actually
1391 * clean (all its buffers are clean). This happens if the
1392 * buffers were written out directly, with submit_bh(). ext3
1393 * will do this, as well as the blockdev mapping.
1394 * try_to_release_page() will discover that cleanness and will
1395 * drop the buffers and mark the page clean - it can be freed.
1397 * Rarely, pages can have buffers and no ->mapping. These are
1398 * the pages which were not successfully invalidated in
1399 * truncate_complete_page(). We try to drop those buffers here
1400 * and if that worked, and the page is no longer mapped into
1401 * process address space (page_count == 1) it can be freed.
1402 * Otherwise, leave the page on the LRU so it is swappable.
1404 if (page_has_private(page
)) {
1405 if (!try_to_release_page(page
, sc
->gfp_mask
))
1406 goto activate_locked
;
1407 if (!mapping
&& page_count(page
) == 1) {
1409 if (put_page_testzero(page
))
1413 * rare race with speculative reference.
1414 * the speculative reference will free
1415 * this page shortly, so we may
1416 * increment nr_reclaimed here (and
1417 * leave it off the LRU).
1425 if (PageAnon(page
) && !PageSwapBacked(page
)) {
1426 /* follow __remove_mapping for reference */
1427 if (!page_ref_freeze(page
, 1))
1429 if (PageDirty(page
)) {
1430 page_ref_unfreeze(page
, 1);
1434 count_vm_event(PGLAZYFREED
);
1435 count_memcg_page_event(page
, PGLAZYFREED
);
1436 } else if (!mapping
|| !__remove_mapping(mapping
, page
, true,
1437 sc
->target_mem_cgroup
))
1443 * THP may get swapped out in a whole, need account
1446 nr_reclaimed
+= nr_pages
;
1449 * Is there need to periodically free_page_list? It would
1450 * appear not as the counts should be low
1452 if (unlikely(PageTransHuge(page
)))
1453 destroy_compound_page(page
);
1455 list_add(&page
->lru
, &free_pages
);
1458 activate_locked_split
:
1460 * The tail pages that are failed to add into swap cache
1461 * reach here. Fixup nr_scanned and nr_pages.
1464 sc
->nr_scanned
-= (nr_pages
- 1);
1468 /* Not a candidate for swapping, so reclaim swap space. */
1469 if (PageSwapCache(page
) && (mem_cgroup_swap_full(page
) ||
1471 try_to_free_swap(page
);
1472 VM_BUG_ON_PAGE(PageActive(page
), page
);
1473 if (!PageMlocked(page
)) {
1474 int type
= page_is_file_lru(page
);
1475 SetPageActive(page
);
1476 stat
->nr_activate
[type
] += nr_pages
;
1477 count_memcg_page_event(page
, PGACTIVATE
);
1482 list_add(&page
->lru
, &ret_pages
);
1483 VM_BUG_ON_PAGE(PageLRU(page
) || PageUnevictable(page
), page
);
1486 pgactivate
= stat
->nr_activate
[0] + stat
->nr_activate
[1];
1488 mem_cgroup_uncharge_list(&free_pages
);
1489 try_to_unmap_flush();
1490 free_unref_page_list(&free_pages
);
1492 list_splice(&ret_pages
, page_list
);
1493 count_vm_events(PGACTIVATE
, pgactivate
);
1495 return nr_reclaimed
;
1498 unsigned int reclaim_clean_pages_from_list(struct zone
*zone
,
1499 struct list_head
*page_list
)
1501 struct scan_control sc
= {
1502 .gfp_mask
= GFP_KERNEL
,
1503 .priority
= DEF_PRIORITY
,
1506 struct reclaim_stat stat
;
1507 unsigned int nr_reclaimed
;
1508 struct page
*page
, *next
;
1509 LIST_HEAD(clean_pages
);
1511 list_for_each_entry_safe(page
, next
, page_list
, lru
) {
1512 if (page_is_file_lru(page
) && !PageDirty(page
) &&
1513 !__PageMovable(page
) && !PageUnevictable(page
)) {
1514 ClearPageActive(page
);
1515 list_move(&page
->lru
, &clean_pages
);
1519 nr_reclaimed
= shrink_page_list(&clean_pages
, zone
->zone_pgdat
, &sc
,
1520 TTU_IGNORE_ACCESS
, &stat
, true);
1521 list_splice(&clean_pages
, page_list
);
1522 mod_node_page_state(zone
->zone_pgdat
, NR_ISOLATED_FILE
, -nr_reclaimed
);
1524 * Since lazyfree pages are isolated from file LRU from the beginning,
1525 * they will rotate back to anonymous LRU in the end if it failed to
1526 * discard so isolated count will be mismatched.
1527 * Compensate the isolated count for both LRU lists.
1529 mod_node_page_state(zone
->zone_pgdat
, NR_ISOLATED_ANON
,
1530 stat
.nr_lazyfree_fail
);
1531 mod_node_page_state(zone
->zone_pgdat
, NR_ISOLATED_FILE
,
1532 -stat
.nr_lazyfree_fail
);
1533 return nr_reclaimed
;
1537 * Attempt to remove the specified page from its LRU. Only take this page
1538 * if it is of the appropriate PageActive status. Pages which are being
1539 * freed elsewhere are also ignored.
1541 * page: page to consider
1542 * mode: one of the LRU isolation modes defined above
1544 * returns 0 on success, -ve errno on failure.
1546 int __isolate_lru_page(struct page
*page
, isolate_mode_t mode
)
1550 /* Only take pages on the LRU. */
1554 /* Compaction should not handle unevictable pages but CMA can do so */
1555 if (PageUnevictable(page
) && !(mode
& ISOLATE_UNEVICTABLE
))
1561 * To minimise LRU disruption, the caller can indicate that it only
1562 * wants to isolate pages it will be able to operate on without
1563 * blocking - clean pages for the most part.
1565 * ISOLATE_ASYNC_MIGRATE is used to indicate that it only wants to pages
1566 * that it is possible to migrate without blocking
1568 if (mode
& ISOLATE_ASYNC_MIGRATE
) {
1569 /* All the caller can do on PageWriteback is block */
1570 if (PageWriteback(page
))
1573 if (PageDirty(page
)) {
1574 struct address_space
*mapping
;
1578 * Only pages without mappings or that have a
1579 * ->migratepage callback are possible to migrate
1580 * without blocking. However, we can be racing with
1581 * truncation so it's necessary to lock the page
1582 * to stabilise the mapping as truncation holds
1583 * the page lock until after the page is removed
1584 * from the page cache.
1586 if (!trylock_page(page
))
1589 mapping
= page_mapping(page
);
1590 migrate_dirty
= !mapping
|| mapping
->a_ops
->migratepage
;
1597 if ((mode
& ISOLATE_UNMAPPED
) && page_mapped(page
))
1600 if (likely(get_page_unless_zero(page
))) {
1602 * Be careful not to clear PageLRU until after we're
1603 * sure the page is not being freed elsewhere -- the
1604 * page release code relies on it.
1615 * Update LRU sizes after isolating pages. The LRU size updates must
1616 * be complete before mem_cgroup_update_lru_size due to a sanity check.
1618 static __always_inline
void update_lru_sizes(struct lruvec
*lruvec
,
1619 enum lru_list lru
, unsigned long *nr_zone_taken
)
1623 for (zid
= 0; zid
< MAX_NR_ZONES
; zid
++) {
1624 if (!nr_zone_taken
[zid
])
1627 update_lru_size(lruvec
, lru
, zid
, -nr_zone_taken
[zid
]);
1633 * pgdat->lru_lock is heavily contended. Some of the functions that
1634 * shrink the lists perform better by taking out a batch of pages
1635 * and working on them outside the LRU lock.
1637 * For pagecache intensive workloads, this function is the hottest
1638 * spot in the kernel (apart from copy_*_user functions).
1640 * Appropriate locks must be held before calling this function.
1642 * @nr_to_scan: The number of eligible pages to look through on the list.
1643 * @lruvec: The LRU vector to pull pages from.
1644 * @dst: The temp list to put pages on to.
1645 * @nr_scanned: The number of pages that were scanned.
1646 * @sc: The scan_control struct for this reclaim session
1647 * @lru: LRU list id for isolating
1649 * returns how many pages were moved onto *@dst.
1651 static unsigned long isolate_lru_pages(unsigned long nr_to_scan
,
1652 struct lruvec
*lruvec
, struct list_head
*dst
,
1653 unsigned long *nr_scanned
, struct scan_control
*sc
,
1656 struct list_head
*src
= &lruvec
->lists
[lru
];
1657 unsigned long nr_taken
= 0;
1658 unsigned long nr_zone_taken
[MAX_NR_ZONES
] = { 0 };
1659 unsigned long nr_skipped
[MAX_NR_ZONES
] = { 0, };
1660 unsigned long skipped
= 0;
1661 unsigned long scan
, total_scan
, nr_pages
;
1662 LIST_HEAD(pages_skipped
);
1663 isolate_mode_t mode
= (sc
->may_unmap
? 0 : ISOLATE_UNMAPPED
);
1667 while (scan
< nr_to_scan
&& !list_empty(src
)) {
1670 page
= lru_to_page(src
);
1671 prefetchw_prev_lru_page(page
, src
, flags
);
1673 VM_BUG_ON_PAGE(!PageLRU(page
), page
);
1675 nr_pages
= compound_nr(page
);
1676 total_scan
+= nr_pages
;
1678 if (page_zonenum(page
) > sc
->reclaim_idx
) {
1679 list_move(&page
->lru
, &pages_skipped
);
1680 nr_skipped
[page_zonenum(page
)] += nr_pages
;
1685 * Do not count skipped pages because that makes the function
1686 * return with no isolated pages if the LRU mostly contains
1687 * ineligible pages. This causes the VM to not reclaim any
1688 * pages, triggering a premature OOM.
1690 * Account all tail pages of THP. This would not cause
1691 * premature OOM since __isolate_lru_page() returns -EBUSY
1692 * only when the page is being freed somewhere else.
1695 switch (__isolate_lru_page(page
, mode
)) {
1697 nr_taken
+= nr_pages
;
1698 nr_zone_taken
[page_zonenum(page
)] += nr_pages
;
1699 list_move(&page
->lru
, dst
);
1703 /* else it is being freed elsewhere */
1704 list_move(&page
->lru
, src
);
1713 * Splice any skipped pages to the start of the LRU list. Note that
1714 * this disrupts the LRU order when reclaiming for lower zones but
1715 * we cannot splice to the tail. If we did then the SWAP_CLUSTER_MAX
1716 * scanning would soon rescan the same pages to skip and put the
1717 * system at risk of premature OOM.
1719 if (!list_empty(&pages_skipped
)) {
1722 list_splice(&pages_skipped
, src
);
1723 for (zid
= 0; zid
< MAX_NR_ZONES
; zid
++) {
1724 if (!nr_skipped
[zid
])
1727 __count_zid_vm_events(PGSCAN_SKIP
, zid
, nr_skipped
[zid
]);
1728 skipped
+= nr_skipped
[zid
];
1731 *nr_scanned
= total_scan
;
1732 trace_mm_vmscan_lru_isolate(sc
->reclaim_idx
, sc
->order
, nr_to_scan
,
1733 total_scan
, skipped
, nr_taken
, mode
, lru
);
1734 update_lru_sizes(lruvec
, lru
, nr_zone_taken
);
1739 * isolate_lru_page - tries to isolate a page from its LRU list
1740 * @page: page to isolate from its LRU list
1742 * Isolates a @page from an LRU list, clears PageLRU and adjusts the
1743 * vmstat statistic corresponding to whatever LRU list the page was on.
1745 * Returns 0 if the page was removed from an LRU list.
1746 * Returns -EBUSY if the page was not on an LRU list.
1748 * The returned page will have PageLRU() cleared. If it was found on
1749 * the active list, it will have PageActive set. If it was found on
1750 * the unevictable list, it will have the PageUnevictable bit set. That flag
1751 * may need to be cleared by the caller before letting the page go.
1753 * The vmstat statistic corresponding to the list on which the page was
1754 * found will be decremented.
1758 * (1) Must be called with an elevated refcount on the page. This is a
1759 * fundamentnal difference from isolate_lru_pages (which is called
1760 * without a stable reference).
1761 * (2) the lru_lock must not be held.
1762 * (3) interrupts must be enabled.
1764 int isolate_lru_page(struct page
*page
)
1768 VM_BUG_ON_PAGE(!page_count(page
), page
);
1769 WARN_RATELIMIT(PageTail(page
), "trying to isolate tail page");
1771 if (PageLRU(page
)) {
1772 pg_data_t
*pgdat
= page_pgdat(page
);
1773 struct lruvec
*lruvec
;
1775 spin_lock_irq(&pgdat
->lru_lock
);
1776 lruvec
= mem_cgroup_page_lruvec(page
, pgdat
);
1777 if (PageLRU(page
)) {
1778 int lru
= page_lru(page
);
1781 del_page_from_lru_list(page
, lruvec
, lru
);
1784 spin_unlock_irq(&pgdat
->lru_lock
);
1790 * A direct reclaimer may isolate SWAP_CLUSTER_MAX pages from the LRU list and
1791 * then get rescheduled. When there are massive number of tasks doing page
1792 * allocation, such sleeping direct reclaimers may keep piling up on each CPU,
1793 * the LRU list will go small and be scanned faster than necessary, leading to
1794 * unnecessary swapping, thrashing and OOM.
1796 static int too_many_isolated(struct pglist_data
*pgdat
, int file
,
1797 struct scan_control
*sc
)
1799 unsigned long inactive
, isolated
;
1801 if (current_is_kswapd())
1804 if (!writeback_throttling_sane(sc
))
1808 inactive
= node_page_state(pgdat
, NR_INACTIVE_FILE
);
1809 isolated
= node_page_state(pgdat
, NR_ISOLATED_FILE
);
1811 inactive
= node_page_state(pgdat
, NR_INACTIVE_ANON
);
1812 isolated
= node_page_state(pgdat
, NR_ISOLATED_ANON
);
1816 * GFP_NOIO/GFP_NOFS callers are allowed to isolate more pages, so they
1817 * won't get blocked by normal direct-reclaimers, forming a circular
1820 if ((sc
->gfp_mask
& (__GFP_IO
| __GFP_FS
)) == (__GFP_IO
| __GFP_FS
))
1823 return isolated
> inactive
;
1827 * This moves pages from @list to corresponding LRU list.
1829 * We move them the other way if the page is referenced by one or more
1830 * processes, from rmap.
1832 * If the pages are mostly unmapped, the processing is fast and it is
1833 * appropriate to hold zone_lru_lock across the whole operation. But if
1834 * the pages are mapped, the processing is slow (page_referenced()) so we
1835 * should drop zone_lru_lock around each page. It's impossible to balance
1836 * this, so instead we remove the pages from the LRU while processing them.
1837 * It is safe to rely on PG_active against the non-LRU pages in here because
1838 * nobody will play with that bit on a non-LRU page.
1840 * The downside is that we have to touch page->_refcount against each page.
1841 * But we had to alter page->flags anyway.
1843 * Returns the number of pages moved to the given lruvec.
1846 static unsigned noinline_for_stack
move_pages_to_lru(struct lruvec
*lruvec
,
1847 struct list_head
*list
)
1849 struct pglist_data
*pgdat
= lruvec_pgdat(lruvec
);
1850 int nr_pages
, nr_moved
= 0;
1851 LIST_HEAD(pages_to_free
);
1855 while (!list_empty(list
)) {
1856 page
= lru_to_page(list
);
1857 VM_BUG_ON_PAGE(PageLRU(page
), page
);
1858 if (unlikely(!page_evictable(page
))) {
1859 list_del(&page
->lru
);
1860 spin_unlock_irq(&pgdat
->lru_lock
);
1861 putback_lru_page(page
);
1862 spin_lock_irq(&pgdat
->lru_lock
);
1865 lruvec
= mem_cgroup_page_lruvec(page
, pgdat
);
1868 lru
= page_lru(page
);
1870 nr_pages
= hpage_nr_pages(page
);
1871 update_lru_size(lruvec
, lru
, page_zonenum(page
), nr_pages
);
1872 list_move(&page
->lru
, &lruvec
->lists
[lru
]);
1874 if (put_page_testzero(page
)) {
1875 __ClearPageLRU(page
);
1876 __ClearPageActive(page
);
1877 del_page_from_lru_list(page
, lruvec
, lru
);
1879 if (unlikely(PageCompound(page
))) {
1880 spin_unlock_irq(&pgdat
->lru_lock
);
1881 destroy_compound_page(page
);
1882 spin_lock_irq(&pgdat
->lru_lock
);
1884 list_add(&page
->lru
, &pages_to_free
);
1886 nr_moved
+= nr_pages
;
1891 * To save our caller's stack, now use input list for pages to free.
1893 list_splice(&pages_to_free
, list
);
1899 * If a kernel thread (such as nfsd for loop-back mounts) services
1900 * a backing device by writing to the page cache it sets PF_LOCAL_THROTTLE.
1901 * In that case we should only throttle if the backing device it is
1902 * writing to is congested. In other cases it is safe to throttle.
1904 static int current_may_throttle(void)
1906 return !(current
->flags
& PF_LOCAL_THROTTLE
) ||
1907 current
->backing_dev_info
== NULL
||
1908 bdi_write_congested(current
->backing_dev_info
);
1912 * shrink_inactive_list() is a helper for shrink_node(). It returns the number
1913 * of reclaimed pages
1915 static noinline_for_stack
unsigned long
1916 shrink_inactive_list(unsigned long nr_to_scan
, struct lruvec
*lruvec
,
1917 struct scan_control
*sc
, enum lru_list lru
)
1919 LIST_HEAD(page_list
);
1920 unsigned long nr_scanned
;
1921 unsigned int nr_reclaimed
= 0;
1922 unsigned long nr_taken
;
1923 struct reclaim_stat stat
;
1924 bool file
= is_file_lru(lru
);
1925 enum vm_event_item item
;
1926 struct pglist_data
*pgdat
= lruvec_pgdat(lruvec
);
1927 bool stalled
= false;
1929 while (unlikely(too_many_isolated(pgdat
, file
, sc
))) {
1933 /* wait a bit for the reclaimer. */
1937 /* We are about to die and free our memory. Return now. */
1938 if (fatal_signal_pending(current
))
1939 return SWAP_CLUSTER_MAX
;
1944 spin_lock_irq(&pgdat
->lru_lock
);
1946 nr_taken
= isolate_lru_pages(nr_to_scan
, lruvec
, &page_list
,
1947 &nr_scanned
, sc
, lru
);
1949 __mod_node_page_state(pgdat
, NR_ISOLATED_ANON
+ file
, nr_taken
);
1950 item
= current_is_kswapd() ? PGSCAN_KSWAPD
: PGSCAN_DIRECT
;
1951 if (!cgroup_reclaim(sc
))
1952 __count_vm_events(item
, nr_scanned
);
1953 __count_memcg_events(lruvec_memcg(lruvec
), item
, nr_scanned
);
1954 __count_vm_events(PGSCAN_ANON
+ file
, nr_scanned
);
1956 spin_unlock_irq(&pgdat
->lru_lock
);
1961 nr_reclaimed
= shrink_page_list(&page_list
, pgdat
, sc
, 0,
1964 spin_lock_irq(&pgdat
->lru_lock
);
1966 move_pages_to_lru(lruvec
, &page_list
);
1968 __mod_node_page_state(pgdat
, NR_ISOLATED_ANON
+ file
, -nr_taken
);
1969 lru_note_cost(lruvec
, file
, stat
.nr_pageout
);
1970 item
= current_is_kswapd() ? PGSTEAL_KSWAPD
: PGSTEAL_DIRECT
;
1971 if (!cgroup_reclaim(sc
))
1972 __count_vm_events(item
, nr_reclaimed
);
1973 __count_memcg_events(lruvec_memcg(lruvec
), item
, nr_reclaimed
);
1974 __count_vm_events(PGSTEAL_ANON
+ file
, nr_reclaimed
);
1976 spin_unlock_irq(&pgdat
->lru_lock
);
1978 mem_cgroup_uncharge_list(&page_list
);
1979 free_unref_page_list(&page_list
);
1982 * If dirty pages are scanned that are not queued for IO, it
1983 * implies that flushers are not doing their job. This can
1984 * happen when memory pressure pushes dirty pages to the end of
1985 * the LRU before the dirty limits are breached and the dirty
1986 * data has expired. It can also happen when the proportion of
1987 * dirty pages grows not through writes but through memory
1988 * pressure reclaiming all the clean cache. And in some cases,
1989 * the flushers simply cannot keep up with the allocation
1990 * rate. Nudge the flusher threads in case they are asleep.
1992 if (stat
.nr_unqueued_dirty
== nr_taken
)
1993 wakeup_flusher_threads(WB_REASON_VMSCAN
);
1995 sc
->nr
.dirty
+= stat
.nr_dirty
;
1996 sc
->nr
.congested
+= stat
.nr_congested
;
1997 sc
->nr
.unqueued_dirty
+= stat
.nr_unqueued_dirty
;
1998 sc
->nr
.writeback
+= stat
.nr_writeback
;
1999 sc
->nr
.immediate
+= stat
.nr_immediate
;
2000 sc
->nr
.taken
+= nr_taken
;
2002 sc
->nr
.file_taken
+= nr_taken
;
2004 trace_mm_vmscan_lru_shrink_inactive(pgdat
->node_id
,
2005 nr_scanned
, nr_reclaimed
, &stat
, sc
->priority
, file
);
2006 return nr_reclaimed
;
2009 static void shrink_active_list(unsigned long nr_to_scan
,
2010 struct lruvec
*lruvec
,
2011 struct scan_control
*sc
,
2014 unsigned long nr_taken
;
2015 unsigned long nr_scanned
;
2016 unsigned long vm_flags
;
2017 LIST_HEAD(l_hold
); /* The pages which were snipped off */
2018 LIST_HEAD(l_active
);
2019 LIST_HEAD(l_inactive
);
2021 unsigned nr_deactivate
, nr_activate
;
2022 unsigned nr_rotated
= 0;
2023 int file
= is_file_lru(lru
);
2024 struct pglist_data
*pgdat
= lruvec_pgdat(lruvec
);
2028 spin_lock_irq(&pgdat
->lru_lock
);
2030 nr_taken
= isolate_lru_pages(nr_to_scan
, lruvec
, &l_hold
,
2031 &nr_scanned
, sc
, lru
);
2033 __mod_node_page_state(pgdat
, NR_ISOLATED_ANON
+ file
, nr_taken
);
2035 __count_vm_events(PGREFILL
, nr_scanned
);
2036 __count_memcg_events(lruvec_memcg(lruvec
), PGREFILL
, nr_scanned
);
2038 spin_unlock_irq(&pgdat
->lru_lock
);
2040 while (!list_empty(&l_hold
)) {
2042 page
= lru_to_page(&l_hold
);
2043 list_del(&page
->lru
);
2045 if (unlikely(!page_evictable(page
))) {
2046 putback_lru_page(page
);
2050 if (unlikely(buffer_heads_over_limit
)) {
2051 if (page_has_private(page
) && trylock_page(page
)) {
2052 if (page_has_private(page
))
2053 try_to_release_page(page
, 0);
2058 if (page_referenced(page
, 0, sc
->target_mem_cgroup
,
2061 * Identify referenced, file-backed active pages and
2062 * give them one more trip around the active list. So
2063 * that executable code get better chances to stay in
2064 * memory under moderate memory pressure. Anon pages
2065 * are not likely to be evicted by use-once streaming
2066 * IO, plus JVM can create lots of anon VM_EXEC pages,
2067 * so we ignore them here.
2069 if ((vm_flags
& VM_EXEC
) && page_is_file_lru(page
)) {
2070 nr_rotated
+= hpage_nr_pages(page
);
2071 list_add(&page
->lru
, &l_active
);
2076 ClearPageActive(page
); /* we are de-activating */
2077 SetPageWorkingset(page
);
2078 list_add(&page
->lru
, &l_inactive
);
2082 * Move pages back to the lru list.
2084 spin_lock_irq(&pgdat
->lru_lock
);
2086 nr_activate
= move_pages_to_lru(lruvec
, &l_active
);
2087 nr_deactivate
= move_pages_to_lru(lruvec
, &l_inactive
);
2088 /* Keep all free pages in l_active list */
2089 list_splice(&l_inactive
, &l_active
);
2091 __count_vm_events(PGDEACTIVATE
, nr_deactivate
);
2092 __count_memcg_events(lruvec_memcg(lruvec
), PGDEACTIVATE
, nr_deactivate
);
2094 __mod_node_page_state(pgdat
, NR_ISOLATED_ANON
+ file
, -nr_taken
);
2095 spin_unlock_irq(&pgdat
->lru_lock
);
2097 mem_cgroup_uncharge_list(&l_active
);
2098 free_unref_page_list(&l_active
);
2099 trace_mm_vmscan_lru_shrink_active(pgdat
->node_id
, nr_taken
, nr_activate
,
2100 nr_deactivate
, nr_rotated
, sc
->priority
, file
);
2103 unsigned long reclaim_pages(struct list_head
*page_list
)
2105 int nid
= NUMA_NO_NODE
;
2106 unsigned int nr_reclaimed
= 0;
2107 LIST_HEAD(node_page_list
);
2108 struct reclaim_stat dummy_stat
;
2110 struct scan_control sc
= {
2111 .gfp_mask
= GFP_KERNEL
,
2112 .priority
= DEF_PRIORITY
,
2118 while (!list_empty(page_list
)) {
2119 page
= lru_to_page(page_list
);
2120 if (nid
== NUMA_NO_NODE
) {
2121 nid
= page_to_nid(page
);
2122 INIT_LIST_HEAD(&node_page_list
);
2125 if (nid
== page_to_nid(page
)) {
2126 ClearPageActive(page
);
2127 list_move(&page
->lru
, &node_page_list
);
2131 nr_reclaimed
+= shrink_page_list(&node_page_list
,
2134 &dummy_stat
, false);
2135 while (!list_empty(&node_page_list
)) {
2136 page
= lru_to_page(&node_page_list
);
2137 list_del(&page
->lru
);
2138 putback_lru_page(page
);
2144 if (!list_empty(&node_page_list
)) {
2145 nr_reclaimed
+= shrink_page_list(&node_page_list
,
2148 &dummy_stat
, false);
2149 while (!list_empty(&node_page_list
)) {
2150 page
= lru_to_page(&node_page_list
);
2151 list_del(&page
->lru
);
2152 putback_lru_page(page
);
2156 return nr_reclaimed
;
2159 static unsigned long shrink_list(enum lru_list lru
, unsigned long nr_to_scan
,
2160 struct lruvec
*lruvec
, struct scan_control
*sc
)
2162 if (is_active_lru(lru
)) {
2163 if (sc
->may_deactivate
& (1 << is_file_lru(lru
)))
2164 shrink_active_list(nr_to_scan
, lruvec
, sc
, lru
);
2166 sc
->skipped_deactivate
= 1;
2170 return shrink_inactive_list(nr_to_scan
, lruvec
, sc
, lru
);
2174 * The inactive anon list should be small enough that the VM never has
2175 * to do too much work.
2177 * The inactive file list should be small enough to leave most memory
2178 * to the established workingset on the scan-resistant active list,
2179 * but large enough to avoid thrashing the aggregate readahead window.
2181 * Both inactive lists should also be large enough that each inactive
2182 * page has a chance to be referenced again before it is reclaimed.
2184 * If that fails and refaulting is observed, the inactive list grows.
2186 * The inactive_ratio is the target ratio of ACTIVE to INACTIVE pages
2187 * on this LRU, maintained by the pageout code. An inactive_ratio
2188 * of 3 means 3:1 or 25% of the pages are kept on the inactive list.
2191 * memory ratio inactive
2192 * -------------------------------------
2201 static bool inactive_is_low(struct lruvec
*lruvec
, enum lru_list inactive_lru
)
2203 enum lru_list active_lru
= inactive_lru
+ LRU_ACTIVE
;
2204 unsigned long inactive
, active
;
2205 unsigned long inactive_ratio
;
2208 inactive
= lruvec_page_state(lruvec
, NR_LRU_BASE
+ inactive_lru
);
2209 active
= lruvec_page_state(lruvec
, NR_LRU_BASE
+ active_lru
);
2211 gb
= (inactive
+ active
) >> (30 - PAGE_SHIFT
);
2213 inactive_ratio
= int_sqrt(10 * gb
);
2217 return inactive
* inactive_ratio
< active
;
2228 * Determine how aggressively the anon and file LRU lists should be
2229 * scanned. The relative value of each set of LRU lists is determined
2230 * by looking at the fraction of the pages scanned we did rotate back
2231 * onto the active list instead of evict.
2233 * nr[0] = anon inactive pages to scan; nr[1] = anon active pages to scan
2234 * nr[2] = file inactive pages to scan; nr[3] = file active pages to scan
2236 static void get_scan_count(struct lruvec
*lruvec
, struct scan_control
*sc
,
2239 struct mem_cgroup
*memcg
= lruvec_memcg(lruvec
);
2240 unsigned long anon_cost
, file_cost
, total_cost
;
2241 int swappiness
= mem_cgroup_swappiness(memcg
);
2243 u64 denominator
= 0; /* gcc */
2244 enum scan_balance scan_balance
;
2245 unsigned long ap
, fp
;
2248 /* If we have no swap space, do not bother scanning anon pages. */
2249 if (!sc
->may_swap
|| mem_cgroup_get_nr_swap_pages(memcg
) <= 0) {
2250 scan_balance
= SCAN_FILE
;
2255 * Global reclaim will swap to prevent OOM even with no
2256 * swappiness, but memcg users want to use this knob to
2257 * disable swapping for individual groups completely when
2258 * using the memory controller's swap limit feature would be
2261 if (cgroup_reclaim(sc
) && !swappiness
) {
2262 scan_balance
= SCAN_FILE
;
2267 * Do not apply any pressure balancing cleverness when the
2268 * system is close to OOM, scan both anon and file equally
2269 * (unless the swappiness setting disagrees with swapping).
2271 if (!sc
->priority
&& swappiness
) {
2272 scan_balance
= SCAN_EQUAL
;
2277 * If the system is almost out of file pages, force-scan anon.
2279 if (sc
->file_is_tiny
) {
2280 scan_balance
= SCAN_ANON
;
2285 * If there is enough inactive page cache, we do not reclaim
2286 * anything from the anonymous working right now.
2288 if (sc
->cache_trim_mode
) {
2289 scan_balance
= SCAN_FILE
;
2293 scan_balance
= SCAN_FRACT
;
2295 * Calculate the pressure balance between anon and file pages.
2297 * The amount of pressure we put on each LRU is inversely
2298 * proportional to the cost of reclaiming each list, as
2299 * determined by the share of pages that are refaulting, times
2300 * the relative IO cost of bringing back a swapped out
2301 * anonymous page vs reloading a filesystem page (swappiness).
2303 * Although we limit that influence to ensure no list gets
2304 * left behind completely: at least a third of the pressure is
2305 * applied, before swappiness.
2307 * With swappiness at 100, anon and file have equal IO cost.
2309 total_cost
= sc
->anon_cost
+ sc
->file_cost
;
2310 anon_cost
= total_cost
+ sc
->anon_cost
;
2311 file_cost
= total_cost
+ sc
->file_cost
;
2312 total_cost
= anon_cost
+ file_cost
;
2314 ap
= swappiness
* (total_cost
+ 1);
2315 ap
/= anon_cost
+ 1;
2317 fp
= (200 - swappiness
) * (total_cost
+ 1);
2318 fp
/= file_cost
+ 1;
2322 denominator
= ap
+ fp
;
2324 for_each_evictable_lru(lru
) {
2325 int file
= is_file_lru(lru
);
2326 unsigned long lruvec_size
;
2328 unsigned long protection
;
2330 lruvec_size
= lruvec_lru_size(lruvec
, lru
, sc
->reclaim_idx
);
2331 protection
= mem_cgroup_protection(memcg
,
2332 sc
->memcg_low_reclaim
);
2336 * Scale a cgroup's reclaim pressure by proportioning
2337 * its current usage to its memory.low or memory.min
2340 * This is important, as otherwise scanning aggression
2341 * becomes extremely binary -- from nothing as we
2342 * approach the memory protection threshold, to totally
2343 * nominal as we exceed it. This results in requiring
2344 * setting extremely liberal protection thresholds. It
2345 * also means we simply get no protection at all if we
2346 * set it too low, which is not ideal.
2348 * If there is any protection in place, we reduce scan
2349 * pressure by how much of the total memory used is
2350 * within protection thresholds.
2352 * There is one special case: in the first reclaim pass,
2353 * we skip over all groups that are within their low
2354 * protection. If that fails to reclaim enough pages to
2355 * satisfy the reclaim goal, we come back and override
2356 * the best-effort low protection. However, we still
2357 * ideally want to honor how well-behaved groups are in
2358 * that case instead of simply punishing them all
2359 * equally. As such, we reclaim them based on how much
2360 * memory they are using, reducing the scan pressure
2361 * again by how much of the total memory used is under
2364 unsigned long cgroup_size
= mem_cgroup_size(memcg
);
2366 /* Avoid TOCTOU with earlier protection check */
2367 cgroup_size
= max(cgroup_size
, protection
);
2369 scan
= lruvec_size
- lruvec_size
* protection
/
2373 * Minimally target SWAP_CLUSTER_MAX pages to keep
2374 * reclaim moving forwards, avoiding decrementing
2375 * sc->priority further than desirable.
2377 scan
= max(scan
, SWAP_CLUSTER_MAX
);
2382 scan
>>= sc
->priority
;
2385 * If the cgroup's already been deleted, make sure to
2386 * scrape out the remaining cache.
2388 if (!scan
&& !mem_cgroup_online(memcg
))
2389 scan
= min(lruvec_size
, SWAP_CLUSTER_MAX
);
2391 switch (scan_balance
) {
2393 /* Scan lists relative to size */
2397 * Scan types proportional to swappiness and
2398 * their relative recent reclaim efficiency.
2399 * Make sure we don't miss the last page on
2400 * the offlined memory cgroups because of a
2403 scan
= mem_cgroup_online(memcg
) ?
2404 div64_u64(scan
* fraction
[file
], denominator
) :
2405 DIV64_U64_ROUND_UP(scan
* fraction
[file
],
2410 /* Scan one type exclusively */
2411 if ((scan_balance
== SCAN_FILE
) != file
)
2415 /* Look ma, no brain */
2423 static void shrink_lruvec(struct lruvec
*lruvec
, struct scan_control
*sc
)
2425 unsigned long nr
[NR_LRU_LISTS
];
2426 unsigned long targets
[NR_LRU_LISTS
];
2427 unsigned long nr_to_scan
;
2429 unsigned long nr_reclaimed
= 0;
2430 unsigned long nr_to_reclaim
= sc
->nr_to_reclaim
;
2431 struct blk_plug plug
;
2434 get_scan_count(lruvec
, sc
, nr
);
2436 /* Record the original scan target for proportional adjustments later */
2437 memcpy(targets
, nr
, sizeof(nr
));
2440 * Global reclaiming within direct reclaim at DEF_PRIORITY is a normal
2441 * event that can occur when there is little memory pressure e.g.
2442 * multiple streaming readers/writers. Hence, we do not abort scanning
2443 * when the requested number of pages are reclaimed when scanning at
2444 * DEF_PRIORITY on the assumption that the fact we are direct
2445 * reclaiming implies that kswapd is not keeping up and it is best to
2446 * do a batch of work at once. For memcg reclaim one check is made to
2447 * abort proportional reclaim if either the file or anon lru has already
2448 * dropped to zero at the first pass.
2450 scan_adjusted
= (!cgroup_reclaim(sc
) && !current_is_kswapd() &&
2451 sc
->priority
== DEF_PRIORITY
);
2453 blk_start_plug(&plug
);
2454 while (nr
[LRU_INACTIVE_ANON
] || nr
[LRU_ACTIVE_FILE
] ||
2455 nr
[LRU_INACTIVE_FILE
]) {
2456 unsigned long nr_anon
, nr_file
, percentage
;
2457 unsigned long nr_scanned
;
2459 for_each_evictable_lru(lru
) {
2461 nr_to_scan
= min(nr
[lru
], SWAP_CLUSTER_MAX
);
2462 nr
[lru
] -= nr_to_scan
;
2464 nr_reclaimed
+= shrink_list(lru
, nr_to_scan
,
2471 if (nr_reclaimed
< nr_to_reclaim
|| scan_adjusted
)
2475 * For kswapd and memcg, reclaim at least the number of pages
2476 * requested. Ensure that the anon and file LRUs are scanned
2477 * proportionally what was requested by get_scan_count(). We
2478 * stop reclaiming one LRU and reduce the amount scanning
2479 * proportional to the original scan target.
2481 nr_file
= nr
[LRU_INACTIVE_FILE
] + nr
[LRU_ACTIVE_FILE
];
2482 nr_anon
= nr
[LRU_INACTIVE_ANON
] + nr
[LRU_ACTIVE_ANON
];
2485 * It's just vindictive to attack the larger once the smaller
2486 * has gone to zero. And given the way we stop scanning the
2487 * smaller below, this makes sure that we only make one nudge
2488 * towards proportionality once we've got nr_to_reclaim.
2490 if (!nr_file
|| !nr_anon
)
2493 if (nr_file
> nr_anon
) {
2494 unsigned long scan_target
= targets
[LRU_INACTIVE_ANON
] +
2495 targets
[LRU_ACTIVE_ANON
] + 1;
2497 percentage
= nr_anon
* 100 / scan_target
;
2499 unsigned long scan_target
= targets
[LRU_INACTIVE_FILE
] +
2500 targets
[LRU_ACTIVE_FILE
] + 1;
2502 percentage
= nr_file
* 100 / scan_target
;
2505 /* Stop scanning the smaller of the LRU */
2507 nr
[lru
+ LRU_ACTIVE
] = 0;
2510 * Recalculate the other LRU scan count based on its original
2511 * scan target and the percentage scanning already complete
2513 lru
= (lru
== LRU_FILE
) ? LRU_BASE
: LRU_FILE
;
2514 nr_scanned
= targets
[lru
] - nr
[lru
];
2515 nr
[lru
] = targets
[lru
] * (100 - percentage
) / 100;
2516 nr
[lru
] -= min(nr
[lru
], nr_scanned
);
2519 nr_scanned
= targets
[lru
] - nr
[lru
];
2520 nr
[lru
] = targets
[lru
] * (100 - percentage
) / 100;
2521 nr
[lru
] -= min(nr
[lru
], nr_scanned
);
2523 scan_adjusted
= true;
2525 blk_finish_plug(&plug
);
2526 sc
->nr_reclaimed
+= nr_reclaimed
;
2529 * Even if we did not try to evict anon pages at all, we want to
2530 * rebalance the anon lru active/inactive ratio.
2532 if (total_swap_pages
&& inactive_is_low(lruvec
, LRU_INACTIVE_ANON
))
2533 shrink_active_list(SWAP_CLUSTER_MAX
, lruvec
,
2534 sc
, LRU_ACTIVE_ANON
);
2537 /* Use reclaim/compaction for costly allocs or under memory pressure */
2538 static bool in_reclaim_compaction(struct scan_control
*sc
)
2540 if (IS_ENABLED(CONFIG_COMPACTION
) && sc
->order
&&
2541 (sc
->order
> PAGE_ALLOC_COSTLY_ORDER
||
2542 sc
->priority
< DEF_PRIORITY
- 2))
2549 * Reclaim/compaction is used for high-order allocation requests. It reclaims
2550 * order-0 pages before compacting the zone. should_continue_reclaim() returns
2551 * true if more pages should be reclaimed such that when the page allocator
2552 * calls try_to_compact_pages() that it will have enough free pages to succeed.
2553 * It will give up earlier than that if there is difficulty reclaiming pages.
2555 static inline bool should_continue_reclaim(struct pglist_data
*pgdat
,
2556 unsigned long nr_reclaimed
,
2557 struct scan_control
*sc
)
2559 unsigned long pages_for_compaction
;
2560 unsigned long inactive_lru_pages
;
2563 /* If not in reclaim/compaction mode, stop */
2564 if (!in_reclaim_compaction(sc
))
2568 * Stop if we failed to reclaim any pages from the last SWAP_CLUSTER_MAX
2569 * number of pages that were scanned. This will return to the caller
2570 * with the risk reclaim/compaction and the resulting allocation attempt
2571 * fails. In the past we have tried harder for __GFP_RETRY_MAYFAIL
2572 * allocations through requiring that the full LRU list has been scanned
2573 * first, by assuming that zero delta of sc->nr_scanned means full LRU
2574 * scan, but that approximation was wrong, and there were corner cases
2575 * where always a non-zero amount of pages were scanned.
2580 /* If compaction would go ahead or the allocation would succeed, stop */
2581 for (z
= 0; z
<= sc
->reclaim_idx
; z
++) {
2582 struct zone
*zone
= &pgdat
->node_zones
[z
];
2583 if (!managed_zone(zone
))
2586 switch (compaction_suitable(zone
, sc
->order
, 0, sc
->reclaim_idx
)) {
2587 case COMPACT_SUCCESS
:
2588 case COMPACT_CONTINUE
:
2591 /* check next zone */
2597 * If we have not reclaimed enough pages for compaction and the
2598 * inactive lists are large enough, continue reclaiming
2600 pages_for_compaction
= compact_gap(sc
->order
);
2601 inactive_lru_pages
= node_page_state(pgdat
, NR_INACTIVE_FILE
);
2602 if (get_nr_swap_pages() > 0)
2603 inactive_lru_pages
+= node_page_state(pgdat
, NR_INACTIVE_ANON
);
2605 return inactive_lru_pages
> pages_for_compaction
;
2608 static void shrink_node_memcgs(pg_data_t
*pgdat
, struct scan_control
*sc
)
2610 struct mem_cgroup
*target_memcg
= sc
->target_mem_cgroup
;
2611 struct mem_cgroup
*memcg
;
2613 memcg
= mem_cgroup_iter(target_memcg
, NULL
, NULL
);
2615 struct lruvec
*lruvec
= mem_cgroup_lruvec(memcg
, pgdat
);
2616 unsigned long reclaimed
;
2617 unsigned long scanned
;
2619 switch (mem_cgroup_protected(target_memcg
, memcg
)) {
2620 case MEMCG_PROT_MIN
:
2623 * If there is no reclaimable memory, OOM.
2626 case MEMCG_PROT_LOW
:
2629 * Respect the protection only as long as
2630 * there is an unprotected supply
2631 * of reclaimable memory from other cgroups.
2633 if (!sc
->memcg_low_reclaim
) {
2634 sc
->memcg_low_skipped
= 1;
2637 memcg_memory_event(memcg
, MEMCG_LOW
);
2639 case MEMCG_PROT_NONE
:
2641 * All protection thresholds breached. We may
2642 * still choose to vary the scan pressure
2643 * applied based on by how much the cgroup in
2644 * question has exceeded its protection
2645 * thresholds (see get_scan_count).
2650 reclaimed
= sc
->nr_reclaimed
;
2651 scanned
= sc
->nr_scanned
;
2653 shrink_lruvec(lruvec
, sc
);
2655 shrink_slab(sc
->gfp_mask
, pgdat
->node_id
, memcg
,
2658 /* Record the group's reclaim efficiency */
2659 vmpressure(sc
->gfp_mask
, memcg
, false,
2660 sc
->nr_scanned
- scanned
,
2661 sc
->nr_reclaimed
- reclaimed
);
2663 } while ((memcg
= mem_cgroup_iter(target_memcg
, memcg
, NULL
)));
2666 static void shrink_node(pg_data_t
*pgdat
, struct scan_control
*sc
)
2668 struct reclaim_state
*reclaim_state
= current
->reclaim_state
;
2669 unsigned long nr_reclaimed
, nr_scanned
;
2670 struct lruvec
*target_lruvec
;
2671 bool reclaimable
= false;
2674 target_lruvec
= mem_cgroup_lruvec(sc
->target_mem_cgroup
, pgdat
);
2677 memset(&sc
->nr
, 0, sizeof(sc
->nr
));
2679 nr_reclaimed
= sc
->nr_reclaimed
;
2680 nr_scanned
= sc
->nr_scanned
;
2683 * Determine the scan balance between anon and file LRUs.
2685 spin_lock_irq(&pgdat
->lru_lock
);
2686 sc
->anon_cost
= target_lruvec
->anon_cost
;
2687 sc
->file_cost
= target_lruvec
->file_cost
;
2688 spin_unlock_irq(&pgdat
->lru_lock
);
2691 * Target desirable inactive:active list ratios for the anon
2692 * and file LRU lists.
2694 if (!sc
->force_deactivate
) {
2695 unsigned long refaults
;
2697 if (inactive_is_low(target_lruvec
, LRU_INACTIVE_ANON
))
2698 sc
->may_deactivate
|= DEACTIVATE_ANON
;
2700 sc
->may_deactivate
&= ~DEACTIVATE_ANON
;
2703 * When refaults are being observed, it means a new
2704 * workingset is being established. Deactivate to get
2705 * rid of any stale active pages quickly.
2707 refaults
= lruvec_page_state(target_lruvec
,
2708 WORKINGSET_ACTIVATE
);
2709 if (refaults
!= target_lruvec
->refaults
||
2710 inactive_is_low(target_lruvec
, LRU_INACTIVE_FILE
))
2711 sc
->may_deactivate
|= DEACTIVATE_FILE
;
2713 sc
->may_deactivate
&= ~DEACTIVATE_FILE
;
2715 sc
->may_deactivate
= DEACTIVATE_ANON
| DEACTIVATE_FILE
;
2718 * If we have plenty of inactive file pages that aren't
2719 * thrashing, try to reclaim those first before touching
2722 file
= lruvec_page_state(target_lruvec
, NR_INACTIVE_FILE
);
2723 if (file
>> sc
->priority
&& !(sc
->may_deactivate
& DEACTIVATE_FILE
))
2724 sc
->cache_trim_mode
= 1;
2726 sc
->cache_trim_mode
= 0;
2729 * Prevent the reclaimer from falling into the cache trap: as
2730 * cache pages start out inactive, every cache fault will tip
2731 * the scan balance towards the file LRU. And as the file LRU
2732 * shrinks, so does the window for rotation from references.
2733 * This means we have a runaway feedback loop where a tiny
2734 * thrashing file LRU becomes infinitely more attractive than
2735 * anon pages. Try to detect this based on file LRU size.
2737 if (!cgroup_reclaim(sc
)) {
2738 unsigned long total_high_wmark
= 0;
2739 unsigned long free
, anon
;
2742 free
= sum_zone_node_page_state(pgdat
->node_id
, NR_FREE_PAGES
);
2743 file
= node_page_state(pgdat
, NR_ACTIVE_FILE
) +
2744 node_page_state(pgdat
, NR_INACTIVE_FILE
);
2746 for (z
= 0; z
< MAX_NR_ZONES
; z
++) {
2747 struct zone
*zone
= &pgdat
->node_zones
[z
];
2748 if (!managed_zone(zone
))
2751 total_high_wmark
+= high_wmark_pages(zone
);
2755 * Consider anon: if that's low too, this isn't a
2756 * runaway file reclaim problem, but rather just
2757 * extreme pressure. Reclaim as per usual then.
2759 anon
= node_page_state(pgdat
, NR_INACTIVE_ANON
);
2762 file
+ free
<= total_high_wmark
&&
2763 !(sc
->may_deactivate
& DEACTIVATE_ANON
) &&
2764 anon
>> sc
->priority
;
2767 shrink_node_memcgs(pgdat
, sc
);
2769 if (reclaim_state
) {
2770 sc
->nr_reclaimed
+= reclaim_state
->reclaimed_slab
;
2771 reclaim_state
->reclaimed_slab
= 0;
2774 /* Record the subtree's reclaim efficiency */
2775 vmpressure(sc
->gfp_mask
, sc
->target_mem_cgroup
, true,
2776 sc
->nr_scanned
- nr_scanned
,
2777 sc
->nr_reclaimed
- nr_reclaimed
);
2779 if (sc
->nr_reclaimed
- nr_reclaimed
)
2782 if (current_is_kswapd()) {
2784 * If reclaim is isolating dirty pages under writeback,
2785 * it implies that the long-lived page allocation rate
2786 * is exceeding the page laundering rate. Either the
2787 * global limits are not being effective at throttling
2788 * processes due to the page distribution throughout
2789 * zones or there is heavy usage of a slow backing
2790 * device. The only option is to throttle from reclaim
2791 * context which is not ideal as there is no guarantee
2792 * the dirtying process is throttled in the same way
2793 * balance_dirty_pages() manages.
2795 * Once a node is flagged PGDAT_WRITEBACK, kswapd will
2796 * count the number of pages under pages flagged for
2797 * immediate reclaim and stall if any are encountered
2798 * in the nr_immediate check below.
2800 if (sc
->nr
.writeback
&& sc
->nr
.writeback
== sc
->nr
.taken
)
2801 set_bit(PGDAT_WRITEBACK
, &pgdat
->flags
);
2803 /* Allow kswapd to start writing pages during reclaim.*/
2804 if (sc
->nr
.unqueued_dirty
== sc
->nr
.file_taken
)
2805 set_bit(PGDAT_DIRTY
, &pgdat
->flags
);
2808 * If kswapd scans pages marked marked for immediate
2809 * reclaim and under writeback (nr_immediate), it
2810 * implies that pages are cycling through the LRU
2811 * faster than they are written so also forcibly stall.
2813 if (sc
->nr
.immediate
)
2814 congestion_wait(BLK_RW_ASYNC
, HZ
/10);
2818 * Tag a node/memcg as congested if all the dirty pages
2819 * scanned were backed by a congested BDI and
2820 * wait_iff_congested will stall.
2822 * Legacy memcg will stall in page writeback so avoid forcibly
2823 * stalling in wait_iff_congested().
2825 if ((current_is_kswapd() ||
2826 (cgroup_reclaim(sc
) && writeback_throttling_sane(sc
))) &&
2827 sc
->nr
.dirty
&& sc
->nr
.dirty
== sc
->nr
.congested
)
2828 set_bit(LRUVEC_CONGESTED
, &target_lruvec
->flags
);
2831 * Stall direct reclaim for IO completions if underlying BDIs
2832 * and node is congested. Allow kswapd to continue until it
2833 * starts encountering unqueued dirty pages or cycling through
2834 * the LRU too quickly.
2836 if (!current_is_kswapd() && current_may_throttle() &&
2837 !sc
->hibernation_mode
&&
2838 test_bit(LRUVEC_CONGESTED
, &target_lruvec
->flags
))
2839 wait_iff_congested(BLK_RW_ASYNC
, HZ
/10);
2841 if (should_continue_reclaim(pgdat
, sc
->nr_reclaimed
- nr_reclaimed
,
2846 * Kswapd gives up on balancing particular nodes after too
2847 * many failures to reclaim anything from them and goes to
2848 * sleep. On reclaim progress, reset the failure counter. A
2849 * successful direct reclaim run will revive a dormant kswapd.
2852 pgdat
->kswapd_failures
= 0;
2856 * Returns true if compaction should go ahead for a costly-order request, or
2857 * the allocation would already succeed without compaction. Return false if we
2858 * should reclaim first.
2860 static inline bool compaction_ready(struct zone
*zone
, struct scan_control
*sc
)
2862 unsigned long watermark
;
2863 enum compact_result suitable
;
2865 suitable
= compaction_suitable(zone
, sc
->order
, 0, sc
->reclaim_idx
);
2866 if (suitable
== COMPACT_SUCCESS
)
2867 /* Allocation should succeed already. Don't reclaim. */
2869 if (suitable
== COMPACT_SKIPPED
)
2870 /* Compaction cannot yet proceed. Do reclaim. */
2874 * Compaction is already possible, but it takes time to run and there
2875 * are potentially other callers using the pages just freed. So proceed
2876 * with reclaim to make a buffer of free pages available to give
2877 * compaction a reasonable chance of completing and allocating the page.
2878 * Note that we won't actually reclaim the whole buffer in one attempt
2879 * as the target watermark in should_continue_reclaim() is lower. But if
2880 * we are already above the high+gap watermark, don't reclaim at all.
2882 watermark
= high_wmark_pages(zone
) + compact_gap(sc
->order
);
2884 return zone_watermark_ok_safe(zone
, 0, watermark
, sc
->reclaim_idx
);
2888 * This is the direct reclaim path, for page-allocating processes. We only
2889 * try to reclaim pages from zones which will satisfy the caller's allocation
2892 * If a zone is deemed to be full of pinned pages then just give it a light
2893 * scan then give up on it.
2895 static void shrink_zones(struct zonelist
*zonelist
, struct scan_control
*sc
)
2899 unsigned long nr_soft_reclaimed
;
2900 unsigned long nr_soft_scanned
;
2902 pg_data_t
*last_pgdat
= NULL
;
2905 * If the number of buffer_heads in the machine exceeds the maximum
2906 * allowed level, force direct reclaim to scan the highmem zone as
2907 * highmem pages could be pinning lowmem pages storing buffer_heads
2909 orig_mask
= sc
->gfp_mask
;
2910 if (buffer_heads_over_limit
) {
2911 sc
->gfp_mask
|= __GFP_HIGHMEM
;
2912 sc
->reclaim_idx
= gfp_zone(sc
->gfp_mask
);
2915 for_each_zone_zonelist_nodemask(zone
, z
, zonelist
,
2916 sc
->reclaim_idx
, sc
->nodemask
) {
2918 * Take care memory controller reclaiming has small influence
2921 if (!cgroup_reclaim(sc
)) {
2922 if (!cpuset_zone_allowed(zone
,
2923 GFP_KERNEL
| __GFP_HARDWALL
))
2927 * If we already have plenty of memory free for
2928 * compaction in this zone, don't free any more.
2929 * Even though compaction is invoked for any
2930 * non-zero order, only frequent costly order
2931 * reclamation is disruptive enough to become a
2932 * noticeable problem, like transparent huge
2935 if (IS_ENABLED(CONFIG_COMPACTION
) &&
2936 sc
->order
> PAGE_ALLOC_COSTLY_ORDER
&&
2937 compaction_ready(zone
, sc
)) {
2938 sc
->compaction_ready
= true;
2943 * Shrink each node in the zonelist once. If the
2944 * zonelist is ordered by zone (not the default) then a
2945 * node may be shrunk multiple times but in that case
2946 * the user prefers lower zones being preserved.
2948 if (zone
->zone_pgdat
== last_pgdat
)
2952 * This steals pages from memory cgroups over softlimit
2953 * and returns the number of reclaimed pages and
2954 * scanned pages. This works for global memory pressure
2955 * and balancing, not for a memcg's limit.
2957 nr_soft_scanned
= 0;
2958 nr_soft_reclaimed
= mem_cgroup_soft_limit_reclaim(zone
->zone_pgdat
,
2959 sc
->order
, sc
->gfp_mask
,
2961 sc
->nr_reclaimed
+= nr_soft_reclaimed
;
2962 sc
->nr_scanned
+= nr_soft_scanned
;
2963 /* need some check for avoid more shrink_zone() */
2966 /* See comment about same check for global reclaim above */
2967 if (zone
->zone_pgdat
== last_pgdat
)
2969 last_pgdat
= zone
->zone_pgdat
;
2970 shrink_node(zone
->zone_pgdat
, sc
);
2974 * Restore to original mask to avoid the impact on the caller if we
2975 * promoted it to __GFP_HIGHMEM.
2977 sc
->gfp_mask
= orig_mask
;
2980 static void snapshot_refaults(struct mem_cgroup
*target_memcg
, pg_data_t
*pgdat
)
2982 struct lruvec
*target_lruvec
;
2983 unsigned long refaults
;
2985 target_lruvec
= mem_cgroup_lruvec(target_memcg
, pgdat
);
2986 refaults
= lruvec_page_state(target_lruvec
, WORKINGSET_ACTIVATE
);
2987 target_lruvec
->refaults
= refaults
;
2991 * This is the main entry point to direct page reclaim.
2993 * If a full scan of the inactive list fails to free enough memory then we
2994 * are "out of memory" and something needs to be killed.
2996 * If the caller is !__GFP_FS then the probability of a failure is reasonably
2997 * high - the zone may be full of dirty or under-writeback pages, which this
2998 * caller can't do much about. We kick the writeback threads and take explicit
2999 * naps in the hope that some of these pages can be written. But if the
3000 * allocating task holds filesystem locks which prevent writeout this might not
3001 * work, and the allocation attempt will fail.
3003 * returns: 0, if no pages reclaimed
3004 * else, the number of pages reclaimed
3006 static unsigned long do_try_to_free_pages(struct zonelist
*zonelist
,
3007 struct scan_control
*sc
)
3009 int initial_priority
= sc
->priority
;
3010 pg_data_t
*last_pgdat
;
3014 delayacct_freepages_start();
3016 if (!cgroup_reclaim(sc
))
3017 __count_zid_vm_events(ALLOCSTALL
, sc
->reclaim_idx
, 1);
3020 vmpressure_prio(sc
->gfp_mask
, sc
->target_mem_cgroup
,
3023 shrink_zones(zonelist
, sc
);
3025 if (sc
->nr_reclaimed
>= sc
->nr_to_reclaim
)
3028 if (sc
->compaction_ready
)
3032 * If we're getting trouble reclaiming, start doing
3033 * writepage even in laptop mode.
3035 if (sc
->priority
< DEF_PRIORITY
- 2)
3036 sc
->may_writepage
= 1;
3037 } while (--sc
->priority
>= 0);
3040 for_each_zone_zonelist_nodemask(zone
, z
, zonelist
, sc
->reclaim_idx
,
3042 if (zone
->zone_pgdat
== last_pgdat
)
3044 last_pgdat
= zone
->zone_pgdat
;
3046 snapshot_refaults(sc
->target_mem_cgroup
, zone
->zone_pgdat
);
3048 if (cgroup_reclaim(sc
)) {
3049 struct lruvec
*lruvec
;
3051 lruvec
= mem_cgroup_lruvec(sc
->target_mem_cgroup
,
3053 clear_bit(LRUVEC_CONGESTED
, &lruvec
->flags
);
3057 delayacct_freepages_end();
3059 if (sc
->nr_reclaimed
)
3060 return sc
->nr_reclaimed
;
3062 /* Aborted reclaim to try compaction? don't OOM, then */
3063 if (sc
->compaction_ready
)
3067 * We make inactive:active ratio decisions based on the node's
3068 * composition of memory, but a restrictive reclaim_idx or a
3069 * memory.low cgroup setting can exempt large amounts of
3070 * memory from reclaim. Neither of which are very common, so
3071 * instead of doing costly eligibility calculations of the
3072 * entire cgroup subtree up front, we assume the estimates are
3073 * good, and retry with forcible deactivation if that fails.
3075 if (sc
->skipped_deactivate
) {
3076 sc
->priority
= initial_priority
;
3077 sc
->force_deactivate
= 1;
3078 sc
->skipped_deactivate
= 0;
3082 /* Untapped cgroup reserves? Don't OOM, retry. */
3083 if (sc
->memcg_low_skipped
) {
3084 sc
->priority
= initial_priority
;
3085 sc
->force_deactivate
= 0;
3086 sc
->memcg_low_reclaim
= 1;
3087 sc
->memcg_low_skipped
= 0;
3094 static bool allow_direct_reclaim(pg_data_t
*pgdat
)
3097 unsigned long pfmemalloc_reserve
= 0;
3098 unsigned long free_pages
= 0;
3102 if (pgdat
->kswapd_failures
>= MAX_RECLAIM_RETRIES
)
3105 for (i
= 0; i
<= ZONE_NORMAL
; i
++) {
3106 zone
= &pgdat
->node_zones
[i
];
3107 if (!managed_zone(zone
))
3110 if (!zone_reclaimable_pages(zone
))
3113 pfmemalloc_reserve
+= min_wmark_pages(zone
);
3114 free_pages
+= zone_page_state(zone
, NR_FREE_PAGES
);
3117 /* If there are no reserves (unexpected config) then do not throttle */
3118 if (!pfmemalloc_reserve
)
3121 wmark_ok
= free_pages
> pfmemalloc_reserve
/ 2;
3123 /* kswapd must be awake if processes are being throttled */
3124 if (!wmark_ok
&& waitqueue_active(&pgdat
->kswapd_wait
)) {
3125 if (READ_ONCE(pgdat
->kswapd_highest_zoneidx
) > ZONE_NORMAL
)
3126 WRITE_ONCE(pgdat
->kswapd_highest_zoneidx
, ZONE_NORMAL
);
3128 wake_up_interruptible(&pgdat
->kswapd_wait
);
3135 * Throttle direct reclaimers if backing storage is backed by the network
3136 * and the PFMEMALLOC reserve for the preferred node is getting dangerously
3137 * depleted. kswapd will continue to make progress and wake the processes
3138 * when the low watermark is reached.
3140 * Returns true if a fatal signal was delivered during throttling. If this
3141 * happens, the page allocator should not consider triggering the OOM killer.
3143 static bool throttle_direct_reclaim(gfp_t gfp_mask
, struct zonelist
*zonelist
,
3144 nodemask_t
*nodemask
)
3148 pg_data_t
*pgdat
= NULL
;
3151 * Kernel threads should not be throttled as they may be indirectly
3152 * responsible for cleaning pages necessary for reclaim to make forward
3153 * progress. kjournald for example may enter direct reclaim while
3154 * committing a transaction where throttling it could forcing other
3155 * processes to block on log_wait_commit().
3157 if (current
->flags
& PF_KTHREAD
)
3161 * If a fatal signal is pending, this process should not throttle.
3162 * It should return quickly so it can exit and free its memory
3164 if (fatal_signal_pending(current
))
3168 * Check if the pfmemalloc reserves are ok by finding the first node
3169 * with a usable ZONE_NORMAL or lower zone. The expectation is that
3170 * GFP_KERNEL will be required for allocating network buffers when
3171 * swapping over the network so ZONE_HIGHMEM is unusable.
3173 * Throttling is based on the first usable node and throttled processes
3174 * wait on a queue until kswapd makes progress and wakes them. There
3175 * is an affinity then between processes waking up and where reclaim
3176 * progress has been made assuming the process wakes on the same node.
3177 * More importantly, processes running on remote nodes will not compete
3178 * for remote pfmemalloc reserves and processes on different nodes
3179 * should make reasonable progress.
3181 for_each_zone_zonelist_nodemask(zone
, z
, zonelist
,
3182 gfp_zone(gfp_mask
), nodemask
) {
3183 if (zone_idx(zone
) > ZONE_NORMAL
)
3186 /* Throttle based on the first usable node */
3187 pgdat
= zone
->zone_pgdat
;
3188 if (allow_direct_reclaim(pgdat
))
3193 /* If no zone was usable by the allocation flags then do not throttle */
3197 /* Account for the throttling */
3198 count_vm_event(PGSCAN_DIRECT_THROTTLE
);
3201 * If the caller cannot enter the filesystem, it's possible that it
3202 * is due to the caller holding an FS lock or performing a journal
3203 * transaction in the case of a filesystem like ext[3|4]. In this case,
3204 * it is not safe to block on pfmemalloc_wait as kswapd could be
3205 * blocked waiting on the same lock. Instead, throttle for up to a
3206 * second before continuing.
3208 if (!(gfp_mask
& __GFP_FS
)) {
3209 wait_event_interruptible_timeout(pgdat
->pfmemalloc_wait
,
3210 allow_direct_reclaim(pgdat
), HZ
);
3215 /* Throttle until kswapd wakes the process */
3216 wait_event_killable(zone
->zone_pgdat
->pfmemalloc_wait
,
3217 allow_direct_reclaim(pgdat
));
3220 if (fatal_signal_pending(current
))
3227 unsigned long try_to_free_pages(struct zonelist
*zonelist
, int order
,
3228 gfp_t gfp_mask
, nodemask_t
*nodemask
)
3230 unsigned long nr_reclaimed
;
3231 struct scan_control sc
= {
3232 .nr_to_reclaim
= SWAP_CLUSTER_MAX
,
3233 .gfp_mask
= current_gfp_context(gfp_mask
),
3234 .reclaim_idx
= gfp_zone(gfp_mask
),
3236 .nodemask
= nodemask
,
3237 .priority
= DEF_PRIORITY
,
3238 .may_writepage
= !laptop_mode
,
3244 * scan_control uses s8 fields for order, priority, and reclaim_idx.
3245 * Confirm they are large enough for max values.
3247 BUILD_BUG_ON(MAX_ORDER
> S8_MAX
);
3248 BUILD_BUG_ON(DEF_PRIORITY
> S8_MAX
);
3249 BUILD_BUG_ON(MAX_NR_ZONES
> S8_MAX
);
3252 * Do not enter reclaim if fatal signal was delivered while throttled.
3253 * 1 is returned so that the page allocator does not OOM kill at this
3256 if (throttle_direct_reclaim(sc
.gfp_mask
, zonelist
, nodemask
))
3259 set_task_reclaim_state(current
, &sc
.reclaim_state
);
3260 trace_mm_vmscan_direct_reclaim_begin(order
, sc
.gfp_mask
);
3262 nr_reclaimed
= do_try_to_free_pages(zonelist
, &sc
);
3264 trace_mm_vmscan_direct_reclaim_end(nr_reclaimed
);
3265 set_task_reclaim_state(current
, NULL
);
3267 return nr_reclaimed
;
3272 /* Only used by soft limit reclaim. Do not reuse for anything else. */
3273 unsigned long mem_cgroup_shrink_node(struct mem_cgroup
*memcg
,
3274 gfp_t gfp_mask
, bool noswap
,
3276 unsigned long *nr_scanned
)
3278 struct lruvec
*lruvec
= mem_cgroup_lruvec(memcg
, pgdat
);
3279 struct scan_control sc
= {
3280 .nr_to_reclaim
= SWAP_CLUSTER_MAX
,
3281 .target_mem_cgroup
= memcg
,
3282 .may_writepage
= !laptop_mode
,
3284 .reclaim_idx
= MAX_NR_ZONES
- 1,
3285 .may_swap
= !noswap
,
3288 WARN_ON_ONCE(!current
->reclaim_state
);
3290 sc
.gfp_mask
= (gfp_mask
& GFP_RECLAIM_MASK
) |
3291 (GFP_HIGHUSER_MOVABLE
& ~GFP_RECLAIM_MASK
);
3293 trace_mm_vmscan_memcg_softlimit_reclaim_begin(sc
.order
,
3297 * NOTE: Although we can get the priority field, using it
3298 * here is not a good idea, since it limits the pages we can scan.
3299 * if we don't reclaim here, the shrink_node from balance_pgdat
3300 * will pick up pages from other mem cgroup's as well. We hack
3301 * the priority and make it zero.
3303 shrink_lruvec(lruvec
, &sc
);
3305 trace_mm_vmscan_memcg_softlimit_reclaim_end(sc
.nr_reclaimed
);
3307 *nr_scanned
= sc
.nr_scanned
;
3309 return sc
.nr_reclaimed
;
3312 unsigned long try_to_free_mem_cgroup_pages(struct mem_cgroup
*memcg
,
3313 unsigned long nr_pages
,
3317 unsigned long nr_reclaimed
;
3318 unsigned long pflags
;
3319 unsigned int noreclaim_flag
;
3320 struct scan_control sc
= {
3321 .nr_to_reclaim
= max(nr_pages
, SWAP_CLUSTER_MAX
),
3322 .gfp_mask
= (current_gfp_context(gfp_mask
) & GFP_RECLAIM_MASK
) |
3323 (GFP_HIGHUSER_MOVABLE
& ~GFP_RECLAIM_MASK
),
3324 .reclaim_idx
= MAX_NR_ZONES
- 1,
3325 .target_mem_cgroup
= memcg
,
3326 .priority
= DEF_PRIORITY
,
3327 .may_writepage
= !laptop_mode
,
3329 .may_swap
= may_swap
,
3332 * Traverse the ZONELIST_FALLBACK zonelist of the current node to put
3333 * equal pressure on all the nodes. This is based on the assumption that
3334 * the reclaim does not bail out early.
3336 struct zonelist
*zonelist
= node_zonelist(numa_node_id(), sc
.gfp_mask
);
3338 set_task_reclaim_state(current
, &sc
.reclaim_state
);
3340 trace_mm_vmscan_memcg_reclaim_begin(0, sc
.gfp_mask
);
3342 psi_memstall_enter(&pflags
);
3343 noreclaim_flag
= memalloc_noreclaim_save();
3345 nr_reclaimed
= do_try_to_free_pages(zonelist
, &sc
);
3347 memalloc_noreclaim_restore(noreclaim_flag
);
3348 psi_memstall_leave(&pflags
);
3350 trace_mm_vmscan_memcg_reclaim_end(nr_reclaimed
);
3351 set_task_reclaim_state(current
, NULL
);
3353 return nr_reclaimed
;
3357 static void age_active_anon(struct pglist_data
*pgdat
,
3358 struct scan_control
*sc
)
3360 struct mem_cgroup
*memcg
;
3361 struct lruvec
*lruvec
;
3363 if (!total_swap_pages
)
3366 lruvec
= mem_cgroup_lruvec(NULL
, pgdat
);
3367 if (!inactive_is_low(lruvec
, LRU_INACTIVE_ANON
))
3370 memcg
= mem_cgroup_iter(NULL
, NULL
, NULL
);
3372 lruvec
= mem_cgroup_lruvec(memcg
, pgdat
);
3373 shrink_active_list(SWAP_CLUSTER_MAX
, lruvec
,
3374 sc
, LRU_ACTIVE_ANON
);
3375 memcg
= mem_cgroup_iter(NULL
, memcg
, NULL
);
3379 static bool pgdat_watermark_boosted(pg_data_t
*pgdat
, int highest_zoneidx
)
3385 * Check for watermark boosts top-down as the higher zones
3386 * are more likely to be boosted. Both watermarks and boosts
3387 * should not be checked at the time time as reclaim would
3388 * start prematurely when there is no boosting and a lower
3391 for (i
= highest_zoneidx
; i
>= 0; i
--) {
3392 zone
= pgdat
->node_zones
+ i
;
3393 if (!managed_zone(zone
))
3396 if (zone
->watermark_boost
)
3404 * Returns true if there is an eligible zone balanced for the request order
3405 * and highest_zoneidx
3407 static bool pgdat_balanced(pg_data_t
*pgdat
, int order
, int highest_zoneidx
)
3410 unsigned long mark
= -1;
3414 * Check watermarks bottom-up as lower zones are more likely to
3417 for (i
= 0; i
<= highest_zoneidx
; i
++) {
3418 zone
= pgdat
->node_zones
+ i
;
3420 if (!managed_zone(zone
))
3423 mark
= high_wmark_pages(zone
);
3424 if (zone_watermark_ok_safe(zone
, order
, mark
, highest_zoneidx
))
3429 * If a node has no populated zone within highest_zoneidx, it does not
3430 * need balancing by definition. This can happen if a zone-restricted
3431 * allocation tries to wake a remote kswapd.
3439 /* Clear pgdat state for congested, dirty or under writeback. */
3440 static void clear_pgdat_congested(pg_data_t
*pgdat
)
3442 struct lruvec
*lruvec
= mem_cgroup_lruvec(NULL
, pgdat
);
3444 clear_bit(LRUVEC_CONGESTED
, &lruvec
->flags
);
3445 clear_bit(PGDAT_DIRTY
, &pgdat
->flags
);
3446 clear_bit(PGDAT_WRITEBACK
, &pgdat
->flags
);
3450 * Prepare kswapd for sleeping. This verifies that there are no processes
3451 * waiting in throttle_direct_reclaim() and that watermarks have been met.
3453 * Returns true if kswapd is ready to sleep
3455 static bool prepare_kswapd_sleep(pg_data_t
*pgdat
, int order
,
3456 int highest_zoneidx
)
3459 * The throttled processes are normally woken up in balance_pgdat() as
3460 * soon as allow_direct_reclaim() is true. But there is a potential
3461 * race between when kswapd checks the watermarks and a process gets
3462 * throttled. There is also a potential race if processes get
3463 * throttled, kswapd wakes, a large process exits thereby balancing the
3464 * zones, which causes kswapd to exit balance_pgdat() before reaching
3465 * the wake up checks. If kswapd is going to sleep, no process should
3466 * be sleeping on pfmemalloc_wait, so wake them now if necessary. If
3467 * the wake up is premature, processes will wake kswapd and get
3468 * throttled again. The difference from wake ups in balance_pgdat() is
3469 * that here we are under prepare_to_wait().
3471 if (waitqueue_active(&pgdat
->pfmemalloc_wait
))
3472 wake_up_all(&pgdat
->pfmemalloc_wait
);
3474 /* Hopeless node, leave it to direct reclaim */
3475 if (pgdat
->kswapd_failures
>= MAX_RECLAIM_RETRIES
)
3478 if (pgdat_balanced(pgdat
, order
, highest_zoneidx
)) {
3479 clear_pgdat_congested(pgdat
);
3487 * kswapd shrinks a node of pages that are at or below the highest usable
3488 * zone that is currently unbalanced.
3490 * Returns true if kswapd scanned at least the requested number of pages to
3491 * reclaim or if the lack of progress was due to pages under writeback.
3492 * This is used to determine if the scanning priority needs to be raised.
3494 static bool kswapd_shrink_node(pg_data_t
*pgdat
,
3495 struct scan_control
*sc
)
3500 /* Reclaim a number of pages proportional to the number of zones */
3501 sc
->nr_to_reclaim
= 0;
3502 for (z
= 0; z
<= sc
->reclaim_idx
; z
++) {
3503 zone
= pgdat
->node_zones
+ z
;
3504 if (!managed_zone(zone
))
3507 sc
->nr_to_reclaim
+= max(high_wmark_pages(zone
), SWAP_CLUSTER_MAX
);
3511 * Historically care was taken to put equal pressure on all zones but
3512 * now pressure is applied based on node LRU order.
3514 shrink_node(pgdat
, sc
);
3517 * Fragmentation may mean that the system cannot be rebalanced for
3518 * high-order allocations. If twice the allocation size has been
3519 * reclaimed then recheck watermarks only at order-0 to prevent
3520 * excessive reclaim. Assume that a process requested a high-order
3521 * can direct reclaim/compact.
3523 if (sc
->order
&& sc
->nr_reclaimed
>= compact_gap(sc
->order
))
3526 return sc
->nr_scanned
>= sc
->nr_to_reclaim
;
3530 * For kswapd, balance_pgdat() will reclaim pages across a node from zones
3531 * that are eligible for use by the caller until at least one zone is
3534 * Returns the order kswapd finished reclaiming at.
3536 * kswapd scans the zones in the highmem->normal->dma direction. It skips
3537 * zones which have free_pages > high_wmark_pages(zone), but once a zone is
3538 * found to have free_pages <= high_wmark_pages(zone), any page in that zone
3539 * or lower is eligible for reclaim until at least one usable zone is
3542 static int balance_pgdat(pg_data_t
*pgdat
, int order
, int highest_zoneidx
)
3545 unsigned long nr_soft_reclaimed
;
3546 unsigned long nr_soft_scanned
;
3547 unsigned long pflags
;
3548 unsigned long nr_boost_reclaim
;
3549 unsigned long zone_boosts
[MAX_NR_ZONES
] = { 0, };
3552 struct scan_control sc
= {
3553 .gfp_mask
= GFP_KERNEL
,
3558 set_task_reclaim_state(current
, &sc
.reclaim_state
);
3559 psi_memstall_enter(&pflags
);
3560 __fs_reclaim_acquire();
3562 count_vm_event(PAGEOUTRUN
);
3565 * Account for the reclaim boost. Note that the zone boost is left in
3566 * place so that parallel allocations that are near the watermark will
3567 * stall or direct reclaim until kswapd is finished.
3569 nr_boost_reclaim
= 0;
3570 for (i
= 0; i
<= highest_zoneidx
; i
++) {
3571 zone
= pgdat
->node_zones
+ i
;
3572 if (!managed_zone(zone
))
3575 nr_boost_reclaim
+= zone
->watermark_boost
;
3576 zone_boosts
[i
] = zone
->watermark_boost
;
3578 boosted
= nr_boost_reclaim
;
3581 sc
.priority
= DEF_PRIORITY
;
3583 unsigned long nr_reclaimed
= sc
.nr_reclaimed
;
3584 bool raise_priority
= true;
3588 sc
.reclaim_idx
= highest_zoneidx
;
3591 * If the number of buffer_heads exceeds the maximum allowed
3592 * then consider reclaiming from all zones. This has a dual
3593 * purpose -- on 64-bit systems it is expected that
3594 * buffer_heads are stripped during active rotation. On 32-bit
3595 * systems, highmem pages can pin lowmem memory and shrinking
3596 * buffers can relieve lowmem pressure. Reclaim may still not
3597 * go ahead if all eligible zones for the original allocation
3598 * request are balanced to avoid excessive reclaim from kswapd.
3600 if (buffer_heads_over_limit
) {
3601 for (i
= MAX_NR_ZONES
- 1; i
>= 0; i
--) {
3602 zone
= pgdat
->node_zones
+ i
;
3603 if (!managed_zone(zone
))
3612 * If the pgdat is imbalanced then ignore boosting and preserve
3613 * the watermarks for a later time and restart. Note that the
3614 * zone watermarks will be still reset at the end of balancing
3615 * on the grounds that the normal reclaim should be enough to
3616 * re-evaluate if boosting is required when kswapd next wakes.
3618 balanced
= pgdat_balanced(pgdat
, sc
.order
, highest_zoneidx
);
3619 if (!balanced
&& nr_boost_reclaim
) {
3620 nr_boost_reclaim
= 0;
3625 * If boosting is not active then only reclaim if there are no
3626 * eligible zones. Note that sc.reclaim_idx is not used as
3627 * buffer_heads_over_limit may have adjusted it.
3629 if (!nr_boost_reclaim
&& balanced
)
3632 /* Limit the priority of boosting to avoid reclaim writeback */
3633 if (nr_boost_reclaim
&& sc
.priority
== DEF_PRIORITY
- 2)
3634 raise_priority
= false;
3637 * Do not writeback or swap pages for boosted reclaim. The
3638 * intent is to relieve pressure not issue sub-optimal IO
3639 * from reclaim context. If no pages are reclaimed, the
3640 * reclaim will be aborted.
3642 sc
.may_writepage
= !laptop_mode
&& !nr_boost_reclaim
;
3643 sc
.may_swap
= !nr_boost_reclaim
;
3646 * Do some background aging of the anon list, to give
3647 * pages a chance to be referenced before reclaiming. All
3648 * pages are rotated regardless of classzone as this is
3649 * about consistent aging.
3651 age_active_anon(pgdat
, &sc
);
3654 * If we're getting trouble reclaiming, start doing writepage
3655 * even in laptop mode.
3657 if (sc
.priority
< DEF_PRIORITY
- 2)
3658 sc
.may_writepage
= 1;
3660 /* Call soft limit reclaim before calling shrink_node. */
3662 nr_soft_scanned
= 0;
3663 nr_soft_reclaimed
= mem_cgroup_soft_limit_reclaim(pgdat
, sc
.order
,
3664 sc
.gfp_mask
, &nr_soft_scanned
);
3665 sc
.nr_reclaimed
+= nr_soft_reclaimed
;
3668 * There should be no need to raise the scanning priority if
3669 * enough pages are already being scanned that that high
3670 * watermark would be met at 100% efficiency.
3672 if (kswapd_shrink_node(pgdat
, &sc
))
3673 raise_priority
= false;
3676 * If the low watermark is met there is no need for processes
3677 * to be throttled on pfmemalloc_wait as they should not be
3678 * able to safely make forward progress. Wake them
3680 if (waitqueue_active(&pgdat
->pfmemalloc_wait
) &&
3681 allow_direct_reclaim(pgdat
))
3682 wake_up_all(&pgdat
->pfmemalloc_wait
);
3684 /* Check if kswapd should be suspending */
3685 __fs_reclaim_release();
3686 ret
= try_to_freeze();
3687 __fs_reclaim_acquire();
3688 if (ret
|| kthread_should_stop())
3692 * Raise priority if scanning rate is too low or there was no
3693 * progress in reclaiming pages
3695 nr_reclaimed
= sc
.nr_reclaimed
- nr_reclaimed
;
3696 nr_boost_reclaim
-= min(nr_boost_reclaim
, nr_reclaimed
);
3699 * If reclaim made no progress for a boost, stop reclaim as
3700 * IO cannot be queued and it could be an infinite loop in
3701 * extreme circumstances.
3703 if (nr_boost_reclaim
&& !nr_reclaimed
)
3706 if (raise_priority
|| !nr_reclaimed
)
3708 } while (sc
.priority
>= 1);
3710 if (!sc
.nr_reclaimed
)
3711 pgdat
->kswapd_failures
++;
3714 /* If reclaim was boosted, account for the reclaim done in this pass */
3716 unsigned long flags
;
3718 for (i
= 0; i
<= highest_zoneidx
; i
++) {
3719 if (!zone_boosts
[i
])
3722 /* Increments are under the zone lock */
3723 zone
= pgdat
->node_zones
+ i
;
3724 spin_lock_irqsave(&zone
->lock
, flags
);
3725 zone
->watermark_boost
-= min(zone
->watermark_boost
, zone_boosts
[i
]);
3726 spin_unlock_irqrestore(&zone
->lock
, flags
);
3730 * As there is now likely space, wakeup kcompact to defragment
3733 wakeup_kcompactd(pgdat
, pageblock_order
, highest_zoneidx
);
3736 snapshot_refaults(NULL
, pgdat
);
3737 __fs_reclaim_release();
3738 psi_memstall_leave(&pflags
);
3739 set_task_reclaim_state(current
, NULL
);
3742 * Return the order kswapd stopped reclaiming at as
3743 * prepare_kswapd_sleep() takes it into account. If another caller
3744 * entered the allocator slow path while kswapd was awake, order will
3745 * remain at the higher level.
3751 * The pgdat->kswapd_highest_zoneidx is used to pass the highest zone index to
3752 * be reclaimed by kswapd from the waker. If the value is MAX_NR_ZONES which is
3753 * not a valid index then either kswapd runs for first time or kswapd couldn't
3754 * sleep after previous reclaim attempt (node is still unbalanced). In that
3755 * case return the zone index of the previous kswapd reclaim cycle.
3757 static enum zone_type
kswapd_highest_zoneidx(pg_data_t
*pgdat
,
3758 enum zone_type prev_highest_zoneidx
)
3760 enum zone_type curr_idx
= READ_ONCE(pgdat
->kswapd_highest_zoneidx
);
3762 return curr_idx
== MAX_NR_ZONES
? prev_highest_zoneidx
: curr_idx
;
3765 static void kswapd_try_to_sleep(pg_data_t
*pgdat
, int alloc_order
, int reclaim_order
,
3766 unsigned int highest_zoneidx
)
3771 if (freezing(current
) || kthread_should_stop())
3774 prepare_to_wait(&pgdat
->kswapd_wait
, &wait
, TASK_INTERRUPTIBLE
);
3777 * Try to sleep for a short interval. Note that kcompactd will only be
3778 * woken if it is possible to sleep for a short interval. This is
3779 * deliberate on the assumption that if reclaim cannot keep an
3780 * eligible zone balanced that it's also unlikely that compaction will
3783 if (prepare_kswapd_sleep(pgdat
, reclaim_order
, highest_zoneidx
)) {
3785 * Compaction records what page blocks it recently failed to
3786 * isolate pages from and skips them in the future scanning.
3787 * When kswapd is going to sleep, it is reasonable to assume
3788 * that pages and compaction may succeed so reset the cache.
3790 reset_isolation_suitable(pgdat
);
3793 * We have freed the memory, now we should compact it to make
3794 * allocation of the requested order possible.
3796 wakeup_kcompactd(pgdat
, alloc_order
, highest_zoneidx
);
3798 remaining
= schedule_timeout(HZ
/10);
3801 * If woken prematurely then reset kswapd_highest_zoneidx and
3802 * order. The values will either be from a wakeup request or
3803 * the previous request that slept prematurely.
3806 WRITE_ONCE(pgdat
->kswapd_highest_zoneidx
,
3807 kswapd_highest_zoneidx(pgdat
,
3810 if (READ_ONCE(pgdat
->kswapd_order
) < reclaim_order
)
3811 WRITE_ONCE(pgdat
->kswapd_order
, reclaim_order
);
3814 finish_wait(&pgdat
->kswapd_wait
, &wait
);
3815 prepare_to_wait(&pgdat
->kswapd_wait
, &wait
, TASK_INTERRUPTIBLE
);
3819 * After a short sleep, check if it was a premature sleep. If not, then
3820 * go fully to sleep until explicitly woken up.
3823 prepare_kswapd_sleep(pgdat
, reclaim_order
, highest_zoneidx
)) {
3824 trace_mm_vmscan_kswapd_sleep(pgdat
->node_id
);
3827 * vmstat counters are not perfectly accurate and the estimated
3828 * value for counters such as NR_FREE_PAGES can deviate from the
3829 * true value by nr_online_cpus * threshold. To avoid the zone
3830 * watermarks being breached while under pressure, we reduce the
3831 * per-cpu vmstat threshold while kswapd is awake and restore
3832 * them before going back to sleep.
3834 set_pgdat_percpu_threshold(pgdat
, calculate_normal_threshold
);
3836 if (!kthread_should_stop())
3839 set_pgdat_percpu_threshold(pgdat
, calculate_pressure_threshold
);
3842 count_vm_event(KSWAPD_LOW_WMARK_HIT_QUICKLY
);
3844 count_vm_event(KSWAPD_HIGH_WMARK_HIT_QUICKLY
);
3846 finish_wait(&pgdat
->kswapd_wait
, &wait
);
3850 * The background pageout daemon, started as a kernel thread
3851 * from the init process.
3853 * This basically trickles out pages so that we have _some_
3854 * free memory available even if there is no other activity
3855 * that frees anything up. This is needed for things like routing
3856 * etc, where we otherwise might have all activity going on in
3857 * asynchronous contexts that cannot page things out.
3859 * If there are applications that are active memory-allocators
3860 * (most normal use), this basically shouldn't matter.
3862 static int kswapd(void *p
)
3864 unsigned int alloc_order
, reclaim_order
;
3865 unsigned int highest_zoneidx
= MAX_NR_ZONES
- 1;
3866 pg_data_t
*pgdat
= (pg_data_t
*)p
;
3867 struct task_struct
*tsk
= current
;
3868 const struct cpumask
*cpumask
= cpumask_of_node(pgdat
->node_id
);
3870 if (!cpumask_empty(cpumask
))
3871 set_cpus_allowed_ptr(tsk
, cpumask
);
3874 * Tell the memory management that we're a "memory allocator",
3875 * and that if we need more memory we should get access to it
3876 * regardless (see "__alloc_pages()"). "kswapd" should
3877 * never get caught in the normal page freeing logic.
3879 * (Kswapd normally doesn't need memory anyway, but sometimes
3880 * you need a small amount of memory in order to be able to
3881 * page out something else, and this flag essentially protects
3882 * us from recursively trying to free more memory as we're
3883 * trying to free the first piece of memory in the first place).
3885 tsk
->flags
|= PF_MEMALLOC
| PF_SWAPWRITE
| PF_KSWAPD
;
3888 WRITE_ONCE(pgdat
->kswapd_order
, 0);
3889 WRITE_ONCE(pgdat
->kswapd_highest_zoneidx
, MAX_NR_ZONES
);
3893 alloc_order
= reclaim_order
= READ_ONCE(pgdat
->kswapd_order
);
3894 highest_zoneidx
= kswapd_highest_zoneidx(pgdat
,
3898 kswapd_try_to_sleep(pgdat
, alloc_order
, reclaim_order
,
3901 /* Read the new order and highest_zoneidx */
3902 alloc_order
= reclaim_order
= READ_ONCE(pgdat
->kswapd_order
);
3903 highest_zoneidx
= kswapd_highest_zoneidx(pgdat
,
3905 WRITE_ONCE(pgdat
->kswapd_order
, 0);
3906 WRITE_ONCE(pgdat
->kswapd_highest_zoneidx
, MAX_NR_ZONES
);
3908 ret
= try_to_freeze();
3909 if (kthread_should_stop())
3913 * We can speed up thawing tasks if we don't call balance_pgdat
3914 * after returning from the refrigerator
3920 * Reclaim begins at the requested order but if a high-order
3921 * reclaim fails then kswapd falls back to reclaiming for
3922 * order-0. If that happens, kswapd will consider sleeping
3923 * for the order it finished reclaiming at (reclaim_order)
3924 * but kcompactd is woken to compact for the original
3925 * request (alloc_order).
3927 trace_mm_vmscan_kswapd_wake(pgdat
->node_id
, highest_zoneidx
,
3929 reclaim_order
= balance_pgdat(pgdat
, alloc_order
,
3931 if (reclaim_order
< alloc_order
)
3932 goto kswapd_try_sleep
;
3935 tsk
->flags
&= ~(PF_MEMALLOC
| PF_SWAPWRITE
| PF_KSWAPD
);
3941 * A zone is low on free memory or too fragmented for high-order memory. If
3942 * kswapd should reclaim (direct reclaim is deferred), wake it up for the zone's
3943 * pgdat. It will wake up kcompactd after reclaiming memory. If kswapd reclaim
3944 * has failed or is not needed, still wake up kcompactd if only compaction is
3947 void wakeup_kswapd(struct zone
*zone
, gfp_t gfp_flags
, int order
,
3948 enum zone_type highest_zoneidx
)
3951 enum zone_type curr_idx
;
3953 if (!managed_zone(zone
))
3956 if (!cpuset_zone_allowed(zone
, gfp_flags
))
3959 pgdat
= zone
->zone_pgdat
;
3960 curr_idx
= READ_ONCE(pgdat
->kswapd_highest_zoneidx
);
3962 if (curr_idx
== MAX_NR_ZONES
|| curr_idx
< highest_zoneidx
)
3963 WRITE_ONCE(pgdat
->kswapd_highest_zoneidx
, highest_zoneidx
);
3965 if (READ_ONCE(pgdat
->kswapd_order
) < order
)
3966 WRITE_ONCE(pgdat
->kswapd_order
, order
);
3968 if (!waitqueue_active(&pgdat
->kswapd_wait
))
3971 /* Hopeless node, leave it to direct reclaim if possible */
3972 if (pgdat
->kswapd_failures
>= MAX_RECLAIM_RETRIES
||
3973 (pgdat_balanced(pgdat
, order
, highest_zoneidx
) &&
3974 !pgdat_watermark_boosted(pgdat
, highest_zoneidx
))) {
3976 * There may be plenty of free memory available, but it's too
3977 * fragmented for high-order allocations. Wake up kcompactd
3978 * and rely on compaction_suitable() to determine if it's
3979 * needed. If it fails, it will defer subsequent attempts to
3980 * ratelimit its work.
3982 if (!(gfp_flags
& __GFP_DIRECT_RECLAIM
))
3983 wakeup_kcompactd(pgdat
, order
, highest_zoneidx
);
3987 trace_mm_vmscan_wakeup_kswapd(pgdat
->node_id
, highest_zoneidx
, order
,
3989 wake_up_interruptible(&pgdat
->kswapd_wait
);
3992 #ifdef CONFIG_HIBERNATION
3994 * Try to free `nr_to_reclaim' of memory, system-wide, and return the number of
3997 * Rather than trying to age LRUs the aim is to preserve the overall
3998 * LRU order by reclaiming preferentially
3999 * inactive > active > active referenced > active mapped
4001 unsigned long shrink_all_memory(unsigned long nr_to_reclaim
)
4003 struct scan_control sc
= {
4004 .nr_to_reclaim
= nr_to_reclaim
,
4005 .gfp_mask
= GFP_HIGHUSER_MOVABLE
,
4006 .reclaim_idx
= MAX_NR_ZONES
- 1,
4007 .priority
= DEF_PRIORITY
,
4011 .hibernation_mode
= 1,
4013 struct zonelist
*zonelist
= node_zonelist(numa_node_id(), sc
.gfp_mask
);
4014 unsigned long nr_reclaimed
;
4015 unsigned int noreclaim_flag
;
4017 fs_reclaim_acquire(sc
.gfp_mask
);
4018 noreclaim_flag
= memalloc_noreclaim_save();
4019 set_task_reclaim_state(current
, &sc
.reclaim_state
);
4021 nr_reclaimed
= do_try_to_free_pages(zonelist
, &sc
);
4023 set_task_reclaim_state(current
, NULL
);
4024 memalloc_noreclaim_restore(noreclaim_flag
);
4025 fs_reclaim_release(sc
.gfp_mask
);
4027 return nr_reclaimed
;
4029 #endif /* CONFIG_HIBERNATION */
4032 * This kswapd start function will be called by init and node-hot-add.
4033 * On node-hot-add, kswapd will moved to proper cpus if cpus are hot-added.
4035 int kswapd_run(int nid
)
4037 pg_data_t
*pgdat
= NODE_DATA(nid
);
4043 pgdat
->kswapd
= kthread_run(kswapd
, pgdat
, "kswapd%d", nid
);
4044 if (IS_ERR(pgdat
->kswapd
)) {
4045 /* failure at boot is fatal */
4046 BUG_ON(system_state
< SYSTEM_RUNNING
);
4047 pr_err("Failed to start kswapd on node %d\n", nid
);
4048 ret
= PTR_ERR(pgdat
->kswapd
);
4049 pgdat
->kswapd
= NULL
;
4055 * Called by memory hotplug when all memory in a node is offlined. Caller must
4056 * hold mem_hotplug_begin/end().
4058 void kswapd_stop(int nid
)
4060 struct task_struct
*kswapd
= NODE_DATA(nid
)->kswapd
;
4063 kthread_stop(kswapd
);
4064 NODE_DATA(nid
)->kswapd
= NULL
;
4068 static int __init
kswapd_init(void)
4073 for_each_node_state(nid
, N_MEMORY
)
4078 module_init(kswapd_init
)
4084 * If non-zero call node_reclaim when the number of free pages falls below
4087 int node_reclaim_mode __read_mostly
;
4089 #define RECLAIM_WRITE (1<<0) /* Writeout pages during reclaim */
4090 #define RECLAIM_UNMAP (1<<1) /* Unmap pages during reclaim */
4093 * Priority for NODE_RECLAIM. This determines the fraction of pages
4094 * of a node considered for each zone_reclaim. 4 scans 1/16th of
4097 #define NODE_RECLAIM_PRIORITY 4
4100 * Percentage of pages in a zone that must be unmapped for node_reclaim to
4103 int sysctl_min_unmapped_ratio
= 1;
4106 * If the number of slab pages in a zone grows beyond this percentage then
4107 * slab reclaim needs to occur.
4109 int sysctl_min_slab_ratio
= 5;
4111 static inline unsigned long node_unmapped_file_pages(struct pglist_data
*pgdat
)
4113 unsigned long file_mapped
= node_page_state(pgdat
, NR_FILE_MAPPED
);
4114 unsigned long file_lru
= node_page_state(pgdat
, NR_INACTIVE_FILE
) +
4115 node_page_state(pgdat
, NR_ACTIVE_FILE
);
4118 * It's possible for there to be more file mapped pages than
4119 * accounted for by the pages on the file LRU lists because
4120 * tmpfs pages accounted for as ANON can also be FILE_MAPPED
4122 return (file_lru
> file_mapped
) ? (file_lru
- file_mapped
) : 0;
4125 /* Work out how many page cache pages we can reclaim in this reclaim_mode */
4126 static unsigned long node_pagecache_reclaimable(struct pglist_data
*pgdat
)
4128 unsigned long nr_pagecache_reclaimable
;
4129 unsigned long delta
= 0;
4132 * If RECLAIM_UNMAP is set, then all file pages are considered
4133 * potentially reclaimable. Otherwise, we have to worry about
4134 * pages like swapcache and node_unmapped_file_pages() provides
4137 if (node_reclaim_mode
& RECLAIM_UNMAP
)
4138 nr_pagecache_reclaimable
= node_page_state(pgdat
, NR_FILE_PAGES
);
4140 nr_pagecache_reclaimable
= node_unmapped_file_pages(pgdat
);
4142 /* If we can't clean pages, remove dirty pages from consideration */
4143 if (!(node_reclaim_mode
& RECLAIM_WRITE
))
4144 delta
+= node_page_state(pgdat
, NR_FILE_DIRTY
);
4146 /* Watch for any possible underflows due to delta */
4147 if (unlikely(delta
> nr_pagecache_reclaimable
))
4148 delta
= nr_pagecache_reclaimable
;
4150 return nr_pagecache_reclaimable
- delta
;
4154 * Try to free up some pages from this node through reclaim.
4156 static int __node_reclaim(struct pglist_data
*pgdat
, gfp_t gfp_mask
, unsigned int order
)
4158 /* Minimum pages needed in order to stay on node */
4159 const unsigned long nr_pages
= 1 << order
;
4160 struct task_struct
*p
= current
;
4161 unsigned int noreclaim_flag
;
4162 struct scan_control sc
= {
4163 .nr_to_reclaim
= max(nr_pages
, SWAP_CLUSTER_MAX
),
4164 .gfp_mask
= current_gfp_context(gfp_mask
),
4166 .priority
= NODE_RECLAIM_PRIORITY
,
4167 .may_writepage
= !!(node_reclaim_mode
& RECLAIM_WRITE
),
4168 .may_unmap
= !!(node_reclaim_mode
& RECLAIM_UNMAP
),
4170 .reclaim_idx
= gfp_zone(gfp_mask
),
4173 trace_mm_vmscan_node_reclaim_begin(pgdat
->node_id
, order
,
4177 fs_reclaim_acquire(sc
.gfp_mask
);
4179 * We need to be able to allocate from the reserves for RECLAIM_UNMAP
4180 * and we also need to be able to write out pages for RECLAIM_WRITE
4181 * and RECLAIM_UNMAP.
4183 noreclaim_flag
= memalloc_noreclaim_save();
4184 p
->flags
|= PF_SWAPWRITE
;
4185 set_task_reclaim_state(p
, &sc
.reclaim_state
);
4187 if (node_pagecache_reclaimable(pgdat
) > pgdat
->min_unmapped_pages
) {
4189 * Free memory by calling shrink node with increasing
4190 * priorities until we have enough memory freed.
4193 shrink_node(pgdat
, &sc
);
4194 } while (sc
.nr_reclaimed
< nr_pages
&& --sc
.priority
>= 0);
4197 set_task_reclaim_state(p
, NULL
);
4198 current
->flags
&= ~PF_SWAPWRITE
;
4199 memalloc_noreclaim_restore(noreclaim_flag
);
4200 fs_reclaim_release(sc
.gfp_mask
);
4202 trace_mm_vmscan_node_reclaim_end(sc
.nr_reclaimed
);
4204 return sc
.nr_reclaimed
>= nr_pages
;
4207 int node_reclaim(struct pglist_data
*pgdat
, gfp_t gfp_mask
, unsigned int order
)
4212 * Node reclaim reclaims unmapped file backed pages and
4213 * slab pages if we are over the defined limits.
4215 * A small portion of unmapped file backed pages is needed for
4216 * file I/O otherwise pages read by file I/O will be immediately
4217 * thrown out if the node is overallocated. So we do not reclaim
4218 * if less than a specified percentage of the node is used by
4219 * unmapped file backed pages.
4221 if (node_pagecache_reclaimable(pgdat
) <= pgdat
->min_unmapped_pages
&&
4222 node_page_state(pgdat
, NR_SLAB_RECLAIMABLE
) <= pgdat
->min_slab_pages
)
4223 return NODE_RECLAIM_FULL
;
4226 * Do not scan if the allocation should not be delayed.
4228 if (!gfpflags_allow_blocking(gfp_mask
) || (current
->flags
& PF_MEMALLOC
))
4229 return NODE_RECLAIM_NOSCAN
;
4232 * Only run node reclaim on the local node or on nodes that do not
4233 * have associated processors. This will favor the local processor
4234 * over remote processors and spread off node memory allocations
4235 * as wide as possible.
4237 if (node_state(pgdat
->node_id
, N_CPU
) && pgdat
->node_id
!= numa_node_id())
4238 return NODE_RECLAIM_NOSCAN
;
4240 if (test_and_set_bit(PGDAT_RECLAIM_LOCKED
, &pgdat
->flags
))
4241 return NODE_RECLAIM_NOSCAN
;
4243 ret
= __node_reclaim(pgdat
, gfp_mask
, order
);
4244 clear_bit(PGDAT_RECLAIM_LOCKED
, &pgdat
->flags
);
4247 count_vm_event(PGSCAN_ZONE_RECLAIM_FAILED
);
4254 * check_move_unevictable_pages - check pages for evictability and move to
4255 * appropriate zone lru list
4256 * @pvec: pagevec with lru pages to check
4258 * Checks pages for evictability, if an evictable page is in the unevictable
4259 * lru list, moves it to the appropriate evictable lru list. This function
4260 * should be only used for lru pages.
4262 void check_move_unevictable_pages(struct pagevec
*pvec
)
4264 struct lruvec
*lruvec
;
4265 struct pglist_data
*pgdat
= NULL
;
4270 for (i
= 0; i
< pvec
->nr
; i
++) {
4271 struct page
*page
= pvec
->pages
[i
];
4272 struct pglist_data
*pagepgdat
= page_pgdat(page
);
4275 if (pagepgdat
!= pgdat
) {
4277 spin_unlock_irq(&pgdat
->lru_lock
);
4279 spin_lock_irq(&pgdat
->lru_lock
);
4281 lruvec
= mem_cgroup_page_lruvec(page
, pgdat
);
4283 if (!PageLRU(page
) || !PageUnevictable(page
))
4286 if (page_evictable(page
)) {
4287 enum lru_list lru
= page_lru_base_type(page
);
4289 VM_BUG_ON_PAGE(PageActive(page
), page
);
4290 ClearPageUnevictable(page
);
4291 del_page_from_lru_list(page
, lruvec
, LRU_UNEVICTABLE
);
4292 add_page_to_lru_list(page
, lruvec
, lru
);
4298 __count_vm_events(UNEVICTABLE_PGRESCUED
, pgrescued
);
4299 __count_vm_events(UNEVICTABLE_PGSCANNED
, pgscanned
);
4300 spin_unlock_irq(&pgdat
->lru_lock
);
4303 EXPORT_SYMBOL_GPL(check_move_unevictable_pages
);