Commit | Line | Data |
---|---|---|
b2441318 | 1 | // SPDX-License-Identifier: GPL-2.0 |
1da177e4 | 2 | /* |
1da177e4 LT |
3 | * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds |
4 | * | |
5 | * Swap reorganised 29.12.95, Stephen Tweedie. | |
6 | * kswapd added: 7.1.96 sct | |
7 | * Removed kswapd_ctl limits, and swap out as many pages as needed | |
8 | * to bring the system back to freepages.high: 2.4.97, Rik van Riel. | |
9 | * Zone aware kswapd started 02/00, Kanoj Sarcar (kanoj@sgi.com). | |
10 | * Multiqueue VM started 5.8.00, Rik van Riel. | |
11 | */ | |
12 | ||
b1de0d13 MH |
13 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
14 | ||
1da177e4 | 15 | #include <linux/mm.h> |
5b3cc15a | 16 | #include <linux/sched/mm.h> |
1da177e4 | 17 | #include <linux/module.h> |
5a0e3ad6 | 18 | #include <linux/gfp.h> |
1da177e4 LT |
19 | #include <linux/kernel_stat.h> |
20 | #include <linux/swap.h> | |
21 | #include <linux/pagemap.h> | |
22 | #include <linux/init.h> | |
23 | #include <linux/highmem.h> | |
70ddf637 | 24 | #include <linux/vmpressure.h> |
e129b5c2 | 25 | #include <linux/vmstat.h> |
1da177e4 LT |
26 | #include <linux/file.h> |
27 | #include <linux/writeback.h> | |
28 | #include <linux/blkdev.h> | |
29 | #include <linux/buffer_head.h> /* for try_to_release_page(), | |
30 | buffer_heads_over_limit */ | |
31 | #include <linux/mm_inline.h> | |
1da177e4 LT |
32 | #include <linux/backing-dev.h> |
33 | #include <linux/rmap.h> | |
34 | #include <linux/topology.h> | |
35 | #include <linux/cpu.h> | |
36 | #include <linux/cpuset.h> | |
3e7d3449 | 37 | #include <linux/compaction.h> |
1da177e4 LT |
38 | #include <linux/notifier.h> |
39 | #include <linux/rwsem.h> | |
248a0301 | 40 | #include <linux/delay.h> |
3218ae14 | 41 | #include <linux/kthread.h> |
7dfb7103 | 42 | #include <linux/freezer.h> |
66e1707b | 43 | #include <linux/memcontrol.h> |
26aa2d19 | 44 | #include <linux/migrate.h> |
873b4771 | 45 | #include <linux/delayacct.h> |
af936a16 | 46 | #include <linux/sysctl.h> |
929bea7c | 47 | #include <linux/oom.h> |
64e3d12f | 48 | #include <linux/pagevec.h> |
268bb0ce | 49 | #include <linux/prefetch.h> |
b1de0d13 | 50 | #include <linux/printk.h> |
f9fe48be | 51 | #include <linux/dax.h> |
eb414681 | 52 | #include <linux/psi.h> |
1da177e4 LT |
53 | |
54 | #include <asm/tlbflush.h> | |
55 | #include <asm/div64.h> | |
56 | ||
57 | #include <linux/swapops.h> | |
117aad1e | 58 | #include <linux/balloon_compaction.h> |
c574bbe9 | 59 | #include <linux/sched/sysctl.h> |
1da177e4 | 60 | |
0f8053a5 NP |
61 | #include "internal.h" |
62 | ||
33906bc5 MG |
63 | #define CREATE_TRACE_POINTS |
64 | #include <trace/events/vmscan.h> | |
65 | ||
1da177e4 | 66 | struct scan_control { |
22fba335 KM |
67 | /* How many pages shrink_list() should reclaim */ |
68 | unsigned long nr_to_reclaim; | |
69 | ||
ee814fe2 JW |
70 | /* |
71 | * Nodemask of nodes allowed by the caller. If NULL, all nodes | |
72 | * are scanned. | |
73 | */ | |
74 | nodemask_t *nodemask; | |
9e3b2f8c | 75 | |
f16015fb JW |
76 | /* |
77 | * The memory cgroup that hit its limit and as a result is the | |
78 | * primary target of this reclaim invocation. | |
79 | */ | |
80 | struct mem_cgroup *target_mem_cgroup; | |
66e1707b | 81 | |
7cf111bc JW |
82 | /* |
83 | * Scan pressure balancing between anon and file LRUs | |
84 | */ | |
85 | unsigned long anon_cost; | |
86 | unsigned long file_cost; | |
87 | ||
b91ac374 JW |
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; | |
94 | ||
1276ad68 | 95 | /* Writepage batching in laptop mode; RECLAIM_WRITE */ |
ee814fe2 JW |
96 | unsigned int may_writepage:1; |
97 | ||
98 | /* Can mapped pages be reclaimed? */ | |
99 | unsigned int may_unmap:1; | |
100 | ||
101 | /* Can pages be swapped as part of reclaim? */ | |
102 | unsigned int may_swap:1; | |
103 | ||
d6622f63 | 104 | /* |
f56ce412 JW |
105 | * Cgroup memory below memory.low is protected as long as we |
106 | * don't threaten to OOM. If any cgroup is reclaimed at | |
107 | * reduced force or passed over entirely due to its memory.low | |
108 | * setting (memcg_low_skipped), and nothing is reclaimed as a | |
109 | * result, then go back for one more cycle that reclaims the protected | |
110 | * memory (memcg_low_reclaim) to avert OOM. | |
d6622f63 YX |
111 | */ |
112 | unsigned int memcg_low_reclaim:1; | |
113 | unsigned int memcg_low_skipped:1; | |
241994ed | 114 | |
ee814fe2 JW |
115 | unsigned int hibernation_mode:1; |
116 | ||
117 | /* One of the zones is ready for compaction */ | |
118 | unsigned int compaction_ready:1; | |
119 | ||
b91ac374 JW |
120 | /* There is easily reclaimable cold cache in the current node */ |
121 | unsigned int cache_trim_mode:1; | |
122 | ||
53138cea JW |
123 | /* The file pages on the current node are dangerously low */ |
124 | unsigned int file_is_tiny:1; | |
125 | ||
26aa2d19 DH |
126 | /* Always discard instead of demoting to lower tier memory */ |
127 | unsigned int no_demotion:1; | |
128 | ||
bb451fdf GT |
129 | /* Allocation order */ |
130 | s8 order; | |
131 | ||
132 | /* Scan (total_size >> priority) pages at once */ | |
133 | s8 priority; | |
134 | ||
135 | /* The highest zone to isolate pages for reclaim from */ | |
136 | s8 reclaim_idx; | |
137 | ||
138 | /* This context's GFP mask */ | |
139 | gfp_t gfp_mask; | |
140 | ||
ee814fe2 JW |
141 | /* Incremented by the number of inactive pages that were scanned */ |
142 | unsigned long nr_scanned; | |
143 | ||
144 | /* Number of pages freed so far during a call to shrink_zones() */ | |
145 | unsigned long nr_reclaimed; | |
d108c772 AR |
146 | |
147 | struct { | |
148 | unsigned int dirty; | |
149 | unsigned int unqueued_dirty; | |
150 | unsigned int congested; | |
151 | unsigned int writeback; | |
152 | unsigned int immediate; | |
153 | unsigned int file_taken; | |
154 | unsigned int taken; | |
155 | } nr; | |
e5ca8071 YS |
156 | |
157 | /* for recording the reclaimed slab by now */ | |
158 | struct reclaim_state reclaim_state; | |
1da177e4 LT |
159 | }; |
160 | ||
1da177e4 LT |
161 | #ifdef ARCH_HAS_PREFETCHW |
162 | #define prefetchw_prev_lru_page(_page, _base, _field) \ | |
163 | do { \ | |
164 | if ((_page)->lru.prev != _base) { \ | |
165 | struct page *prev; \ | |
166 | \ | |
167 | prev = lru_to_page(&(_page->lru)); \ | |
168 | prefetchw(&prev->_field); \ | |
169 | } \ | |
170 | } while (0) | |
171 | #else | |
172 | #define prefetchw_prev_lru_page(_page, _base, _field) do { } while (0) | |
173 | #endif | |
174 | ||
175 | /* | |
c843966c | 176 | * From 0 .. 200. Higher means more swappy. |
1da177e4 LT |
177 | */ |
178 | int vm_swappiness = 60; | |
1da177e4 | 179 | |
0a432dcb YS |
180 | static void set_task_reclaim_state(struct task_struct *task, |
181 | struct reclaim_state *rs) | |
182 | { | |
183 | /* Check for an overwrite */ | |
184 | WARN_ON_ONCE(rs && task->reclaim_state); | |
185 | ||
186 | /* Check for the nulling of an already-nulled member */ | |
187 | WARN_ON_ONCE(!rs && !task->reclaim_state); | |
188 | ||
189 | task->reclaim_state = rs; | |
190 | } | |
191 | ||
1da177e4 LT |
192 | static LIST_HEAD(shrinker_list); |
193 | static DECLARE_RWSEM(shrinker_rwsem); | |
194 | ||
0a432dcb | 195 | #ifdef CONFIG_MEMCG |
a2fb1261 | 196 | static int shrinker_nr_max; |
2bfd3637 | 197 | |
3c6f17e6 | 198 | /* The shrinker_info is expanded in a batch of BITS_PER_LONG */ |
a2fb1261 YS |
199 | static inline int shrinker_map_size(int nr_items) |
200 | { | |
201 | return (DIV_ROUND_UP(nr_items, BITS_PER_LONG) * sizeof(unsigned long)); | |
202 | } | |
2bfd3637 | 203 | |
3c6f17e6 YS |
204 | static inline int shrinker_defer_size(int nr_items) |
205 | { | |
206 | return (round_up(nr_items, BITS_PER_LONG) * sizeof(atomic_long_t)); | |
207 | } | |
208 | ||
468ab843 YS |
209 | static struct shrinker_info *shrinker_info_protected(struct mem_cgroup *memcg, |
210 | int nid) | |
211 | { | |
212 | return rcu_dereference_protected(memcg->nodeinfo[nid]->shrinker_info, | |
213 | lockdep_is_held(&shrinker_rwsem)); | |
214 | } | |
215 | ||
e4262c4f | 216 | static int expand_one_shrinker_info(struct mem_cgroup *memcg, |
3c6f17e6 YS |
217 | int map_size, int defer_size, |
218 | int old_map_size, int old_defer_size) | |
2bfd3637 | 219 | { |
e4262c4f | 220 | struct shrinker_info *new, *old; |
2bfd3637 YS |
221 | struct mem_cgroup_per_node *pn; |
222 | int nid; | |
3c6f17e6 | 223 | int size = map_size + defer_size; |
2bfd3637 | 224 | |
2bfd3637 YS |
225 | for_each_node(nid) { |
226 | pn = memcg->nodeinfo[nid]; | |
468ab843 | 227 | old = shrinker_info_protected(memcg, nid); |
2bfd3637 YS |
228 | /* Not yet online memcg */ |
229 | if (!old) | |
230 | return 0; | |
231 | ||
232 | new = kvmalloc_node(sizeof(*new) + size, GFP_KERNEL, nid); | |
233 | if (!new) | |
234 | return -ENOMEM; | |
235 | ||
3c6f17e6 YS |
236 | new->nr_deferred = (atomic_long_t *)(new + 1); |
237 | new->map = (void *)new->nr_deferred + defer_size; | |
238 | ||
239 | /* map: set all old bits, clear all new bits */ | |
240 | memset(new->map, (int)0xff, old_map_size); | |
241 | memset((void *)new->map + old_map_size, 0, map_size - old_map_size); | |
242 | /* nr_deferred: copy old values, clear all new values */ | |
243 | memcpy(new->nr_deferred, old->nr_deferred, old_defer_size); | |
244 | memset((void *)new->nr_deferred + old_defer_size, 0, | |
245 | defer_size - old_defer_size); | |
2bfd3637 | 246 | |
e4262c4f | 247 | rcu_assign_pointer(pn->shrinker_info, new); |
72673e86 | 248 | kvfree_rcu(old, rcu); |
2bfd3637 YS |
249 | } |
250 | ||
251 | return 0; | |
252 | } | |
253 | ||
e4262c4f | 254 | void free_shrinker_info(struct mem_cgroup *memcg) |
2bfd3637 YS |
255 | { |
256 | struct mem_cgroup_per_node *pn; | |
e4262c4f | 257 | struct shrinker_info *info; |
2bfd3637 YS |
258 | int nid; |
259 | ||
2bfd3637 YS |
260 | for_each_node(nid) { |
261 | pn = memcg->nodeinfo[nid]; | |
e4262c4f YS |
262 | info = rcu_dereference_protected(pn->shrinker_info, true); |
263 | kvfree(info); | |
264 | rcu_assign_pointer(pn->shrinker_info, NULL); | |
2bfd3637 YS |
265 | } |
266 | } | |
267 | ||
e4262c4f | 268 | int alloc_shrinker_info(struct mem_cgroup *memcg) |
2bfd3637 | 269 | { |
e4262c4f | 270 | struct shrinker_info *info; |
2bfd3637 | 271 | int nid, size, ret = 0; |
3c6f17e6 | 272 | int map_size, defer_size = 0; |
2bfd3637 | 273 | |
d27cf2aa | 274 | down_write(&shrinker_rwsem); |
3c6f17e6 YS |
275 | map_size = shrinker_map_size(shrinker_nr_max); |
276 | defer_size = shrinker_defer_size(shrinker_nr_max); | |
277 | size = map_size + defer_size; | |
2bfd3637 | 278 | for_each_node(nid) { |
e4262c4f YS |
279 | info = kvzalloc_node(sizeof(*info) + size, GFP_KERNEL, nid); |
280 | if (!info) { | |
281 | free_shrinker_info(memcg); | |
2bfd3637 YS |
282 | ret = -ENOMEM; |
283 | break; | |
284 | } | |
3c6f17e6 YS |
285 | info->nr_deferred = (atomic_long_t *)(info + 1); |
286 | info->map = (void *)info->nr_deferred + defer_size; | |
e4262c4f | 287 | rcu_assign_pointer(memcg->nodeinfo[nid]->shrinker_info, info); |
2bfd3637 | 288 | } |
d27cf2aa | 289 | up_write(&shrinker_rwsem); |
2bfd3637 YS |
290 | |
291 | return ret; | |
292 | } | |
293 | ||
3c6f17e6 YS |
294 | static inline bool need_expand(int nr_max) |
295 | { | |
296 | return round_up(nr_max, BITS_PER_LONG) > | |
297 | round_up(shrinker_nr_max, BITS_PER_LONG); | |
298 | } | |
299 | ||
e4262c4f | 300 | static int expand_shrinker_info(int new_id) |
2bfd3637 | 301 | { |
3c6f17e6 | 302 | int ret = 0; |
a2fb1261 | 303 | int new_nr_max = new_id + 1; |
3c6f17e6 YS |
304 | int map_size, defer_size = 0; |
305 | int old_map_size, old_defer_size = 0; | |
2bfd3637 YS |
306 | struct mem_cgroup *memcg; |
307 | ||
3c6f17e6 | 308 | if (!need_expand(new_nr_max)) |
a2fb1261 | 309 | goto out; |
2bfd3637 | 310 | |
2bfd3637 | 311 | if (!root_mem_cgroup) |
d27cf2aa YS |
312 | goto out; |
313 | ||
314 | lockdep_assert_held(&shrinker_rwsem); | |
2bfd3637 | 315 | |
3c6f17e6 YS |
316 | map_size = shrinker_map_size(new_nr_max); |
317 | defer_size = shrinker_defer_size(new_nr_max); | |
318 | old_map_size = shrinker_map_size(shrinker_nr_max); | |
319 | old_defer_size = shrinker_defer_size(shrinker_nr_max); | |
320 | ||
2bfd3637 YS |
321 | memcg = mem_cgroup_iter(NULL, NULL, NULL); |
322 | do { | |
3c6f17e6 YS |
323 | ret = expand_one_shrinker_info(memcg, map_size, defer_size, |
324 | old_map_size, old_defer_size); | |
2bfd3637 YS |
325 | if (ret) { |
326 | mem_cgroup_iter_break(NULL, memcg); | |
d27cf2aa | 327 | goto out; |
2bfd3637 YS |
328 | } |
329 | } while ((memcg = mem_cgroup_iter(NULL, memcg, NULL)) != NULL); | |
d27cf2aa | 330 | out: |
2bfd3637 | 331 | if (!ret) |
a2fb1261 | 332 | shrinker_nr_max = new_nr_max; |
d27cf2aa | 333 | |
2bfd3637 YS |
334 | return ret; |
335 | } | |
336 | ||
337 | void set_shrinker_bit(struct mem_cgroup *memcg, int nid, int shrinker_id) | |
338 | { | |
339 | if (shrinker_id >= 0 && memcg && !mem_cgroup_is_root(memcg)) { | |
e4262c4f | 340 | struct shrinker_info *info; |
2bfd3637 YS |
341 | |
342 | rcu_read_lock(); | |
e4262c4f | 343 | info = rcu_dereference(memcg->nodeinfo[nid]->shrinker_info); |
2bfd3637 YS |
344 | /* Pairs with smp mb in shrink_slab() */ |
345 | smp_mb__before_atomic(); | |
e4262c4f | 346 | set_bit(shrinker_id, info->map); |
2bfd3637 YS |
347 | rcu_read_unlock(); |
348 | } | |
349 | } | |
350 | ||
b4c2b231 | 351 | static DEFINE_IDR(shrinker_idr); |
b4c2b231 KT |
352 | |
353 | static int prealloc_memcg_shrinker(struct shrinker *shrinker) | |
354 | { | |
355 | int id, ret = -ENOMEM; | |
356 | ||
476b30a0 YS |
357 | if (mem_cgroup_disabled()) |
358 | return -ENOSYS; | |
359 | ||
b4c2b231 KT |
360 | down_write(&shrinker_rwsem); |
361 | /* This may call shrinker, so it must use down_read_trylock() */ | |
41ca668a | 362 | id = idr_alloc(&shrinker_idr, shrinker, 0, 0, GFP_KERNEL); |
b4c2b231 KT |
363 | if (id < 0) |
364 | goto unlock; | |
365 | ||
0a4465d3 | 366 | if (id >= shrinker_nr_max) { |
e4262c4f | 367 | if (expand_shrinker_info(id)) { |
0a4465d3 KT |
368 | idr_remove(&shrinker_idr, id); |
369 | goto unlock; | |
370 | } | |
0a4465d3 | 371 | } |
b4c2b231 KT |
372 | shrinker->id = id; |
373 | ret = 0; | |
374 | unlock: | |
375 | up_write(&shrinker_rwsem); | |
376 | return ret; | |
377 | } | |
378 | ||
379 | static void unregister_memcg_shrinker(struct shrinker *shrinker) | |
380 | { | |
381 | int id = shrinker->id; | |
382 | ||
383 | BUG_ON(id < 0); | |
384 | ||
41ca668a YS |
385 | lockdep_assert_held(&shrinker_rwsem); |
386 | ||
b4c2b231 | 387 | idr_remove(&shrinker_idr, id); |
b4c2b231 | 388 | } |
b4c2b231 | 389 | |
86750830 YS |
390 | static long xchg_nr_deferred_memcg(int nid, struct shrinker *shrinker, |
391 | struct mem_cgroup *memcg) | |
392 | { | |
393 | struct shrinker_info *info; | |
394 | ||
395 | info = shrinker_info_protected(memcg, nid); | |
396 | return atomic_long_xchg(&info->nr_deferred[shrinker->id], 0); | |
397 | } | |
398 | ||
399 | static long add_nr_deferred_memcg(long nr, int nid, struct shrinker *shrinker, | |
400 | struct mem_cgroup *memcg) | |
401 | { | |
402 | struct shrinker_info *info; | |
403 | ||
404 | info = shrinker_info_protected(memcg, nid); | |
405 | return atomic_long_add_return(nr, &info->nr_deferred[shrinker->id]); | |
406 | } | |
407 | ||
a178015c YS |
408 | void reparent_shrinker_deferred(struct mem_cgroup *memcg) |
409 | { | |
410 | int i, nid; | |
411 | long nr; | |
412 | struct mem_cgroup *parent; | |
413 | struct shrinker_info *child_info, *parent_info; | |
414 | ||
415 | parent = parent_mem_cgroup(memcg); | |
416 | if (!parent) | |
417 | parent = root_mem_cgroup; | |
418 | ||
419 | /* Prevent from concurrent shrinker_info expand */ | |
420 | down_read(&shrinker_rwsem); | |
421 | for_each_node(nid) { | |
422 | child_info = shrinker_info_protected(memcg, nid); | |
423 | parent_info = shrinker_info_protected(parent, nid); | |
424 | for (i = 0; i < shrinker_nr_max; i++) { | |
425 | nr = atomic_long_read(&child_info->nr_deferred[i]); | |
426 | atomic_long_add(nr, &parent_info->nr_deferred[i]); | |
427 | } | |
428 | } | |
429 | up_read(&shrinker_rwsem); | |
430 | } | |
431 | ||
b5ead35e | 432 | static bool cgroup_reclaim(struct scan_control *sc) |
89b5fae5 | 433 | { |
b5ead35e | 434 | return sc->target_mem_cgroup; |
89b5fae5 | 435 | } |
97c9341f TH |
436 | |
437 | /** | |
b5ead35e | 438 | * writeback_throttling_sane - is the usual dirty throttling mechanism available? |
97c9341f TH |
439 | * @sc: scan_control in question |
440 | * | |
441 | * The normal page dirty throttling mechanism in balance_dirty_pages() is | |
442 | * completely broken with the legacy memcg and direct stalling in | |
443 | * shrink_page_list() is used for throttling instead, which lacks all the | |
444 | * niceties such as fairness, adaptive pausing, bandwidth proportional | |
445 | * allocation and configurability. | |
446 | * | |
447 | * This function tests whether the vmscan currently in progress can assume | |
448 | * that the normal dirty throttling mechanism is operational. | |
449 | */ | |
b5ead35e | 450 | static bool writeback_throttling_sane(struct scan_control *sc) |
97c9341f | 451 | { |
b5ead35e | 452 | if (!cgroup_reclaim(sc)) |
97c9341f TH |
453 | return true; |
454 | #ifdef CONFIG_CGROUP_WRITEBACK | |
69234ace | 455 | if (cgroup_subsys_on_dfl(memory_cgrp_subsys)) |
97c9341f TH |
456 | return true; |
457 | #endif | |
458 | return false; | |
459 | } | |
91a45470 | 460 | #else |
0a432dcb YS |
461 | static int prealloc_memcg_shrinker(struct shrinker *shrinker) |
462 | { | |
476b30a0 | 463 | return -ENOSYS; |
0a432dcb YS |
464 | } |
465 | ||
466 | static void unregister_memcg_shrinker(struct shrinker *shrinker) | |
467 | { | |
468 | } | |
469 | ||
86750830 YS |
470 | static long xchg_nr_deferred_memcg(int nid, struct shrinker *shrinker, |
471 | struct mem_cgroup *memcg) | |
472 | { | |
473 | return 0; | |
474 | } | |
475 | ||
476 | static long add_nr_deferred_memcg(long nr, int nid, struct shrinker *shrinker, | |
477 | struct mem_cgroup *memcg) | |
478 | { | |
479 | return 0; | |
480 | } | |
481 | ||
b5ead35e | 482 | static bool cgroup_reclaim(struct scan_control *sc) |
89b5fae5 | 483 | { |
b5ead35e | 484 | return false; |
89b5fae5 | 485 | } |
97c9341f | 486 | |
b5ead35e | 487 | static bool writeback_throttling_sane(struct scan_control *sc) |
97c9341f TH |
488 | { |
489 | return true; | |
490 | } | |
91a45470 KH |
491 | #endif |
492 | ||
86750830 YS |
493 | static long xchg_nr_deferred(struct shrinker *shrinker, |
494 | struct shrink_control *sc) | |
495 | { | |
496 | int nid = sc->nid; | |
497 | ||
498 | if (!(shrinker->flags & SHRINKER_NUMA_AWARE)) | |
499 | nid = 0; | |
500 | ||
501 | if (sc->memcg && | |
502 | (shrinker->flags & SHRINKER_MEMCG_AWARE)) | |
503 | return xchg_nr_deferred_memcg(nid, shrinker, | |
504 | sc->memcg); | |
505 | ||
506 | return atomic_long_xchg(&shrinker->nr_deferred[nid], 0); | |
507 | } | |
508 | ||
509 | ||
510 | static long add_nr_deferred(long nr, struct shrinker *shrinker, | |
511 | struct shrink_control *sc) | |
512 | { | |
513 | int nid = sc->nid; | |
514 | ||
515 | if (!(shrinker->flags & SHRINKER_NUMA_AWARE)) | |
516 | nid = 0; | |
517 | ||
518 | if (sc->memcg && | |
519 | (shrinker->flags & SHRINKER_MEMCG_AWARE)) | |
520 | return add_nr_deferred_memcg(nr, nid, shrinker, | |
521 | sc->memcg); | |
522 | ||
523 | return atomic_long_add_return(nr, &shrinker->nr_deferred[nid]); | |
524 | } | |
525 | ||
26aa2d19 DH |
526 | static bool can_demote(int nid, struct scan_control *sc) |
527 | { | |
20b51af1 HY |
528 | if (!numa_demotion_enabled) |
529 | return false; | |
3a235693 DH |
530 | if (sc) { |
531 | if (sc->no_demotion) | |
532 | return false; | |
533 | /* It is pointless to do demotion in memcg reclaim */ | |
534 | if (cgroup_reclaim(sc)) | |
535 | return false; | |
536 | } | |
26aa2d19 DH |
537 | if (next_demotion_node(nid) == NUMA_NO_NODE) |
538 | return false; | |
539 | ||
20b51af1 | 540 | return true; |
26aa2d19 DH |
541 | } |
542 | ||
a2a36488 KB |
543 | static inline bool can_reclaim_anon_pages(struct mem_cgroup *memcg, |
544 | int nid, | |
545 | struct scan_control *sc) | |
546 | { | |
547 | if (memcg == NULL) { | |
548 | /* | |
549 | * For non-memcg reclaim, is there | |
550 | * space in any swap device? | |
551 | */ | |
552 | if (get_nr_swap_pages() > 0) | |
553 | return true; | |
554 | } else { | |
555 | /* Is the memcg below its swap limit? */ | |
556 | if (mem_cgroup_get_nr_swap_pages(memcg) > 0) | |
557 | return true; | |
558 | } | |
559 | ||
560 | /* | |
561 | * The page can not be swapped. | |
562 | * | |
563 | * Can it be reclaimed from this node via demotion? | |
564 | */ | |
565 | return can_demote(nid, sc); | |
566 | } | |
567 | ||
5a1c84b4 MG |
568 | /* |
569 | * This misses isolated pages which are not accounted for to save counters. | |
570 | * As the data only determines if reclaim or compaction continues, it is | |
571 | * not expected that isolated pages will be a dominating factor. | |
572 | */ | |
573 | unsigned long zone_reclaimable_pages(struct zone *zone) | |
574 | { | |
575 | unsigned long nr; | |
576 | ||
577 | nr = zone_page_state_snapshot(zone, NR_ZONE_INACTIVE_FILE) + | |
578 | zone_page_state_snapshot(zone, NR_ZONE_ACTIVE_FILE); | |
a2a36488 | 579 | if (can_reclaim_anon_pages(NULL, zone_to_nid(zone), NULL)) |
5a1c84b4 MG |
580 | nr += zone_page_state_snapshot(zone, NR_ZONE_INACTIVE_ANON) + |
581 | zone_page_state_snapshot(zone, NR_ZONE_ACTIVE_ANON); | |
582 | ||
583 | return nr; | |
584 | } | |
585 | ||
fd538803 MH |
586 | /** |
587 | * lruvec_lru_size - Returns the number of pages on the given LRU list. | |
588 | * @lruvec: lru vector | |
589 | * @lru: lru to use | |
590 | * @zone_idx: zones to consider (use MAX_NR_ZONES for the whole LRU list) | |
591 | */ | |
2091339d YZ |
592 | static unsigned long lruvec_lru_size(struct lruvec *lruvec, enum lru_list lru, |
593 | int zone_idx) | |
c9f299d9 | 594 | { |
de3b0150 | 595 | unsigned long size = 0; |
fd538803 MH |
596 | int zid; |
597 | ||
de3b0150 | 598 | for (zid = 0; zid <= zone_idx && zid < MAX_NR_ZONES; zid++) { |
fd538803 | 599 | struct zone *zone = &lruvec_pgdat(lruvec)->node_zones[zid]; |
c9f299d9 | 600 | |
fd538803 MH |
601 | if (!managed_zone(zone)) |
602 | continue; | |
603 | ||
604 | if (!mem_cgroup_disabled()) | |
de3b0150 | 605 | size += mem_cgroup_get_zone_lru_size(lruvec, lru, zid); |
fd538803 | 606 | else |
de3b0150 | 607 | size += zone_page_state(zone, NR_ZONE_LRU_BASE + lru); |
fd538803 | 608 | } |
de3b0150 | 609 | return size; |
b4536f0c MH |
610 | } |
611 | ||
1da177e4 | 612 | /* |
1d3d4437 | 613 | * Add a shrinker callback to be called from the vm. |
1da177e4 | 614 | */ |
8e04944f | 615 | int prealloc_shrinker(struct shrinker *shrinker) |
1da177e4 | 616 | { |
476b30a0 YS |
617 | unsigned int size; |
618 | int err; | |
619 | ||
620 | if (shrinker->flags & SHRINKER_MEMCG_AWARE) { | |
621 | err = prealloc_memcg_shrinker(shrinker); | |
622 | if (err != -ENOSYS) | |
623 | return err; | |
1d3d4437 | 624 | |
476b30a0 YS |
625 | shrinker->flags &= ~SHRINKER_MEMCG_AWARE; |
626 | } | |
627 | ||
628 | size = sizeof(*shrinker->nr_deferred); | |
1d3d4437 GC |
629 | if (shrinker->flags & SHRINKER_NUMA_AWARE) |
630 | size *= nr_node_ids; | |
631 | ||
632 | shrinker->nr_deferred = kzalloc(size, GFP_KERNEL); | |
633 | if (!shrinker->nr_deferred) | |
634 | return -ENOMEM; | |
b4c2b231 | 635 | |
8e04944f TH |
636 | return 0; |
637 | } | |
638 | ||
639 | void free_prealloced_shrinker(struct shrinker *shrinker) | |
640 | { | |
41ca668a YS |
641 | if (shrinker->flags & SHRINKER_MEMCG_AWARE) { |
642 | down_write(&shrinker_rwsem); | |
b4c2b231 | 643 | unregister_memcg_shrinker(shrinker); |
41ca668a | 644 | up_write(&shrinker_rwsem); |
476b30a0 | 645 | return; |
41ca668a | 646 | } |
b4c2b231 | 647 | |
8e04944f TH |
648 | kfree(shrinker->nr_deferred); |
649 | shrinker->nr_deferred = NULL; | |
650 | } | |
1d3d4437 | 651 | |
8e04944f TH |
652 | void register_shrinker_prepared(struct shrinker *shrinker) |
653 | { | |
8e1f936b RR |
654 | down_write(&shrinker_rwsem); |
655 | list_add_tail(&shrinker->list, &shrinker_list); | |
41ca668a | 656 | shrinker->flags |= SHRINKER_REGISTERED; |
8e1f936b | 657 | up_write(&shrinker_rwsem); |
8e04944f TH |
658 | } |
659 | ||
660 | int register_shrinker(struct shrinker *shrinker) | |
661 | { | |
662 | int err = prealloc_shrinker(shrinker); | |
663 | ||
664 | if (err) | |
665 | return err; | |
666 | register_shrinker_prepared(shrinker); | |
1d3d4437 | 667 | return 0; |
1da177e4 | 668 | } |
8e1f936b | 669 | EXPORT_SYMBOL(register_shrinker); |
1da177e4 LT |
670 | |
671 | /* | |
672 | * Remove one | |
673 | */ | |
8e1f936b | 674 | void unregister_shrinker(struct shrinker *shrinker) |
1da177e4 | 675 | { |
41ca668a | 676 | if (!(shrinker->flags & SHRINKER_REGISTERED)) |
bb422a73 | 677 | return; |
41ca668a | 678 | |
1da177e4 LT |
679 | down_write(&shrinker_rwsem); |
680 | list_del(&shrinker->list); | |
41ca668a YS |
681 | shrinker->flags &= ~SHRINKER_REGISTERED; |
682 | if (shrinker->flags & SHRINKER_MEMCG_AWARE) | |
683 | unregister_memcg_shrinker(shrinker); | |
1da177e4 | 684 | up_write(&shrinker_rwsem); |
41ca668a | 685 | |
ae393321 | 686 | kfree(shrinker->nr_deferred); |
bb422a73 | 687 | shrinker->nr_deferred = NULL; |
1da177e4 | 688 | } |
8e1f936b | 689 | EXPORT_SYMBOL(unregister_shrinker); |
1da177e4 | 690 | |
880121be CK |
691 | /** |
692 | * synchronize_shrinkers - Wait for all running shrinkers to complete. | |
693 | * | |
694 | * This is equivalent to calling unregister_shrink() and register_shrinker(), | |
695 | * but atomically and with less overhead. This is useful to guarantee that all | |
696 | * shrinker invocations have seen an update, before freeing memory, similar to | |
697 | * rcu. | |
698 | */ | |
699 | void synchronize_shrinkers(void) | |
700 | { | |
701 | down_write(&shrinker_rwsem); | |
702 | up_write(&shrinker_rwsem); | |
703 | } | |
704 | EXPORT_SYMBOL(synchronize_shrinkers); | |
705 | ||
1da177e4 | 706 | #define SHRINK_BATCH 128 |
1d3d4437 | 707 | |
cb731d6c | 708 | static unsigned long do_shrink_slab(struct shrink_control *shrinkctl, |
9092c71b | 709 | struct shrinker *shrinker, int priority) |
1d3d4437 GC |
710 | { |
711 | unsigned long freed = 0; | |
712 | unsigned long long delta; | |
713 | long total_scan; | |
d5bc5fd3 | 714 | long freeable; |
1d3d4437 GC |
715 | long nr; |
716 | long new_nr; | |
1d3d4437 GC |
717 | long batch_size = shrinker->batch ? shrinker->batch |
718 | : SHRINK_BATCH; | |
5f33a080 | 719 | long scanned = 0, next_deferred; |
1d3d4437 | 720 | |
d5bc5fd3 | 721 | freeable = shrinker->count_objects(shrinker, shrinkctl); |
9b996468 KT |
722 | if (freeable == 0 || freeable == SHRINK_EMPTY) |
723 | return freeable; | |
1d3d4437 GC |
724 | |
725 | /* | |
726 | * copy the current shrinker scan count into a local variable | |
727 | * and zero it so that other concurrent shrinker invocations | |
728 | * don't also do this scanning work. | |
729 | */ | |
86750830 | 730 | nr = xchg_nr_deferred(shrinker, shrinkctl); |
1d3d4437 | 731 | |
4b85afbd JW |
732 | if (shrinker->seeks) { |
733 | delta = freeable >> priority; | |
734 | delta *= 4; | |
735 | do_div(delta, shrinker->seeks); | |
736 | } else { | |
737 | /* | |
738 | * These objects don't require any IO to create. Trim | |
739 | * them aggressively under memory pressure to keep | |
740 | * them from causing refetches in the IO caches. | |
741 | */ | |
742 | delta = freeable / 2; | |
743 | } | |
172b06c3 | 744 | |
18bb473e | 745 | total_scan = nr >> priority; |
1d3d4437 | 746 | total_scan += delta; |
18bb473e | 747 | total_scan = min(total_scan, (2 * freeable)); |
1d3d4437 GC |
748 | |
749 | trace_mm_shrink_slab_start(shrinker, shrinkctl, nr, | |
9092c71b | 750 | freeable, delta, total_scan, priority); |
1d3d4437 | 751 | |
0b1fb40a VD |
752 | /* |
753 | * Normally, we should not scan less than batch_size objects in one | |
754 | * pass to avoid too frequent shrinker calls, but if the slab has less | |
755 | * than batch_size objects in total and we are really tight on memory, | |
756 | * we will try to reclaim all available objects, otherwise we can end | |
757 | * up failing allocations although there are plenty of reclaimable | |
758 | * objects spread over several slabs with usage less than the | |
759 | * batch_size. | |
760 | * | |
761 | * We detect the "tight on memory" situations by looking at the total | |
762 | * number of objects we want to scan (total_scan). If it is greater | |
d5bc5fd3 | 763 | * than the total number of objects on slab (freeable), we must be |
0b1fb40a VD |
764 | * scanning at high prio and therefore should try to reclaim as much as |
765 | * possible. | |
766 | */ | |
767 | while (total_scan >= batch_size || | |
d5bc5fd3 | 768 | total_scan >= freeable) { |
a0b02131 | 769 | unsigned long ret; |
0b1fb40a | 770 | unsigned long nr_to_scan = min(batch_size, total_scan); |
1d3d4437 | 771 | |
0b1fb40a | 772 | shrinkctl->nr_to_scan = nr_to_scan; |
d460acb5 | 773 | shrinkctl->nr_scanned = nr_to_scan; |
a0b02131 DC |
774 | ret = shrinker->scan_objects(shrinker, shrinkctl); |
775 | if (ret == SHRINK_STOP) | |
776 | break; | |
777 | freed += ret; | |
1d3d4437 | 778 | |
d460acb5 CW |
779 | count_vm_events(SLABS_SCANNED, shrinkctl->nr_scanned); |
780 | total_scan -= shrinkctl->nr_scanned; | |
781 | scanned += shrinkctl->nr_scanned; | |
1d3d4437 GC |
782 | |
783 | cond_resched(); | |
784 | } | |
785 | ||
18bb473e YS |
786 | /* |
787 | * The deferred work is increased by any new work (delta) that wasn't | |
788 | * done, decreased by old deferred work that was done now. | |
789 | * | |
790 | * And it is capped to two times of the freeable items. | |
791 | */ | |
792 | next_deferred = max_t(long, (nr + delta - scanned), 0); | |
793 | next_deferred = min(next_deferred, (2 * freeable)); | |
794 | ||
1d3d4437 GC |
795 | /* |
796 | * move the unused scan count back into the shrinker in a | |
86750830 | 797 | * manner that handles concurrent updates. |
1d3d4437 | 798 | */ |
86750830 | 799 | new_nr = add_nr_deferred(next_deferred, shrinker, shrinkctl); |
1d3d4437 | 800 | |
8efb4b59 | 801 | trace_mm_shrink_slab_end(shrinker, shrinkctl->nid, freed, nr, new_nr, total_scan); |
1d3d4437 | 802 | return freed; |
1495f230 YH |
803 | } |
804 | ||
0a432dcb | 805 | #ifdef CONFIG_MEMCG |
b0dedc49 KT |
806 | static unsigned long shrink_slab_memcg(gfp_t gfp_mask, int nid, |
807 | struct mem_cgroup *memcg, int priority) | |
808 | { | |
e4262c4f | 809 | struct shrinker_info *info; |
b8e57efa KT |
810 | unsigned long ret, freed = 0; |
811 | int i; | |
b0dedc49 | 812 | |
0a432dcb | 813 | if (!mem_cgroup_online(memcg)) |
b0dedc49 KT |
814 | return 0; |
815 | ||
816 | if (!down_read_trylock(&shrinker_rwsem)) | |
817 | return 0; | |
818 | ||
468ab843 | 819 | info = shrinker_info_protected(memcg, nid); |
e4262c4f | 820 | if (unlikely(!info)) |
b0dedc49 KT |
821 | goto unlock; |
822 | ||
e4262c4f | 823 | for_each_set_bit(i, info->map, shrinker_nr_max) { |
b0dedc49 KT |
824 | struct shrink_control sc = { |
825 | .gfp_mask = gfp_mask, | |
826 | .nid = nid, | |
827 | .memcg = memcg, | |
828 | }; | |
829 | struct shrinker *shrinker; | |
830 | ||
831 | shrinker = idr_find(&shrinker_idr, i); | |
41ca668a | 832 | if (unlikely(!shrinker || !(shrinker->flags & SHRINKER_REGISTERED))) { |
7e010df5 | 833 | if (!shrinker) |
e4262c4f | 834 | clear_bit(i, info->map); |
b0dedc49 KT |
835 | continue; |
836 | } | |
837 | ||
0a432dcb YS |
838 | /* Call non-slab shrinkers even though kmem is disabled */ |
839 | if (!memcg_kmem_enabled() && | |
840 | !(shrinker->flags & SHRINKER_NONSLAB)) | |
841 | continue; | |
842 | ||
b0dedc49 | 843 | ret = do_shrink_slab(&sc, shrinker, priority); |
f90280d6 | 844 | if (ret == SHRINK_EMPTY) { |
e4262c4f | 845 | clear_bit(i, info->map); |
f90280d6 KT |
846 | /* |
847 | * After the shrinker reported that it had no objects to | |
848 | * free, but before we cleared the corresponding bit in | |
849 | * the memcg shrinker map, a new object might have been | |
850 | * added. To make sure, we have the bit set in this | |
851 | * case, we invoke the shrinker one more time and reset | |
852 | * the bit if it reports that it is not empty anymore. | |
853 | * The memory barrier here pairs with the barrier in | |
2bfd3637 | 854 | * set_shrinker_bit(): |
f90280d6 KT |
855 | * |
856 | * list_lru_add() shrink_slab_memcg() | |
857 | * list_add_tail() clear_bit() | |
858 | * <MB> <MB> | |
859 | * set_bit() do_shrink_slab() | |
860 | */ | |
861 | smp_mb__after_atomic(); | |
862 | ret = do_shrink_slab(&sc, shrinker, priority); | |
863 | if (ret == SHRINK_EMPTY) | |
864 | ret = 0; | |
865 | else | |
2bfd3637 | 866 | set_shrinker_bit(memcg, nid, i); |
f90280d6 | 867 | } |
b0dedc49 KT |
868 | freed += ret; |
869 | ||
870 | if (rwsem_is_contended(&shrinker_rwsem)) { | |
871 | freed = freed ? : 1; | |
872 | break; | |
873 | } | |
874 | } | |
875 | unlock: | |
876 | up_read(&shrinker_rwsem); | |
877 | return freed; | |
878 | } | |
0a432dcb | 879 | #else /* CONFIG_MEMCG */ |
b0dedc49 KT |
880 | static unsigned long shrink_slab_memcg(gfp_t gfp_mask, int nid, |
881 | struct mem_cgroup *memcg, int priority) | |
882 | { | |
883 | return 0; | |
884 | } | |
0a432dcb | 885 | #endif /* CONFIG_MEMCG */ |
b0dedc49 | 886 | |
6b4f7799 | 887 | /** |
cb731d6c | 888 | * shrink_slab - shrink slab caches |
6b4f7799 JW |
889 | * @gfp_mask: allocation context |
890 | * @nid: node whose slab caches to target | |
cb731d6c | 891 | * @memcg: memory cgroup whose slab caches to target |
9092c71b | 892 | * @priority: the reclaim priority |
1da177e4 | 893 | * |
6b4f7799 | 894 | * Call the shrink functions to age shrinkable caches. |
1da177e4 | 895 | * |
6b4f7799 JW |
896 | * @nid is passed along to shrinkers with SHRINKER_NUMA_AWARE set, |
897 | * unaware shrinkers will receive a node id of 0 instead. | |
1da177e4 | 898 | * |
aeed1d32 VD |
899 | * @memcg specifies the memory cgroup to target. Unaware shrinkers |
900 | * are called only if it is the root cgroup. | |
cb731d6c | 901 | * |
9092c71b JB |
902 | * @priority is sc->priority, we take the number of objects and >> by priority |
903 | * in order to get the scan target. | |
b15e0905 | 904 | * |
6b4f7799 | 905 | * Returns the number of reclaimed slab objects. |
1da177e4 | 906 | */ |
cb731d6c VD |
907 | static unsigned long shrink_slab(gfp_t gfp_mask, int nid, |
908 | struct mem_cgroup *memcg, | |
9092c71b | 909 | int priority) |
1da177e4 | 910 | { |
b8e57efa | 911 | unsigned long ret, freed = 0; |
1da177e4 LT |
912 | struct shrinker *shrinker; |
913 | ||
fa1e512f YS |
914 | /* |
915 | * The root memcg might be allocated even though memcg is disabled | |
916 | * via "cgroup_disable=memory" boot parameter. This could make | |
917 | * mem_cgroup_is_root() return false, then just run memcg slab | |
918 | * shrink, but skip global shrink. This may result in premature | |
919 | * oom. | |
920 | */ | |
921 | if (!mem_cgroup_disabled() && !mem_cgroup_is_root(memcg)) | |
b0dedc49 | 922 | return shrink_slab_memcg(gfp_mask, nid, memcg, priority); |
cb731d6c | 923 | |
e830c63a | 924 | if (!down_read_trylock(&shrinker_rwsem)) |
f06590bd | 925 | goto out; |
1da177e4 LT |
926 | |
927 | list_for_each_entry(shrinker, &shrinker_list, list) { | |
6b4f7799 JW |
928 | struct shrink_control sc = { |
929 | .gfp_mask = gfp_mask, | |
930 | .nid = nid, | |
cb731d6c | 931 | .memcg = memcg, |
6b4f7799 | 932 | }; |
ec97097b | 933 | |
9b996468 KT |
934 | ret = do_shrink_slab(&sc, shrinker, priority); |
935 | if (ret == SHRINK_EMPTY) | |
936 | ret = 0; | |
937 | freed += ret; | |
e496612c MK |
938 | /* |
939 | * Bail out if someone want to register a new shrinker to | |
55b65a57 | 940 | * prevent the registration from being stalled for long periods |
e496612c MK |
941 | * by parallel ongoing shrinking. |
942 | */ | |
943 | if (rwsem_is_contended(&shrinker_rwsem)) { | |
944 | freed = freed ? : 1; | |
945 | break; | |
946 | } | |
1da177e4 | 947 | } |
6b4f7799 | 948 | |
1da177e4 | 949 | up_read(&shrinker_rwsem); |
f06590bd MK |
950 | out: |
951 | cond_resched(); | |
24f7c6b9 | 952 | return freed; |
1da177e4 LT |
953 | } |
954 | ||
e4b424b7 | 955 | static void drop_slab_node(int nid) |
cb731d6c VD |
956 | { |
957 | unsigned long freed; | |
1399af7e | 958 | int shift = 0; |
cb731d6c VD |
959 | |
960 | do { | |
961 | struct mem_cgroup *memcg = NULL; | |
962 | ||
069c411d CZ |
963 | if (fatal_signal_pending(current)) |
964 | return; | |
965 | ||
cb731d6c | 966 | freed = 0; |
aeed1d32 | 967 | memcg = mem_cgroup_iter(NULL, NULL, NULL); |
cb731d6c | 968 | do { |
9092c71b | 969 | freed += shrink_slab(GFP_KERNEL, nid, memcg, 0); |
cb731d6c | 970 | } while ((memcg = mem_cgroup_iter(NULL, memcg, NULL)) != NULL); |
1399af7e | 971 | } while ((freed >> shift++) > 1); |
cb731d6c VD |
972 | } |
973 | ||
974 | void drop_slab(void) | |
975 | { | |
976 | int nid; | |
977 | ||
978 | for_each_online_node(nid) | |
979 | drop_slab_node(nid); | |
980 | } | |
981 | ||
e0cd5e7f | 982 | static inline int is_page_cache_freeable(struct folio *folio) |
1da177e4 | 983 | { |
ceddc3a5 JW |
984 | /* |
985 | * A freeable page cache page is referenced only by the caller | |
67891fff MW |
986 | * that isolated the page, the page cache and optional buffer |
987 | * heads at page->private. | |
ceddc3a5 | 988 | */ |
e0cd5e7f MWO |
989 | return folio_ref_count(folio) - folio_test_private(folio) == |
990 | 1 + folio_nr_pages(folio); | |
1da177e4 LT |
991 | } |
992 | ||
1da177e4 | 993 | /* |
e0cd5e7f | 994 | * We detected a synchronous write error writing a folio out. Probably |
1da177e4 LT |
995 | * -ENOSPC. We need to propagate that into the address_space for a subsequent |
996 | * fsync(), msync() or close(). | |
997 | * | |
998 | * The tricky part is that after writepage we cannot touch the mapping: nothing | |
e0cd5e7f MWO |
999 | * prevents it from being freed up. But we have a ref on the folio and once |
1000 | * that folio is locked, the mapping is pinned. | |
1da177e4 | 1001 | * |
e0cd5e7f | 1002 | * We're allowed to run sleeping folio_lock() here because we know the caller has |
1da177e4 LT |
1003 | * __GFP_FS. |
1004 | */ | |
1005 | static void handle_write_error(struct address_space *mapping, | |
e0cd5e7f | 1006 | struct folio *folio, int error) |
1da177e4 | 1007 | { |
e0cd5e7f MWO |
1008 | folio_lock(folio); |
1009 | if (folio_mapping(folio) == mapping) | |
3e9f45bd | 1010 | mapping_set_error(mapping, error); |
e0cd5e7f | 1011 | folio_unlock(folio); |
1da177e4 LT |
1012 | } |
1013 | ||
1b4e3f26 MG |
1014 | static bool skip_throttle_noprogress(pg_data_t *pgdat) |
1015 | { | |
1016 | int reclaimable = 0, write_pending = 0; | |
1017 | int i; | |
1018 | ||
1019 | /* | |
1020 | * If kswapd is disabled, reschedule if necessary but do not | |
1021 | * throttle as the system is likely near OOM. | |
1022 | */ | |
1023 | if (pgdat->kswapd_failures >= MAX_RECLAIM_RETRIES) | |
1024 | return true; | |
1025 | ||
1026 | /* | |
1027 | * If there are a lot of dirty/writeback pages then do not | |
1028 | * throttle as throttling will occur when the pages cycle | |
1029 | * towards the end of the LRU if still under writeback. | |
1030 | */ | |
1031 | for (i = 0; i < MAX_NR_ZONES; i++) { | |
1032 | struct zone *zone = pgdat->node_zones + i; | |
1033 | ||
36c26128 | 1034 | if (!managed_zone(zone)) |
1b4e3f26 MG |
1035 | continue; |
1036 | ||
1037 | reclaimable += zone_reclaimable_pages(zone); | |
1038 | write_pending += zone_page_state_snapshot(zone, | |
1039 | NR_ZONE_WRITE_PENDING); | |
1040 | } | |
1041 | if (2 * write_pending <= reclaimable) | |
1042 | return true; | |
1043 | ||
1044 | return false; | |
1045 | } | |
1046 | ||
c3f4a9a2 | 1047 | void reclaim_throttle(pg_data_t *pgdat, enum vmscan_throttle_state reason) |
8cd7c588 MG |
1048 | { |
1049 | wait_queue_head_t *wqh = &pgdat->reclaim_wait[reason]; | |
c3f4a9a2 | 1050 | long timeout, ret; |
8cd7c588 MG |
1051 | DEFINE_WAIT(wait); |
1052 | ||
1053 | /* | |
1054 | * Do not throttle IO workers, kthreads other than kswapd or | |
1055 | * workqueues. They may be required for reclaim to make | |
1056 | * forward progress (e.g. journalling workqueues or kthreads). | |
1057 | */ | |
1058 | if (!current_is_kswapd() && | |
b485c6f1 MG |
1059 | current->flags & (PF_IO_WORKER|PF_KTHREAD)) { |
1060 | cond_resched(); | |
8cd7c588 | 1061 | return; |
b485c6f1 | 1062 | } |
8cd7c588 | 1063 | |
c3f4a9a2 MG |
1064 | /* |
1065 | * These figures are pulled out of thin air. | |
1066 | * VMSCAN_THROTTLE_ISOLATED is a transient condition based on too many | |
1067 | * parallel reclaimers which is a short-lived event so the timeout is | |
1068 | * short. Failing to make progress or waiting on writeback are | |
1069 | * potentially long-lived events so use a longer timeout. This is shaky | |
1070 | * logic as a failure to make progress could be due to anything from | |
1071 | * writeback to a slow device to excessive references pages at the tail | |
1072 | * of the inactive LRU. | |
1073 | */ | |
1074 | switch(reason) { | |
1075 | case VMSCAN_THROTTLE_WRITEBACK: | |
1076 | timeout = HZ/10; | |
1077 | ||
1078 | if (atomic_inc_return(&pgdat->nr_writeback_throttled) == 1) { | |
1079 | WRITE_ONCE(pgdat->nr_reclaim_start, | |
1080 | node_page_state(pgdat, NR_THROTTLED_WRITTEN)); | |
1081 | } | |
1082 | ||
1083 | break; | |
1b4e3f26 MG |
1084 | case VMSCAN_THROTTLE_CONGESTED: |
1085 | fallthrough; | |
c3f4a9a2 | 1086 | case VMSCAN_THROTTLE_NOPROGRESS: |
1b4e3f26 MG |
1087 | if (skip_throttle_noprogress(pgdat)) { |
1088 | cond_resched(); | |
1089 | return; | |
1090 | } | |
1091 | ||
1092 | timeout = 1; | |
1093 | ||
c3f4a9a2 MG |
1094 | break; |
1095 | case VMSCAN_THROTTLE_ISOLATED: | |
1096 | timeout = HZ/50; | |
1097 | break; | |
1098 | default: | |
1099 | WARN_ON_ONCE(1); | |
1100 | timeout = HZ; | |
1101 | break; | |
8cd7c588 MG |
1102 | } |
1103 | ||
1104 | prepare_to_wait(wqh, &wait, TASK_UNINTERRUPTIBLE); | |
1105 | ret = schedule_timeout(timeout); | |
1106 | finish_wait(wqh, &wait); | |
d818fca1 | 1107 | |
c3f4a9a2 | 1108 | if (reason == VMSCAN_THROTTLE_WRITEBACK) |
d818fca1 | 1109 | atomic_dec(&pgdat->nr_writeback_throttled); |
8cd7c588 MG |
1110 | |
1111 | trace_mm_vmscan_throttled(pgdat->node_id, jiffies_to_usecs(timeout), | |
1112 | jiffies_to_usecs(timeout - ret), | |
1113 | reason); | |
1114 | } | |
1115 | ||
1116 | /* | |
1117 | * Account for pages written if tasks are throttled waiting on dirty | |
1118 | * pages to clean. If enough pages have been cleaned since throttling | |
1119 | * started then wakeup the throttled tasks. | |
1120 | */ | |
512b7931 | 1121 | void __acct_reclaim_writeback(pg_data_t *pgdat, struct folio *folio, |
8cd7c588 MG |
1122 | int nr_throttled) |
1123 | { | |
1124 | unsigned long nr_written; | |
1125 | ||
512b7931 | 1126 | node_stat_add_folio(folio, NR_THROTTLED_WRITTEN); |
8cd7c588 MG |
1127 | |
1128 | /* | |
1129 | * This is an inaccurate read as the per-cpu deltas may not | |
1130 | * be synchronised. However, given that the system is | |
1131 | * writeback throttled, it is not worth taking the penalty | |
1132 | * of getting an accurate count. At worst, the throttle | |
1133 | * timeout guarantees forward progress. | |
1134 | */ | |
1135 | nr_written = node_page_state(pgdat, NR_THROTTLED_WRITTEN) - | |
1136 | READ_ONCE(pgdat->nr_reclaim_start); | |
1137 | ||
1138 | if (nr_written > SWAP_CLUSTER_MAX * nr_throttled) | |
1139 | wake_up(&pgdat->reclaim_wait[VMSCAN_THROTTLE_WRITEBACK]); | |
1140 | } | |
1141 | ||
04e62a29 CL |
1142 | /* possible outcome of pageout() */ |
1143 | typedef enum { | |
1144 | /* failed to write page out, page is locked */ | |
1145 | PAGE_KEEP, | |
1146 | /* move page to the active list, page is locked */ | |
1147 | PAGE_ACTIVATE, | |
1148 | /* page has been sent to the disk successfully, page is unlocked */ | |
1149 | PAGE_SUCCESS, | |
1150 | /* page is clean and locked */ | |
1151 | PAGE_CLEAN, | |
1152 | } pageout_t; | |
1153 | ||
1da177e4 | 1154 | /* |
1742f19f AM |
1155 | * pageout is called by shrink_page_list() for each dirty page. |
1156 | * Calls ->writepage(). | |
1da177e4 | 1157 | */ |
e0cd5e7f | 1158 | static pageout_t pageout(struct folio *folio, struct address_space *mapping) |
1da177e4 LT |
1159 | { |
1160 | /* | |
e0cd5e7f | 1161 | * If the folio is dirty, only perform writeback if that write |
1da177e4 LT |
1162 | * will be non-blocking. To prevent this allocation from being |
1163 | * stalled by pagecache activity. But note that there may be | |
1164 | * stalls if we need to run get_block(). We could test | |
1165 | * PagePrivate for that. | |
1166 | * | |
8174202b | 1167 | * If this process is currently in __generic_file_write_iter() against |
e0cd5e7f | 1168 | * this folio's queue, we can perform writeback even if that |
1da177e4 LT |
1169 | * will block. |
1170 | * | |
e0cd5e7f | 1171 | * If the folio is swapcache, write it back even if that would |
1da177e4 LT |
1172 | * block, for some throttling. This happens by accident, because |
1173 | * swap_backing_dev_info is bust: it doesn't reflect the | |
1174 | * congestion state of the swapdevs. Easy to fix, if needed. | |
1da177e4 | 1175 | */ |
e0cd5e7f | 1176 | if (!is_page_cache_freeable(folio)) |
1da177e4 LT |
1177 | return PAGE_KEEP; |
1178 | if (!mapping) { | |
1179 | /* | |
e0cd5e7f MWO |
1180 | * Some data journaling orphaned folios can have |
1181 | * folio->mapping == NULL while being dirty with clean buffers. | |
1da177e4 | 1182 | */ |
e0cd5e7f MWO |
1183 | if (folio_test_private(folio)) { |
1184 | if (try_to_free_buffers(&folio->page)) { | |
1185 | folio_clear_dirty(folio); | |
1186 | pr_info("%s: orphaned folio\n", __func__); | |
1da177e4 LT |
1187 | return PAGE_CLEAN; |
1188 | } | |
1189 | } | |
1190 | return PAGE_KEEP; | |
1191 | } | |
1192 | if (mapping->a_ops->writepage == NULL) | |
1193 | return PAGE_ACTIVATE; | |
1da177e4 | 1194 | |
e0cd5e7f | 1195 | if (folio_clear_dirty_for_io(folio)) { |
1da177e4 LT |
1196 | int res; |
1197 | struct writeback_control wbc = { | |
1198 | .sync_mode = WB_SYNC_NONE, | |
1199 | .nr_to_write = SWAP_CLUSTER_MAX, | |
111ebb6e OH |
1200 | .range_start = 0, |
1201 | .range_end = LLONG_MAX, | |
1da177e4 LT |
1202 | .for_reclaim = 1, |
1203 | }; | |
1204 | ||
e0cd5e7f MWO |
1205 | folio_set_reclaim(folio); |
1206 | res = mapping->a_ops->writepage(&folio->page, &wbc); | |
1da177e4 | 1207 | if (res < 0) |
e0cd5e7f | 1208 | handle_write_error(mapping, folio, res); |
994fc28c | 1209 | if (res == AOP_WRITEPAGE_ACTIVATE) { |
e0cd5e7f | 1210 | folio_clear_reclaim(folio); |
1da177e4 LT |
1211 | return PAGE_ACTIVATE; |
1212 | } | |
c661b078 | 1213 | |
e0cd5e7f | 1214 | if (!folio_test_writeback(folio)) { |
1da177e4 | 1215 | /* synchronous write or broken a_ops? */ |
e0cd5e7f | 1216 | folio_clear_reclaim(folio); |
1da177e4 | 1217 | } |
e0cd5e7f MWO |
1218 | trace_mm_vmscan_write_folio(folio); |
1219 | node_stat_add_folio(folio, NR_VMSCAN_WRITE); | |
1da177e4 LT |
1220 | return PAGE_SUCCESS; |
1221 | } | |
1222 | ||
1223 | return PAGE_CLEAN; | |
1224 | } | |
1225 | ||
a649fd92 | 1226 | /* |
e286781d NP |
1227 | * Same as remove_mapping, but if the page is removed from the mapping, it |
1228 | * gets returned with a refcount of 0. | |
a649fd92 | 1229 | */ |
be7c07d6 | 1230 | static int __remove_mapping(struct address_space *mapping, struct folio *folio, |
b910718a | 1231 | bool reclaimed, struct mem_cgroup *target_memcg) |
49d2e9cc | 1232 | { |
bd4c82c2 | 1233 | int refcount; |
aae466b0 | 1234 | void *shadow = NULL; |
c4843a75 | 1235 | |
be7c07d6 MWO |
1236 | BUG_ON(!folio_test_locked(folio)); |
1237 | BUG_ON(mapping != folio_mapping(folio)); | |
49d2e9cc | 1238 | |
be7c07d6 | 1239 | if (!folio_test_swapcache(folio)) |
51b8c1fe | 1240 | spin_lock(&mapping->host->i_lock); |
30472509 | 1241 | xa_lock_irq(&mapping->i_pages); |
49d2e9cc | 1242 | /* |
0fd0e6b0 NP |
1243 | * The non racy check for a busy page. |
1244 | * | |
1245 | * Must be careful with the order of the tests. When someone has | |
1246 | * a ref to the page, it may be possible that they dirty it then | |
1247 | * drop the reference. So if PageDirty is tested before page_count | |
1248 | * here, then the following race may occur: | |
1249 | * | |
1250 | * get_user_pages(&page); | |
1251 | * [user mapping goes away] | |
1252 | * write_to(page); | |
1253 | * !PageDirty(page) [good] | |
1254 | * SetPageDirty(page); | |
1255 | * put_page(page); | |
1256 | * !page_count(page) [good, discard it] | |
1257 | * | |
1258 | * [oops, our write_to data is lost] | |
1259 | * | |
1260 | * Reversing the order of the tests ensures such a situation cannot | |
1261 | * escape unnoticed. The smp_rmb is needed to ensure the page->flags | |
0139aa7b | 1262 | * load is not satisfied before that of page->_refcount. |
0fd0e6b0 NP |
1263 | * |
1264 | * Note that if SetPageDirty is always performed via set_page_dirty, | |
b93b0163 | 1265 | * and thus under the i_pages lock, then this ordering is not required. |
49d2e9cc | 1266 | */ |
be7c07d6 MWO |
1267 | refcount = 1 + folio_nr_pages(folio); |
1268 | if (!folio_ref_freeze(folio, refcount)) | |
49d2e9cc | 1269 | goto cannot_free; |
1c4c3b99 | 1270 | /* note: atomic_cmpxchg in page_ref_freeze provides the smp_rmb */ |
be7c07d6 MWO |
1271 | if (unlikely(folio_test_dirty(folio))) { |
1272 | folio_ref_unfreeze(folio, refcount); | |
49d2e9cc | 1273 | goto cannot_free; |
e286781d | 1274 | } |
49d2e9cc | 1275 | |
be7c07d6 MWO |
1276 | if (folio_test_swapcache(folio)) { |
1277 | swp_entry_t swap = folio_swap_entry(folio); | |
3ecb0087 | 1278 | mem_cgroup_swapout(folio, swap); |
aae466b0 | 1279 | if (reclaimed && !mapping_exiting(mapping)) |
8927f647 | 1280 | shadow = workingset_eviction(folio, target_memcg); |
be7c07d6 | 1281 | __delete_from_swap_cache(&folio->page, swap, shadow); |
30472509 | 1282 | xa_unlock_irq(&mapping->i_pages); |
be7c07d6 | 1283 | put_swap_page(&folio->page, swap); |
e286781d | 1284 | } else { |
6072d13c LT |
1285 | void (*freepage)(struct page *); |
1286 | ||
1287 | freepage = mapping->a_ops->freepage; | |
a528910e JW |
1288 | /* |
1289 | * Remember a shadow entry for reclaimed file cache in | |
1290 | * order to detect refaults, thus thrashing, later on. | |
1291 | * | |
1292 | * But don't store shadows in an address space that is | |
238c3046 | 1293 | * already exiting. This is not just an optimization, |
a528910e JW |
1294 | * inode reclaim needs to empty out the radix tree or |
1295 | * the nodes are lost. Don't plant shadows behind its | |
1296 | * back. | |
f9fe48be RZ |
1297 | * |
1298 | * We also don't store shadows for DAX mappings because the | |
1299 | * only page cache pages found in these are zero pages | |
1300 | * covering holes, and because we don't want to mix DAX | |
1301 | * exceptional entries and shadow exceptional entries in the | |
b93b0163 | 1302 | * same address_space. |
a528910e | 1303 | */ |
be7c07d6 | 1304 | if (reclaimed && folio_is_file_lru(folio) && |
f9fe48be | 1305 | !mapping_exiting(mapping) && !dax_mapping(mapping)) |
8927f647 MWO |
1306 | shadow = workingset_eviction(folio, target_memcg); |
1307 | __filemap_remove_folio(folio, shadow); | |
30472509 | 1308 | xa_unlock_irq(&mapping->i_pages); |
51b8c1fe JW |
1309 | if (mapping_shrinkable(mapping)) |
1310 | inode_add_lru(mapping->host); | |
1311 | spin_unlock(&mapping->host->i_lock); | |
6072d13c LT |
1312 | |
1313 | if (freepage != NULL) | |
be7c07d6 | 1314 | freepage(&folio->page); |
49d2e9cc CL |
1315 | } |
1316 | ||
49d2e9cc CL |
1317 | return 1; |
1318 | ||
1319 | cannot_free: | |
30472509 | 1320 | xa_unlock_irq(&mapping->i_pages); |
be7c07d6 | 1321 | if (!folio_test_swapcache(folio)) |
51b8c1fe | 1322 | spin_unlock(&mapping->host->i_lock); |
49d2e9cc CL |
1323 | return 0; |
1324 | } | |
1325 | ||
5100da38 MWO |
1326 | /** |
1327 | * remove_mapping() - Attempt to remove a folio from its mapping. | |
1328 | * @mapping: The address space. | |
1329 | * @folio: The folio to remove. | |
1330 | * | |
1331 | * If the folio is dirty, under writeback or if someone else has a ref | |
1332 | * on it, removal will fail. | |
1333 | * Return: The number of pages removed from the mapping. 0 if the folio | |
1334 | * could not be removed. | |
1335 | * Context: The caller should have a single refcount on the folio and | |
1336 | * hold its lock. | |
e286781d | 1337 | */ |
5100da38 | 1338 | long remove_mapping(struct address_space *mapping, struct folio *folio) |
e286781d | 1339 | { |
be7c07d6 | 1340 | if (__remove_mapping(mapping, folio, false, NULL)) { |
e286781d | 1341 | /* |
5100da38 | 1342 | * Unfreezing the refcount with 1 effectively |
e286781d NP |
1343 | * drops the pagecache ref for us without requiring another |
1344 | * atomic operation. | |
1345 | */ | |
be7c07d6 | 1346 | folio_ref_unfreeze(folio, 1); |
5100da38 | 1347 | return folio_nr_pages(folio); |
e286781d NP |
1348 | } |
1349 | return 0; | |
1350 | } | |
1351 | ||
894bc310 | 1352 | /** |
ca6d60f3 MWO |
1353 | * folio_putback_lru - Put previously isolated folio onto appropriate LRU list. |
1354 | * @folio: Folio to be returned to an LRU list. | |
894bc310 | 1355 | * |
ca6d60f3 MWO |
1356 | * Add previously isolated @folio to appropriate LRU list. |
1357 | * The folio may still be unevictable for other reasons. | |
894bc310 | 1358 | * |
ca6d60f3 | 1359 | * Context: lru_lock must not be held, interrupts must be enabled. |
894bc310 | 1360 | */ |
ca6d60f3 | 1361 | void folio_putback_lru(struct folio *folio) |
894bc310 | 1362 | { |
ca6d60f3 MWO |
1363 | folio_add_lru(folio); |
1364 | folio_put(folio); /* drop ref from isolate */ | |
894bc310 LS |
1365 | } |
1366 | ||
dfc8d636 JW |
1367 | enum page_references { |
1368 | PAGEREF_RECLAIM, | |
1369 | PAGEREF_RECLAIM_CLEAN, | |
64574746 | 1370 | PAGEREF_KEEP, |
dfc8d636 JW |
1371 | PAGEREF_ACTIVATE, |
1372 | }; | |
1373 | ||
d92013d1 | 1374 | static enum page_references folio_check_references(struct folio *folio, |
dfc8d636 JW |
1375 | struct scan_control *sc) |
1376 | { | |
d92013d1 | 1377 | int referenced_ptes, referenced_folio; |
dfc8d636 | 1378 | unsigned long vm_flags; |
dfc8d636 | 1379 | |
b3ac0413 MWO |
1380 | referenced_ptes = folio_referenced(folio, 1, sc->target_mem_cgroup, |
1381 | &vm_flags); | |
d92013d1 | 1382 | referenced_folio = folio_test_clear_referenced(folio); |
dfc8d636 | 1383 | |
dfc8d636 | 1384 | /* |
d92013d1 MWO |
1385 | * The supposedly reclaimable folio was found to be in a VM_LOCKED vma. |
1386 | * Let the folio, now marked Mlocked, be moved to the unevictable list. | |
dfc8d636 JW |
1387 | */ |
1388 | if (vm_flags & VM_LOCKED) | |
47d4f3ee | 1389 | return PAGEREF_ACTIVATE; |
dfc8d636 | 1390 | |
64574746 | 1391 | if (referenced_ptes) { |
64574746 | 1392 | /* |
d92013d1 | 1393 | * All mapped folios start out with page table |
64574746 | 1394 | * references from the instantiating fault, so we need |
9030fb0b | 1395 | * to look twice if a mapped file/anon folio is used more |
64574746 JW |
1396 | * than once. |
1397 | * | |
1398 | * Mark it and spare it for another trip around the | |
1399 | * inactive list. Another page table reference will | |
1400 | * lead to its activation. | |
1401 | * | |
d92013d1 MWO |
1402 | * Note: the mark is set for activated folios as well |
1403 | * so that recently deactivated but used folios are | |
64574746 JW |
1404 | * quickly recovered. |
1405 | */ | |
d92013d1 | 1406 | folio_set_referenced(folio); |
64574746 | 1407 | |
d92013d1 | 1408 | if (referenced_folio || referenced_ptes > 1) |
64574746 JW |
1409 | return PAGEREF_ACTIVATE; |
1410 | ||
c909e993 | 1411 | /* |
d92013d1 | 1412 | * Activate file-backed executable folios after first usage. |
c909e993 | 1413 | */ |
d92013d1 | 1414 | if ((vm_flags & VM_EXEC) && !folio_test_swapbacked(folio)) |
c909e993 KK |
1415 | return PAGEREF_ACTIVATE; |
1416 | ||
64574746 JW |
1417 | return PAGEREF_KEEP; |
1418 | } | |
dfc8d636 | 1419 | |
d92013d1 MWO |
1420 | /* Reclaim if clean, defer dirty folios to writeback */ |
1421 | if (referenced_folio && !folio_test_swapbacked(folio)) | |
64574746 JW |
1422 | return PAGEREF_RECLAIM_CLEAN; |
1423 | ||
1424 | return PAGEREF_RECLAIM; | |
dfc8d636 JW |
1425 | } |
1426 | ||
e2be15f6 | 1427 | /* Check if a page is dirty or under writeback */ |
e20c41b1 | 1428 | static void folio_check_dirty_writeback(struct folio *folio, |
e2be15f6 MG |
1429 | bool *dirty, bool *writeback) |
1430 | { | |
b4597226 MG |
1431 | struct address_space *mapping; |
1432 | ||
e2be15f6 MG |
1433 | /* |
1434 | * Anonymous pages are not handled by flushers and must be written | |
1435 | * from reclaim context. Do not stall reclaim based on them | |
1436 | */ | |
e20c41b1 MWO |
1437 | if (!folio_is_file_lru(folio) || |
1438 | (folio_test_anon(folio) && !folio_test_swapbacked(folio))) { | |
e2be15f6 MG |
1439 | *dirty = false; |
1440 | *writeback = false; | |
1441 | return; | |
1442 | } | |
1443 | ||
e20c41b1 MWO |
1444 | /* By default assume that the folio flags are accurate */ |
1445 | *dirty = folio_test_dirty(folio); | |
1446 | *writeback = folio_test_writeback(folio); | |
b4597226 MG |
1447 | |
1448 | /* Verify dirty/writeback state if the filesystem supports it */ | |
e20c41b1 | 1449 | if (!folio_test_private(folio)) |
b4597226 MG |
1450 | return; |
1451 | ||
e20c41b1 | 1452 | mapping = folio_mapping(folio); |
b4597226 | 1453 | if (mapping && mapping->a_ops->is_dirty_writeback) |
e20c41b1 | 1454 | mapping->a_ops->is_dirty_writeback(&folio->page, dirty, writeback); |
e2be15f6 MG |
1455 | } |
1456 | ||
26aa2d19 DH |
1457 | static struct page *alloc_demote_page(struct page *page, unsigned long node) |
1458 | { | |
1459 | struct migration_target_control mtc = { | |
1460 | /* | |
1461 | * Allocate from 'node', or fail quickly and quietly. | |
1462 | * When this happens, 'page' will likely just be discarded | |
1463 | * instead of migrated. | |
1464 | */ | |
1465 | .gfp_mask = (GFP_HIGHUSER_MOVABLE & ~__GFP_RECLAIM) | | |
1466 | __GFP_THISNODE | __GFP_NOWARN | | |
1467 | __GFP_NOMEMALLOC | GFP_NOWAIT, | |
1468 | .nid = node | |
1469 | }; | |
1470 | ||
1471 | return alloc_migration_target(page, (unsigned long)&mtc); | |
1472 | } | |
1473 | ||
1474 | /* | |
1475 | * Take pages on @demote_list and attempt to demote them to | |
1476 | * another node. Pages which are not demoted are left on | |
1477 | * @demote_pages. | |
1478 | */ | |
1479 | static unsigned int demote_page_list(struct list_head *demote_pages, | |
1480 | struct pglist_data *pgdat) | |
1481 | { | |
1482 | int target_nid = next_demotion_node(pgdat->node_id); | |
1483 | unsigned int nr_succeeded; | |
26aa2d19 DH |
1484 | |
1485 | if (list_empty(demote_pages)) | |
1486 | return 0; | |
1487 | ||
1488 | if (target_nid == NUMA_NO_NODE) | |
1489 | return 0; | |
1490 | ||
1491 | /* Demotion ignores all cpuset and mempolicy settings */ | |
cb75463c | 1492 | migrate_pages(demote_pages, alloc_demote_page, NULL, |
26aa2d19 DH |
1493 | target_nid, MIGRATE_ASYNC, MR_DEMOTION, |
1494 | &nr_succeeded); | |
1495 | ||
668e4147 YS |
1496 | if (current_is_kswapd()) |
1497 | __count_vm_events(PGDEMOTE_KSWAPD, nr_succeeded); | |
1498 | else | |
1499 | __count_vm_events(PGDEMOTE_DIRECT, nr_succeeded); | |
1500 | ||
26aa2d19 DH |
1501 | return nr_succeeded; |
1502 | } | |
1503 | ||
1da177e4 | 1504 | /* |
1742f19f | 1505 | * shrink_page_list() returns the number of reclaimed pages |
1da177e4 | 1506 | */ |
730ec8c0 MS |
1507 | static unsigned int shrink_page_list(struct list_head *page_list, |
1508 | struct pglist_data *pgdat, | |
1509 | struct scan_control *sc, | |
730ec8c0 MS |
1510 | struct reclaim_stat *stat, |
1511 | bool ignore_references) | |
1da177e4 LT |
1512 | { |
1513 | LIST_HEAD(ret_pages); | |
abe4c3b5 | 1514 | LIST_HEAD(free_pages); |
26aa2d19 | 1515 | LIST_HEAD(demote_pages); |
730ec8c0 MS |
1516 | unsigned int nr_reclaimed = 0; |
1517 | unsigned int pgactivate = 0; | |
26aa2d19 | 1518 | bool do_demote_pass; |
1da177e4 | 1519 | |
060f005f | 1520 | memset(stat, 0, sizeof(*stat)); |
1da177e4 | 1521 | cond_resched(); |
26aa2d19 | 1522 | do_demote_pass = can_demote(pgdat->node_id, sc); |
1da177e4 | 1523 | |
26aa2d19 | 1524 | retry: |
1da177e4 LT |
1525 | while (!list_empty(page_list)) { |
1526 | struct address_space *mapping; | |
1527 | struct page *page; | |
be7c07d6 | 1528 | struct folio *folio; |
8940b34a | 1529 | enum page_references references = PAGEREF_RECLAIM; |
4b793062 | 1530 | bool dirty, writeback, may_enter_fs; |
98879b3b | 1531 | unsigned int nr_pages; |
1da177e4 LT |
1532 | |
1533 | cond_resched(); | |
1534 | ||
be7c07d6 MWO |
1535 | folio = lru_to_folio(page_list); |
1536 | list_del(&folio->lru); | |
1537 | page = &folio->page; | |
1da177e4 | 1538 | |
529ae9aa | 1539 | if (!trylock_page(page)) |
1da177e4 LT |
1540 | goto keep; |
1541 | ||
309381fe | 1542 | VM_BUG_ON_PAGE(PageActive(page), page); |
1da177e4 | 1543 | |
d8c6546b | 1544 | nr_pages = compound_nr(page); |
98879b3b YS |
1545 | |
1546 | /* Account the number of base pages even though THP */ | |
1547 | sc->nr_scanned += nr_pages; | |
80e43426 | 1548 | |
39b5f29a | 1549 | if (unlikely(!page_evictable(page))) |
ad6b6704 | 1550 | goto activate_locked; |
894bc310 | 1551 | |
a6dc60f8 | 1552 | if (!sc->may_unmap && page_mapped(page)) |
80e43426 CL |
1553 | goto keep_locked; |
1554 | ||
c661b078 AW |
1555 | may_enter_fs = (sc->gfp_mask & __GFP_FS) || |
1556 | (PageSwapCache(page) && (sc->gfp_mask & __GFP_IO)); | |
1557 | ||
e2be15f6 | 1558 | /* |
894befec | 1559 | * The number of dirty pages determines if a node is marked |
8cd7c588 MG |
1560 | * reclaim_congested. kswapd will stall and start writing |
1561 | * pages if the tail of the LRU is all dirty unqueued pages. | |
e2be15f6 | 1562 | */ |
e20c41b1 | 1563 | folio_check_dirty_writeback(folio, &dirty, &writeback); |
e2be15f6 | 1564 | if (dirty || writeback) |
c79b7b96 | 1565 | stat->nr_dirty += nr_pages; |
e2be15f6 MG |
1566 | |
1567 | if (dirty && !writeback) | |
c79b7b96 | 1568 | stat->nr_unqueued_dirty += nr_pages; |
e2be15f6 | 1569 | |
d04e8acd MG |
1570 | /* |
1571 | * Treat this page as congested if the underlying BDI is or if | |
1572 | * pages are cycling through the LRU so quickly that the | |
1573 | * pages marked for immediate reclaim are making it to the | |
1574 | * end of the LRU a second time. | |
1575 | */ | |
e2be15f6 | 1576 | mapping = page_mapping(page); |
fe55d563 | 1577 | if (writeback && PageReclaim(page)) |
c79b7b96 | 1578 | stat->nr_congested += nr_pages; |
e2be15f6 | 1579 | |
283aba9f MG |
1580 | /* |
1581 | * If a page at the tail of the LRU is under writeback, there | |
1582 | * are three cases to consider. | |
1583 | * | |
1584 | * 1) If reclaim is encountering an excessive number of pages | |
1585 | * under writeback and this page is both under writeback and | |
1586 | * PageReclaim then it indicates that pages are being queued | |
1587 | * for IO but are being recycled through the LRU before the | |
1588 | * IO can complete. Waiting on the page itself risks an | |
1589 | * indefinite stall if it is impossible to writeback the | |
1590 | * page due to IO error or disconnected storage so instead | |
b1a6f21e MG |
1591 | * note that the LRU is being scanned too quickly and the |
1592 | * caller can stall after page list has been processed. | |
283aba9f | 1593 | * |
97c9341f | 1594 | * 2) Global or new memcg reclaim encounters a page that is |
ecf5fc6e MH |
1595 | * not marked for immediate reclaim, or the caller does not |
1596 | * have __GFP_FS (or __GFP_IO if it's simply going to swap, | |
1597 | * not to fs). In this case mark the page for immediate | |
97c9341f | 1598 | * reclaim and continue scanning. |
283aba9f | 1599 | * |
ecf5fc6e MH |
1600 | * Require may_enter_fs because we would wait on fs, which |
1601 | * may not have submitted IO yet. And the loop driver might | |
283aba9f MG |
1602 | * enter reclaim, and deadlock if it waits on a page for |
1603 | * which it is needed to do the write (loop masks off | |
1604 | * __GFP_IO|__GFP_FS for this reason); but more thought | |
1605 | * would probably show more reasons. | |
1606 | * | |
7fadc820 | 1607 | * 3) Legacy memcg encounters a page that is already marked |
283aba9f MG |
1608 | * PageReclaim. memcg does not have any dirty pages |
1609 | * throttling so we could easily OOM just because too many | |
1610 | * pages are in writeback and there is nothing else to | |
1611 | * reclaim. Wait for the writeback to complete. | |
c55e8d03 JW |
1612 | * |
1613 | * In cases 1) and 2) we activate the pages to get them out of | |
1614 | * the way while we continue scanning for clean pages on the | |
1615 | * inactive list and refilling from the active list. The | |
1616 | * observation here is that waiting for disk writes is more | |
1617 | * expensive than potentially causing reloads down the line. | |
1618 | * Since they're marked for immediate reclaim, they won't put | |
1619 | * memory pressure on the cache working set any longer than it | |
1620 | * takes to write them to disk. | |
283aba9f | 1621 | */ |
c661b078 | 1622 | if (PageWriteback(page)) { |
283aba9f MG |
1623 | /* Case 1 above */ |
1624 | if (current_is_kswapd() && | |
1625 | PageReclaim(page) && | |
599d0c95 | 1626 | test_bit(PGDAT_WRITEBACK, &pgdat->flags)) { |
c79b7b96 | 1627 | stat->nr_immediate += nr_pages; |
c55e8d03 | 1628 | goto activate_locked; |
283aba9f MG |
1629 | |
1630 | /* Case 2 above */ | |
b5ead35e | 1631 | } else if (writeback_throttling_sane(sc) || |
ecf5fc6e | 1632 | !PageReclaim(page) || !may_enter_fs) { |
c3b94f44 HD |
1633 | /* |
1634 | * This is slightly racy - end_page_writeback() | |
1635 | * might have just cleared PageReclaim, then | |
1636 | * setting PageReclaim here end up interpreted | |
1637 | * as PageReadahead - but that does not matter | |
1638 | * enough to care. What we do want is for this | |
1639 | * page to have PageReclaim set next time memcg | |
1640 | * reclaim reaches the tests above, so it will | |
1641 | * then wait_on_page_writeback() to avoid OOM; | |
1642 | * and it's also appropriate in global reclaim. | |
1643 | */ | |
1644 | SetPageReclaim(page); | |
c79b7b96 | 1645 | stat->nr_writeback += nr_pages; |
c55e8d03 | 1646 | goto activate_locked; |
283aba9f MG |
1647 | |
1648 | /* Case 3 above */ | |
1649 | } else { | |
7fadc820 | 1650 | unlock_page(page); |
283aba9f | 1651 | wait_on_page_writeback(page); |
7fadc820 HD |
1652 | /* then go back and try same page again */ |
1653 | list_add_tail(&page->lru, page_list); | |
1654 | continue; | |
e62e384e | 1655 | } |
c661b078 | 1656 | } |
1da177e4 | 1657 | |
8940b34a | 1658 | if (!ignore_references) |
d92013d1 | 1659 | references = folio_check_references(folio, sc); |
02c6de8d | 1660 | |
dfc8d636 JW |
1661 | switch (references) { |
1662 | case PAGEREF_ACTIVATE: | |
1da177e4 | 1663 | goto activate_locked; |
64574746 | 1664 | case PAGEREF_KEEP: |
98879b3b | 1665 | stat->nr_ref_keep += nr_pages; |
64574746 | 1666 | goto keep_locked; |
dfc8d636 JW |
1667 | case PAGEREF_RECLAIM: |
1668 | case PAGEREF_RECLAIM_CLEAN: | |
1669 | ; /* try to reclaim the page below */ | |
1670 | } | |
1da177e4 | 1671 | |
26aa2d19 DH |
1672 | /* |
1673 | * Before reclaiming the page, try to relocate | |
1674 | * its contents to another node. | |
1675 | */ | |
1676 | if (do_demote_pass && | |
1677 | (thp_migration_supported() || !PageTransHuge(page))) { | |
1678 | list_add(&page->lru, &demote_pages); | |
1679 | unlock_page(page); | |
1680 | continue; | |
1681 | } | |
1682 | ||
1da177e4 LT |
1683 | /* |
1684 | * Anonymous process memory has backing store? | |
1685 | * Try to allocate it some swap space here. | |
802a3a92 | 1686 | * Lazyfree page could be freed directly |
1da177e4 | 1687 | */ |
bd4c82c2 HY |
1688 | if (PageAnon(page) && PageSwapBacked(page)) { |
1689 | if (!PageSwapCache(page)) { | |
1690 | if (!(sc->gfp_mask & __GFP_IO)) | |
1691 | goto keep_locked; | |
d4b4084a | 1692 | if (folio_maybe_dma_pinned(folio)) |
feb889fb | 1693 | goto keep_locked; |
bd4c82c2 HY |
1694 | if (PageTransHuge(page)) { |
1695 | /* cannot split THP, skip it */ | |
d4b4084a | 1696 | if (!can_split_folio(folio, NULL)) |
bd4c82c2 HY |
1697 | goto activate_locked; |
1698 | /* | |
1699 | * Split pages without a PMD map right | |
1700 | * away. Chances are some or all of the | |
1701 | * tail pages can be freed without IO. | |
1702 | */ | |
d4b4084a | 1703 | if (!folio_entire_mapcount(folio) && |
346cf613 MWO |
1704 | split_folio_to_list(folio, |
1705 | page_list)) | |
bd4c82c2 HY |
1706 | goto activate_locked; |
1707 | } | |
1708 | if (!add_to_swap(page)) { | |
1709 | if (!PageTransHuge(page)) | |
98879b3b | 1710 | goto activate_locked_split; |
bd4c82c2 | 1711 | /* Fallback to swap normal pages */ |
346cf613 MWO |
1712 | if (split_folio_to_list(folio, |
1713 | page_list)) | |
bd4c82c2 | 1714 | goto activate_locked; |
fe490cc0 HY |
1715 | #ifdef CONFIG_TRANSPARENT_HUGEPAGE |
1716 | count_vm_event(THP_SWPOUT_FALLBACK); | |
1717 | #endif | |
bd4c82c2 | 1718 | if (!add_to_swap(page)) |
98879b3b | 1719 | goto activate_locked_split; |
bd4c82c2 | 1720 | } |
0f074658 | 1721 | |
4b793062 | 1722 | may_enter_fs = true; |
1da177e4 | 1723 | |
bd4c82c2 HY |
1724 | /* Adding to swap updated mapping */ |
1725 | mapping = page_mapping(page); | |
1726 | } | |
820c4e2e MWO |
1727 | } else if (PageSwapBacked(page) && PageTransHuge(page)) { |
1728 | /* Split shmem THP */ | |
346cf613 | 1729 | if (split_folio_to_list(folio, page_list)) |
7751b2da | 1730 | goto keep_locked; |
e2be15f6 | 1731 | } |
1da177e4 | 1732 | |
98879b3b YS |
1733 | /* |
1734 | * THP may get split above, need minus tail pages and update | |
1735 | * nr_pages to avoid accounting tail pages twice. | |
1736 | * | |
1737 | * The tail pages that are added into swap cache successfully | |
1738 | * reach here. | |
1739 | */ | |
1740 | if ((nr_pages > 1) && !PageTransHuge(page)) { | |
1741 | sc->nr_scanned -= (nr_pages - 1); | |
1742 | nr_pages = 1; | |
1743 | } | |
1744 | ||
1da177e4 LT |
1745 | /* |
1746 | * The page is mapped into the page tables of one or more | |
1747 | * processes. Try to unmap it here. | |
1748 | */ | |
802a3a92 | 1749 | if (page_mapped(page)) { |
013339df | 1750 | enum ttu_flags flags = TTU_BATCH_FLUSH; |
1f318a9b | 1751 | bool was_swapbacked = PageSwapBacked(page); |
bd4c82c2 | 1752 | |
343b2888 MWO |
1753 | if (PageTransHuge(page) && |
1754 | thp_order(page) >= HPAGE_PMD_ORDER) | |
bd4c82c2 | 1755 | flags |= TTU_SPLIT_HUGE_PMD; |
1f318a9b | 1756 | |
869f7ee6 | 1757 | try_to_unmap(folio, flags); |
1fb08ac6 | 1758 | if (page_mapped(page)) { |
98879b3b | 1759 | stat->nr_unmap_fail += nr_pages; |
1f318a9b JK |
1760 | if (!was_swapbacked && PageSwapBacked(page)) |
1761 | stat->nr_lazyfree_fail += nr_pages; | |
1da177e4 | 1762 | goto activate_locked; |
1da177e4 LT |
1763 | } |
1764 | } | |
1765 | ||
1766 | if (PageDirty(page)) { | |
ee72886d | 1767 | /* |
4eda4823 JW |
1768 | * Only kswapd can writeback filesystem pages |
1769 | * to avoid risk of stack overflow. But avoid | |
1770 | * injecting inefficient single-page IO into | |
1771 | * flusher writeback as much as possible: only | |
1772 | * write pages when we've encountered many | |
1773 | * dirty pages, and when we've already scanned | |
1774 | * the rest of the LRU for clean pages and see | |
1775 | * the same dirty pages again (PageReclaim). | |
ee72886d | 1776 | */ |
9de4f22a | 1777 | if (page_is_file_lru(page) && |
4eda4823 JW |
1778 | (!current_is_kswapd() || !PageReclaim(page) || |
1779 | !test_bit(PGDAT_DIRTY, &pgdat->flags))) { | |
49ea7eb6 MG |
1780 | /* |
1781 | * Immediately reclaim when written back. | |
1782 | * Similar in principal to deactivate_page() | |
1783 | * except we already have the page isolated | |
1784 | * and know it's dirty | |
1785 | */ | |
c4a25635 | 1786 | inc_node_page_state(page, NR_VMSCAN_IMMEDIATE); |
49ea7eb6 MG |
1787 | SetPageReclaim(page); |
1788 | ||
c55e8d03 | 1789 | goto activate_locked; |
ee72886d MG |
1790 | } |
1791 | ||
dfc8d636 | 1792 | if (references == PAGEREF_RECLAIM_CLEAN) |
1da177e4 | 1793 | goto keep_locked; |
4dd4b920 | 1794 | if (!may_enter_fs) |
1da177e4 | 1795 | goto keep_locked; |
52a8363e | 1796 | if (!sc->may_writepage) |
1da177e4 LT |
1797 | goto keep_locked; |
1798 | ||
d950c947 MG |
1799 | /* |
1800 | * Page is dirty. Flush the TLB if a writable entry | |
1801 | * potentially exists to avoid CPU writes after IO | |
1802 | * starts and then write it out here. | |
1803 | */ | |
1804 | try_to_unmap_flush_dirty(); | |
e0cd5e7f | 1805 | switch (pageout(folio, mapping)) { |
1da177e4 LT |
1806 | case PAGE_KEEP: |
1807 | goto keep_locked; | |
1808 | case PAGE_ACTIVATE: | |
1809 | goto activate_locked; | |
1810 | case PAGE_SUCCESS: | |
c79b7b96 | 1811 | stat->nr_pageout += nr_pages; |
96f8bf4f | 1812 | |
7d3579e8 | 1813 | if (PageWriteback(page)) |
41ac1999 | 1814 | goto keep; |
7d3579e8 | 1815 | if (PageDirty(page)) |
1da177e4 | 1816 | goto keep; |
7d3579e8 | 1817 | |
1da177e4 LT |
1818 | /* |
1819 | * A synchronous write - probably a ramdisk. Go | |
1820 | * ahead and try to reclaim the page. | |
1821 | */ | |
529ae9aa | 1822 | if (!trylock_page(page)) |
1da177e4 LT |
1823 | goto keep; |
1824 | if (PageDirty(page) || PageWriteback(page)) | |
1825 | goto keep_locked; | |
1826 | mapping = page_mapping(page); | |
01359eb2 | 1827 | fallthrough; |
1da177e4 LT |
1828 | case PAGE_CLEAN: |
1829 | ; /* try to free the page below */ | |
1830 | } | |
1831 | } | |
1832 | ||
1833 | /* | |
1834 | * If the page has buffers, try to free the buffer mappings | |
1835 | * associated with this page. If we succeed we try to free | |
1836 | * the page as well. | |
1837 | * | |
1838 | * We do this even if the page is PageDirty(). | |
1839 | * try_to_release_page() does not perform I/O, but it is | |
1840 | * possible for a page to have PageDirty set, but it is actually | |
1841 | * clean (all its buffers are clean). This happens if the | |
1842 | * buffers were written out directly, with submit_bh(). ext3 | |
894bc310 | 1843 | * will do this, as well as the blockdev mapping. |
1da177e4 LT |
1844 | * try_to_release_page() will discover that cleanness and will |
1845 | * drop the buffers and mark the page clean - it can be freed. | |
1846 | * | |
1847 | * Rarely, pages can have buffers and no ->mapping. These are | |
1848 | * the pages which were not successfully invalidated in | |
d12b8951 | 1849 | * truncate_cleanup_page(). We try to drop those buffers here |
1da177e4 LT |
1850 | * and if that worked, and the page is no longer mapped into |
1851 | * process address space (page_count == 1) it can be freed. | |
1852 | * Otherwise, leave the page on the LRU so it is swappable. | |
1853 | */ | |
266cf658 | 1854 | if (page_has_private(page)) { |
1da177e4 LT |
1855 | if (!try_to_release_page(page, sc->gfp_mask)) |
1856 | goto activate_locked; | |
e286781d NP |
1857 | if (!mapping && page_count(page) == 1) { |
1858 | unlock_page(page); | |
1859 | if (put_page_testzero(page)) | |
1860 | goto free_it; | |
1861 | else { | |
1862 | /* | |
1863 | * rare race with speculative reference. | |
1864 | * the speculative reference will free | |
1865 | * this page shortly, so we may | |
1866 | * increment nr_reclaimed here (and | |
1867 | * leave it off the LRU). | |
1868 | */ | |
1869 | nr_reclaimed++; | |
1870 | continue; | |
1871 | } | |
1872 | } | |
1da177e4 LT |
1873 | } |
1874 | ||
802a3a92 SL |
1875 | if (PageAnon(page) && !PageSwapBacked(page)) { |
1876 | /* follow __remove_mapping for reference */ | |
1877 | if (!page_ref_freeze(page, 1)) | |
1878 | goto keep_locked; | |
d17be2d9 ML |
1879 | /* |
1880 | * The page has only one reference left, which is | |
1881 | * from the isolation. After the caller puts the | |
1882 | * page back on lru and drops the reference, the | |
1883 | * page will be freed anyway. It doesn't matter | |
1884 | * which lru it goes. So we don't bother checking | |
1885 | * PageDirty here. | |
1886 | */ | |
802a3a92 | 1887 | count_vm_event(PGLAZYFREED); |
2262185c | 1888 | count_memcg_page_event(page, PGLAZYFREED); |
be7c07d6 | 1889 | } else if (!mapping || !__remove_mapping(mapping, folio, true, |
b910718a | 1890 | sc->target_mem_cgroup)) |
802a3a92 | 1891 | goto keep_locked; |
9a1ea439 HD |
1892 | |
1893 | unlock_page(page); | |
e286781d | 1894 | free_it: |
98879b3b YS |
1895 | /* |
1896 | * THP may get swapped out in a whole, need account | |
1897 | * all base pages. | |
1898 | */ | |
1899 | nr_reclaimed += nr_pages; | |
abe4c3b5 MG |
1900 | |
1901 | /* | |
1902 | * Is there need to periodically free_page_list? It would | |
1903 | * appear not as the counts should be low | |
1904 | */ | |
7ae88534 | 1905 | if (unlikely(PageTransHuge(page))) |
ff45fc3c | 1906 | destroy_compound_page(page); |
7ae88534 | 1907 | else |
bd4c82c2 | 1908 | list_add(&page->lru, &free_pages); |
1da177e4 LT |
1909 | continue; |
1910 | ||
98879b3b YS |
1911 | activate_locked_split: |
1912 | /* | |
1913 | * The tail pages that are failed to add into swap cache | |
1914 | * reach here. Fixup nr_scanned and nr_pages. | |
1915 | */ | |
1916 | if (nr_pages > 1) { | |
1917 | sc->nr_scanned -= (nr_pages - 1); | |
1918 | nr_pages = 1; | |
1919 | } | |
1da177e4 | 1920 | activate_locked: |
68a22394 | 1921 | /* Not a candidate for swapping, so reclaim swap space. */ |
ad6b6704 MK |
1922 | if (PageSwapCache(page) && (mem_cgroup_swap_full(page) || |
1923 | PageMlocked(page))) | |
a2c43eed | 1924 | try_to_free_swap(page); |
309381fe | 1925 | VM_BUG_ON_PAGE(PageActive(page), page); |
ad6b6704 | 1926 | if (!PageMlocked(page)) { |
9de4f22a | 1927 | int type = page_is_file_lru(page); |
ad6b6704 | 1928 | SetPageActive(page); |
98879b3b | 1929 | stat->nr_activate[type] += nr_pages; |
2262185c | 1930 | count_memcg_page_event(page, PGACTIVATE); |
ad6b6704 | 1931 | } |
1da177e4 LT |
1932 | keep_locked: |
1933 | unlock_page(page); | |
1934 | keep: | |
1935 | list_add(&page->lru, &ret_pages); | |
309381fe | 1936 | VM_BUG_ON_PAGE(PageLRU(page) || PageUnevictable(page), page); |
1da177e4 | 1937 | } |
26aa2d19 DH |
1938 | /* 'page_list' is always empty here */ |
1939 | ||
1940 | /* Migrate pages selected for demotion */ | |
1941 | nr_reclaimed += demote_page_list(&demote_pages, pgdat); | |
1942 | /* Pages that could not be demoted are still in @demote_pages */ | |
1943 | if (!list_empty(&demote_pages)) { | |
1944 | /* Pages which failed to demoted go back on @page_list for retry: */ | |
1945 | list_splice_init(&demote_pages, page_list); | |
1946 | do_demote_pass = false; | |
1947 | goto retry; | |
1948 | } | |
abe4c3b5 | 1949 | |
98879b3b YS |
1950 | pgactivate = stat->nr_activate[0] + stat->nr_activate[1]; |
1951 | ||
747db954 | 1952 | mem_cgroup_uncharge_list(&free_pages); |
72b252ae | 1953 | try_to_unmap_flush(); |
2d4894b5 | 1954 | free_unref_page_list(&free_pages); |
abe4c3b5 | 1955 | |
1da177e4 | 1956 | list_splice(&ret_pages, page_list); |
886cf190 | 1957 | count_vm_events(PGACTIVATE, pgactivate); |
060f005f | 1958 | |
05ff5137 | 1959 | return nr_reclaimed; |
1da177e4 LT |
1960 | } |
1961 | ||
730ec8c0 | 1962 | unsigned int reclaim_clean_pages_from_list(struct zone *zone, |
02c6de8d MK |
1963 | struct list_head *page_list) |
1964 | { | |
1965 | struct scan_control sc = { | |
1966 | .gfp_mask = GFP_KERNEL, | |
02c6de8d MK |
1967 | .may_unmap = 1, |
1968 | }; | |
1f318a9b | 1969 | struct reclaim_stat stat; |
730ec8c0 | 1970 | unsigned int nr_reclaimed; |
02c6de8d MK |
1971 | struct page *page, *next; |
1972 | LIST_HEAD(clean_pages); | |
2d2b8d2b | 1973 | unsigned int noreclaim_flag; |
02c6de8d MK |
1974 | |
1975 | list_for_each_entry_safe(page, next, page_list, lru) { | |
ae37c7ff OS |
1976 | if (!PageHuge(page) && page_is_file_lru(page) && |
1977 | !PageDirty(page) && !__PageMovable(page) && | |
1978 | !PageUnevictable(page)) { | |
02c6de8d MK |
1979 | ClearPageActive(page); |
1980 | list_move(&page->lru, &clean_pages); | |
1981 | } | |
1982 | } | |
1983 | ||
2d2b8d2b YZ |
1984 | /* |
1985 | * We should be safe here since we are only dealing with file pages and | |
1986 | * we are not kswapd and therefore cannot write dirty file pages. But | |
1987 | * call memalloc_noreclaim_save() anyway, just in case these conditions | |
1988 | * change in the future. | |
1989 | */ | |
1990 | noreclaim_flag = memalloc_noreclaim_save(); | |
1f318a9b | 1991 | nr_reclaimed = shrink_page_list(&clean_pages, zone->zone_pgdat, &sc, |
013339df | 1992 | &stat, true); |
2d2b8d2b YZ |
1993 | memalloc_noreclaim_restore(noreclaim_flag); |
1994 | ||
02c6de8d | 1995 | list_splice(&clean_pages, page_list); |
2da9f630 NP |
1996 | mod_node_page_state(zone->zone_pgdat, NR_ISOLATED_FILE, |
1997 | -(long)nr_reclaimed); | |
1f318a9b JK |
1998 | /* |
1999 | * Since lazyfree pages are isolated from file LRU from the beginning, | |
2000 | * they will rotate back to anonymous LRU in the end if it failed to | |
2001 | * discard so isolated count will be mismatched. | |
2002 | * Compensate the isolated count for both LRU lists. | |
2003 | */ | |
2004 | mod_node_page_state(zone->zone_pgdat, NR_ISOLATED_ANON, | |
2005 | stat.nr_lazyfree_fail); | |
2006 | mod_node_page_state(zone->zone_pgdat, NR_ISOLATED_FILE, | |
2da9f630 | 2007 | -(long)stat.nr_lazyfree_fail); |
1f318a9b | 2008 | return nr_reclaimed; |
02c6de8d MK |
2009 | } |
2010 | ||
7ee36a14 MG |
2011 | /* |
2012 | * Update LRU sizes after isolating pages. The LRU size updates must | |
55b65a57 | 2013 | * be complete before mem_cgroup_update_lru_size due to a sanity check. |
7ee36a14 MG |
2014 | */ |
2015 | static __always_inline void update_lru_sizes(struct lruvec *lruvec, | |
b4536f0c | 2016 | enum lru_list lru, unsigned long *nr_zone_taken) |
7ee36a14 | 2017 | { |
7ee36a14 MG |
2018 | int zid; |
2019 | ||
7ee36a14 MG |
2020 | for (zid = 0; zid < MAX_NR_ZONES; zid++) { |
2021 | if (!nr_zone_taken[zid]) | |
2022 | continue; | |
2023 | ||
a892cb6b | 2024 | update_lru_size(lruvec, lru, zid, -nr_zone_taken[zid]); |
b4536f0c MH |
2025 | } |
2026 | ||
7ee36a14 MG |
2027 | } |
2028 | ||
f611fab7 | 2029 | /* |
15b44736 HD |
2030 | * Isolating page from the lruvec to fill in @dst list by nr_to_scan times. |
2031 | * | |
2032 | * lruvec->lru_lock is heavily contended. Some of the functions that | |
1da177e4 LT |
2033 | * shrink the lists perform better by taking out a batch of pages |
2034 | * and working on them outside the LRU lock. | |
2035 | * | |
2036 | * For pagecache intensive workloads, this function is the hottest | |
2037 | * spot in the kernel (apart from copy_*_user functions). | |
2038 | * | |
15b44736 | 2039 | * Lru_lock must be held before calling this function. |
1da177e4 | 2040 | * |
791b48b6 | 2041 | * @nr_to_scan: The number of eligible pages to look through on the list. |
5dc35979 | 2042 | * @lruvec: The LRU vector to pull pages from. |
1da177e4 | 2043 | * @dst: The temp list to put pages on to. |
f626012d | 2044 | * @nr_scanned: The number of pages that were scanned. |
fe2c2a10 | 2045 | * @sc: The scan_control struct for this reclaim session |
3cb99451 | 2046 | * @lru: LRU list id for isolating |
1da177e4 LT |
2047 | * |
2048 | * returns how many pages were moved onto *@dst. | |
2049 | */ | |
69e05944 | 2050 | static unsigned long isolate_lru_pages(unsigned long nr_to_scan, |
5dc35979 | 2051 | struct lruvec *lruvec, struct list_head *dst, |
fe2c2a10 | 2052 | unsigned long *nr_scanned, struct scan_control *sc, |
a9e7c39f | 2053 | enum lru_list lru) |
1da177e4 | 2054 | { |
75b00af7 | 2055 | struct list_head *src = &lruvec->lists[lru]; |
69e05944 | 2056 | unsigned long nr_taken = 0; |
599d0c95 | 2057 | unsigned long nr_zone_taken[MAX_NR_ZONES] = { 0 }; |
7cc30fcf | 2058 | unsigned long nr_skipped[MAX_NR_ZONES] = { 0, }; |
3db65812 | 2059 | unsigned long skipped = 0; |
791b48b6 | 2060 | unsigned long scan, total_scan, nr_pages; |
b2e18757 | 2061 | LIST_HEAD(pages_skipped); |
1da177e4 | 2062 | |
98879b3b | 2063 | total_scan = 0; |
791b48b6 | 2064 | scan = 0; |
98879b3b | 2065 | while (scan < nr_to_scan && !list_empty(src)) { |
89f6c88a | 2066 | struct list_head *move_to = src; |
5ad333eb | 2067 | struct page *page; |
5ad333eb | 2068 | |
1da177e4 LT |
2069 | page = lru_to_page(src); |
2070 | prefetchw_prev_lru_page(page, src, flags); | |
2071 | ||
d8c6546b | 2072 | nr_pages = compound_nr(page); |
98879b3b YS |
2073 | total_scan += nr_pages; |
2074 | ||
b2e18757 | 2075 | if (page_zonenum(page) > sc->reclaim_idx) { |
98879b3b | 2076 | nr_skipped[page_zonenum(page)] += nr_pages; |
89f6c88a HD |
2077 | move_to = &pages_skipped; |
2078 | goto move; | |
b2e18757 MG |
2079 | } |
2080 | ||
791b48b6 MK |
2081 | /* |
2082 | * Do not count skipped pages because that makes the function | |
2083 | * return with no isolated pages if the LRU mostly contains | |
2084 | * ineligible pages. This causes the VM to not reclaim any | |
2085 | * pages, triggering a premature OOM. | |
89f6c88a | 2086 | * Account all tail pages of THP. |
791b48b6 | 2087 | */ |
98879b3b | 2088 | scan += nr_pages; |
89f6c88a HD |
2089 | |
2090 | if (!PageLRU(page)) | |
2091 | goto move; | |
2092 | if (!sc->may_unmap && page_mapped(page)) | |
2093 | goto move; | |
2094 | ||
c2135f7c AS |
2095 | /* |
2096 | * Be careful not to clear PageLRU until after we're | |
2097 | * sure the page is not being freed elsewhere -- the | |
2098 | * page release code relies on it. | |
2099 | */ | |
89f6c88a HD |
2100 | if (unlikely(!get_page_unless_zero(page))) |
2101 | goto move; | |
5ad333eb | 2102 | |
c2135f7c AS |
2103 | if (!TestClearPageLRU(page)) { |
2104 | /* Another thread is already isolating this page */ | |
2105 | put_page(page); | |
89f6c88a | 2106 | goto move; |
5ad333eb | 2107 | } |
c2135f7c AS |
2108 | |
2109 | nr_taken += nr_pages; | |
2110 | nr_zone_taken[page_zonenum(page)] += nr_pages; | |
89f6c88a HD |
2111 | move_to = dst; |
2112 | move: | |
2113 | list_move(&page->lru, move_to); | |
1da177e4 LT |
2114 | } |
2115 | ||
b2e18757 MG |
2116 | /* |
2117 | * Splice any skipped pages to the start of the LRU list. Note that | |
2118 | * this disrupts the LRU order when reclaiming for lower zones but | |
2119 | * we cannot splice to the tail. If we did then the SWAP_CLUSTER_MAX | |
2120 | * scanning would soon rescan the same pages to skip and put the | |
2121 | * system at risk of premature OOM. | |
2122 | */ | |
7cc30fcf MG |
2123 | if (!list_empty(&pages_skipped)) { |
2124 | int zid; | |
2125 | ||
3db65812 | 2126 | list_splice(&pages_skipped, src); |
7cc30fcf MG |
2127 | for (zid = 0; zid < MAX_NR_ZONES; zid++) { |
2128 | if (!nr_skipped[zid]) | |
2129 | continue; | |
2130 | ||
2131 | __count_zid_vm_events(PGSCAN_SKIP, zid, nr_skipped[zid]); | |
1265e3a6 | 2132 | skipped += nr_skipped[zid]; |
7cc30fcf MG |
2133 | } |
2134 | } | |
791b48b6 | 2135 | *nr_scanned = total_scan; |
1265e3a6 | 2136 | trace_mm_vmscan_lru_isolate(sc->reclaim_idx, sc->order, nr_to_scan, |
89f6c88a HD |
2137 | total_scan, skipped, nr_taken, |
2138 | sc->may_unmap ? 0 : ISOLATE_UNMAPPED, lru); | |
b4536f0c | 2139 | update_lru_sizes(lruvec, lru, nr_zone_taken); |
1da177e4 LT |
2140 | return nr_taken; |
2141 | } | |
2142 | ||
62695a84 | 2143 | /** |
d1d8a3b4 MWO |
2144 | * folio_isolate_lru() - Try to isolate a folio from its LRU list. |
2145 | * @folio: Folio to isolate from its LRU list. | |
62695a84 | 2146 | * |
d1d8a3b4 MWO |
2147 | * Isolate a @folio from an LRU list and adjust the vmstat statistic |
2148 | * corresponding to whatever LRU list the folio was on. | |
62695a84 | 2149 | * |
d1d8a3b4 MWO |
2150 | * The folio will have its LRU flag cleared. If it was found on the |
2151 | * active list, it will have the Active flag set. If it was found on the | |
2152 | * unevictable list, it will have the Unevictable flag set. These flags | |
894bc310 | 2153 | * may need to be cleared by the caller before letting the page go. |
62695a84 | 2154 | * |
d1d8a3b4 | 2155 | * Context: |
a5d09bed | 2156 | * |
62695a84 | 2157 | * (1) Must be called with an elevated refcount on the page. This is a |
d1d8a3b4 | 2158 | * fundamental difference from isolate_lru_pages() (which is called |
62695a84 | 2159 | * without a stable reference). |
d1d8a3b4 MWO |
2160 | * (2) The lru_lock must not be held. |
2161 | * (3) Interrupts must be enabled. | |
2162 | * | |
2163 | * Return: 0 if the folio was removed from an LRU list. | |
2164 | * -EBUSY if the folio was not on an LRU list. | |
62695a84 | 2165 | */ |
d1d8a3b4 | 2166 | int folio_isolate_lru(struct folio *folio) |
62695a84 NP |
2167 | { |
2168 | int ret = -EBUSY; | |
2169 | ||
d1d8a3b4 | 2170 | VM_BUG_ON_FOLIO(!folio_ref_count(folio), folio); |
0c917313 | 2171 | |
d1d8a3b4 | 2172 | if (folio_test_clear_lru(folio)) { |
fa9add64 | 2173 | struct lruvec *lruvec; |
62695a84 | 2174 | |
d1d8a3b4 | 2175 | folio_get(folio); |
e809c3fe | 2176 | lruvec = folio_lruvec_lock_irq(folio); |
d1d8a3b4 | 2177 | lruvec_del_folio(lruvec, folio); |
6168d0da | 2178 | unlock_page_lruvec_irq(lruvec); |
d25b5bd8 | 2179 | ret = 0; |
62695a84 | 2180 | } |
d25b5bd8 | 2181 | |
62695a84 NP |
2182 | return ret; |
2183 | } | |
2184 | ||
35cd7815 | 2185 | /* |
d37dd5dc | 2186 | * A direct reclaimer may isolate SWAP_CLUSTER_MAX pages from the LRU list and |
178821b8 | 2187 | * then get rescheduled. When there are massive number of tasks doing page |
d37dd5dc FW |
2188 | * allocation, such sleeping direct reclaimers may keep piling up on each CPU, |
2189 | * the LRU list will go small and be scanned faster than necessary, leading to | |
2190 | * unnecessary swapping, thrashing and OOM. | |
35cd7815 | 2191 | */ |
599d0c95 | 2192 | static int too_many_isolated(struct pglist_data *pgdat, int file, |
35cd7815 RR |
2193 | struct scan_control *sc) |
2194 | { | |
2195 | unsigned long inactive, isolated; | |
d818fca1 | 2196 | bool too_many; |
35cd7815 RR |
2197 | |
2198 | if (current_is_kswapd()) | |
2199 | return 0; | |
2200 | ||
b5ead35e | 2201 | if (!writeback_throttling_sane(sc)) |
35cd7815 RR |
2202 | return 0; |
2203 | ||
2204 | if (file) { | |
599d0c95 MG |
2205 | inactive = node_page_state(pgdat, NR_INACTIVE_FILE); |
2206 | isolated = node_page_state(pgdat, NR_ISOLATED_FILE); | |
35cd7815 | 2207 | } else { |
599d0c95 MG |
2208 | inactive = node_page_state(pgdat, NR_INACTIVE_ANON); |
2209 | isolated = node_page_state(pgdat, NR_ISOLATED_ANON); | |
35cd7815 RR |
2210 | } |
2211 | ||
3cf23841 FW |
2212 | /* |
2213 | * GFP_NOIO/GFP_NOFS callers are allowed to isolate more pages, so they | |
2214 | * won't get blocked by normal direct-reclaimers, forming a circular | |
2215 | * deadlock. | |
2216 | */ | |
d0164adc | 2217 | if ((sc->gfp_mask & (__GFP_IO | __GFP_FS)) == (__GFP_IO | __GFP_FS)) |
3cf23841 FW |
2218 | inactive >>= 3; |
2219 | ||
d818fca1 MG |
2220 | too_many = isolated > inactive; |
2221 | ||
2222 | /* Wake up tasks throttled due to too_many_isolated. */ | |
2223 | if (!too_many) | |
2224 | wake_throttle_isolated(pgdat); | |
2225 | ||
2226 | return too_many; | |
35cd7815 RR |
2227 | } |
2228 | ||
a222f341 | 2229 | /* |
15b44736 HD |
2230 | * move_pages_to_lru() moves pages from private @list to appropriate LRU list. |
2231 | * On return, @list is reused as a list of pages to be freed by the caller. | |
a222f341 KT |
2232 | * |
2233 | * Returns the number of pages moved to the given lruvec. | |
2234 | */ | |
9ef56b78 MS |
2235 | static unsigned int move_pages_to_lru(struct lruvec *lruvec, |
2236 | struct list_head *list) | |
66635629 | 2237 | { |
a222f341 | 2238 | int nr_pages, nr_moved = 0; |
3f79768f | 2239 | LIST_HEAD(pages_to_free); |
a222f341 | 2240 | struct page *page; |
66635629 | 2241 | |
a222f341 KT |
2242 | while (!list_empty(list)) { |
2243 | page = lru_to_page(list); | |
309381fe | 2244 | VM_BUG_ON_PAGE(PageLRU(page), page); |
3d06afab | 2245 | list_del(&page->lru); |
39b5f29a | 2246 | if (unlikely(!page_evictable(page))) { |
6168d0da | 2247 | spin_unlock_irq(&lruvec->lru_lock); |
66635629 | 2248 | putback_lru_page(page); |
6168d0da | 2249 | spin_lock_irq(&lruvec->lru_lock); |
66635629 MG |
2250 | continue; |
2251 | } | |
fa9add64 | 2252 | |
3d06afab AS |
2253 | /* |
2254 | * The SetPageLRU needs to be kept here for list integrity. | |
2255 | * Otherwise: | |
2256 | * #0 move_pages_to_lru #1 release_pages | |
2257 | * if !put_page_testzero | |
2258 | * if (put_page_testzero()) | |
2259 | * !PageLRU //skip lru_lock | |
2260 | * SetPageLRU() | |
2261 | * list_add(&page->lru,) | |
2262 | * list_add(&page->lru,) | |
2263 | */ | |
7a608572 | 2264 | SetPageLRU(page); |
a222f341 | 2265 | |
3d06afab | 2266 | if (unlikely(put_page_testzero(page))) { |
87560179 | 2267 | __clear_page_lru_flags(page); |
2bcf8879 HD |
2268 | |
2269 | if (unlikely(PageCompound(page))) { | |
6168d0da | 2270 | spin_unlock_irq(&lruvec->lru_lock); |
ff45fc3c | 2271 | destroy_compound_page(page); |
6168d0da | 2272 | spin_lock_irq(&lruvec->lru_lock); |
2bcf8879 HD |
2273 | } else |
2274 | list_add(&page->lru, &pages_to_free); | |
3d06afab AS |
2275 | |
2276 | continue; | |
66635629 | 2277 | } |
3d06afab | 2278 | |
afca9157 AS |
2279 | /* |
2280 | * All pages were isolated from the same lruvec (and isolation | |
2281 | * inhibits memcg migration). | |
2282 | */ | |
0de340cb | 2283 | VM_BUG_ON_PAGE(!folio_matches_lruvec(page_folio(page), lruvec), page); |
3a9c9788 | 2284 | add_page_to_lru_list(page, lruvec); |
3d06afab | 2285 | nr_pages = thp_nr_pages(page); |
3d06afab AS |
2286 | nr_moved += nr_pages; |
2287 | if (PageActive(page)) | |
2288 | workingset_age_nonresident(lruvec, nr_pages); | |
66635629 | 2289 | } |
66635629 | 2290 | |
3f79768f HD |
2291 | /* |
2292 | * To save our caller's stack, now use input list for pages to free. | |
2293 | */ | |
a222f341 KT |
2294 | list_splice(&pages_to_free, list); |
2295 | ||
2296 | return nr_moved; | |
66635629 MG |
2297 | } |
2298 | ||
399ba0b9 N |
2299 | /* |
2300 | * If a kernel thread (such as nfsd for loop-back mounts) services | |
a37b0715 | 2301 | * a backing device by writing to the page cache it sets PF_LOCAL_THROTTLE. |
399ba0b9 N |
2302 | * In that case we should only throttle if the backing device it is |
2303 | * writing to is congested. In other cases it is safe to throttle. | |
2304 | */ | |
2305 | static int current_may_throttle(void) | |
2306 | { | |
b9b1335e | 2307 | return !(current->flags & PF_LOCAL_THROTTLE); |
399ba0b9 N |
2308 | } |
2309 | ||
1da177e4 | 2310 | /* |
b2e18757 | 2311 | * shrink_inactive_list() is a helper for shrink_node(). It returns the number |
1742f19f | 2312 | * of reclaimed pages |
1da177e4 | 2313 | */ |
9ef56b78 | 2314 | static unsigned long |
1a93be0e | 2315 | shrink_inactive_list(unsigned long nr_to_scan, struct lruvec *lruvec, |
9e3b2f8c | 2316 | struct scan_control *sc, enum lru_list lru) |
1da177e4 LT |
2317 | { |
2318 | LIST_HEAD(page_list); | |
e247dbce | 2319 | unsigned long nr_scanned; |
730ec8c0 | 2320 | unsigned int nr_reclaimed = 0; |
e247dbce | 2321 | unsigned long nr_taken; |
060f005f | 2322 | struct reclaim_stat stat; |
497a6c1b | 2323 | bool file = is_file_lru(lru); |
f46b7912 | 2324 | enum vm_event_item item; |
599d0c95 | 2325 | struct pglist_data *pgdat = lruvec_pgdat(lruvec); |
db73ee0d | 2326 | bool stalled = false; |
78dc583d | 2327 | |
599d0c95 | 2328 | while (unlikely(too_many_isolated(pgdat, file, sc))) { |
db73ee0d MH |
2329 | if (stalled) |
2330 | return 0; | |
2331 | ||
2332 | /* wait a bit for the reclaimer. */ | |
db73ee0d | 2333 | stalled = true; |
c3f4a9a2 | 2334 | reclaim_throttle(pgdat, VMSCAN_THROTTLE_ISOLATED); |
35cd7815 RR |
2335 | |
2336 | /* We are about to die and free our memory. Return now. */ | |
2337 | if (fatal_signal_pending(current)) | |
2338 | return SWAP_CLUSTER_MAX; | |
2339 | } | |
2340 | ||
1da177e4 | 2341 | lru_add_drain(); |
f80c0673 | 2342 | |
6168d0da | 2343 | spin_lock_irq(&lruvec->lru_lock); |
b35ea17b | 2344 | |
5dc35979 | 2345 | nr_taken = isolate_lru_pages(nr_to_scan, lruvec, &page_list, |
a9e7c39f | 2346 | &nr_scanned, sc, lru); |
95d918fc | 2347 | |
599d0c95 | 2348 | __mod_node_page_state(pgdat, NR_ISOLATED_ANON + file, nr_taken); |
f46b7912 | 2349 | item = current_is_kswapd() ? PGSCAN_KSWAPD : PGSCAN_DIRECT; |
b5ead35e | 2350 | if (!cgroup_reclaim(sc)) |
f46b7912 KT |
2351 | __count_vm_events(item, nr_scanned); |
2352 | __count_memcg_events(lruvec_memcg(lruvec), item, nr_scanned); | |
497a6c1b JW |
2353 | __count_vm_events(PGSCAN_ANON + file, nr_scanned); |
2354 | ||
6168d0da | 2355 | spin_unlock_irq(&lruvec->lru_lock); |
b35ea17b | 2356 | |
d563c050 | 2357 | if (nr_taken == 0) |
66635629 | 2358 | return 0; |
5ad333eb | 2359 | |
013339df | 2360 | nr_reclaimed = shrink_page_list(&page_list, pgdat, sc, &stat, false); |
c661b078 | 2361 | |
6168d0da | 2362 | spin_lock_irq(&lruvec->lru_lock); |
497a6c1b JW |
2363 | move_pages_to_lru(lruvec, &page_list); |
2364 | ||
2365 | __mod_node_page_state(pgdat, NR_ISOLATED_ANON + file, -nr_taken); | |
f46b7912 | 2366 | item = current_is_kswapd() ? PGSTEAL_KSWAPD : PGSTEAL_DIRECT; |
b5ead35e | 2367 | if (!cgroup_reclaim(sc)) |
f46b7912 KT |
2368 | __count_vm_events(item, nr_reclaimed); |
2369 | __count_memcg_events(lruvec_memcg(lruvec), item, nr_reclaimed); | |
497a6c1b | 2370 | __count_vm_events(PGSTEAL_ANON + file, nr_reclaimed); |
6168d0da | 2371 | spin_unlock_irq(&lruvec->lru_lock); |
3f79768f | 2372 | |
75cc3c91 | 2373 | lru_note_cost(lruvec, file, stat.nr_pageout); |
747db954 | 2374 | mem_cgroup_uncharge_list(&page_list); |
2d4894b5 | 2375 | free_unref_page_list(&page_list); |
e11da5b4 | 2376 | |
1c610d5f AR |
2377 | /* |
2378 | * If dirty pages are scanned that are not queued for IO, it | |
2379 | * implies that flushers are not doing their job. This can | |
2380 | * happen when memory pressure pushes dirty pages to the end of | |
2381 | * the LRU before the dirty limits are breached and the dirty | |
2382 | * data has expired. It can also happen when the proportion of | |
2383 | * dirty pages grows not through writes but through memory | |
2384 | * pressure reclaiming all the clean cache. And in some cases, | |
2385 | * the flushers simply cannot keep up with the allocation | |
2386 | * rate. Nudge the flusher threads in case they are asleep. | |
2387 | */ | |
2388 | if (stat.nr_unqueued_dirty == nr_taken) | |
2389 | wakeup_flusher_threads(WB_REASON_VMSCAN); | |
2390 | ||
d108c772 AR |
2391 | sc->nr.dirty += stat.nr_dirty; |
2392 | sc->nr.congested += stat.nr_congested; | |
2393 | sc->nr.unqueued_dirty += stat.nr_unqueued_dirty; | |
2394 | sc->nr.writeback += stat.nr_writeback; | |
2395 | sc->nr.immediate += stat.nr_immediate; | |
2396 | sc->nr.taken += nr_taken; | |
2397 | if (file) | |
2398 | sc->nr.file_taken += nr_taken; | |
8e950282 | 2399 | |
599d0c95 | 2400 | trace_mm_vmscan_lru_shrink_inactive(pgdat->node_id, |
d51d1e64 | 2401 | nr_scanned, nr_reclaimed, &stat, sc->priority, file); |
05ff5137 | 2402 | return nr_reclaimed; |
1da177e4 LT |
2403 | } |
2404 | ||
15b44736 HD |
2405 | /* |
2406 | * shrink_active_list() moves pages from the active LRU to the inactive LRU. | |
2407 | * | |
2408 | * We move them the other way if the page is referenced by one or more | |
2409 | * processes. | |
2410 | * | |
2411 | * If the pages are mostly unmapped, the processing is fast and it is | |
2412 | * appropriate to hold lru_lock across the whole operation. But if | |
b3ac0413 | 2413 | * the pages are mapped, the processing is slow (folio_referenced()), so |
15b44736 HD |
2414 | * we should drop lru_lock around each page. It's impossible to balance |
2415 | * this, so instead we remove the pages from the LRU while processing them. | |
2416 | * It is safe to rely on PG_active against the non-LRU pages in here because | |
2417 | * nobody will play with that bit on a non-LRU page. | |
2418 | * | |
2419 | * The downside is that we have to touch page->_refcount against each page. | |
2420 | * But we had to alter page->flags anyway. | |
2421 | */ | |
f626012d | 2422 | static void shrink_active_list(unsigned long nr_to_scan, |
1a93be0e | 2423 | struct lruvec *lruvec, |
f16015fb | 2424 | struct scan_control *sc, |
9e3b2f8c | 2425 | enum lru_list lru) |
1da177e4 | 2426 | { |
44c241f1 | 2427 | unsigned long nr_taken; |
f626012d | 2428 | unsigned long nr_scanned; |
6fe6b7e3 | 2429 | unsigned long vm_flags; |
1da177e4 | 2430 | LIST_HEAD(l_hold); /* The pages which were snipped off */ |
8cab4754 | 2431 | LIST_HEAD(l_active); |
b69408e8 | 2432 | LIST_HEAD(l_inactive); |
9d998b4f MH |
2433 | unsigned nr_deactivate, nr_activate; |
2434 | unsigned nr_rotated = 0; | |
3cb99451 | 2435 | int file = is_file_lru(lru); |
599d0c95 | 2436 | struct pglist_data *pgdat = lruvec_pgdat(lruvec); |
1da177e4 LT |
2437 | |
2438 | lru_add_drain(); | |
f80c0673 | 2439 | |
6168d0da | 2440 | spin_lock_irq(&lruvec->lru_lock); |
925b7673 | 2441 | |
5dc35979 | 2442 | nr_taken = isolate_lru_pages(nr_to_scan, lruvec, &l_hold, |
a9e7c39f | 2443 | &nr_scanned, sc, lru); |
89b5fae5 | 2444 | |
599d0c95 | 2445 | __mod_node_page_state(pgdat, NR_ISOLATED_ANON + file, nr_taken); |
1cfb419b | 2446 | |
912c0572 SB |
2447 | if (!cgroup_reclaim(sc)) |
2448 | __count_vm_events(PGREFILL, nr_scanned); | |
2fa2690c | 2449 | __count_memcg_events(lruvec_memcg(lruvec), PGREFILL, nr_scanned); |
9d5e6a9f | 2450 | |
6168d0da | 2451 | spin_unlock_irq(&lruvec->lru_lock); |
1da177e4 | 2452 | |
1da177e4 | 2453 | while (!list_empty(&l_hold)) { |
b3ac0413 MWO |
2454 | struct folio *folio; |
2455 | struct page *page; | |
2456 | ||
1da177e4 | 2457 | cond_resched(); |
b3ac0413 MWO |
2458 | folio = lru_to_folio(&l_hold); |
2459 | list_del(&folio->lru); | |
2460 | page = &folio->page; | |
7e9cd484 | 2461 | |
39b5f29a | 2462 | if (unlikely(!page_evictable(page))) { |
894bc310 LS |
2463 | putback_lru_page(page); |
2464 | continue; | |
2465 | } | |
2466 | ||
cc715d99 MG |
2467 | if (unlikely(buffer_heads_over_limit)) { |
2468 | if (page_has_private(page) && trylock_page(page)) { | |
2469 | if (page_has_private(page)) | |
2470 | try_to_release_page(page, 0); | |
2471 | unlock_page(page); | |
2472 | } | |
2473 | } | |
2474 | ||
b3ac0413 MWO |
2475 | if (folio_referenced(folio, 0, sc->target_mem_cgroup, |
2476 | &vm_flags)) { | |
8cab4754 WF |
2477 | /* |
2478 | * Identify referenced, file-backed active pages and | |
2479 | * give them one more trip around the active list. So | |
2480 | * that executable code get better chances to stay in | |
2481 | * memory under moderate memory pressure. Anon pages | |
2482 | * are not likely to be evicted by use-once streaming | |
2483 | * IO, plus JVM can create lots of anon VM_EXEC pages, | |
2484 | * so we ignore them here. | |
2485 | */ | |
9de4f22a | 2486 | if ((vm_flags & VM_EXEC) && page_is_file_lru(page)) { |
6c357848 | 2487 | nr_rotated += thp_nr_pages(page); |
8cab4754 WF |
2488 | list_add(&page->lru, &l_active); |
2489 | continue; | |
2490 | } | |
2491 | } | |
7e9cd484 | 2492 | |
5205e56e | 2493 | ClearPageActive(page); /* we are de-activating */ |
1899ad18 | 2494 | SetPageWorkingset(page); |
1da177e4 LT |
2495 | list_add(&page->lru, &l_inactive); |
2496 | } | |
2497 | ||
b555749a | 2498 | /* |
8cab4754 | 2499 | * Move pages back to the lru list. |
b555749a | 2500 | */ |
6168d0da | 2501 | spin_lock_irq(&lruvec->lru_lock); |
556adecb | 2502 | |
a222f341 KT |
2503 | nr_activate = move_pages_to_lru(lruvec, &l_active); |
2504 | nr_deactivate = move_pages_to_lru(lruvec, &l_inactive); | |
f372d89e KT |
2505 | /* Keep all free pages in l_active list */ |
2506 | list_splice(&l_inactive, &l_active); | |
9851ac13 KT |
2507 | |
2508 | __count_vm_events(PGDEACTIVATE, nr_deactivate); | |
2509 | __count_memcg_events(lruvec_memcg(lruvec), PGDEACTIVATE, nr_deactivate); | |
2510 | ||
599d0c95 | 2511 | __mod_node_page_state(pgdat, NR_ISOLATED_ANON + file, -nr_taken); |
6168d0da | 2512 | spin_unlock_irq(&lruvec->lru_lock); |
2bcf8879 | 2513 | |
f372d89e KT |
2514 | mem_cgroup_uncharge_list(&l_active); |
2515 | free_unref_page_list(&l_active); | |
9d998b4f MH |
2516 | trace_mm_vmscan_lru_shrink_active(pgdat->node_id, nr_taken, nr_activate, |
2517 | nr_deactivate, nr_rotated, sc->priority, file); | |
1da177e4 LT |
2518 | } |
2519 | ||
1a4e58cc MK |
2520 | unsigned long reclaim_pages(struct list_head *page_list) |
2521 | { | |
f661d007 | 2522 | int nid = NUMA_NO_NODE; |
730ec8c0 | 2523 | unsigned int nr_reclaimed = 0; |
1a4e58cc MK |
2524 | LIST_HEAD(node_page_list); |
2525 | struct reclaim_stat dummy_stat; | |
2526 | struct page *page; | |
2d2b8d2b | 2527 | unsigned int noreclaim_flag; |
1a4e58cc MK |
2528 | struct scan_control sc = { |
2529 | .gfp_mask = GFP_KERNEL, | |
1a4e58cc MK |
2530 | .may_writepage = 1, |
2531 | .may_unmap = 1, | |
2532 | .may_swap = 1, | |
26aa2d19 | 2533 | .no_demotion = 1, |
1a4e58cc MK |
2534 | }; |
2535 | ||
2d2b8d2b YZ |
2536 | noreclaim_flag = memalloc_noreclaim_save(); |
2537 | ||
1a4e58cc MK |
2538 | while (!list_empty(page_list)) { |
2539 | page = lru_to_page(page_list); | |
f661d007 | 2540 | if (nid == NUMA_NO_NODE) { |
1a4e58cc MK |
2541 | nid = page_to_nid(page); |
2542 | INIT_LIST_HEAD(&node_page_list); | |
2543 | } | |
2544 | ||
2545 | if (nid == page_to_nid(page)) { | |
2546 | ClearPageActive(page); | |
2547 | list_move(&page->lru, &node_page_list); | |
2548 | continue; | |
2549 | } | |
2550 | ||
2551 | nr_reclaimed += shrink_page_list(&node_page_list, | |
2552 | NODE_DATA(nid), | |
013339df | 2553 | &sc, &dummy_stat, false); |
1a4e58cc MK |
2554 | while (!list_empty(&node_page_list)) { |
2555 | page = lru_to_page(&node_page_list); | |
2556 | list_del(&page->lru); | |
2557 | putback_lru_page(page); | |
2558 | } | |
2559 | ||
f661d007 | 2560 | nid = NUMA_NO_NODE; |
1a4e58cc MK |
2561 | } |
2562 | ||
2563 | if (!list_empty(&node_page_list)) { | |
2564 | nr_reclaimed += shrink_page_list(&node_page_list, | |
2565 | NODE_DATA(nid), | |
013339df | 2566 | &sc, &dummy_stat, false); |
1a4e58cc MK |
2567 | while (!list_empty(&node_page_list)) { |
2568 | page = lru_to_page(&node_page_list); | |
2569 | list_del(&page->lru); | |
2570 | putback_lru_page(page); | |
2571 | } | |
2572 | } | |
2573 | ||
2d2b8d2b YZ |
2574 | memalloc_noreclaim_restore(noreclaim_flag); |
2575 | ||
1a4e58cc MK |
2576 | return nr_reclaimed; |
2577 | } | |
2578 | ||
b91ac374 JW |
2579 | static unsigned long shrink_list(enum lru_list lru, unsigned long nr_to_scan, |
2580 | struct lruvec *lruvec, struct scan_control *sc) | |
2581 | { | |
2582 | if (is_active_lru(lru)) { | |
2583 | if (sc->may_deactivate & (1 << is_file_lru(lru))) | |
2584 | shrink_active_list(nr_to_scan, lruvec, sc, lru); | |
2585 | else | |
2586 | sc->skipped_deactivate = 1; | |
2587 | return 0; | |
2588 | } | |
2589 | ||
2590 | return shrink_inactive_list(nr_to_scan, lruvec, sc, lru); | |
2591 | } | |
2592 | ||
59dc76b0 RR |
2593 | /* |
2594 | * The inactive anon list should be small enough that the VM never has | |
2595 | * to do too much work. | |
14797e23 | 2596 | * |
59dc76b0 RR |
2597 | * The inactive file list should be small enough to leave most memory |
2598 | * to the established workingset on the scan-resistant active list, | |
2599 | * but large enough to avoid thrashing the aggregate readahead window. | |
56e49d21 | 2600 | * |
59dc76b0 RR |
2601 | * Both inactive lists should also be large enough that each inactive |
2602 | * page has a chance to be referenced again before it is reclaimed. | |
56e49d21 | 2603 | * |
2a2e4885 JW |
2604 | * If that fails and refaulting is observed, the inactive list grows. |
2605 | * | |
59dc76b0 | 2606 | * The inactive_ratio is the target ratio of ACTIVE to INACTIVE pages |
3a50d14d | 2607 | * on this LRU, maintained by the pageout code. An inactive_ratio |
59dc76b0 | 2608 | * of 3 means 3:1 or 25% of the pages are kept on the inactive list. |
56e49d21 | 2609 | * |
59dc76b0 RR |
2610 | * total target max |
2611 | * memory ratio inactive | |
2612 | * ------------------------------------- | |
2613 | * 10MB 1 5MB | |
2614 | * 100MB 1 50MB | |
2615 | * 1GB 3 250MB | |
2616 | * 10GB 10 0.9GB | |
2617 | * 100GB 31 3GB | |
2618 | * 1TB 101 10GB | |
2619 | * 10TB 320 32GB | |
56e49d21 | 2620 | */ |
b91ac374 | 2621 | static bool inactive_is_low(struct lruvec *lruvec, enum lru_list inactive_lru) |
56e49d21 | 2622 | { |
b91ac374 | 2623 | enum lru_list active_lru = inactive_lru + LRU_ACTIVE; |
2a2e4885 JW |
2624 | unsigned long inactive, active; |
2625 | unsigned long inactive_ratio; | |
59dc76b0 | 2626 | unsigned long gb; |
e3790144 | 2627 | |
b91ac374 JW |
2628 | inactive = lruvec_page_state(lruvec, NR_LRU_BASE + inactive_lru); |
2629 | active = lruvec_page_state(lruvec, NR_LRU_BASE + active_lru); | |
f8d1a311 | 2630 | |
b91ac374 | 2631 | gb = (inactive + active) >> (30 - PAGE_SHIFT); |
4002570c | 2632 | if (gb) |
b91ac374 JW |
2633 | inactive_ratio = int_sqrt(10 * gb); |
2634 | else | |
2635 | inactive_ratio = 1; | |
fd538803 | 2636 | |
59dc76b0 | 2637 | return inactive * inactive_ratio < active; |
b39415b2 RR |
2638 | } |
2639 | ||
9a265114 JW |
2640 | enum scan_balance { |
2641 | SCAN_EQUAL, | |
2642 | SCAN_FRACT, | |
2643 | SCAN_ANON, | |
2644 | SCAN_FILE, | |
2645 | }; | |
2646 | ||
4f98a2fe RR |
2647 | /* |
2648 | * Determine how aggressively the anon and file LRU lists should be | |
2649 | * scanned. The relative value of each set of LRU lists is determined | |
2650 | * by looking at the fraction of the pages scanned we did rotate back | |
2651 | * onto the active list instead of evict. | |
2652 | * | |
be7bd59d WL |
2653 | * nr[0] = anon inactive pages to scan; nr[1] = anon active pages to scan |
2654 | * nr[2] = file inactive pages to scan; nr[3] = file active pages to scan | |
4f98a2fe | 2655 | */ |
afaf07a6 JW |
2656 | static void get_scan_count(struct lruvec *lruvec, struct scan_control *sc, |
2657 | unsigned long *nr) | |
4f98a2fe | 2658 | { |
a2a36488 | 2659 | struct pglist_data *pgdat = lruvec_pgdat(lruvec); |
afaf07a6 | 2660 | struct mem_cgroup *memcg = lruvec_memcg(lruvec); |
d483a5dd | 2661 | unsigned long anon_cost, file_cost, total_cost; |
33377678 | 2662 | int swappiness = mem_cgroup_swappiness(memcg); |
ed017373 | 2663 | u64 fraction[ANON_AND_FILE]; |
9a265114 | 2664 | u64 denominator = 0; /* gcc */ |
9a265114 | 2665 | enum scan_balance scan_balance; |
4f98a2fe | 2666 | unsigned long ap, fp; |
4111304d | 2667 | enum lru_list lru; |
76a33fc3 SL |
2668 | |
2669 | /* If we have no swap space, do not bother scanning anon pages. */ | |
a2a36488 | 2670 | if (!sc->may_swap || !can_reclaim_anon_pages(memcg, pgdat->node_id, sc)) { |
9a265114 | 2671 | scan_balance = SCAN_FILE; |
76a33fc3 SL |
2672 | goto out; |
2673 | } | |
4f98a2fe | 2674 | |
10316b31 JW |
2675 | /* |
2676 | * Global reclaim will swap to prevent OOM even with no | |
2677 | * swappiness, but memcg users want to use this knob to | |
2678 | * disable swapping for individual groups completely when | |
2679 | * using the memory controller's swap limit feature would be | |
2680 | * too expensive. | |
2681 | */ | |
b5ead35e | 2682 | if (cgroup_reclaim(sc) && !swappiness) { |
9a265114 | 2683 | scan_balance = SCAN_FILE; |
10316b31 JW |
2684 | goto out; |
2685 | } | |
2686 | ||
2687 | /* | |
2688 | * Do not apply any pressure balancing cleverness when the | |
2689 | * system is close to OOM, scan both anon and file equally | |
2690 | * (unless the swappiness setting disagrees with swapping). | |
2691 | */ | |
02695175 | 2692 | if (!sc->priority && swappiness) { |
9a265114 | 2693 | scan_balance = SCAN_EQUAL; |
10316b31 JW |
2694 | goto out; |
2695 | } | |
2696 | ||
62376251 | 2697 | /* |
53138cea | 2698 | * If the system is almost out of file pages, force-scan anon. |
62376251 | 2699 | */ |
b91ac374 | 2700 | if (sc->file_is_tiny) { |
53138cea JW |
2701 | scan_balance = SCAN_ANON; |
2702 | goto out; | |
62376251 JW |
2703 | } |
2704 | ||
7c5bd705 | 2705 | /* |
b91ac374 JW |
2706 | * If there is enough inactive page cache, we do not reclaim |
2707 | * anything from the anonymous working right now. | |
7c5bd705 | 2708 | */ |
b91ac374 | 2709 | if (sc->cache_trim_mode) { |
9a265114 | 2710 | scan_balance = SCAN_FILE; |
7c5bd705 JW |
2711 | goto out; |
2712 | } | |
2713 | ||
9a265114 | 2714 | scan_balance = SCAN_FRACT; |
58c37f6e | 2715 | /* |
314b57fb JW |
2716 | * Calculate the pressure balance between anon and file pages. |
2717 | * | |
2718 | * The amount of pressure we put on each LRU is inversely | |
2719 | * proportional to the cost of reclaiming each list, as | |
2720 | * determined by the share of pages that are refaulting, times | |
2721 | * the relative IO cost of bringing back a swapped out | |
2722 | * anonymous page vs reloading a filesystem page (swappiness). | |
2723 | * | |
d483a5dd JW |
2724 | * Although we limit that influence to ensure no list gets |
2725 | * left behind completely: at least a third of the pressure is | |
2726 | * applied, before swappiness. | |
2727 | * | |
314b57fb | 2728 | * With swappiness at 100, anon and file have equal IO cost. |
58c37f6e | 2729 | */ |
d483a5dd JW |
2730 | total_cost = sc->anon_cost + sc->file_cost; |
2731 | anon_cost = total_cost + sc->anon_cost; | |
2732 | file_cost = total_cost + sc->file_cost; | |
2733 | total_cost = anon_cost + file_cost; | |
58c37f6e | 2734 | |
d483a5dd JW |
2735 | ap = swappiness * (total_cost + 1); |
2736 | ap /= anon_cost + 1; | |
4f98a2fe | 2737 | |
d483a5dd JW |
2738 | fp = (200 - swappiness) * (total_cost + 1); |
2739 | fp /= file_cost + 1; | |
4f98a2fe | 2740 | |
76a33fc3 SL |
2741 | fraction[0] = ap; |
2742 | fraction[1] = fp; | |
a4fe1631 | 2743 | denominator = ap + fp; |
76a33fc3 | 2744 | out: |
688035f7 JW |
2745 | for_each_evictable_lru(lru) { |
2746 | int file = is_file_lru(lru); | |
9783aa99 | 2747 | unsigned long lruvec_size; |
f56ce412 | 2748 | unsigned long low, min; |
688035f7 | 2749 | unsigned long scan; |
9783aa99 CD |
2750 | |
2751 | lruvec_size = lruvec_lru_size(lruvec, lru, sc->reclaim_idx); | |
f56ce412 JW |
2752 | mem_cgroup_protection(sc->target_mem_cgroup, memcg, |
2753 | &min, &low); | |
9783aa99 | 2754 | |
f56ce412 | 2755 | if (min || low) { |
9783aa99 CD |
2756 | /* |
2757 | * Scale a cgroup's reclaim pressure by proportioning | |
2758 | * its current usage to its memory.low or memory.min | |
2759 | * setting. | |
2760 | * | |
2761 | * This is important, as otherwise scanning aggression | |
2762 | * becomes extremely binary -- from nothing as we | |
2763 | * approach the memory protection threshold, to totally | |
2764 | * nominal as we exceed it. This results in requiring | |
2765 | * setting extremely liberal protection thresholds. It | |
2766 | * also means we simply get no protection at all if we | |
2767 | * set it too low, which is not ideal. | |
1bc63fb1 CD |
2768 | * |
2769 | * If there is any protection in place, we reduce scan | |
2770 | * pressure by how much of the total memory used is | |
2771 | * within protection thresholds. | |
9783aa99 | 2772 | * |
9de7ca46 CD |
2773 | * There is one special case: in the first reclaim pass, |
2774 | * we skip over all groups that are within their low | |
2775 | * protection. If that fails to reclaim enough pages to | |
2776 | * satisfy the reclaim goal, we come back and override | |
2777 | * the best-effort low protection. However, we still | |
2778 | * ideally want to honor how well-behaved groups are in | |
2779 | * that case instead of simply punishing them all | |
2780 | * equally. As such, we reclaim them based on how much | |
1bc63fb1 CD |
2781 | * memory they are using, reducing the scan pressure |
2782 | * again by how much of the total memory used is under | |
2783 | * hard protection. | |
9783aa99 | 2784 | */ |
1bc63fb1 | 2785 | unsigned long cgroup_size = mem_cgroup_size(memcg); |
f56ce412 JW |
2786 | unsigned long protection; |
2787 | ||
2788 | /* memory.low scaling, make sure we retry before OOM */ | |
2789 | if (!sc->memcg_low_reclaim && low > min) { | |
2790 | protection = low; | |
2791 | sc->memcg_low_skipped = 1; | |
2792 | } else { | |
2793 | protection = min; | |
2794 | } | |
1bc63fb1 CD |
2795 | |
2796 | /* Avoid TOCTOU with earlier protection check */ | |
2797 | cgroup_size = max(cgroup_size, protection); | |
2798 | ||
2799 | scan = lruvec_size - lruvec_size * protection / | |
32d4f4b7 | 2800 | (cgroup_size + 1); |
9783aa99 CD |
2801 | |
2802 | /* | |
1bc63fb1 | 2803 | * Minimally target SWAP_CLUSTER_MAX pages to keep |
55b65a57 | 2804 | * reclaim moving forwards, avoiding decrementing |
9de7ca46 | 2805 | * sc->priority further than desirable. |
9783aa99 | 2806 | */ |
1bc63fb1 | 2807 | scan = max(scan, SWAP_CLUSTER_MAX); |
9783aa99 CD |
2808 | } else { |
2809 | scan = lruvec_size; | |
2810 | } | |
2811 | ||
2812 | scan >>= sc->priority; | |
6b4f7799 | 2813 | |
688035f7 JW |
2814 | /* |
2815 | * If the cgroup's already been deleted, make sure to | |
2816 | * scrape out the remaining cache. | |
2817 | */ | |
2818 | if (!scan && !mem_cgroup_online(memcg)) | |
9783aa99 | 2819 | scan = min(lruvec_size, SWAP_CLUSTER_MAX); |
6b4f7799 | 2820 | |
688035f7 JW |
2821 | switch (scan_balance) { |
2822 | case SCAN_EQUAL: | |
2823 | /* Scan lists relative to size */ | |
2824 | break; | |
2825 | case SCAN_FRACT: | |
9a265114 | 2826 | /* |
688035f7 JW |
2827 | * Scan types proportional to swappiness and |
2828 | * their relative recent reclaim efficiency. | |
76073c64 GS |
2829 | * Make sure we don't miss the last page on |
2830 | * the offlined memory cgroups because of a | |
2831 | * round-off error. | |
9a265114 | 2832 | */ |
76073c64 GS |
2833 | scan = mem_cgroup_online(memcg) ? |
2834 | div64_u64(scan * fraction[file], denominator) : | |
2835 | DIV64_U64_ROUND_UP(scan * fraction[file], | |
68600f62 | 2836 | denominator); |
688035f7 JW |
2837 | break; |
2838 | case SCAN_FILE: | |
2839 | case SCAN_ANON: | |
2840 | /* Scan one type exclusively */ | |
e072bff6 | 2841 | if ((scan_balance == SCAN_FILE) != file) |
688035f7 | 2842 | scan = 0; |
688035f7 JW |
2843 | break; |
2844 | default: | |
2845 | /* Look ma, no brain */ | |
2846 | BUG(); | |
9a265114 | 2847 | } |
688035f7 | 2848 | |
688035f7 | 2849 | nr[lru] = scan; |
76a33fc3 | 2850 | } |
6e08a369 | 2851 | } |
4f98a2fe | 2852 | |
2f368a9f DH |
2853 | /* |
2854 | * Anonymous LRU management is a waste if there is | |
2855 | * ultimately no way to reclaim the memory. | |
2856 | */ | |
2857 | static bool can_age_anon_pages(struct pglist_data *pgdat, | |
2858 | struct scan_control *sc) | |
2859 | { | |
2860 | /* Aging the anon LRU is valuable if swap is present: */ | |
2861 | if (total_swap_pages > 0) | |
2862 | return true; | |
2863 | ||
2864 | /* Also valuable if anon pages can be demoted: */ | |
2865 | return can_demote(pgdat->node_id, sc); | |
2866 | } | |
2867 | ||
afaf07a6 | 2868 | static void shrink_lruvec(struct lruvec *lruvec, struct scan_control *sc) |
9b4f98cd JW |
2869 | { |
2870 | unsigned long nr[NR_LRU_LISTS]; | |
e82e0561 | 2871 | unsigned long targets[NR_LRU_LISTS]; |
9b4f98cd JW |
2872 | unsigned long nr_to_scan; |
2873 | enum lru_list lru; | |
2874 | unsigned long nr_reclaimed = 0; | |
2875 | unsigned long nr_to_reclaim = sc->nr_to_reclaim; | |
2876 | struct blk_plug plug; | |
1a501907 | 2877 | bool scan_adjusted; |
9b4f98cd | 2878 | |
afaf07a6 | 2879 | get_scan_count(lruvec, sc, nr); |
9b4f98cd | 2880 | |
e82e0561 MG |
2881 | /* Record the original scan target for proportional adjustments later */ |
2882 | memcpy(targets, nr, sizeof(nr)); | |
2883 | ||
1a501907 MG |
2884 | /* |
2885 | * Global reclaiming within direct reclaim at DEF_PRIORITY is a normal | |
2886 | * event that can occur when there is little memory pressure e.g. | |
2887 | * multiple streaming readers/writers. Hence, we do not abort scanning | |
2888 | * when the requested number of pages are reclaimed when scanning at | |
2889 | * DEF_PRIORITY on the assumption that the fact we are direct | |
2890 | * reclaiming implies that kswapd is not keeping up and it is best to | |
2891 | * do a batch of work at once. For memcg reclaim one check is made to | |
2892 | * abort proportional reclaim if either the file or anon lru has already | |
2893 | * dropped to zero at the first pass. | |
2894 | */ | |
b5ead35e | 2895 | scan_adjusted = (!cgroup_reclaim(sc) && !current_is_kswapd() && |
1a501907 MG |
2896 | sc->priority == DEF_PRIORITY); |
2897 | ||
9b4f98cd JW |
2898 | blk_start_plug(&plug); |
2899 | while (nr[LRU_INACTIVE_ANON] || nr[LRU_ACTIVE_FILE] || | |
2900 | nr[LRU_INACTIVE_FILE]) { | |
e82e0561 MG |
2901 | unsigned long nr_anon, nr_file, percentage; |
2902 | unsigned long nr_scanned; | |
2903 | ||
9b4f98cd JW |
2904 | for_each_evictable_lru(lru) { |
2905 | if (nr[lru]) { | |
2906 | nr_to_scan = min(nr[lru], SWAP_CLUSTER_MAX); | |
2907 | nr[lru] -= nr_to_scan; | |
2908 | ||
2909 | nr_reclaimed += shrink_list(lru, nr_to_scan, | |
3b991208 | 2910 | lruvec, sc); |
9b4f98cd JW |
2911 | } |
2912 | } | |
e82e0561 | 2913 | |
bd041733 MH |
2914 | cond_resched(); |
2915 | ||
e82e0561 MG |
2916 | if (nr_reclaimed < nr_to_reclaim || scan_adjusted) |
2917 | continue; | |
2918 | ||
e82e0561 MG |
2919 | /* |
2920 | * For kswapd and memcg, reclaim at least the number of pages | |
1a501907 | 2921 | * requested. Ensure that the anon and file LRUs are scanned |
e82e0561 MG |
2922 | * proportionally what was requested by get_scan_count(). We |
2923 | * stop reclaiming one LRU and reduce the amount scanning | |
2924 | * proportional to the original scan target. | |
2925 | */ | |
2926 | nr_file = nr[LRU_INACTIVE_FILE] + nr[LRU_ACTIVE_FILE]; | |
2927 | nr_anon = nr[LRU_INACTIVE_ANON] + nr[LRU_ACTIVE_ANON]; | |
2928 | ||
1a501907 MG |
2929 | /* |
2930 | * It's just vindictive to attack the larger once the smaller | |
2931 | * has gone to zero. And given the way we stop scanning the | |
2932 | * smaller below, this makes sure that we only make one nudge | |
2933 | * towards proportionality once we've got nr_to_reclaim. | |
2934 | */ | |
2935 | if (!nr_file || !nr_anon) | |
2936 | break; | |
2937 | ||
e82e0561 MG |
2938 | if (nr_file > nr_anon) { |
2939 | unsigned long scan_target = targets[LRU_INACTIVE_ANON] + | |
2940 | targets[LRU_ACTIVE_ANON] + 1; | |
2941 | lru = LRU_BASE; | |
2942 | percentage = nr_anon * 100 / scan_target; | |
2943 | } else { | |
2944 | unsigned long scan_target = targets[LRU_INACTIVE_FILE] + | |
2945 | targets[LRU_ACTIVE_FILE] + 1; | |
2946 | lru = LRU_FILE; | |
2947 | percentage = nr_file * 100 / scan_target; | |
2948 | } | |
2949 | ||
2950 | /* Stop scanning the smaller of the LRU */ | |
2951 | nr[lru] = 0; | |
2952 | nr[lru + LRU_ACTIVE] = 0; | |
2953 | ||
2954 | /* | |
2955 | * Recalculate the other LRU scan count based on its original | |
2956 | * scan target and the percentage scanning already complete | |
2957 | */ | |
2958 | lru = (lru == LRU_FILE) ? LRU_BASE : LRU_FILE; | |
2959 | nr_scanned = targets[lru] - nr[lru]; | |
2960 | nr[lru] = targets[lru] * (100 - percentage) / 100; | |
2961 | nr[lru] -= min(nr[lru], nr_scanned); | |
2962 | ||
2963 | lru += LRU_ACTIVE; | |
2964 | nr_scanned = targets[lru] - nr[lru]; | |
2965 | nr[lru] = targets[lru] * (100 - percentage) / 100; | |
2966 | nr[lru] -= min(nr[lru], nr_scanned); | |
2967 | ||
2968 | scan_adjusted = true; | |
9b4f98cd JW |
2969 | } |
2970 | blk_finish_plug(&plug); | |
2971 | sc->nr_reclaimed += nr_reclaimed; | |
2972 | ||
2973 | /* | |
2974 | * Even if we did not try to evict anon pages at all, we want to | |
2975 | * rebalance the anon lru active/inactive ratio. | |
2976 | */ | |
2f368a9f DH |
2977 | if (can_age_anon_pages(lruvec_pgdat(lruvec), sc) && |
2978 | inactive_is_low(lruvec, LRU_INACTIVE_ANON)) | |
9b4f98cd JW |
2979 | shrink_active_list(SWAP_CLUSTER_MAX, lruvec, |
2980 | sc, LRU_ACTIVE_ANON); | |
9b4f98cd JW |
2981 | } |
2982 | ||
23b9da55 | 2983 | /* Use reclaim/compaction for costly allocs or under memory pressure */ |
9e3b2f8c | 2984 | static bool in_reclaim_compaction(struct scan_control *sc) |
23b9da55 | 2985 | { |
d84da3f9 | 2986 | if (IS_ENABLED(CONFIG_COMPACTION) && sc->order && |
23b9da55 | 2987 | (sc->order > PAGE_ALLOC_COSTLY_ORDER || |
9e3b2f8c | 2988 | sc->priority < DEF_PRIORITY - 2)) |
23b9da55 MG |
2989 | return true; |
2990 | ||
2991 | return false; | |
2992 | } | |
2993 | ||
3e7d3449 | 2994 | /* |
23b9da55 MG |
2995 | * Reclaim/compaction is used for high-order allocation requests. It reclaims |
2996 | * order-0 pages before compacting the zone. should_continue_reclaim() returns | |
2997 | * true if more pages should be reclaimed such that when the page allocator | |
df3a45f9 | 2998 | * calls try_to_compact_pages() that it will have enough free pages to succeed. |
23b9da55 | 2999 | * It will give up earlier than that if there is difficulty reclaiming pages. |
3e7d3449 | 3000 | */ |
a9dd0a83 | 3001 | static inline bool should_continue_reclaim(struct pglist_data *pgdat, |
3e7d3449 | 3002 | unsigned long nr_reclaimed, |
3e7d3449 MG |
3003 | struct scan_control *sc) |
3004 | { | |
3005 | unsigned long pages_for_compaction; | |
3006 | unsigned long inactive_lru_pages; | |
a9dd0a83 | 3007 | int z; |
3e7d3449 MG |
3008 | |
3009 | /* If not in reclaim/compaction mode, stop */ | |
9e3b2f8c | 3010 | if (!in_reclaim_compaction(sc)) |
3e7d3449 MG |
3011 | return false; |
3012 | ||
5ee04716 VB |
3013 | /* |
3014 | * Stop if we failed to reclaim any pages from the last SWAP_CLUSTER_MAX | |
3015 | * number of pages that were scanned. This will return to the caller | |
3016 | * with the risk reclaim/compaction and the resulting allocation attempt | |
3017 | * fails. In the past we have tried harder for __GFP_RETRY_MAYFAIL | |
3018 | * allocations through requiring that the full LRU list has been scanned | |
3019 | * first, by assuming that zero delta of sc->nr_scanned means full LRU | |
3020 | * scan, but that approximation was wrong, and there were corner cases | |
3021 | * where always a non-zero amount of pages were scanned. | |
3022 | */ | |
3023 | if (!nr_reclaimed) | |
3024 | return false; | |
3e7d3449 | 3025 | |
3e7d3449 | 3026 | /* If compaction would go ahead or the allocation would succeed, stop */ |
a9dd0a83 MG |
3027 | for (z = 0; z <= sc->reclaim_idx; z++) { |
3028 | struct zone *zone = &pgdat->node_zones[z]; | |
6aa303de | 3029 | if (!managed_zone(zone)) |
a9dd0a83 MG |
3030 | continue; |
3031 | ||
3032 | switch (compaction_suitable(zone, sc->order, 0, sc->reclaim_idx)) { | |
cf378319 | 3033 | case COMPACT_SUCCESS: |
a9dd0a83 MG |
3034 | case COMPACT_CONTINUE: |
3035 | return false; | |
3036 | default: | |
3037 | /* check next zone */ | |
3038 | ; | |
3039 | } | |
3e7d3449 | 3040 | } |
1c6c1597 HD |
3041 | |
3042 | /* | |
3043 | * If we have not reclaimed enough pages for compaction and the | |
3044 | * inactive lists are large enough, continue reclaiming | |
3045 | */ | |
3046 | pages_for_compaction = compact_gap(sc->order); | |
3047 | inactive_lru_pages = node_page_state(pgdat, NR_INACTIVE_FILE); | |
a2a36488 | 3048 | if (can_reclaim_anon_pages(NULL, pgdat->node_id, sc)) |
1c6c1597 HD |
3049 | inactive_lru_pages += node_page_state(pgdat, NR_INACTIVE_ANON); |
3050 | ||
5ee04716 | 3051 | return inactive_lru_pages > pages_for_compaction; |
3e7d3449 MG |
3052 | } |
3053 | ||
0f6a5cff | 3054 | static void shrink_node_memcgs(pg_data_t *pgdat, struct scan_control *sc) |
1da177e4 | 3055 | { |
0f6a5cff | 3056 | struct mem_cgroup *target_memcg = sc->target_mem_cgroup; |
d2af3397 | 3057 | struct mem_cgroup *memcg; |
1da177e4 | 3058 | |
0f6a5cff | 3059 | memcg = mem_cgroup_iter(target_memcg, NULL, NULL); |
d2af3397 | 3060 | do { |
afaf07a6 | 3061 | struct lruvec *lruvec = mem_cgroup_lruvec(memcg, pgdat); |
d2af3397 JW |
3062 | unsigned long reclaimed; |
3063 | unsigned long scanned; | |
5660048c | 3064 | |
e3336cab XP |
3065 | /* |
3066 | * This loop can become CPU-bound when target memcgs | |
3067 | * aren't eligible for reclaim - either because they | |
3068 | * don't have any reclaimable pages, or because their | |
3069 | * memory is explicitly protected. Avoid soft lockups. | |
3070 | */ | |
3071 | cond_resched(); | |
3072 | ||
45c7f7e1 CD |
3073 | mem_cgroup_calculate_protection(target_memcg, memcg); |
3074 | ||
3075 | if (mem_cgroup_below_min(memcg)) { | |
d2af3397 JW |
3076 | /* |
3077 | * Hard protection. | |
3078 | * If there is no reclaimable memory, OOM. | |
3079 | */ | |
3080 | continue; | |
45c7f7e1 | 3081 | } else if (mem_cgroup_below_low(memcg)) { |
d2af3397 JW |
3082 | /* |
3083 | * Soft protection. | |
3084 | * Respect the protection only as long as | |
3085 | * there is an unprotected supply | |
3086 | * of reclaimable memory from other cgroups. | |
3087 | */ | |
3088 | if (!sc->memcg_low_reclaim) { | |
3089 | sc->memcg_low_skipped = 1; | |
bf8d5d52 | 3090 | continue; |
241994ed | 3091 | } |
d2af3397 | 3092 | memcg_memory_event(memcg, MEMCG_LOW); |
d2af3397 | 3093 | } |
241994ed | 3094 | |
d2af3397 JW |
3095 | reclaimed = sc->nr_reclaimed; |
3096 | scanned = sc->nr_scanned; | |
afaf07a6 JW |
3097 | |
3098 | shrink_lruvec(lruvec, sc); | |
70ddf637 | 3099 | |
d2af3397 JW |
3100 | shrink_slab(sc->gfp_mask, pgdat->node_id, memcg, |
3101 | sc->priority); | |
6b4f7799 | 3102 | |
d2af3397 JW |
3103 | /* Record the group's reclaim efficiency */ |
3104 | vmpressure(sc->gfp_mask, memcg, false, | |
3105 | sc->nr_scanned - scanned, | |
3106 | sc->nr_reclaimed - reclaimed); | |
70ddf637 | 3107 | |
0f6a5cff JW |
3108 | } while ((memcg = mem_cgroup_iter(target_memcg, memcg, NULL))); |
3109 | } | |
3110 | ||
6c9e0907 | 3111 | static void shrink_node(pg_data_t *pgdat, struct scan_control *sc) |
0f6a5cff JW |
3112 | { |
3113 | struct reclaim_state *reclaim_state = current->reclaim_state; | |
0f6a5cff | 3114 | unsigned long nr_reclaimed, nr_scanned; |
1b05117d | 3115 | struct lruvec *target_lruvec; |
0f6a5cff | 3116 | bool reclaimable = false; |
b91ac374 | 3117 | unsigned long file; |
0f6a5cff | 3118 | |
1b05117d JW |
3119 | target_lruvec = mem_cgroup_lruvec(sc->target_mem_cgroup, pgdat); |
3120 | ||
0f6a5cff | 3121 | again: |
aa48e47e SB |
3122 | /* |
3123 | * Flush the memory cgroup stats, so that we read accurate per-memcg | |
3124 | * lruvec stats for heuristics. | |
3125 | */ | |
3126 | mem_cgroup_flush_stats(); | |
3127 | ||
0f6a5cff JW |
3128 | memset(&sc->nr, 0, sizeof(sc->nr)); |
3129 | ||
3130 | nr_reclaimed = sc->nr_reclaimed; | |
3131 | nr_scanned = sc->nr_scanned; | |
3132 | ||
7cf111bc JW |
3133 | /* |
3134 | * Determine the scan balance between anon and file LRUs. | |
3135 | */ | |
6168d0da | 3136 | spin_lock_irq(&target_lruvec->lru_lock); |
7cf111bc JW |
3137 | sc->anon_cost = target_lruvec->anon_cost; |
3138 | sc->file_cost = target_lruvec->file_cost; | |
6168d0da | 3139 | spin_unlock_irq(&target_lruvec->lru_lock); |
7cf111bc | 3140 | |
b91ac374 JW |
3141 | /* |
3142 | * Target desirable inactive:active list ratios for the anon | |
3143 | * and file LRU lists. | |
3144 | */ | |
3145 | if (!sc->force_deactivate) { | |
3146 | unsigned long refaults; | |
3147 | ||
170b04b7 JK |
3148 | refaults = lruvec_page_state(target_lruvec, |
3149 | WORKINGSET_ACTIVATE_ANON); | |
3150 | if (refaults != target_lruvec->refaults[0] || | |
3151 | inactive_is_low(target_lruvec, LRU_INACTIVE_ANON)) | |
b91ac374 JW |
3152 | sc->may_deactivate |= DEACTIVATE_ANON; |
3153 | else | |
3154 | sc->may_deactivate &= ~DEACTIVATE_ANON; | |
3155 | ||
3156 | /* | |
3157 | * When refaults are being observed, it means a new | |
3158 | * workingset is being established. Deactivate to get | |
3159 | * rid of any stale active pages quickly. | |
3160 | */ | |
3161 | refaults = lruvec_page_state(target_lruvec, | |
170b04b7 JK |
3162 | WORKINGSET_ACTIVATE_FILE); |
3163 | if (refaults != target_lruvec->refaults[1] || | |
b91ac374 JW |
3164 | inactive_is_low(target_lruvec, LRU_INACTIVE_FILE)) |
3165 | sc->may_deactivate |= DEACTIVATE_FILE; | |
3166 | else | |
3167 | sc->may_deactivate &= ~DEACTIVATE_FILE; | |
3168 | } else | |
3169 | sc->may_deactivate = DEACTIVATE_ANON | DEACTIVATE_FILE; | |
3170 | ||
3171 | /* | |
3172 | * If we have plenty of inactive file pages that aren't | |
3173 | * thrashing, try to reclaim those first before touching | |
3174 | * anonymous pages. | |
3175 | */ | |
3176 | file = lruvec_page_state(target_lruvec, NR_INACTIVE_FILE); | |
3177 | if (file >> sc->priority && !(sc->may_deactivate & DEACTIVATE_FILE)) | |
3178 | sc->cache_trim_mode = 1; | |
3179 | else | |
3180 | sc->cache_trim_mode = 0; | |
3181 | ||
53138cea JW |
3182 | /* |
3183 | * Prevent the reclaimer from falling into the cache trap: as | |
3184 | * cache pages start out inactive, every cache fault will tip | |
3185 | * the scan balance towards the file LRU. And as the file LRU | |
3186 | * shrinks, so does the window for rotation from references. | |
3187 | * This means we have a runaway feedback loop where a tiny | |
3188 | * thrashing file LRU becomes infinitely more attractive than | |
3189 | * anon pages. Try to detect this based on file LRU size. | |
3190 | */ | |
3191 | if (!cgroup_reclaim(sc)) { | |
53138cea | 3192 | unsigned long total_high_wmark = 0; |
b91ac374 JW |
3193 | unsigned long free, anon; |
3194 | int z; | |
53138cea JW |
3195 | |
3196 | free = sum_zone_node_page_state(pgdat->node_id, NR_FREE_PAGES); | |
3197 | file = node_page_state(pgdat, NR_ACTIVE_FILE) + | |
3198 | node_page_state(pgdat, NR_INACTIVE_FILE); | |
3199 | ||
3200 | for (z = 0; z < MAX_NR_ZONES; z++) { | |
3201 | struct zone *zone = &pgdat->node_zones[z]; | |
3202 | if (!managed_zone(zone)) | |
3203 | continue; | |
3204 | ||
3205 | total_high_wmark += high_wmark_pages(zone); | |
3206 | } | |
3207 | ||
b91ac374 JW |
3208 | /* |
3209 | * Consider anon: if that's low too, this isn't a | |
3210 | * runaway file reclaim problem, but rather just | |
3211 | * extreme pressure. Reclaim as per usual then. | |
3212 | */ | |
3213 | anon = node_page_state(pgdat, NR_INACTIVE_ANON); | |
3214 | ||
3215 | sc->file_is_tiny = | |
3216 | file + free <= total_high_wmark && | |
3217 | !(sc->may_deactivate & DEACTIVATE_ANON) && | |
3218 | anon >> sc->priority; | |
53138cea JW |
3219 | } |
3220 | ||
0f6a5cff | 3221 | shrink_node_memcgs(pgdat, sc); |
2344d7e4 | 3222 | |
d2af3397 JW |
3223 | if (reclaim_state) { |
3224 | sc->nr_reclaimed += reclaim_state->reclaimed_slab; | |
3225 | reclaim_state->reclaimed_slab = 0; | |
3226 | } | |
d108c772 | 3227 | |
d2af3397 | 3228 | /* Record the subtree's reclaim efficiency */ |
1b05117d | 3229 | vmpressure(sc->gfp_mask, sc->target_mem_cgroup, true, |
d2af3397 JW |
3230 | sc->nr_scanned - nr_scanned, |
3231 | sc->nr_reclaimed - nr_reclaimed); | |
d108c772 | 3232 | |
d2af3397 JW |
3233 | if (sc->nr_reclaimed - nr_reclaimed) |
3234 | reclaimable = true; | |
d108c772 | 3235 | |
d2af3397 JW |
3236 | if (current_is_kswapd()) { |
3237 | /* | |
3238 | * If reclaim is isolating dirty pages under writeback, | |
3239 | * it implies that the long-lived page allocation rate | |
3240 | * is exceeding the page laundering rate. Either the | |
3241 | * global limits are not being effective at throttling | |
3242 | * processes due to the page distribution throughout | |
3243 | * zones or there is heavy usage of a slow backing | |
3244 | * device. The only option is to throttle from reclaim | |
3245 | * context which is not ideal as there is no guarantee | |
3246 | * the dirtying process is throttled in the same way | |
3247 | * balance_dirty_pages() manages. | |
3248 | * | |
3249 | * Once a node is flagged PGDAT_WRITEBACK, kswapd will | |
3250 | * count the number of pages under pages flagged for | |
3251 | * immediate reclaim and stall if any are encountered | |
3252 | * in the nr_immediate check below. | |
3253 | */ | |
3254 | if (sc->nr.writeback && sc->nr.writeback == sc->nr.taken) | |
3255 | set_bit(PGDAT_WRITEBACK, &pgdat->flags); | |
d108c772 | 3256 | |
d2af3397 JW |
3257 | /* Allow kswapd to start writing pages during reclaim.*/ |
3258 | if (sc->nr.unqueued_dirty == sc->nr.file_taken) | |
3259 | set_bit(PGDAT_DIRTY, &pgdat->flags); | |
e3c1ac58 | 3260 | |
d108c772 | 3261 | /* |
1eba09c1 | 3262 | * If kswapd scans pages marked for immediate |
d2af3397 JW |
3263 | * reclaim and under writeback (nr_immediate), it |
3264 | * implies that pages are cycling through the LRU | |
8cd7c588 MG |
3265 | * faster than they are written so forcibly stall |
3266 | * until some pages complete writeback. | |
d108c772 | 3267 | */ |
d2af3397 | 3268 | if (sc->nr.immediate) |
c3f4a9a2 | 3269 | reclaim_throttle(pgdat, VMSCAN_THROTTLE_WRITEBACK); |
d2af3397 JW |
3270 | } |
3271 | ||
3272 | /* | |
8cd7c588 MG |
3273 | * Tag a node/memcg as congested if all the dirty pages were marked |
3274 | * for writeback and immediate reclaim (counted in nr.congested). | |
1b05117d | 3275 | * |
d2af3397 | 3276 | * Legacy memcg will stall in page writeback so avoid forcibly |
8cd7c588 | 3277 | * stalling in reclaim_throttle(). |
d2af3397 | 3278 | */ |
1b05117d JW |
3279 | if ((current_is_kswapd() || |
3280 | (cgroup_reclaim(sc) && writeback_throttling_sane(sc))) && | |
d2af3397 | 3281 | sc->nr.dirty && sc->nr.dirty == sc->nr.congested) |
1b05117d | 3282 | set_bit(LRUVEC_CONGESTED, &target_lruvec->flags); |
d2af3397 JW |
3283 | |
3284 | /* | |
8cd7c588 MG |
3285 | * Stall direct reclaim for IO completions if the lruvec is |
3286 | * node is congested. Allow kswapd to continue until it | |
d2af3397 JW |
3287 | * starts encountering unqueued dirty pages or cycling through |
3288 | * the LRU too quickly. | |
3289 | */ | |
1b05117d JW |
3290 | if (!current_is_kswapd() && current_may_throttle() && |
3291 | !sc->hibernation_mode && | |
3292 | test_bit(LRUVEC_CONGESTED, &target_lruvec->flags)) | |
1b4e3f26 | 3293 | reclaim_throttle(pgdat, VMSCAN_THROTTLE_CONGESTED); |
d108c772 | 3294 | |
d2af3397 JW |
3295 | if (should_continue_reclaim(pgdat, sc->nr_reclaimed - nr_reclaimed, |
3296 | sc)) | |
3297 | goto again; | |
2344d7e4 | 3298 | |
c73322d0 JW |
3299 | /* |
3300 | * Kswapd gives up on balancing particular nodes after too | |
3301 | * many failures to reclaim anything from them and goes to | |
3302 | * sleep. On reclaim progress, reset the failure counter. A | |
3303 | * successful direct reclaim run will revive a dormant kswapd. | |
3304 | */ | |
3305 | if (reclaimable) | |
3306 | pgdat->kswapd_failures = 0; | |
f16015fb JW |
3307 | } |
3308 | ||
53853e2d | 3309 | /* |
fdd4c614 VB |
3310 | * Returns true if compaction should go ahead for a costly-order request, or |
3311 | * the allocation would already succeed without compaction. Return false if we | |
3312 | * should reclaim first. | |
53853e2d | 3313 | */ |
4f588331 | 3314 | static inline bool compaction_ready(struct zone *zone, struct scan_control *sc) |
fe4b1b24 | 3315 | { |
31483b6a | 3316 | unsigned long watermark; |
fdd4c614 | 3317 | enum compact_result suitable; |
fe4b1b24 | 3318 | |
fdd4c614 VB |
3319 | suitable = compaction_suitable(zone, sc->order, 0, sc->reclaim_idx); |
3320 | if (suitable == COMPACT_SUCCESS) | |
3321 | /* Allocation should succeed already. Don't reclaim. */ | |
3322 | return true; | |
3323 | if (suitable == COMPACT_SKIPPED) | |
3324 | /* Compaction cannot yet proceed. Do reclaim. */ | |
3325 | return false; | |
fe4b1b24 | 3326 | |
53853e2d | 3327 | /* |
fdd4c614 VB |
3328 | * Compaction is already possible, but it takes time to run and there |
3329 | * are potentially other callers using the pages just freed. So proceed | |
3330 | * with reclaim to make a buffer of free pages available to give | |
3331 | * compaction a reasonable chance of completing and allocating the page. | |
3332 | * Note that we won't actually reclaim the whole buffer in one attempt | |
3333 | * as the target watermark in should_continue_reclaim() is lower. But if | |
3334 | * we are already above the high+gap watermark, don't reclaim at all. | |
53853e2d | 3335 | */ |
fdd4c614 | 3336 | watermark = high_wmark_pages(zone) + compact_gap(sc->order); |
fe4b1b24 | 3337 | |
fdd4c614 | 3338 | return zone_watermark_ok_safe(zone, 0, watermark, sc->reclaim_idx); |
fe4b1b24 MG |
3339 | } |
3340 | ||
69392a40 MG |
3341 | static void consider_reclaim_throttle(pg_data_t *pgdat, struct scan_control *sc) |
3342 | { | |
66ce520b MG |
3343 | /* |
3344 | * If reclaim is making progress greater than 12% efficiency then | |
3345 | * wake all the NOPROGRESS throttled tasks. | |
3346 | */ | |
3347 | if (sc->nr_reclaimed > (sc->nr_scanned >> 3)) { | |
69392a40 MG |
3348 | wait_queue_head_t *wqh; |
3349 | ||
3350 | wqh = &pgdat->reclaim_wait[VMSCAN_THROTTLE_NOPROGRESS]; | |
3351 | if (waitqueue_active(wqh)) | |
3352 | wake_up(wqh); | |
3353 | ||
3354 | return; | |
3355 | } | |
3356 | ||
3357 | /* | |
1b4e3f26 MG |
3358 | * Do not throttle kswapd or cgroup reclaim on NOPROGRESS as it will |
3359 | * throttle on VMSCAN_THROTTLE_WRITEBACK if there are too many pages | |
3360 | * under writeback and marked for immediate reclaim at the tail of the | |
3361 | * LRU. | |
69392a40 | 3362 | */ |
1b4e3f26 | 3363 | if (current_is_kswapd() || cgroup_reclaim(sc)) |
69392a40 MG |
3364 | return; |
3365 | ||
3366 | /* Throttle if making no progress at high prioities. */ | |
1b4e3f26 | 3367 | if (sc->priority == 1 && !sc->nr_reclaimed) |
c3f4a9a2 | 3368 | reclaim_throttle(pgdat, VMSCAN_THROTTLE_NOPROGRESS); |
69392a40 MG |
3369 | } |
3370 | ||
1da177e4 LT |
3371 | /* |
3372 | * This is the direct reclaim path, for page-allocating processes. We only | |
3373 | * try to reclaim pages from zones which will satisfy the caller's allocation | |
3374 | * request. | |
3375 | * | |
1da177e4 LT |
3376 | * If a zone is deemed to be full of pinned pages then just give it a light |
3377 | * scan then give up on it. | |
3378 | */ | |
0a0337e0 | 3379 | static void shrink_zones(struct zonelist *zonelist, struct scan_control *sc) |
1da177e4 | 3380 | { |
dd1a239f | 3381 | struct zoneref *z; |
54a6eb5c | 3382 | struct zone *zone; |
0608f43d AM |
3383 | unsigned long nr_soft_reclaimed; |
3384 | unsigned long nr_soft_scanned; | |
619d0d76 | 3385 | gfp_t orig_mask; |
79dafcdc | 3386 | pg_data_t *last_pgdat = NULL; |
1b4e3f26 | 3387 | pg_data_t *first_pgdat = NULL; |
1cfb419b | 3388 | |
cc715d99 MG |
3389 | /* |
3390 | * If the number of buffer_heads in the machine exceeds the maximum | |
3391 | * allowed level, force direct reclaim to scan the highmem zone as | |
3392 | * highmem pages could be pinning lowmem pages storing buffer_heads | |
3393 | */ | |
619d0d76 | 3394 | orig_mask = sc->gfp_mask; |
b2e18757 | 3395 | if (buffer_heads_over_limit) { |
cc715d99 | 3396 | sc->gfp_mask |= __GFP_HIGHMEM; |
4f588331 | 3397 | sc->reclaim_idx = gfp_zone(sc->gfp_mask); |
b2e18757 | 3398 | } |
cc715d99 | 3399 | |
d4debc66 | 3400 | for_each_zone_zonelist_nodemask(zone, z, zonelist, |
b2e18757 | 3401 | sc->reclaim_idx, sc->nodemask) { |
1cfb419b KH |
3402 | /* |
3403 | * Take care memory controller reclaiming has small influence | |
3404 | * to global LRU. | |
3405 | */ | |
b5ead35e | 3406 | if (!cgroup_reclaim(sc)) { |
344736f2 VD |
3407 | if (!cpuset_zone_allowed(zone, |
3408 | GFP_KERNEL | __GFP_HARDWALL)) | |
1cfb419b | 3409 | continue; |
65ec02cb | 3410 | |
0b06496a JW |
3411 | /* |
3412 | * If we already have plenty of memory free for | |
3413 | * compaction in this zone, don't free any more. | |
3414 | * Even though compaction is invoked for any | |
3415 | * non-zero order, only frequent costly order | |
3416 | * reclamation is disruptive enough to become a | |
3417 | * noticeable problem, like transparent huge | |
3418 | * page allocations. | |
3419 | */ | |
3420 | if (IS_ENABLED(CONFIG_COMPACTION) && | |
3421 | sc->order > PAGE_ALLOC_COSTLY_ORDER && | |
4f588331 | 3422 | compaction_ready(zone, sc)) { |
0b06496a JW |
3423 | sc->compaction_ready = true; |
3424 | continue; | |
e0887c19 | 3425 | } |
0b06496a | 3426 | |
79dafcdc MG |
3427 | /* |
3428 | * Shrink each node in the zonelist once. If the | |
3429 | * zonelist is ordered by zone (not the default) then a | |
3430 | * node may be shrunk multiple times but in that case | |
3431 | * the user prefers lower zones being preserved. | |
3432 | */ | |
3433 | if (zone->zone_pgdat == last_pgdat) | |
3434 | continue; | |
3435 | ||
0608f43d AM |
3436 | /* |
3437 | * This steals pages from memory cgroups over softlimit | |
3438 | * and returns the number of reclaimed pages and | |
3439 | * scanned pages. This works for global memory pressure | |
3440 | * and balancing, not for a memcg's limit. | |
3441 | */ | |
3442 | nr_soft_scanned = 0; | |
ef8f2327 | 3443 | nr_soft_reclaimed = mem_cgroup_soft_limit_reclaim(zone->zone_pgdat, |
0608f43d AM |
3444 | sc->order, sc->gfp_mask, |
3445 | &nr_soft_scanned); | |
3446 | sc->nr_reclaimed += nr_soft_reclaimed; | |
3447 | sc->nr_scanned += nr_soft_scanned; | |
ac34a1a3 | 3448 | /* need some check for avoid more shrink_zone() */ |
1cfb419b | 3449 | } |
408d8544 | 3450 | |
1b4e3f26 MG |
3451 | if (!first_pgdat) |
3452 | first_pgdat = zone->zone_pgdat; | |
3453 | ||
79dafcdc MG |
3454 | /* See comment about same check for global reclaim above */ |
3455 | if (zone->zone_pgdat == last_pgdat) | |
3456 | continue; | |
3457 | last_pgdat = zone->zone_pgdat; | |
970a39a3 | 3458 | shrink_node(zone->zone_pgdat, sc); |
1da177e4 | 3459 | } |
e0c23279 | 3460 | |
80082938 MG |
3461 | if (first_pgdat) |
3462 | consider_reclaim_throttle(first_pgdat, sc); | |
1b4e3f26 | 3463 | |
619d0d76 WY |
3464 | /* |
3465 | * Restore to original mask to avoid the impact on the caller if we | |
3466 | * promoted it to __GFP_HIGHMEM. | |
3467 | */ | |
3468 | sc->gfp_mask = orig_mask; | |
1da177e4 | 3469 | } |
4f98a2fe | 3470 | |
b910718a | 3471 | static void snapshot_refaults(struct mem_cgroup *target_memcg, pg_data_t *pgdat) |
2a2e4885 | 3472 | { |
b910718a JW |
3473 | struct lruvec *target_lruvec; |
3474 | unsigned long refaults; | |
2a2e4885 | 3475 | |
b910718a | 3476 | target_lruvec = mem_cgroup_lruvec(target_memcg, pgdat); |
170b04b7 JK |
3477 | refaults = lruvec_page_state(target_lruvec, WORKINGSET_ACTIVATE_ANON); |
3478 | target_lruvec->refaults[0] = refaults; | |
3479 | refaults = lruvec_page_state(target_lruvec, WORKINGSET_ACTIVATE_FILE); | |
3480 | target_lruvec->refaults[1] = refaults; | |
2a2e4885 JW |
3481 | } |
3482 | ||
1da177e4 LT |
3483 | /* |
3484 | * This is the main entry point to direct page reclaim. | |
3485 | * | |
3486 | * If a full scan of the inactive list fails to free enough memory then we | |
3487 | * are "out of memory" and something needs to be killed. | |
3488 | * | |
3489 | * If the caller is !__GFP_FS then the probability of a failure is reasonably | |
3490 | * high - the zone may be full of dirty or under-writeback pages, which this | |
5b0830cb JA |
3491 | * caller can't do much about. We kick the writeback threads and take explicit |
3492 | * naps in the hope that some of these pages can be written. But if the | |
3493 | * allocating task holds filesystem locks which prevent writeout this might not | |
3494 | * work, and the allocation attempt will fail. | |
a41f24ea NA |
3495 | * |
3496 | * returns: 0, if no pages reclaimed | |
3497 | * else, the number of pages reclaimed | |
1da177e4 | 3498 | */ |
dac1d27b | 3499 | static unsigned long do_try_to_free_pages(struct zonelist *zonelist, |
3115cd91 | 3500 | struct scan_control *sc) |
1da177e4 | 3501 | { |
241994ed | 3502 | int initial_priority = sc->priority; |
2a2e4885 JW |
3503 | pg_data_t *last_pgdat; |
3504 | struct zoneref *z; | |
3505 | struct zone *zone; | |
241994ed | 3506 | retry: |
873b4771 KK |
3507 | delayacct_freepages_start(); |
3508 | ||
b5ead35e | 3509 | if (!cgroup_reclaim(sc)) |
7cc30fcf | 3510 | __count_zid_vm_events(ALLOCSTALL, sc->reclaim_idx, 1); |
1da177e4 | 3511 | |
9e3b2f8c | 3512 | do { |
70ddf637 AV |
3513 | vmpressure_prio(sc->gfp_mask, sc->target_mem_cgroup, |
3514 | sc->priority); | |
66e1707b | 3515 | sc->nr_scanned = 0; |
0a0337e0 | 3516 | shrink_zones(zonelist, sc); |
c6a8a8c5 | 3517 | |
bb21c7ce | 3518 | if (sc->nr_reclaimed >= sc->nr_to_reclaim) |
0b06496a JW |
3519 | break; |
3520 | ||
3521 | if (sc->compaction_ready) | |
3522 | break; | |
1da177e4 | 3523 | |
0e50ce3b MK |
3524 | /* |
3525 | * If we're getting trouble reclaiming, start doing | |
3526 | * writepage even in laptop mode. | |
3527 | */ | |
3528 | if (sc->priority < DEF_PRIORITY - 2) | |
3529 | sc->may_writepage = 1; | |
0b06496a | 3530 | } while (--sc->priority >= 0); |
bb21c7ce | 3531 | |
2a2e4885 JW |
3532 | last_pgdat = NULL; |
3533 | for_each_zone_zonelist_nodemask(zone, z, zonelist, sc->reclaim_idx, | |
3534 | sc->nodemask) { | |
3535 | if (zone->zone_pgdat == last_pgdat) | |
3536 | continue; | |
3537 | last_pgdat = zone->zone_pgdat; | |
1b05117d | 3538 | |
2a2e4885 | 3539 | snapshot_refaults(sc->target_mem_cgroup, zone->zone_pgdat); |
1b05117d JW |
3540 | |
3541 | if (cgroup_reclaim(sc)) { | |
3542 | struct lruvec *lruvec; | |
3543 | ||
3544 | lruvec = mem_cgroup_lruvec(sc->target_mem_cgroup, | |
3545 | zone->zone_pgdat); | |
3546 | clear_bit(LRUVEC_CONGESTED, &lruvec->flags); | |
3547 | } | |
2a2e4885 JW |
3548 | } |
3549 | ||
873b4771 KK |
3550 | delayacct_freepages_end(); |
3551 | ||
bb21c7ce KM |
3552 | if (sc->nr_reclaimed) |
3553 | return sc->nr_reclaimed; | |
3554 | ||
0cee34fd | 3555 | /* Aborted reclaim to try compaction? don't OOM, then */ |
0b06496a | 3556 | if (sc->compaction_ready) |
7335084d MG |
3557 | return 1; |
3558 | ||
b91ac374 JW |
3559 | /* |
3560 | * We make inactive:active ratio decisions based on the node's | |
3561 | * composition of memory, but a restrictive reclaim_idx or a | |
3562 | * memory.low cgroup setting can exempt large amounts of | |
3563 | * memory from reclaim. Neither of which are very common, so | |
3564 | * instead of doing costly eligibility calculations of the | |
3565 | * entire cgroup subtree up front, we assume the estimates are | |
3566 | * good, and retry with forcible deactivation if that fails. | |
3567 | */ | |
3568 | if (sc->skipped_deactivate) { | |
3569 | sc->priority = initial_priority; | |
3570 | sc->force_deactivate = 1; | |
3571 | sc->skipped_deactivate = 0; | |
3572 | goto retry; | |
3573 | } | |
3574 | ||
241994ed | 3575 | /* Untapped cgroup reserves? Don't OOM, retry. */ |
d6622f63 | 3576 | if (sc->memcg_low_skipped) { |
241994ed | 3577 | sc->priority = initial_priority; |
b91ac374 | 3578 | sc->force_deactivate = 0; |
d6622f63 YX |
3579 | sc->memcg_low_reclaim = 1; |
3580 | sc->memcg_low_skipped = 0; | |
241994ed JW |
3581 | goto retry; |
3582 | } | |
3583 | ||
bb21c7ce | 3584 | return 0; |
1da177e4 LT |
3585 | } |
3586 | ||
c73322d0 | 3587 | static bool allow_direct_reclaim(pg_data_t *pgdat) |
5515061d MG |
3588 | { |
3589 | struct zone *zone; | |
3590 | unsigned long pfmemalloc_reserve = 0; | |
3591 | unsigned long free_pages = 0; | |
3592 | int i; | |
3593 | bool wmark_ok; | |
3594 | ||
c73322d0 JW |
3595 | if (pgdat->kswapd_failures >= MAX_RECLAIM_RETRIES) |
3596 | return true; | |
3597 | ||
5515061d MG |
3598 | for (i = 0; i <= ZONE_NORMAL; i++) { |
3599 | zone = &pgdat->node_zones[i]; | |
d450abd8 JW |
3600 | if (!managed_zone(zone)) |
3601 | continue; | |
3602 | ||
3603 | if (!zone_reclaimable_pages(zone)) | |
675becce MG |
3604 | continue; |
3605 | ||
5515061d MG |
3606 | pfmemalloc_reserve += min_wmark_pages(zone); |
3607 | free_pages += zone_page_state(zone, NR_FREE_PAGES); | |
3608 | } | |
3609 | ||
675becce MG |
3610 | /* If there are no reserves (unexpected config) then do not throttle */ |
3611 | if (!pfmemalloc_reserve) | |
3612 | return true; | |
3613 | ||
5515061d MG |
3614 | wmark_ok = free_pages > pfmemalloc_reserve / 2; |
3615 | ||
3616 | /* kswapd must be awake if processes are being throttled */ | |
3617 | if (!wmark_ok && waitqueue_active(&pgdat->kswapd_wait)) { | |
97a225e6 JK |
3618 | if (READ_ONCE(pgdat->kswapd_highest_zoneidx) > ZONE_NORMAL) |
3619 | WRITE_ONCE(pgdat->kswapd_highest_zoneidx, ZONE_NORMAL); | |
5644e1fb | 3620 | |
5515061d MG |
3621 | wake_up_interruptible(&pgdat->kswapd_wait); |
3622 | } | |
3623 | ||
3624 | return wmark_ok; | |
3625 | } | |
3626 | ||
3627 | /* | |
3628 | * Throttle direct reclaimers if backing storage is backed by the network | |
3629 | * and the PFMEMALLOC reserve for the preferred node is getting dangerously | |
3630 | * depleted. kswapd will continue to make progress and wake the processes | |
50694c28 MG |
3631 | * when the low watermark is reached. |
3632 | * | |
3633 | * Returns true if a fatal signal was delivered during throttling. If this | |
3634 | * happens, the page allocator should not consider triggering the OOM killer. | |
5515061d | 3635 | */ |
50694c28 | 3636 | static bool throttle_direct_reclaim(gfp_t gfp_mask, struct zonelist *zonelist, |
5515061d MG |
3637 | nodemask_t *nodemask) |
3638 | { | |
675becce | 3639 | struct zoneref *z; |
5515061d | 3640 | struct zone *zone; |
675becce | 3641 | pg_data_t *pgdat = NULL; |
5515061d MG |
3642 | |
3643 | /* | |
3644 | * Kernel threads should not be throttled as they may be indirectly | |
3645 | * responsible for cleaning pages necessary for reclaim to make forward | |
3646 | * progress. kjournald for example may enter direct reclaim while | |
3647 | * committing a transaction where throttling it could forcing other | |
3648 | * processes to block on log_wait_commit(). | |
3649 | */ | |
3650 | if (current->flags & PF_KTHREAD) | |
50694c28 MG |
3651 | goto out; |
3652 | ||
3653 | /* | |
3654 | * If a fatal signal is pending, this process should not throttle. | |
3655 | * It should return quickly so it can exit and free its memory | |
3656 | */ | |
3657 | if (fatal_signal_pending(current)) | |
3658 | goto out; | |
5515061d | 3659 | |
675becce MG |
3660 | /* |
3661 | * Check if the pfmemalloc reserves are ok by finding the first node | |
3662 | * with a usable ZONE_NORMAL or lower zone. The expectation is that | |
3663 | * GFP_KERNEL will be required for allocating network buffers when | |
3664 | * swapping over the network so ZONE_HIGHMEM is unusable. | |
3665 | * | |
3666 | * Throttling is based on the first usable node and throttled processes | |
3667 | * wait on a queue until kswapd makes progress and wakes them. There | |
3668 | * is an affinity then between processes waking up and where reclaim | |
3669 | * progress has been made assuming the process wakes on the same node. | |
3670 | * More importantly, processes running on remote nodes will not compete | |
3671 | * for remote pfmemalloc reserves and processes on different nodes | |
3672 | * should make reasonable progress. | |
3673 | */ | |
3674 | for_each_zone_zonelist_nodemask(zone, z, zonelist, | |
17636faa | 3675 | gfp_zone(gfp_mask), nodemask) { |
675becce MG |
3676 | if (zone_idx(zone) > ZONE_NORMAL) |
3677 | continue; | |
3678 | ||
3679 | /* Throttle based on the first usable node */ | |
3680 | pgdat = zone->zone_pgdat; | |
c73322d0 | 3681 | if (allow_direct_reclaim(pgdat)) |
675becce MG |
3682 | goto out; |
3683 | break; | |
3684 | } | |
3685 | ||
3686 | /* If no zone was usable by the allocation flags then do not throttle */ | |
3687 | if (!pgdat) | |
50694c28 | 3688 | goto out; |
5515061d | 3689 | |
68243e76 MG |
3690 | /* Account for the throttling */ |
3691 | count_vm_event(PGSCAN_DIRECT_THROTTLE); | |
3692 | ||
5515061d MG |
3693 | /* |
3694 | * If the caller cannot enter the filesystem, it's possible that it | |
3695 | * is due to the caller holding an FS lock or performing a journal | |
3696 | * transaction in the case of a filesystem like ext[3|4]. In this case, | |
3697 | * it is not safe to block on pfmemalloc_wait as kswapd could be | |
3698 | * blocked waiting on the same lock. Instead, throttle for up to a | |
3699 | * second before continuing. | |
3700 | */ | |
2e786d9e | 3701 | if (!(gfp_mask & __GFP_FS)) |
5515061d | 3702 | wait_event_interruptible_timeout(pgdat->pfmemalloc_wait, |
c73322d0 | 3703 | allow_direct_reclaim(pgdat), HZ); |
2e786d9e ML |
3704 | else |
3705 | /* Throttle until kswapd wakes the process */ | |
3706 | wait_event_killable(zone->zone_pgdat->pfmemalloc_wait, | |
3707 | allow_direct_reclaim(pgdat)); | |
50694c28 | 3708 | |
50694c28 MG |
3709 | if (fatal_signal_pending(current)) |
3710 | return true; | |
3711 | ||
3712 | out: | |
3713 | return false; | |
5515061d MG |
3714 | } |
3715 | ||
dac1d27b | 3716 | unsigned long try_to_free_pages(struct zonelist *zonelist, int order, |
327c0e96 | 3717 | gfp_t gfp_mask, nodemask_t *nodemask) |
66e1707b | 3718 | { |
33906bc5 | 3719 | unsigned long nr_reclaimed; |
66e1707b | 3720 | struct scan_control sc = { |
ee814fe2 | 3721 | .nr_to_reclaim = SWAP_CLUSTER_MAX, |
f2f43e56 | 3722 | .gfp_mask = current_gfp_context(gfp_mask), |
b2e18757 | 3723 | .reclaim_idx = gfp_zone(gfp_mask), |
ee814fe2 JW |
3724 | .order = order, |
3725 | .nodemask = nodemask, | |
3726 | .priority = DEF_PRIORITY, | |
66e1707b | 3727 | .may_writepage = !laptop_mode, |
a6dc60f8 | 3728 | .may_unmap = 1, |
2e2e4259 | 3729 | .may_swap = 1, |
66e1707b BS |
3730 | }; |
3731 | ||
bb451fdf GT |
3732 | /* |
3733 | * scan_control uses s8 fields for order, priority, and reclaim_idx. | |
3734 | * Confirm they are large enough for max values. | |
3735 | */ | |
3736 | BUILD_BUG_ON(MAX_ORDER > S8_MAX); | |
3737 | BUILD_BUG_ON(DEF_PRIORITY > S8_MAX); | |
3738 | BUILD_BUG_ON(MAX_NR_ZONES > S8_MAX); | |
3739 | ||
5515061d | 3740 | /* |
50694c28 MG |
3741 | * Do not enter reclaim if fatal signal was delivered while throttled. |
3742 | * 1 is returned so that the page allocator does not OOM kill at this | |
3743 | * point. | |
5515061d | 3744 | */ |
f2f43e56 | 3745 | if (throttle_direct_reclaim(sc.gfp_mask, zonelist, nodemask)) |
5515061d MG |
3746 | return 1; |
3747 | ||
1732d2b0 | 3748 | set_task_reclaim_state(current, &sc.reclaim_state); |
3481c37f | 3749 | trace_mm_vmscan_direct_reclaim_begin(order, sc.gfp_mask); |
33906bc5 | 3750 | |
3115cd91 | 3751 | nr_reclaimed = do_try_to_free_pages(zonelist, &sc); |
33906bc5 MG |
3752 | |
3753 | trace_mm_vmscan_direct_reclaim_end(nr_reclaimed); | |
1732d2b0 | 3754 | set_task_reclaim_state(current, NULL); |
33906bc5 MG |
3755 | |
3756 | return nr_reclaimed; | |
66e1707b BS |
3757 | } |
3758 | ||
c255a458 | 3759 | #ifdef CONFIG_MEMCG |
66e1707b | 3760 | |
d2e5fb92 | 3761 | /* Only used by soft limit reclaim. Do not reuse for anything else. */ |
a9dd0a83 | 3762 | unsigned long mem_cgroup_shrink_node(struct mem_cgroup *memcg, |
4e416953 | 3763 | gfp_t gfp_mask, bool noswap, |
ef8f2327 | 3764 | pg_data_t *pgdat, |
0ae5e89c | 3765 | unsigned long *nr_scanned) |
4e416953 | 3766 | { |
afaf07a6 | 3767 | struct lruvec *lruvec = mem_cgroup_lruvec(memcg, pgdat); |
4e416953 | 3768 | struct scan_control sc = { |
b8f5c566 | 3769 | .nr_to_reclaim = SWAP_CLUSTER_MAX, |
ee814fe2 | 3770 | .target_mem_cgroup = memcg, |
4e416953 BS |
3771 | .may_writepage = !laptop_mode, |
3772 | .may_unmap = 1, | |
b2e18757 | 3773 | .reclaim_idx = MAX_NR_ZONES - 1, |
4e416953 | 3774 | .may_swap = !noswap, |
4e416953 | 3775 | }; |
0ae5e89c | 3776 | |
d2e5fb92 MH |
3777 | WARN_ON_ONCE(!current->reclaim_state); |
3778 | ||
4e416953 BS |
3779 | sc.gfp_mask = (gfp_mask & GFP_RECLAIM_MASK) | |
3780 | (GFP_HIGHUSER_MOVABLE & ~GFP_RECLAIM_MASK); | |
bdce6d9e | 3781 | |
9e3b2f8c | 3782 | trace_mm_vmscan_memcg_softlimit_reclaim_begin(sc.order, |
3481c37f | 3783 | sc.gfp_mask); |
bdce6d9e | 3784 | |
4e416953 BS |
3785 | /* |
3786 | * NOTE: Although we can get the priority field, using it | |
3787 | * here is not a good idea, since it limits the pages we can scan. | |
a9dd0a83 | 3788 | * if we don't reclaim here, the shrink_node from balance_pgdat |
4e416953 BS |
3789 | * will pick up pages from other mem cgroup's as well. We hack |
3790 | * the priority and make it zero. | |
3791 | */ | |
afaf07a6 | 3792 | shrink_lruvec(lruvec, &sc); |
bdce6d9e KM |
3793 | |
3794 | trace_mm_vmscan_memcg_softlimit_reclaim_end(sc.nr_reclaimed); | |
3795 | ||
0ae5e89c | 3796 | *nr_scanned = sc.nr_scanned; |
0308f7cf | 3797 | |
4e416953 BS |
3798 | return sc.nr_reclaimed; |
3799 | } | |
3800 | ||
72835c86 | 3801 | unsigned long try_to_free_mem_cgroup_pages(struct mem_cgroup *memcg, |
b70a2a21 | 3802 | unsigned long nr_pages, |
a7885eb8 | 3803 | gfp_t gfp_mask, |
b70a2a21 | 3804 | bool may_swap) |
66e1707b | 3805 | { |
bdce6d9e | 3806 | unsigned long nr_reclaimed; |
499118e9 | 3807 | unsigned int noreclaim_flag; |
66e1707b | 3808 | struct scan_control sc = { |
b70a2a21 | 3809 | .nr_to_reclaim = max(nr_pages, SWAP_CLUSTER_MAX), |
7dea19f9 | 3810 | .gfp_mask = (current_gfp_context(gfp_mask) & GFP_RECLAIM_MASK) | |
a09ed5e0 | 3811 | (GFP_HIGHUSER_MOVABLE & ~GFP_RECLAIM_MASK), |
b2e18757 | 3812 | .reclaim_idx = MAX_NR_ZONES - 1, |
ee814fe2 JW |
3813 | .target_mem_cgroup = memcg, |
3814 | .priority = DEF_PRIORITY, | |
3815 | .may_writepage = !laptop_mode, | |
3816 | .may_unmap = 1, | |
b70a2a21 | 3817 | .may_swap = may_swap, |
a09ed5e0 | 3818 | }; |
889976db | 3819 | /* |
fa40d1ee SB |
3820 | * Traverse the ZONELIST_FALLBACK zonelist of the current node to put |
3821 | * equal pressure on all the nodes. This is based on the assumption that | |
3822 | * the reclaim does not bail out early. | |
889976db | 3823 | */ |
fa40d1ee | 3824 | struct zonelist *zonelist = node_zonelist(numa_node_id(), sc.gfp_mask); |
889976db | 3825 | |
fa40d1ee | 3826 | set_task_reclaim_state(current, &sc.reclaim_state); |
3481c37f | 3827 | trace_mm_vmscan_memcg_reclaim_begin(0, sc.gfp_mask); |
499118e9 | 3828 | noreclaim_flag = memalloc_noreclaim_save(); |
eb414681 | 3829 | |
3115cd91 | 3830 | nr_reclaimed = do_try_to_free_pages(zonelist, &sc); |
eb414681 | 3831 | |
499118e9 | 3832 | memalloc_noreclaim_restore(noreclaim_flag); |
bdce6d9e | 3833 | trace_mm_vmscan_memcg_reclaim_end(nr_reclaimed); |
1732d2b0 | 3834 | set_task_reclaim_state(current, NULL); |
bdce6d9e KM |
3835 | |
3836 | return nr_reclaimed; | |
66e1707b BS |
3837 | } |
3838 | #endif | |
3839 | ||
1d82de61 | 3840 | static void age_active_anon(struct pglist_data *pgdat, |
ef8f2327 | 3841 | struct scan_control *sc) |
f16015fb | 3842 | { |
b95a2f2d | 3843 | struct mem_cgroup *memcg; |
b91ac374 | 3844 | struct lruvec *lruvec; |
f16015fb | 3845 | |
2f368a9f | 3846 | if (!can_age_anon_pages(pgdat, sc)) |
b95a2f2d JW |
3847 | return; |
3848 | ||
b91ac374 JW |
3849 | lruvec = mem_cgroup_lruvec(NULL, pgdat); |
3850 | if (!inactive_is_low(lruvec, LRU_INACTIVE_ANON)) | |
3851 | return; | |
3852 | ||
b95a2f2d JW |
3853 | memcg = mem_cgroup_iter(NULL, NULL, NULL); |
3854 | do { | |
b91ac374 JW |
3855 | lruvec = mem_cgroup_lruvec(memcg, pgdat); |
3856 | shrink_active_list(SWAP_CLUSTER_MAX, lruvec, | |
3857 | sc, LRU_ACTIVE_ANON); | |
b95a2f2d JW |
3858 | memcg = mem_cgroup_iter(NULL, memcg, NULL); |
3859 | } while (memcg); | |
f16015fb JW |
3860 | } |
3861 | ||
97a225e6 | 3862 | static bool pgdat_watermark_boosted(pg_data_t *pgdat, int highest_zoneidx) |
1c30844d MG |
3863 | { |
3864 | int i; | |
3865 | struct zone *zone; | |
3866 | ||
3867 | /* | |
3868 | * Check for watermark boosts top-down as the higher zones | |
3869 | * are more likely to be boosted. Both watermarks and boosts | |
1eba09c1 | 3870 | * should not be checked at the same time as reclaim would |
1c30844d MG |
3871 | * start prematurely when there is no boosting and a lower |
3872 | * zone is balanced. | |
3873 | */ | |
97a225e6 | 3874 | for (i = highest_zoneidx; i >= 0; i--) { |
1c30844d MG |
3875 | zone = pgdat->node_zones + i; |
3876 | if (!managed_zone(zone)) | |
3877 | continue; | |
3878 | ||
3879 | if (zone->watermark_boost) | |
3880 | return true; | |
3881 | } | |
3882 | ||
3883 | return false; | |
3884 | } | |
3885 | ||
e716f2eb MG |
3886 | /* |
3887 | * Returns true if there is an eligible zone balanced for the request order | |
97a225e6 | 3888 | * and highest_zoneidx |
e716f2eb | 3889 | */ |
97a225e6 | 3890 | static bool pgdat_balanced(pg_data_t *pgdat, int order, int highest_zoneidx) |
60cefed4 | 3891 | { |
e716f2eb MG |
3892 | int i; |
3893 | unsigned long mark = -1; | |
3894 | struct zone *zone; | |
60cefed4 | 3895 | |
1c30844d MG |
3896 | /* |
3897 | * Check watermarks bottom-up as lower zones are more likely to | |
3898 | * meet watermarks. | |
3899 | */ | |
97a225e6 | 3900 | for (i = 0; i <= highest_zoneidx; i++) { |
e716f2eb | 3901 | zone = pgdat->node_zones + i; |
6256c6b4 | 3902 | |
e716f2eb MG |
3903 | if (!managed_zone(zone)) |
3904 | continue; | |
3905 | ||
c574bbe9 HY |
3906 | if (sysctl_numa_balancing_mode & NUMA_BALANCING_MEMORY_TIERING) |
3907 | mark = wmark_pages(zone, WMARK_PROMO); | |
3908 | else | |
3909 | mark = high_wmark_pages(zone); | |
97a225e6 | 3910 | if (zone_watermark_ok_safe(zone, order, mark, highest_zoneidx)) |
e716f2eb MG |
3911 | return true; |
3912 | } | |
3913 | ||
3914 | /* | |
36c26128 | 3915 | * If a node has no managed zone within highest_zoneidx, it does not |
e716f2eb MG |
3916 | * need balancing by definition. This can happen if a zone-restricted |
3917 | * allocation tries to wake a remote kswapd. | |
3918 | */ | |
3919 | if (mark == -1) | |
3920 | return true; | |
3921 | ||
3922 | return false; | |
60cefed4 JW |
3923 | } |
3924 | ||
631b6e08 MG |
3925 | /* Clear pgdat state for congested, dirty or under writeback. */ |
3926 | static void clear_pgdat_congested(pg_data_t *pgdat) | |
3927 | { | |
1b05117d JW |
3928 | struct lruvec *lruvec = mem_cgroup_lruvec(NULL, pgdat); |
3929 | ||
3930 | clear_bit(LRUVEC_CONGESTED, &lruvec->flags); | |
631b6e08 MG |
3931 | clear_bit(PGDAT_DIRTY, &pgdat->flags); |
3932 | clear_bit(PGDAT_WRITEBACK, &pgdat->flags); | |
3933 | } | |
3934 | ||
5515061d MG |
3935 | /* |
3936 | * Prepare kswapd for sleeping. This verifies that there are no processes | |
3937 | * waiting in throttle_direct_reclaim() and that watermarks have been met. | |
3938 | * | |
3939 | * Returns true if kswapd is ready to sleep | |
3940 | */ | |
97a225e6 JK |
3941 | static bool prepare_kswapd_sleep(pg_data_t *pgdat, int order, |
3942 | int highest_zoneidx) | |
f50de2d3 | 3943 | { |
5515061d | 3944 | /* |
9e5e3661 | 3945 | * The throttled processes are normally woken up in balance_pgdat() as |
c73322d0 | 3946 | * soon as allow_direct_reclaim() is true. But there is a potential |
9e5e3661 VB |
3947 | * race between when kswapd checks the watermarks and a process gets |
3948 | * throttled. There is also a potential race if processes get | |
3949 | * throttled, kswapd wakes, a large process exits thereby balancing the | |
3950 | * zones, which causes kswapd to exit balance_pgdat() before reaching | |
3951 | * the wake up checks. If kswapd is going to sleep, no process should | |
3952 | * be sleeping on pfmemalloc_wait, so wake them now if necessary. If | |
3953 | * the wake up is premature, processes will wake kswapd and get | |
3954 | * throttled again. The difference from wake ups in balance_pgdat() is | |
3955 | * that here we are under prepare_to_wait(). | |
5515061d | 3956 | */ |
9e5e3661 VB |
3957 | if (waitqueue_active(&pgdat->pfmemalloc_wait)) |
3958 | wake_up_all(&pgdat->pfmemalloc_wait); | |
f50de2d3 | 3959 | |
c73322d0 JW |
3960 | /* Hopeless node, leave it to direct reclaim */ |
3961 | if (pgdat->kswapd_failures >= MAX_RECLAIM_RETRIES) | |
3962 | return true; | |
3963 | ||
97a225e6 | 3964 | if (pgdat_balanced(pgdat, order, highest_zoneidx)) { |
e716f2eb MG |
3965 | clear_pgdat_congested(pgdat); |
3966 | return true; | |
1d82de61 MG |
3967 | } |
3968 | ||
333b0a45 | 3969 | return false; |
f50de2d3 MG |
3970 | } |
3971 | ||
75485363 | 3972 | /* |
1d82de61 MG |
3973 | * kswapd shrinks a node of pages that are at or below the highest usable |
3974 | * zone that is currently unbalanced. | |
b8e83b94 MG |
3975 | * |
3976 | * Returns true if kswapd scanned at least the requested number of pages to | |
283aba9f MG |
3977 | * reclaim or if the lack of progress was due to pages under writeback. |
3978 | * This is used to determine if the scanning priority needs to be raised. | |
75485363 | 3979 | */ |
1d82de61 | 3980 | static bool kswapd_shrink_node(pg_data_t *pgdat, |
accf6242 | 3981 | struct scan_control *sc) |
75485363 | 3982 | { |
1d82de61 MG |
3983 | struct zone *zone; |
3984 | int z; | |
75485363 | 3985 | |
1d82de61 MG |
3986 | /* Reclaim a number of pages proportional to the number of zones */ |
3987 | sc->nr_to_reclaim = 0; | |
970a39a3 | 3988 | for (z = 0; z <= sc->reclaim_idx; z++) { |
1d82de61 | 3989 | zone = pgdat->node_zones + z; |
6aa303de | 3990 | if (!managed_zone(zone)) |
1d82de61 | 3991 | continue; |
7c954f6d | 3992 | |
1d82de61 MG |
3993 | sc->nr_to_reclaim += max(high_wmark_pages(zone), SWAP_CLUSTER_MAX); |
3994 | } | |
7c954f6d MG |
3995 | |
3996 | /* | |
1d82de61 MG |
3997 | * Historically care was taken to put equal pressure on all zones but |
3998 | * now pressure is applied based on node LRU order. | |
7c954f6d | 3999 | */ |
970a39a3 | 4000 | shrink_node(pgdat, sc); |
283aba9f | 4001 | |
7c954f6d | 4002 | /* |
1d82de61 MG |
4003 | * Fragmentation may mean that the system cannot be rebalanced for |
4004 | * high-order allocations. If twice the allocation size has been | |
4005 | * reclaimed then recheck watermarks only at order-0 to prevent | |
4006 | * excessive reclaim. Assume that a process requested a high-order | |
4007 | * can direct reclaim/compact. | |
7c954f6d | 4008 | */ |
9861a62c | 4009 | if (sc->order && sc->nr_reclaimed >= compact_gap(sc->order)) |
1d82de61 | 4010 | sc->order = 0; |
7c954f6d | 4011 | |
b8e83b94 | 4012 | return sc->nr_scanned >= sc->nr_to_reclaim; |
75485363 MG |
4013 | } |
4014 | ||
c49c2c47 MG |
4015 | /* Page allocator PCP high watermark is lowered if reclaim is active. */ |
4016 | static inline void | |
4017 | update_reclaim_active(pg_data_t *pgdat, int highest_zoneidx, bool active) | |
4018 | { | |
4019 | int i; | |
4020 | struct zone *zone; | |
4021 | ||
4022 | for (i = 0; i <= highest_zoneidx; i++) { | |
4023 | zone = pgdat->node_zones + i; | |
4024 | ||
4025 | if (!managed_zone(zone)) | |
4026 | continue; | |
4027 | ||
4028 | if (active) | |
4029 | set_bit(ZONE_RECLAIM_ACTIVE, &zone->flags); | |
4030 | else | |
4031 | clear_bit(ZONE_RECLAIM_ACTIVE, &zone->flags); | |
4032 | } | |
4033 | } | |
4034 | ||
4035 | static inline void | |
4036 | set_reclaim_active(pg_data_t *pgdat, int highest_zoneidx) | |
4037 | { | |
4038 | update_reclaim_active(pgdat, highest_zoneidx, true); | |
4039 | } | |
4040 | ||
4041 | static inline void | |
4042 | clear_reclaim_active(pg_data_t *pgdat, int highest_zoneidx) | |
4043 | { | |
4044 | update_reclaim_active(pgdat, highest_zoneidx, false); | |
4045 | } | |
4046 | ||
1da177e4 | 4047 | /* |
1d82de61 MG |
4048 | * For kswapd, balance_pgdat() will reclaim pages across a node from zones |
4049 | * that are eligible for use by the caller until at least one zone is | |
4050 | * balanced. | |
1da177e4 | 4051 | * |
1d82de61 | 4052 | * Returns the order kswapd finished reclaiming at. |
1da177e4 LT |
4053 | * |
4054 | * kswapd scans the zones in the highmem->normal->dma direction. It skips | |
41858966 | 4055 | * zones which have free_pages > high_wmark_pages(zone), but once a zone is |
8bb4e7a2 | 4056 | * found to have free_pages <= high_wmark_pages(zone), any page in that zone |
1d82de61 MG |
4057 | * or lower is eligible for reclaim until at least one usable zone is |
4058 | * balanced. | |
1da177e4 | 4059 | */ |
97a225e6 | 4060 | static int balance_pgdat(pg_data_t *pgdat, int order, int highest_zoneidx) |
1da177e4 | 4061 | { |
1da177e4 | 4062 | int i; |
0608f43d AM |
4063 | unsigned long nr_soft_reclaimed; |
4064 | unsigned long nr_soft_scanned; | |
eb414681 | 4065 | unsigned long pflags; |
1c30844d MG |
4066 | unsigned long nr_boost_reclaim; |
4067 | unsigned long zone_boosts[MAX_NR_ZONES] = { 0, }; | |
4068 | bool boosted; | |
1d82de61 | 4069 | struct zone *zone; |
179e9639 AM |
4070 | struct scan_control sc = { |
4071 | .gfp_mask = GFP_KERNEL, | |
ee814fe2 | 4072 | .order = order, |
a6dc60f8 | 4073 | .may_unmap = 1, |
179e9639 | 4074 | }; |
93781325 | 4075 | |
1732d2b0 | 4076 | set_task_reclaim_state(current, &sc.reclaim_state); |
eb414681 | 4077 | psi_memstall_enter(&pflags); |
4f3eaf45 | 4078 | __fs_reclaim_acquire(_THIS_IP_); |
93781325 | 4079 | |
f8891e5e | 4080 | count_vm_event(PAGEOUTRUN); |
1da177e4 | 4081 | |
1c30844d MG |
4082 | /* |
4083 | * Account for the reclaim boost. Note that the zone boost is left in | |
4084 | * place so that parallel allocations that are near the watermark will | |
4085 | * stall or direct reclaim until kswapd is finished. | |
4086 | */ | |
4087 | nr_boost_reclaim = 0; | |
97a225e6 | 4088 | for (i = 0; i <= highest_zoneidx; i++) { |
1c30844d MG |
4089 | zone = pgdat->node_zones + i; |
4090 | if (!managed_zone(zone)) | |
4091 | continue; | |
4092 | ||
4093 | nr_boost_reclaim += zone->watermark_boost; | |
4094 | zone_boosts[i] = zone->watermark_boost; | |
4095 | } | |
4096 | boosted = nr_boost_reclaim; | |
4097 | ||
4098 | restart: | |
c49c2c47 | 4099 | set_reclaim_active(pgdat, highest_zoneidx); |
1c30844d | 4100 | sc.priority = DEF_PRIORITY; |
9e3b2f8c | 4101 | do { |
c73322d0 | 4102 | unsigned long nr_reclaimed = sc.nr_reclaimed; |
b8e83b94 | 4103 | bool raise_priority = true; |
1c30844d | 4104 | bool balanced; |
93781325 | 4105 | bool ret; |
b8e83b94 | 4106 | |
97a225e6 | 4107 | sc.reclaim_idx = highest_zoneidx; |
1da177e4 | 4108 | |
86c79f6b | 4109 | /* |
84c7a777 MG |
4110 | * If the number of buffer_heads exceeds the maximum allowed |
4111 | * then consider reclaiming from all zones. This has a dual | |
4112 | * purpose -- on 64-bit systems it is expected that | |
4113 | * buffer_heads are stripped during active rotation. On 32-bit | |
4114 | * systems, highmem pages can pin lowmem memory and shrinking | |
4115 | * buffers can relieve lowmem pressure. Reclaim may still not | |
4116 | * go ahead if all eligible zones for the original allocation | |
4117 | * request are balanced to avoid excessive reclaim from kswapd. | |
86c79f6b MG |
4118 | */ |
4119 | if (buffer_heads_over_limit) { | |
4120 | for (i = MAX_NR_ZONES - 1; i >= 0; i--) { | |
4121 | zone = pgdat->node_zones + i; | |
6aa303de | 4122 | if (!managed_zone(zone)) |
86c79f6b | 4123 | continue; |
cc715d99 | 4124 | |
970a39a3 | 4125 | sc.reclaim_idx = i; |
e1dbeda6 | 4126 | break; |
1da177e4 | 4127 | } |
1da177e4 | 4128 | } |
dafcb73e | 4129 | |
86c79f6b | 4130 | /* |
1c30844d MG |
4131 | * If the pgdat is imbalanced then ignore boosting and preserve |
4132 | * the watermarks for a later time and restart. Note that the | |
4133 | * zone watermarks will be still reset at the end of balancing | |
4134 | * on the grounds that the normal reclaim should be enough to | |
4135 | * re-evaluate if boosting is required when kswapd next wakes. | |
4136 | */ | |
97a225e6 | 4137 | balanced = pgdat_balanced(pgdat, sc.order, highest_zoneidx); |
1c30844d MG |
4138 | if (!balanced && nr_boost_reclaim) { |
4139 | nr_boost_reclaim = 0; | |
4140 | goto restart; | |
4141 | } | |
4142 | ||
4143 | /* | |
4144 | * If boosting is not active then only reclaim if there are no | |
4145 | * eligible zones. Note that sc.reclaim_idx is not used as | |
4146 | * buffer_heads_over_limit may have adjusted it. | |
86c79f6b | 4147 | */ |
1c30844d | 4148 | if (!nr_boost_reclaim && balanced) |
e716f2eb | 4149 | goto out; |
e1dbeda6 | 4150 | |
1c30844d MG |
4151 | /* Limit the priority of boosting to avoid reclaim writeback */ |
4152 | if (nr_boost_reclaim && sc.priority == DEF_PRIORITY - 2) | |
4153 | raise_priority = false; | |
4154 | ||
4155 | /* | |
4156 | * Do not writeback or swap pages for boosted reclaim. The | |
4157 | * intent is to relieve pressure not issue sub-optimal IO | |
4158 | * from reclaim context. If no pages are reclaimed, the | |
4159 | * reclaim will be aborted. | |
4160 | */ | |
4161 | sc.may_writepage = !laptop_mode && !nr_boost_reclaim; | |
4162 | sc.may_swap = !nr_boost_reclaim; | |
1c30844d | 4163 | |
1d82de61 MG |
4164 | /* |
4165 | * Do some background aging of the anon list, to give | |
4166 | * pages a chance to be referenced before reclaiming. All | |
4167 | * pages are rotated regardless of classzone as this is | |
4168 | * about consistent aging. | |
4169 | */ | |
ef8f2327 | 4170 | age_active_anon(pgdat, &sc); |
1d82de61 | 4171 | |
b7ea3c41 MG |
4172 | /* |
4173 | * If we're getting trouble reclaiming, start doing writepage | |
4174 | * even in laptop mode. | |
4175 | */ | |
047d72c3 | 4176 | if (sc.priority < DEF_PRIORITY - 2) |
b7ea3c41 MG |
4177 | sc.may_writepage = 1; |
4178 | ||
1d82de61 MG |
4179 | /* Call soft limit reclaim before calling shrink_node. */ |
4180 | sc.nr_scanned = 0; | |
4181 | nr_soft_scanned = 0; | |
ef8f2327 | 4182 | nr_soft_reclaimed = mem_cgroup_soft_limit_reclaim(pgdat, sc.order, |
1d82de61 MG |
4183 | sc.gfp_mask, &nr_soft_scanned); |
4184 | sc.nr_reclaimed += nr_soft_reclaimed; | |
4185 | ||
1da177e4 | 4186 | /* |
1d82de61 MG |
4187 | * There should be no need to raise the scanning priority if |
4188 | * enough pages are already being scanned that that high | |
4189 | * watermark would be met at 100% efficiency. | |
1da177e4 | 4190 | */ |
970a39a3 | 4191 | if (kswapd_shrink_node(pgdat, &sc)) |
1d82de61 | 4192 | raise_priority = false; |
5515061d MG |
4193 | |
4194 | /* | |
4195 | * If the low watermark is met there is no need for processes | |
4196 | * to be throttled on pfmemalloc_wait as they should not be | |
4197 | * able to safely make forward progress. Wake them | |
4198 | */ | |
4199 | if (waitqueue_active(&pgdat->pfmemalloc_wait) && | |
c73322d0 | 4200 | allow_direct_reclaim(pgdat)) |
cfc51155 | 4201 | wake_up_all(&pgdat->pfmemalloc_wait); |
5515061d | 4202 | |
b8e83b94 | 4203 | /* Check if kswapd should be suspending */ |
4f3eaf45 | 4204 | __fs_reclaim_release(_THIS_IP_); |
93781325 | 4205 | ret = try_to_freeze(); |
4f3eaf45 | 4206 | __fs_reclaim_acquire(_THIS_IP_); |
93781325 | 4207 | if (ret || kthread_should_stop()) |
b8e83b94 | 4208 | break; |
8357376d | 4209 | |
73ce02e9 | 4210 | /* |
b8e83b94 MG |
4211 | * Raise priority if scanning rate is too low or there was no |
4212 | * progress in reclaiming pages | |
73ce02e9 | 4213 | */ |
c73322d0 | 4214 | nr_reclaimed = sc.nr_reclaimed - nr_reclaimed; |
1c30844d MG |
4215 | nr_boost_reclaim -= min(nr_boost_reclaim, nr_reclaimed); |
4216 | ||
4217 | /* | |
4218 | * If reclaim made no progress for a boost, stop reclaim as | |
4219 | * IO cannot be queued and it could be an infinite loop in | |
4220 | * extreme circumstances. | |
4221 | */ | |
4222 | if (nr_boost_reclaim && !nr_reclaimed) | |
4223 | break; | |
4224 | ||
c73322d0 | 4225 | if (raise_priority || !nr_reclaimed) |
b8e83b94 | 4226 | sc.priority--; |
1d82de61 | 4227 | } while (sc.priority >= 1); |
1da177e4 | 4228 | |
c73322d0 JW |
4229 | if (!sc.nr_reclaimed) |
4230 | pgdat->kswapd_failures++; | |
4231 | ||
b8e83b94 | 4232 | out: |
c49c2c47 MG |
4233 | clear_reclaim_active(pgdat, highest_zoneidx); |
4234 | ||
1c30844d MG |
4235 | /* If reclaim was boosted, account for the reclaim done in this pass */ |
4236 | if (boosted) { | |
4237 | unsigned long flags; | |
4238 | ||
97a225e6 | 4239 | for (i = 0; i <= highest_zoneidx; i++) { |
1c30844d MG |
4240 | if (!zone_boosts[i]) |
4241 | continue; | |
4242 | ||
4243 | /* Increments are under the zone lock */ | |
4244 | zone = pgdat->node_zones + i; | |
4245 | spin_lock_irqsave(&zone->lock, flags); | |
4246 | zone->watermark_boost -= min(zone->watermark_boost, zone_boosts[i]); | |
4247 | spin_unlock_irqrestore(&zone->lock, flags); | |
4248 | } | |
4249 | ||
4250 | /* | |
4251 | * As there is now likely space, wakeup kcompact to defragment | |
4252 | * pageblocks. | |
4253 | */ | |
97a225e6 | 4254 | wakeup_kcompactd(pgdat, pageblock_order, highest_zoneidx); |
1c30844d MG |
4255 | } |
4256 | ||
2a2e4885 | 4257 | snapshot_refaults(NULL, pgdat); |
4f3eaf45 | 4258 | __fs_reclaim_release(_THIS_IP_); |
eb414681 | 4259 | psi_memstall_leave(&pflags); |
1732d2b0 | 4260 | set_task_reclaim_state(current, NULL); |
e5ca8071 | 4261 | |
0abdee2b | 4262 | /* |
1d82de61 MG |
4263 | * Return the order kswapd stopped reclaiming at as |
4264 | * prepare_kswapd_sleep() takes it into account. If another caller | |
4265 | * entered the allocator slow path while kswapd was awake, order will | |
4266 | * remain at the higher level. | |
0abdee2b | 4267 | */ |
1d82de61 | 4268 | return sc.order; |
1da177e4 LT |
4269 | } |
4270 | ||
e716f2eb | 4271 | /* |
97a225e6 JK |
4272 | * The pgdat->kswapd_highest_zoneidx is used to pass the highest zone index to |
4273 | * be reclaimed by kswapd from the waker. If the value is MAX_NR_ZONES which is | |
4274 | * not a valid index then either kswapd runs for first time or kswapd couldn't | |
4275 | * sleep after previous reclaim attempt (node is still unbalanced). In that | |
4276 | * case return the zone index of the previous kswapd reclaim cycle. | |
e716f2eb | 4277 | */ |
97a225e6 JK |
4278 | static enum zone_type kswapd_highest_zoneidx(pg_data_t *pgdat, |
4279 | enum zone_type prev_highest_zoneidx) | |
e716f2eb | 4280 | { |
97a225e6 | 4281 | enum zone_type curr_idx = READ_ONCE(pgdat->kswapd_highest_zoneidx); |
5644e1fb | 4282 | |
97a225e6 | 4283 | return curr_idx == MAX_NR_ZONES ? prev_highest_zoneidx : curr_idx; |
e716f2eb MG |
4284 | } |
4285 | ||
38087d9b | 4286 | static void kswapd_try_to_sleep(pg_data_t *pgdat, int alloc_order, int reclaim_order, |
97a225e6 | 4287 | unsigned int highest_zoneidx) |
f0bc0a60 KM |
4288 | { |
4289 | long remaining = 0; | |
4290 | DEFINE_WAIT(wait); | |
4291 | ||
4292 | if (freezing(current) || kthread_should_stop()) | |
4293 | return; | |
4294 | ||
4295 | prepare_to_wait(&pgdat->kswapd_wait, &wait, TASK_INTERRUPTIBLE); | |
4296 | ||
333b0a45 SG |
4297 | /* |
4298 | * Try to sleep for a short interval. Note that kcompactd will only be | |
4299 | * woken if it is possible to sleep for a short interval. This is | |
4300 | * deliberate on the assumption that if reclaim cannot keep an | |
4301 | * eligible zone balanced that it's also unlikely that compaction will | |
4302 | * succeed. | |
4303 | */ | |
97a225e6 | 4304 | if (prepare_kswapd_sleep(pgdat, reclaim_order, highest_zoneidx)) { |
fd901c95 VB |
4305 | /* |
4306 | * Compaction records what page blocks it recently failed to | |
4307 | * isolate pages from and skips them in the future scanning. | |
4308 | * When kswapd is going to sleep, it is reasonable to assume | |
4309 | * that pages and compaction may succeed so reset the cache. | |
4310 | */ | |
4311 | reset_isolation_suitable(pgdat); | |
4312 | ||
4313 | /* | |
4314 | * We have freed the memory, now we should compact it to make | |
4315 | * allocation of the requested order possible. | |
4316 | */ | |
97a225e6 | 4317 | wakeup_kcompactd(pgdat, alloc_order, highest_zoneidx); |
fd901c95 | 4318 | |
f0bc0a60 | 4319 | remaining = schedule_timeout(HZ/10); |
38087d9b MG |
4320 | |
4321 | /* | |
97a225e6 | 4322 | * If woken prematurely then reset kswapd_highest_zoneidx and |
38087d9b MG |
4323 | * order. The values will either be from a wakeup request or |
4324 | * the previous request that slept prematurely. | |
4325 | */ | |
4326 | if (remaining) { | |
97a225e6 JK |
4327 | WRITE_ONCE(pgdat->kswapd_highest_zoneidx, |
4328 | kswapd_highest_zoneidx(pgdat, | |
4329 | highest_zoneidx)); | |
5644e1fb QC |
4330 | |
4331 | if (READ_ONCE(pgdat->kswapd_order) < reclaim_order) | |
4332 | WRITE_ONCE(pgdat->kswapd_order, reclaim_order); | |
38087d9b MG |
4333 | } |
4334 | ||
f0bc0a60 KM |
4335 | finish_wait(&pgdat->kswapd_wait, &wait); |
4336 | prepare_to_wait(&pgdat->kswapd_wait, &wait, TASK_INTERRUPTIBLE); | |
4337 | } | |
4338 | ||
4339 | /* | |
4340 | * After a short sleep, check if it was a premature sleep. If not, then | |
4341 | * go fully to sleep until explicitly woken up. | |
4342 | */ | |
d9f21d42 | 4343 | if (!remaining && |
97a225e6 | 4344 | prepare_kswapd_sleep(pgdat, reclaim_order, highest_zoneidx)) { |
f0bc0a60 KM |
4345 | trace_mm_vmscan_kswapd_sleep(pgdat->node_id); |
4346 | ||
4347 | /* | |
4348 | * vmstat counters are not perfectly accurate and the estimated | |
4349 | * value for counters such as NR_FREE_PAGES can deviate from the | |
4350 | * true value by nr_online_cpus * threshold. To avoid the zone | |
4351 | * watermarks being breached while under pressure, we reduce the | |
4352 | * per-cpu vmstat threshold while kswapd is awake and restore | |
4353 | * them before going back to sleep. | |
4354 | */ | |
4355 | set_pgdat_percpu_threshold(pgdat, calculate_normal_threshold); | |
1c7e7f6c AK |
4356 | |
4357 | if (!kthread_should_stop()) | |
4358 | schedule(); | |
4359 | ||
f0bc0a60 KM |
4360 | set_pgdat_percpu_threshold(pgdat, calculate_pressure_threshold); |
4361 | } else { | |
4362 | if (remaining) | |
4363 | count_vm_event(KSWAPD_LOW_WMARK_HIT_QUICKLY); | |
4364 | else | |
4365 | count_vm_event(KSWAPD_HIGH_WMARK_HIT_QUICKLY); | |
4366 | } | |
4367 | finish_wait(&pgdat->kswapd_wait, &wait); | |
4368 | } | |
4369 | ||
1da177e4 LT |
4370 | /* |
4371 | * The background pageout daemon, started as a kernel thread | |
4f98a2fe | 4372 | * from the init process. |
1da177e4 LT |
4373 | * |
4374 | * This basically trickles out pages so that we have _some_ | |
4375 | * free memory available even if there is no other activity | |
4376 | * that frees anything up. This is needed for things like routing | |
4377 | * etc, where we otherwise might have all activity going on in | |
4378 | * asynchronous contexts that cannot page things out. | |
4379 | * | |
4380 | * If there are applications that are active memory-allocators | |
4381 | * (most normal use), this basically shouldn't matter. | |
4382 | */ | |
4383 | static int kswapd(void *p) | |
4384 | { | |
e716f2eb | 4385 | unsigned int alloc_order, reclaim_order; |
97a225e6 | 4386 | unsigned int highest_zoneidx = MAX_NR_ZONES - 1; |
68d68ff6 | 4387 | pg_data_t *pgdat = (pg_data_t *)p; |
1da177e4 | 4388 | struct task_struct *tsk = current; |
a70f7302 | 4389 | const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id); |
1da177e4 | 4390 | |
174596a0 | 4391 | if (!cpumask_empty(cpumask)) |
c5f59f08 | 4392 | set_cpus_allowed_ptr(tsk, cpumask); |
1da177e4 LT |
4393 | |
4394 | /* | |
4395 | * Tell the memory management that we're a "memory allocator", | |
4396 | * and that if we need more memory we should get access to it | |
4397 | * regardless (see "__alloc_pages()"). "kswapd" should | |
4398 | * never get caught in the normal page freeing logic. | |
4399 | * | |
4400 | * (Kswapd normally doesn't need memory anyway, but sometimes | |
4401 | * you need a small amount of memory in order to be able to | |
4402 | * page out something else, and this flag essentially protects | |
4403 | * us from recursively trying to free more memory as we're | |
4404 | * trying to free the first piece of memory in the first place). | |
4405 | */ | |
b698f0a1 | 4406 | tsk->flags |= PF_MEMALLOC | PF_KSWAPD; |
83144186 | 4407 | set_freezable(); |
1da177e4 | 4408 | |
5644e1fb | 4409 | WRITE_ONCE(pgdat->kswapd_order, 0); |
97a225e6 | 4410 | WRITE_ONCE(pgdat->kswapd_highest_zoneidx, MAX_NR_ZONES); |
8cd7c588 | 4411 | atomic_set(&pgdat->nr_writeback_throttled, 0); |
1da177e4 | 4412 | for ( ; ; ) { |
6f6313d4 | 4413 | bool ret; |
3e1d1d28 | 4414 | |
5644e1fb | 4415 | alloc_order = reclaim_order = READ_ONCE(pgdat->kswapd_order); |
97a225e6 JK |
4416 | highest_zoneidx = kswapd_highest_zoneidx(pgdat, |
4417 | highest_zoneidx); | |
e716f2eb | 4418 | |
38087d9b MG |
4419 | kswapd_try_sleep: |
4420 | kswapd_try_to_sleep(pgdat, alloc_order, reclaim_order, | |
97a225e6 | 4421 | highest_zoneidx); |
215ddd66 | 4422 | |
97a225e6 | 4423 | /* Read the new order and highest_zoneidx */ |
2b47a24c | 4424 | alloc_order = READ_ONCE(pgdat->kswapd_order); |
97a225e6 JK |
4425 | highest_zoneidx = kswapd_highest_zoneidx(pgdat, |
4426 | highest_zoneidx); | |
5644e1fb | 4427 | WRITE_ONCE(pgdat->kswapd_order, 0); |
97a225e6 | 4428 | WRITE_ONCE(pgdat->kswapd_highest_zoneidx, MAX_NR_ZONES); |
1da177e4 | 4429 | |
8fe23e05 DR |
4430 | ret = try_to_freeze(); |
4431 | if (kthread_should_stop()) | |
4432 | break; | |
4433 | ||
4434 | /* | |
4435 | * We can speed up thawing tasks if we don't call balance_pgdat | |
4436 | * after returning from the refrigerator | |
4437 | */ | |
38087d9b MG |
4438 | if (ret) |
4439 | continue; | |
4440 | ||
4441 | /* | |
4442 | * Reclaim begins at the requested order but if a high-order | |
4443 | * reclaim fails then kswapd falls back to reclaiming for | |
4444 | * order-0. If that happens, kswapd will consider sleeping | |
4445 | * for the order it finished reclaiming at (reclaim_order) | |
4446 | * but kcompactd is woken to compact for the original | |
4447 | * request (alloc_order). | |
4448 | */ | |
97a225e6 | 4449 | trace_mm_vmscan_kswapd_wake(pgdat->node_id, highest_zoneidx, |
e5146b12 | 4450 | alloc_order); |
97a225e6 JK |
4451 | reclaim_order = balance_pgdat(pgdat, alloc_order, |
4452 | highest_zoneidx); | |
38087d9b MG |
4453 | if (reclaim_order < alloc_order) |
4454 | goto kswapd_try_sleep; | |
1da177e4 | 4455 | } |
b0a8cc58 | 4456 | |
b698f0a1 | 4457 | tsk->flags &= ~(PF_MEMALLOC | PF_KSWAPD); |
71abdc15 | 4458 | |
1da177e4 LT |
4459 | return 0; |
4460 | } | |
4461 | ||
4462 | /* | |
5ecd9d40 DR |
4463 | * A zone is low on free memory or too fragmented for high-order memory. If |
4464 | * kswapd should reclaim (direct reclaim is deferred), wake it up for the zone's | |
4465 | * pgdat. It will wake up kcompactd after reclaiming memory. If kswapd reclaim | |
4466 | * has failed or is not needed, still wake up kcompactd if only compaction is | |
4467 | * needed. | |
1da177e4 | 4468 | */ |
5ecd9d40 | 4469 | void wakeup_kswapd(struct zone *zone, gfp_t gfp_flags, int order, |
97a225e6 | 4470 | enum zone_type highest_zoneidx) |
1da177e4 LT |
4471 | { |
4472 | pg_data_t *pgdat; | |
5644e1fb | 4473 | enum zone_type curr_idx; |
1da177e4 | 4474 | |
6aa303de | 4475 | if (!managed_zone(zone)) |
1da177e4 LT |
4476 | return; |
4477 | ||
5ecd9d40 | 4478 | if (!cpuset_zone_allowed(zone, gfp_flags)) |
1da177e4 | 4479 | return; |
5644e1fb | 4480 | |
88f5acf8 | 4481 | pgdat = zone->zone_pgdat; |
97a225e6 | 4482 | curr_idx = READ_ONCE(pgdat->kswapd_highest_zoneidx); |
5644e1fb | 4483 | |
97a225e6 JK |
4484 | if (curr_idx == MAX_NR_ZONES || curr_idx < highest_zoneidx) |
4485 | WRITE_ONCE(pgdat->kswapd_highest_zoneidx, highest_zoneidx); | |
5644e1fb QC |
4486 | |
4487 | if (READ_ONCE(pgdat->kswapd_order) < order) | |
4488 | WRITE_ONCE(pgdat->kswapd_order, order); | |
dffcac2c | 4489 | |
8d0986e2 | 4490 | if (!waitqueue_active(&pgdat->kswapd_wait)) |
1da177e4 | 4491 | return; |
e1a55637 | 4492 | |
5ecd9d40 DR |
4493 | /* Hopeless node, leave it to direct reclaim if possible */ |
4494 | if (pgdat->kswapd_failures >= MAX_RECLAIM_RETRIES || | |
97a225e6 JK |
4495 | (pgdat_balanced(pgdat, order, highest_zoneidx) && |
4496 | !pgdat_watermark_boosted(pgdat, highest_zoneidx))) { | |
5ecd9d40 DR |
4497 | /* |
4498 | * There may be plenty of free memory available, but it's too | |
4499 | * fragmented for high-order allocations. Wake up kcompactd | |
4500 | * and rely on compaction_suitable() to determine if it's | |
4501 | * needed. If it fails, it will defer subsequent attempts to | |
4502 | * ratelimit its work. | |
4503 | */ | |
4504 | if (!(gfp_flags & __GFP_DIRECT_RECLAIM)) | |
97a225e6 | 4505 | wakeup_kcompactd(pgdat, order, highest_zoneidx); |
e716f2eb | 4506 | return; |
5ecd9d40 | 4507 | } |
88f5acf8 | 4508 | |
97a225e6 | 4509 | trace_mm_vmscan_wakeup_kswapd(pgdat->node_id, highest_zoneidx, order, |
5ecd9d40 | 4510 | gfp_flags); |
8d0986e2 | 4511 | wake_up_interruptible(&pgdat->kswapd_wait); |
1da177e4 LT |
4512 | } |
4513 | ||
c6f37f12 | 4514 | #ifdef CONFIG_HIBERNATION |
1da177e4 | 4515 | /* |
7b51755c | 4516 | * Try to free `nr_to_reclaim' of memory, system-wide, and return the number of |
d6277db4 RW |
4517 | * freed pages. |
4518 | * | |
4519 | * Rather than trying to age LRUs the aim is to preserve the overall | |
4520 | * LRU order by reclaiming preferentially | |
4521 | * inactive > active > active referenced > active mapped | |
1da177e4 | 4522 | */ |
7b51755c | 4523 | unsigned long shrink_all_memory(unsigned long nr_to_reclaim) |
1da177e4 | 4524 | { |
d6277db4 | 4525 | struct scan_control sc = { |
ee814fe2 | 4526 | .nr_to_reclaim = nr_to_reclaim, |
7b51755c | 4527 | .gfp_mask = GFP_HIGHUSER_MOVABLE, |
b2e18757 | 4528 | .reclaim_idx = MAX_NR_ZONES - 1, |
ee814fe2 | 4529 | .priority = DEF_PRIORITY, |
d6277db4 | 4530 | .may_writepage = 1, |
ee814fe2 JW |
4531 | .may_unmap = 1, |
4532 | .may_swap = 1, | |
7b51755c | 4533 | .hibernation_mode = 1, |
1da177e4 | 4534 | }; |
a09ed5e0 | 4535 | struct zonelist *zonelist = node_zonelist(numa_node_id(), sc.gfp_mask); |
7b51755c | 4536 | unsigned long nr_reclaimed; |
499118e9 | 4537 | unsigned int noreclaim_flag; |
1da177e4 | 4538 | |
d92a8cfc | 4539 | fs_reclaim_acquire(sc.gfp_mask); |
93781325 | 4540 | noreclaim_flag = memalloc_noreclaim_save(); |
1732d2b0 | 4541 | set_task_reclaim_state(current, &sc.reclaim_state); |
d6277db4 | 4542 | |
3115cd91 | 4543 | nr_reclaimed = do_try_to_free_pages(zonelist, &sc); |
d979677c | 4544 | |
1732d2b0 | 4545 | set_task_reclaim_state(current, NULL); |
499118e9 | 4546 | memalloc_noreclaim_restore(noreclaim_flag); |
93781325 | 4547 | fs_reclaim_release(sc.gfp_mask); |
d6277db4 | 4548 | |
7b51755c | 4549 | return nr_reclaimed; |
1da177e4 | 4550 | } |
c6f37f12 | 4551 | #endif /* CONFIG_HIBERNATION */ |
1da177e4 | 4552 | |
3218ae14 YG |
4553 | /* |
4554 | * This kswapd start function will be called by init and node-hot-add. | |
4555 | * On node-hot-add, kswapd will moved to proper cpus if cpus are hot-added. | |
4556 | */ | |
b87c517a | 4557 | void kswapd_run(int nid) |
3218ae14 YG |
4558 | { |
4559 | pg_data_t *pgdat = NODE_DATA(nid); | |
3218ae14 YG |
4560 | |
4561 | if (pgdat->kswapd) | |
b87c517a | 4562 | return; |
3218ae14 YG |
4563 | |
4564 | pgdat->kswapd = kthread_run(kswapd, pgdat, "kswapd%d", nid); | |
4565 | if (IS_ERR(pgdat->kswapd)) { | |
4566 | /* failure at boot is fatal */ | |
c6202adf | 4567 | BUG_ON(system_state < SYSTEM_RUNNING); |
d5dc0ad9 | 4568 | pr_err("Failed to start kswapd on node %d\n", nid); |
d72515b8 | 4569 | pgdat->kswapd = NULL; |
3218ae14 | 4570 | } |
3218ae14 YG |
4571 | } |
4572 | ||
8fe23e05 | 4573 | /* |
d8adde17 | 4574 | * Called by memory hotplug when all memory in a node is offlined. Caller must |
bfc8c901 | 4575 | * hold mem_hotplug_begin/end(). |
8fe23e05 DR |
4576 | */ |
4577 | void kswapd_stop(int nid) | |
4578 | { | |
4579 | struct task_struct *kswapd = NODE_DATA(nid)->kswapd; | |
4580 | ||
d8adde17 | 4581 | if (kswapd) { |
8fe23e05 | 4582 | kthread_stop(kswapd); |
d8adde17 JL |
4583 | NODE_DATA(nid)->kswapd = NULL; |
4584 | } | |
8fe23e05 DR |
4585 | } |
4586 | ||
1da177e4 LT |
4587 | static int __init kswapd_init(void) |
4588 | { | |
6b700b5b | 4589 | int nid; |
69e05944 | 4590 | |
1da177e4 | 4591 | swap_setup(); |
48fb2e24 | 4592 | for_each_node_state(nid, N_MEMORY) |
3218ae14 | 4593 | kswapd_run(nid); |
1da177e4 LT |
4594 | return 0; |
4595 | } | |
4596 | ||
4597 | module_init(kswapd_init) | |
9eeff239 CL |
4598 | |
4599 | #ifdef CONFIG_NUMA | |
4600 | /* | |
a5f5f91d | 4601 | * Node reclaim mode |
9eeff239 | 4602 | * |
a5f5f91d | 4603 | * If non-zero call node_reclaim when the number of free pages falls below |
9eeff239 | 4604 | * the watermarks. |
9eeff239 | 4605 | */ |
a5f5f91d | 4606 | int node_reclaim_mode __read_mostly; |
9eeff239 | 4607 | |
a92f7126 | 4608 | /* |
a5f5f91d | 4609 | * Priority for NODE_RECLAIM. This determines the fraction of pages |
a92f7126 CL |
4610 | * of a node considered for each zone_reclaim. 4 scans 1/16th of |
4611 | * a zone. | |
4612 | */ | |
a5f5f91d | 4613 | #define NODE_RECLAIM_PRIORITY 4 |
a92f7126 | 4614 | |
9614634f | 4615 | /* |
a5f5f91d | 4616 | * Percentage of pages in a zone that must be unmapped for node_reclaim to |
9614634f CL |
4617 | * occur. |
4618 | */ | |
4619 | int sysctl_min_unmapped_ratio = 1; | |
4620 | ||
0ff38490 CL |
4621 | /* |
4622 | * If the number of slab pages in a zone grows beyond this percentage then | |
4623 | * slab reclaim needs to occur. | |
4624 | */ | |
4625 | int sysctl_min_slab_ratio = 5; | |
4626 | ||
11fb9989 | 4627 | static inline unsigned long node_unmapped_file_pages(struct pglist_data *pgdat) |
90afa5de | 4628 | { |
11fb9989 MG |
4629 | unsigned long file_mapped = node_page_state(pgdat, NR_FILE_MAPPED); |
4630 | unsigned long file_lru = node_page_state(pgdat, NR_INACTIVE_FILE) + | |
4631 | node_page_state(pgdat, NR_ACTIVE_FILE); | |
90afa5de MG |
4632 | |
4633 | /* | |
4634 | * It's possible for there to be more file mapped pages than | |
4635 | * accounted for by the pages on the file LRU lists because | |
4636 | * tmpfs pages accounted for as ANON can also be FILE_MAPPED | |
4637 | */ | |
4638 | return (file_lru > file_mapped) ? (file_lru - file_mapped) : 0; | |
4639 | } | |
4640 | ||
4641 | /* Work out how many page cache pages we can reclaim in this reclaim_mode */ | |
a5f5f91d | 4642 | static unsigned long node_pagecache_reclaimable(struct pglist_data *pgdat) |
90afa5de | 4643 | { |
d031a157 AM |
4644 | unsigned long nr_pagecache_reclaimable; |
4645 | unsigned long delta = 0; | |
90afa5de MG |
4646 | |
4647 | /* | |
95bbc0c7 | 4648 | * If RECLAIM_UNMAP is set, then all file pages are considered |
90afa5de | 4649 | * potentially reclaimable. Otherwise, we have to worry about |
11fb9989 | 4650 | * pages like swapcache and node_unmapped_file_pages() provides |
90afa5de MG |
4651 | * a better estimate |
4652 | */ | |
a5f5f91d MG |
4653 | if (node_reclaim_mode & RECLAIM_UNMAP) |
4654 | nr_pagecache_reclaimable = node_page_state(pgdat, NR_FILE_PAGES); | |
90afa5de | 4655 | else |
a5f5f91d | 4656 | nr_pagecache_reclaimable = node_unmapped_file_pages(pgdat); |
90afa5de MG |
4657 | |
4658 | /* If we can't clean pages, remove dirty pages from consideration */ | |
a5f5f91d MG |
4659 | if (!(node_reclaim_mode & RECLAIM_WRITE)) |
4660 | delta += node_page_state(pgdat, NR_FILE_DIRTY); | |
90afa5de MG |
4661 | |
4662 | /* Watch for any possible underflows due to delta */ | |
4663 | if (unlikely(delta > nr_pagecache_reclaimable)) | |
4664 | delta = nr_pagecache_reclaimable; | |
4665 | ||
4666 | return nr_pagecache_reclaimable - delta; | |
4667 | } | |
4668 | ||
9eeff239 | 4669 | /* |
a5f5f91d | 4670 | * Try to free up some pages from this node through reclaim. |
9eeff239 | 4671 | */ |
a5f5f91d | 4672 | static int __node_reclaim(struct pglist_data *pgdat, gfp_t gfp_mask, unsigned int order) |
9eeff239 | 4673 | { |
7fb2d46d | 4674 | /* Minimum pages needed in order to stay on node */ |
69e05944 | 4675 | const unsigned long nr_pages = 1 << order; |
9eeff239 | 4676 | struct task_struct *p = current; |
499118e9 | 4677 | unsigned int noreclaim_flag; |
179e9639 | 4678 | struct scan_control sc = { |
62b726c1 | 4679 | .nr_to_reclaim = max(nr_pages, SWAP_CLUSTER_MAX), |
f2f43e56 | 4680 | .gfp_mask = current_gfp_context(gfp_mask), |
bd2f6199 | 4681 | .order = order, |
a5f5f91d MG |
4682 | .priority = NODE_RECLAIM_PRIORITY, |
4683 | .may_writepage = !!(node_reclaim_mode & RECLAIM_WRITE), | |
4684 | .may_unmap = !!(node_reclaim_mode & RECLAIM_UNMAP), | |
ee814fe2 | 4685 | .may_swap = 1, |
f2f43e56 | 4686 | .reclaim_idx = gfp_zone(gfp_mask), |
179e9639 | 4687 | }; |
57f29762 | 4688 | unsigned long pflags; |
9eeff239 | 4689 | |
132bb8cf YS |
4690 | trace_mm_vmscan_node_reclaim_begin(pgdat->node_id, order, |
4691 | sc.gfp_mask); | |
4692 | ||
9eeff239 | 4693 | cond_resched(); |
57f29762 | 4694 | psi_memstall_enter(&pflags); |
93781325 | 4695 | fs_reclaim_acquire(sc.gfp_mask); |
d4f7796e | 4696 | /* |
95bbc0c7 | 4697 | * We need to be able to allocate from the reserves for RECLAIM_UNMAP |
d4f7796e | 4698 | */ |
499118e9 | 4699 | noreclaim_flag = memalloc_noreclaim_save(); |
1732d2b0 | 4700 | set_task_reclaim_state(p, &sc.reclaim_state); |
c84db23c | 4701 | |
a5f5f91d | 4702 | if (node_pagecache_reclaimable(pgdat) > pgdat->min_unmapped_pages) { |
0ff38490 | 4703 | /* |
894befec | 4704 | * Free memory by calling shrink node with increasing |
0ff38490 CL |
4705 | * priorities until we have enough memory freed. |
4706 | */ | |
0ff38490 | 4707 | do { |
970a39a3 | 4708 | shrink_node(pgdat, &sc); |
9e3b2f8c | 4709 | } while (sc.nr_reclaimed < nr_pages && --sc.priority >= 0); |
0ff38490 | 4710 | } |
c84db23c | 4711 | |
1732d2b0 | 4712 | set_task_reclaim_state(p, NULL); |
499118e9 | 4713 | memalloc_noreclaim_restore(noreclaim_flag); |
93781325 | 4714 | fs_reclaim_release(sc.gfp_mask); |
57f29762 | 4715 | psi_memstall_leave(&pflags); |
132bb8cf YS |
4716 | |
4717 | trace_mm_vmscan_node_reclaim_end(sc.nr_reclaimed); | |
4718 | ||
a79311c1 | 4719 | return sc.nr_reclaimed >= nr_pages; |
9eeff239 | 4720 | } |
179e9639 | 4721 | |
a5f5f91d | 4722 | int node_reclaim(struct pglist_data *pgdat, gfp_t gfp_mask, unsigned int order) |
179e9639 | 4723 | { |
d773ed6b | 4724 | int ret; |
179e9639 AM |
4725 | |
4726 | /* | |
a5f5f91d | 4727 | * Node reclaim reclaims unmapped file backed pages and |
0ff38490 | 4728 | * slab pages if we are over the defined limits. |
34aa1330 | 4729 | * |
9614634f CL |
4730 | * A small portion of unmapped file backed pages is needed for |
4731 | * file I/O otherwise pages read by file I/O will be immediately | |
a5f5f91d MG |
4732 | * thrown out if the node is overallocated. So we do not reclaim |
4733 | * if less than a specified percentage of the node is used by | |
9614634f | 4734 | * unmapped file backed pages. |
179e9639 | 4735 | */ |
a5f5f91d | 4736 | if (node_pagecache_reclaimable(pgdat) <= pgdat->min_unmapped_pages && |
d42f3245 RG |
4737 | node_page_state_pages(pgdat, NR_SLAB_RECLAIMABLE_B) <= |
4738 | pgdat->min_slab_pages) | |
a5f5f91d | 4739 | return NODE_RECLAIM_FULL; |
179e9639 AM |
4740 | |
4741 | /* | |
d773ed6b | 4742 | * Do not scan if the allocation should not be delayed. |
179e9639 | 4743 | */ |
d0164adc | 4744 | if (!gfpflags_allow_blocking(gfp_mask) || (current->flags & PF_MEMALLOC)) |
a5f5f91d | 4745 | return NODE_RECLAIM_NOSCAN; |
179e9639 AM |
4746 | |
4747 | /* | |
a5f5f91d | 4748 | * Only run node reclaim on the local node or on nodes that do not |
179e9639 AM |
4749 | * have associated processors. This will favor the local processor |
4750 | * over remote processors and spread off node memory allocations | |
4751 | * as wide as possible. | |
4752 | */ | |
a5f5f91d MG |
4753 | if (node_state(pgdat->node_id, N_CPU) && pgdat->node_id != numa_node_id()) |
4754 | return NODE_RECLAIM_NOSCAN; | |
d773ed6b | 4755 | |
a5f5f91d MG |
4756 | if (test_and_set_bit(PGDAT_RECLAIM_LOCKED, &pgdat->flags)) |
4757 | return NODE_RECLAIM_NOSCAN; | |
fa5e084e | 4758 | |
a5f5f91d MG |
4759 | ret = __node_reclaim(pgdat, gfp_mask, order); |
4760 | clear_bit(PGDAT_RECLAIM_LOCKED, &pgdat->flags); | |
d773ed6b | 4761 | |
24cf7251 MG |
4762 | if (!ret) |
4763 | count_vm_event(PGSCAN_ZONE_RECLAIM_FAILED); | |
4764 | ||
d773ed6b | 4765 | return ret; |
179e9639 | 4766 | } |
9eeff239 | 4767 | #endif |
894bc310 | 4768 | |
89e004ea | 4769 | /** |
64e3d12f KHY |
4770 | * check_move_unevictable_pages - check pages for evictability and move to |
4771 | * appropriate zone lru list | |
4772 | * @pvec: pagevec with lru pages to check | |
89e004ea | 4773 | * |
64e3d12f KHY |
4774 | * Checks pages for evictability, if an evictable page is in the unevictable |
4775 | * lru list, moves it to the appropriate evictable lru list. This function | |
4776 | * should be only used for lru pages. | |
89e004ea | 4777 | */ |
64e3d12f | 4778 | void check_move_unevictable_pages(struct pagevec *pvec) |
89e004ea | 4779 | { |
6168d0da | 4780 | struct lruvec *lruvec = NULL; |
24513264 HD |
4781 | int pgscanned = 0; |
4782 | int pgrescued = 0; | |
4783 | int i; | |
89e004ea | 4784 | |
64e3d12f KHY |
4785 | for (i = 0; i < pvec->nr; i++) { |
4786 | struct page *page = pvec->pages[i]; | |
0de340cb | 4787 | struct folio *folio = page_folio(page); |
8d8869ca HD |
4788 | int nr_pages; |
4789 | ||
4790 | if (PageTransTail(page)) | |
4791 | continue; | |
4792 | ||
4793 | nr_pages = thp_nr_pages(page); | |
4794 | pgscanned += nr_pages; | |
89e004ea | 4795 | |
d25b5bd8 AS |
4796 | /* block memcg migration during page moving between lru */ |
4797 | if (!TestClearPageLRU(page)) | |
4798 | continue; | |
4799 | ||
0de340cb | 4800 | lruvec = folio_lruvec_relock_irq(folio, lruvec); |
d25b5bd8 | 4801 | if (page_evictable(page) && PageUnevictable(page)) { |
46ae6b2c | 4802 | del_page_from_lru_list(page, lruvec); |
24513264 | 4803 | ClearPageUnevictable(page); |
3a9c9788 | 4804 | add_page_to_lru_list(page, lruvec); |
8d8869ca | 4805 | pgrescued += nr_pages; |
89e004ea | 4806 | } |
d25b5bd8 | 4807 | SetPageLRU(page); |
24513264 | 4808 | } |
89e004ea | 4809 | |
6168d0da | 4810 | if (lruvec) { |
24513264 HD |
4811 | __count_vm_events(UNEVICTABLE_PGRESCUED, pgrescued); |
4812 | __count_vm_events(UNEVICTABLE_PGSCANNED, pgscanned); | |
6168d0da | 4813 | unlock_page_lruvec_irq(lruvec); |
d25b5bd8 AS |
4814 | } else if (pgscanned) { |
4815 | count_vm_events(UNEVICTABLE_PGSCANNED, pgscanned); | |
89e004ea | 4816 | } |
89e004ea | 4817 | } |
64e3d12f | 4818 | EXPORT_SYMBOL_GPL(check_move_unevictable_pages); |