]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * linux/mm/vmscan.c | |
3 | * | |
4 | * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds | |
5 | * | |
6 | * Swap reorganised 29.12.95, Stephen Tweedie. | |
7 | * kswapd added: 7.1.96 sct | |
8 | * Removed kswapd_ctl limits, and swap out as many pages as needed | |
9 | * to bring the system back to freepages.high: 2.4.97, Rik van Riel. | |
10 | * Zone aware kswapd started 02/00, Kanoj Sarcar (kanoj@sgi.com). | |
11 | * Multiqueue VM started 5.8.00, Rik van Riel. | |
12 | */ | |
13 | ||
b1de0d13 MH |
14 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
15 | ||
1da177e4 LT |
16 | #include <linux/mm.h> |
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> |
873b4771 | 44 | #include <linux/delayacct.h> |
af936a16 | 45 | #include <linux/sysctl.h> |
929bea7c | 46 | #include <linux/oom.h> |
268bb0ce | 47 | #include <linux/prefetch.h> |
b1de0d13 | 48 | #include <linux/printk.h> |
1da177e4 LT |
49 | |
50 | #include <asm/tlbflush.h> | |
51 | #include <asm/div64.h> | |
52 | ||
53 | #include <linux/swapops.h> | |
117aad1e | 54 | #include <linux/balloon_compaction.h> |
1da177e4 | 55 | |
0f8053a5 NP |
56 | #include "internal.h" |
57 | ||
33906bc5 MG |
58 | #define CREATE_TRACE_POINTS |
59 | #include <trace/events/vmscan.h> | |
60 | ||
1da177e4 | 61 | struct scan_control { |
22fba335 KM |
62 | /* How many pages shrink_list() should reclaim */ |
63 | unsigned long nr_to_reclaim; | |
64 | ||
1da177e4 | 65 | /* This context's GFP mask */ |
6daa0e28 | 66 | gfp_t gfp_mask; |
1da177e4 | 67 | |
ee814fe2 | 68 | /* Allocation order */ |
5ad333eb | 69 | int order; |
66e1707b | 70 | |
ee814fe2 JW |
71 | /* |
72 | * Nodemask of nodes allowed by the caller. If NULL, all nodes | |
73 | * are scanned. | |
74 | */ | |
75 | nodemask_t *nodemask; | |
9e3b2f8c | 76 | |
f16015fb JW |
77 | /* |
78 | * The memory cgroup that hit its limit and as a result is the | |
79 | * primary target of this reclaim invocation. | |
80 | */ | |
81 | struct mem_cgroup *target_mem_cgroup; | |
66e1707b | 82 | |
ee814fe2 JW |
83 | /* Scan (total_size >> priority) pages at once */ |
84 | int priority; | |
85 | ||
86 | unsigned int may_writepage:1; | |
87 | ||
88 | /* Can mapped pages be reclaimed? */ | |
89 | unsigned int may_unmap:1; | |
90 | ||
91 | /* Can pages be swapped as part of reclaim? */ | |
92 | unsigned int may_swap:1; | |
93 | ||
94 | unsigned int hibernation_mode:1; | |
95 | ||
96 | /* One of the zones is ready for compaction */ | |
97 | unsigned int compaction_ready:1; | |
98 | ||
99 | /* Incremented by the number of inactive pages that were scanned */ | |
100 | unsigned long nr_scanned; | |
101 | ||
102 | /* Number of pages freed so far during a call to shrink_zones() */ | |
103 | unsigned long nr_reclaimed; | |
1da177e4 LT |
104 | }; |
105 | ||
1da177e4 LT |
106 | #define lru_to_page(_head) (list_entry((_head)->prev, struct page, lru)) |
107 | ||
108 | #ifdef ARCH_HAS_PREFETCH | |
109 | #define prefetch_prev_lru_page(_page, _base, _field) \ | |
110 | do { \ | |
111 | if ((_page)->lru.prev != _base) { \ | |
112 | struct page *prev; \ | |
113 | \ | |
114 | prev = lru_to_page(&(_page->lru)); \ | |
115 | prefetch(&prev->_field); \ | |
116 | } \ | |
117 | } while (0) | |
118 | #else | |
119 | #define prefetch_prev_lru_page(_page, _base, _field) do { } while (0) | |
120 | #endif | |
121 | ||
122 | #ifdef ARCH_HAS_PREFETCHW | |
123 | #define prefetchw_prev_lru_page(_page, _base, _field) \ | |
124 | do { \ | |
125 | if ((_page)->lru.prev != _base) { \ | |
126 | struct page *prev; \ | |
127 | \ | |
128 | prev = lru_to_page(&(_page->lru)); \ | |
129 | prefetchw(&prev->_field); \ | |
130 | } \ | |
131 | } while (0) | |
132 | #else | |
133 | #define prefetchw_prev_lru_page(_page, _base, _field) do { } while (0) | |
134 | #endif | |
135 | ||
136 | /* | |
137 | * From 0 .. 100. Higher means more swappy. | |
138 | */ | |
139 | int vm_swappiness = 60; | |
d0480be4 WSH |
140 | /* |
141 | * The total number of pages which are beyond the high watermark within all | |
142 | * zones. | |
143 | */ | |
144 | unsigned long vm_total_pages; | |
1da177e4 LT |
145 | |
146 | static LIST_HEAD(shrinker_list); | |
147 | static DECLARE_RWSEM(shrinker_rwsem); | |
148 | ||
c255a458 | 149 | #ifdef CONFIG_MEMCG |
89b5fae5 JW |
150 | static bool global_reclaim(struct scan_control *sc) |
151 | { | |
f16015fb | 152 | return !sc->target_mem_cgroup; |
89b5fae5 | 153 | } |
91a45470 | 154 | #else |
89b5fae5 JW |
155 | static bool global_reclaim(struct scan_control *sc) |
156 | { | |
157 | return true; | |
158 | } | |
91a45470 KH |
159 | #endif |
160 | ||
a1c3bfb2 | 161 | static unsigned long zone_reclaimable_pages(struct zone *zone) |
6e543d57 LD |
162 | { |
163 | int nr; | |
164 | ||
165 | nr = zone_page_state(zone, NR_ACTIVE_FILE) + | |
166 | zone_page_state(zone, NR_INACTIVE_FILE); | |
167 | ||
168 | if (get_nr_swap_pages() > 0) | |
169 | nr += zone_page_state(zone, NR_ACTIVE_ANON) + | |
170 | zone_page_state(zone, NR_INACTIVE_ANON); | |
171 | ||
172 | return nr; | |
173 | } | |
174 | ||
175 | bool zone_reclaimable(struct zone *zone) | |
176 | { | |
177 | return zone->pages_scanned < zone_reclaimable_pages(zone) * 6; | |
178 | } | |
179 | ||
4d7dcca2 | 180 | static unsigned long get_lru_size(struct lruvec *lruvec, enum lru_list lru) |
c9f299d9 | 181 | { |
c3c787e8 | 182 | if (!mem_cgroup_disabled()) |
4d7dcca2 | 183 | return mem_cgroup_get_lru_size(lruvec, lru); |
a3d8e054 | 184 | |
074291fe | 185 | return zone_page_state(lruvec_zone(lruvec), NR_LRU_BASE + lru); |
c9f299d9 KM |
186 | } |
187 | ||
1da177e4 | 188 | /* |
1d3d4437 | 189 | * Add a shrinker callback to be called from the vm. |
1da177e4 | 190 | */ |
1d3d4437 | 191 | int register_shrinker(struct shrinker *shrinker) |
1da177e4 | 192 | { |
1d3d4437 GC |
193 | size_t size = sizeof(*shrinker->nr_deferred); |
194 | ||
195 | /* | |
196 | * If we only have one possible node in the system anyway, save | |
197 | * ourselves the trouble and disable NUMA aware behavior. This way we | |
198 | * will save memory and some small loop time later. | |
199 | */ | |
200 | if (nr_node_ids == 1) | |
201 | shrinker->flags &= ~SHRINKER_NUMA_AWARE; | |
202 | ||
203 | if (shrinker->flags & SHRINKER_NUMA_AWARE) | |
204 | size *= nr_node_ids; | |
205 | ||
206 | shrinker->nr_deferred = kzalloc(size, GFP_KERNEL); | |
207 | if (!shrinker->nr_deferred) | |
208 | return -ENOMEM; | |
209 | ||
8e1f936b RR |
210 | down_write(&shrinker_rwsem); |
211 | list_add_tail(&shrinker->list, &shrinker_list); | |
212 | up_write(&shrinker_rwsem); | |
1d3d4437 | 213 | return 0; |
1da177e4 | 214 | } |
8e1f936b | 215 | EXPORT_SYMBOL(register_shrinker); |
1da177e4 LT |
216 | |
217 | /* | |
218 | * Remove one | |
219 | */ | |
8e1f936b | 220 | void unregister_shrinker(struct shrinker *shrinker) |
1da177e4 LT |
221 | { |
222 | down_write(&shrinker_rwsem); | |
223 | list_del(&shrinker->list); | |
224 | up_write(&shrinker_rwsem); | |
ae393321 | 225 | kfree(shrinker->nr_deferred); |
1da177e4 | 226 | } |
8e1f936b | 227 | EXPORT_SYMBOL(unregister_shrinker); |
1da177e4 LT |
228 | |
229 | #define SHRINK_BATCH 128 | |
1d3d4437 GC |
230 | |
231 | static unsigned long | |
232 | shrink_slab_node(struct shrink_control *shrinkctl, struct shrinker *shrinker, | |
233 | unsigned long nr_pages_scanned, unsigned long lru_pages) | |
234 | { | |
235 | unsigned long freed = 0; | |
236 | unsigned long long delta; | |
237 | long total_scan; | |
d5bc5fd3 | 238 | long freeable; |
1d3d4437 GC |
239 | long nr; |
240 | long new_nr; | |
241 | int nid = shrinkctl->nid; | |
242 | long batch_size = shrinker->batch ? shrinker->batch | |
243 | : SHRINK_BATCH; | |
244 | ||
d5bc5fd3 VD |
245 | freeable = shrinker->count_objects(shrinker, shrinkctl); |
246 | if (freeable == 0) | |
1d3d4437 GC |
247 | return 0; |
248 | ||
249 | /* | |
250 | * copy the current shrinker scan count into a local variable | |
251 | * and zero it so that other concurrent shrinker invocations | |
252 | * don't also do this scanning work. | |
253 | */ | |
254 | nr = atomic_long_xchg(&shrinker->nr_deferred[nid], 0); | |
255 | ||
256 | total_scan = nr; | |
257 | delta = (4 * nr_pages_scanned) / shrinker->seeks; | |
d5bc5fd3 | 258 | delta *= freeable; |
1d3d4437 GC |
259 | do_div(delta, lru_pages + 1); |
260 | total_scan += delta; | |
261 | if (total_scan < 0) { | |
262 | printk(KERN_ERR | |
263 | "shrink_slab: %pF negative objects to delete nr=%ld\n", | |
a0b02131 | 264 | shrinker->scan_objects, total_scan); |
d5bc5fd3 | 265 | total_scan = freeable; |
1d3d4437 GC |
266 | } |
267 | ||
268 | /* | |
269 | * We need to avoid excessive windup on filesystem shrinkers | |
270 | * due to large numbers of GFP_NOFS allocations causing the | |
271 | * shrinkers to return -1 all the time. This results in a large | |
272 | * nr being built up so when a shrink that can do some work | |
273 | * comes along it empties the entire cache due to nr >>> | |
d5bc5fd3 | 274 | * freeable. This is bad for sustaining a working set in |
1d3d4437 GC |
275 | * memory. |
276 | * | |
277 | * Hence only allow the shrinker to scan the entire cache when | |
278 | * a large delta change is calculated directly. | |
279 | */ | |
d5bc5fd3 VD |
280 | if (delta < freeable / 4) |
281 | total_scan = min(total_scan, freeable / 2); | |
1d3d4437 GC |
282 | |
283 | /* | |
284 | * Avoid risking looping forever due to too large nr value: | |
285 | * never try to free more than twice the estimate number of | |
286 | * freeable entries. | |
287 | */ | |
d5bc5fd3 VD |
288 | if (total_scan > freeable * 2) |
289 | total_scan = freeable * 2; | |
1d3d4437 GC |
290 | |
291 | trace_mm_shrink_slab_start(shrinker, shrinkctl, nr, | |
292 | nr_pages_scanned, lru_pages, | |
d5bc5fd3 | 293 | freeable, delta, total_scan); |
1d3d4437 | 294 | |
0b1fb40a VD |
295 | /* |
296 | * Normally, we should not scan less than batch_size objects in one | |
297 | * pass to avoid too frequent shrinker calls, but if the slab has less | |
298 | * than batch_size objects in total and we are really tight on memory, | |
299 | * we will try to reclaim all available objects, otherwise we can end | |
300 | * up failing allocations although there are plenty of reclaimable | |
301 | * objects spread over several slabs with usage less than the | |
302 | * batch_size. | |
303 | * | |
304 | * We detect the "tight on memory" situations by looking at the total | |
305 | * number of objects we want to scan (total_scan). If it is greater | |
d5bc5fd3 | 306 | * than the total number of objects on slab (freeable), we must be |
0b1fb40a VD |
307 | * scanning at high prio and therefore should try to reclaim as much as |
308 | * possible. | |
309 | */ | |
310 | while (total_scan >= batch_size || | |
d5bc5fd3 | 311 | total_scan >= freeable) { |
a0b02131 | 312 | unsigned long ret; |
0b1fb40a | 313 | unsigned long nr_to_scan = min(batch_size, total_scan); |
1d3d4437 | 314 | |
0b1fb40a | 315 | shrinkctl->nr_to_scan = nr_to_scan; |
a0b02131 DC |
316 | ret = shrinker->scan_objects(shrinker, shrinkctl); |
317 | if (ret == SHRINK_STOP) | |
318 | break; | |
319 | freed += ret; | |
1d3d4437 | 320 | |
0b1fb40a VD |
321 | count_vm_events(SLABS_SCANNED, nr_to_scan); |
322 | total_scan -= nr_to_scan; | |
1d3d4437 GC |
323 | |
324 | cond_resched(); | |
325 | } | |
326 | ||
327 | /* | |
328 | * move the unused scan count back into the shrinker in a | |
329 | * manner that handles concurrent updates. If we exhausted the | |
330 | * scan, there is no need to do an update. | |
331 | */ | |
332 | if (total_scan > 0) | |
333 | new_nr = atomic_long_add_return(total_scan, | |
334 | &shrinker->nr_deferred[nid]); | |
335 | else | |
336 | new_nr = atomic_long_read(&shrinker->nr_deferred[nid]); | |
337 | ||
df9024a8 | 338 | trace_mm_shrink_slab_end(shrinker, nid, freed, nr, new_nr, total_scan); |
1d3d4437 | 339 | return freed; |
1495f230 YH |
340 | } |
341 | ||
1da177e4 LT |
342 | /* |
343 | * Call the shrink functions to age shrinkable caches | |
344 | * | |
345 | * Here we assume it costs one seek to replace a lru page and that it also | |
346 | * takes a seek to recreate a cache object. With this in mind we age equal | |
347 | * percentages of the lru and ageable caches. This should balance the seeks | |
348 | * generated by these structures. | |
349 | * | |
183ff22b | 350 | * If the vm encountered mapped pages on the LRU it increase the pressure on |
1da177e4 LT |
351 | * slab to avoid swapping. |
352 | * | |
353 | * We do weird things to avoid (scanned*seeks*entries) overflowing 32 bits. | |
354 | * | |
355 | * `lru_pages' represents the number of on-LRU pages in all the zones which | |
356 | * are eligible for the caller's allocation attempt. It is used for balancing | |
357 | * slab reclaim versus page reclaim. | |
b15e0905 | 358 | * |
359 | * Returns the number of slab objects which we shrunk. | |
1da177e4 | 360 | */ |
24f7c6b9 | 361 | unsigned long shrink_slab(struct shrink_control *shrinkctl, |
1495f230 | 362 | unsigned long nr_pages_scanned, |
a09ed5e0 | 363 | unsigned long lru_pages) |
1da177e4 LT |
364 | { |
365 | struct shrinker *shrinker; | |
24f7c6b9 | 366 | unsigned long freed = 0; |
1da177e4 | 367 | |
1495f230 YH |
368 | if (nr_pages_scanned == 0) |
369 | nr_pages_scanned = SWAP_CLUSTER_MAX; | |
1da177e4 | 370 | |
f06590bd | 371 | if (!down_read_trylock(&shrinker_rwsem)) { |
24f7c6b9 DC |
372 | /* |
373 | * If we would return 0, our callers would understand that we | |
374 | * have nothing else to shrink and give up trying. By returning | |
375 | * 1 we keep it going and assume we'll be able to shrink next | |
376 | * time. | |
377 | */ | |
378 | freed = 1; | |
f06590bd MK |
379 | goto out; |
380 | } | |
1da177e4 LT |
381 | |
382 | list_for_each_entry(shrinker, &shrinker_list, list) { | |
ec97097b VD |
383 | if (!(shrinker->flags & SHRINKER_NUMA_AWARE)) { |
384 | shrinkctl->nid = 0; | |
1d3d4437 | 385 | freed += shrink_slab_node(shrinkctl, shrinker, |
ec97097b VD |
386 | nr_pages_scanned, lru_pages); |
387 | continue; | |
388 | } | |
389 | ||
390 | for_each_node_mask(shrinkctl->nid, shrinkctl->nodes_to_scan) { | |
391 | if (node_online(shrinkctl->nid)) | |
392 | freed += shrink_slab_node(shrinkctl, shrinker, | |
393 | nr_pages_scanned, lru_pages); | |
1da177e4 | 394 | |
1da177e4 | 395 | } |
1da177e4 LT |
396 | } |
397 | up_read(&shrinker_rwsem); | |
f06590bd MK |
398 | out: |
399 | cond_resched(); | |
24f7c6b9 | 400 | return freed; |
1da177e4 LT |
401 | } |
402 | ||
1da177e4 LT |
403 | static inline int is_page_cache_freeable(struct page *page) |
404 | { | |
ceddc3a5 JW |
405 | /* |
406 | * A freeable page cache page is referenced only by the caller | |
407 | * that isolated the page, the page cache radix tree and | |
408 | * optional buffer heads at page->private. | |
409 | */ | |
edcf4748 | 410 | return page_count(page) - page_has_private(page) == 2; |
1da177e4 LT |
411 | } |
412 | ||
7d3579e8 KM |
413 | static int may_write_to_queue(struct backing_dev_info *bdi, |
414 | struct scan_control *sc) | |
1da177e4 | 415 | { |
930d9152 | 416 | if (current->flags & PF_SWAPWRITE) |
1da177e4 LT |
417 | return 1; |
418 | if (!bdi_write_congested(bdi)) | |
419 | return 1; | |
420 | if (bdi == current->backing_dev_info) | |
421 | return 1; | |
422 | return 0; | |
423 | } | |
424 | ||
425 | /* | |
426 | * We detected a synchronous write error writing a page out. Probably | |
427 | * -ENOSPC. We need to propagate that into the address_space for a subsequent | |
428 | * fsync(), msync() or close(). | |
429 | * | |
430 | * The tricky part is that after writepage we cannot touch the mapping: nothing | |
431 | * prevents it from being freed up. But we have a ref on the page and once | |
432 | * that page is locked, the mapping is pinned. | |
433 | * | |
434 | * We're allowed to run sleeping lock_page() here because we know the caller has | |
435 | * __GFP_FS. | |
436 | */ | |
437 | static void handle_write_error(struct address_space *mapping, | |
438 | struct page *page, int error) | |
439 | { | |
7eaceacc | 440 | lock_page(page); |
3e9f45bd GC |
441 | if (page_mapping(page) == mapping) |
442 | mapping_set_error(mapping, error); | |
1da177e4 LT |
443 | unlock_page(page); |
444 | } | |
445 | ||
04e62a29 CL |
446 | /* possible outcome of pageout() */ |
447 | typedef enum { | |
448 | /* failed to write page out, page is locked */ | |
449 | PAGE_KEEP, | |
450 | /* move page to the active list, page is locked */ | |
451 | PAGE_ACTIVATE, | |
452 | /* page has been sent to the disk successfully, page is unlocked */ | |
453 | PAGE_SUCCESS, | |
454 | /* page is clean and locked */ | |
455 | PAGE_CLEAN, | |
456 | } pageout_t; | |
457 | ||
1da177e4 | 458 | /* |
1742f19f AM |
459 | * pageout is called by shrink_page_list() for each dirty page. |
460 | * Calls ->writepage(). | |
1da177e4 | 461 | */ |
c661b078 | 462 | static pageout_t pageout(struct page *page, struct address_space *mapping, |
7d3579e8 | 463 | struct scan_control *sc) |
1da177e4 LT |
464 | { |
465 | /* | |
466 | * If the page is dirty, only perform writeback if that write | |
467 | * will be non-blocking. To prevent this allocation from being | |
468 | * stalled by pagecache activity. But note that there may be | |
469 | * stalls if we need to run get_block(). We could test | |
470 | * PagePrivate for that. | |
471 | * | |
8174202b | 472 | * If this process is currently in __generic_file_write_iter() against |
1da177e4 LT |
473 | * this page's queue, we can perform writeback even if that |
474 | * will block. | |
475 | * | |
476 | * If the page is swapcache, write it back even if that would | |
477 | * block, for some throttling. This happens by accident, because | |
478 | * swap_backing_dev_info is bust: it doesn't reflect the | |
479 | * congestion state of the swapdevs. Easy to fix, if needed. | |
1da177e4 LT |
480 | */ |
481 | if (!is_page_cache_freeable(page)) | |
482 | return PAGE_KEEP; | |
483 | if (!mapping) { | |
484 | /* | |
485 | * Some data journaling orphaned pages can have | |
486 | * page->mapping == NULL while being dirty with clean buffers. | |
487 | */ | |
266cf658 | 488 | if (page_has_private(page)) { |
1da177e4 LT |
489 | if (try_to_free_buffers(page)) { |
490 | ClearPageDirty(page); | |
b1de0d13 | 491 | pr_info("%s: orphaned page\n", __func__); |
1da177e4 LT |
492 | return PAGE_CLEAN; |
493 | } | |
494 | } | |
495 | return PAGE_KEEP; | |
496 | } | |
497 | if (mapping->a_ops->writepage == NULL) | |
498 | return PAGE_ACTIVATE; | |
0e093d99 | 499 | if (!may_write_to_queue(mapping->backing_dev_info, sc)) |
1da177e4 LT |
500 | return PAGE_KEEP; |
501 | ||
502 | if (clear_page_dirty_for_io(page)) { | |
503 | int res; | |
504 | struct writeback_control wbc = { | |
505 | .sync_mode = WB_SYNC_NONE, | |
506 | .nr_to_write = SWAP_CLUSTER_MAX, | |
111ebb6e OH |
507 | .range_start = 0, |
508 | .range_end = LLONG_MAX, | |
1da177e4 LT |
509 | .for_reclaim = 1, |
510 | }; | |
511 | ||
512 | SetPageReclaim(page); | |
513 | res = mapping->a_ops->writepage(page, &wbc); | |
514 | if (res < 0) | |
515 | handle_write_error(mapping, page, res); | |
994fc28c | 516 | if (res == AOP_WRITEPAGE_ACTIVATE) { |
1da177e4 LT |
517 | ClearPageReclaim(page); |
518 | return PAGE_ACTIVATE; | |
519 | } | |
c661b078 | 520 | |
1da177e4 LT |
521 | if (!PageWriteback(page)) { |
522 | /* synchronous write or broken a_ops? */ | |
523 | ClearPageReclaim(page); | |
524 | } | |
23b9da55 | 525 | trace_mm_vmscan_writepage(page, trace_reclaim_flags(page)); |
e129b5c2 | 526 | inc_zone_page_state(page, NR_VMSCAN_WRITE); |
1da177e4 LT |
527 | return PAGE_SUCCESS; |
528 | } | |
529 | ||
530 | return PAGE_CLEAN; | |
531 | } | |
532 | ||
a649fd92 | 533 | /* |
e286781d NP |
534 | * Same as remove_mapping, but if the page is removed from the mapping, it |
535 | * gets returned with a refcount of 0. | |
a649fd92 | 536 | */ |
a528910e JW |
537 | static int __remove_mapping(struct address_space *mapping, struct page *page, |
538 | bool reclaimed) | |
49d2e9cc | 539 | { |
28e4d965 NP |
540 | BUG_ON(!PageLocked(page)); |
541 | BUG_ON(mapping != page_mapping(page)); | |
49d2e9cc | 542 | |
19fd6231 | 543 | spin_lock_irq(&mapping->tree_lock); |
49d2e9cc | 544 | /* |
0fd0e6b0 NP |
545 | * The non racy check for a busy page. |
546 | * | |
547 | * Must be careful with the order of the tests. When someone has | |
548 | * a ref to the page, it may be possible that they dirty it then | |
549 | * drop the reference. So if PageDirty is tested before page_count | |
550 | * here, then the following race may occur: | |
551 | * | |
552 | * get_user_pages(&page); | |
553 | * [user mapping goes away] | |
554 | * write_to(page); | |
555 | * !PageDirty(page) [good] | |
556 | * SetPageDirty(page); | |
557 | * put_page(page); | |
558 | * !page_count(page) [good, discard it] | |
559 | * | |
560 | * [oops, our write_to data is lost] | |
561 | * | |
562 | * Reversing the order of the tests ensures such a situation cannot | |
563 | * escape unnoticed. The smp_rmb is needed to ensure the page->flags | |
564 | * load is not satisfied before that of page->_count. | |
565 | * | |
566 | * Note that if SetPageDirty is always performed via set_page_dirty, | |
567 | * and thus under tree_lock, then this ordering is not required. | |
49d2e9cc | 568 | */ |
e286781d | 569 | if (!page_freeze_refs(page, 2)) |
49d2e9cc | 570 | goto cannot_free; |
e286781d NP |
571 | /* note: atomic_cmpxchg in page_freeze_refs provides the smp_rmb */ |
572 | if (unlikely(PageDirty(page))) { | |
573 | page_unfreeze_refs(page, 2); | |
49d2e9cc | 574 | goto cannot_free; |
e286781d | 575 | } |
49d2e9cc CL |
576 | |
577 | if (PageSwapCache(page)) { | |
578 | swp_entry_t swap = { .val = page_private(page) }; | |
579 | __delete_from_swap_cache(page); | |
19fd6231 | 580 | spin_unlock_irq(&mapping->tree_lock); |
cb4b86ba | 581 | swapcache_free(swap, page); |
e286781d | 582 | } else { |
6072d13c | 583 | void (*freepage)(struct page *); |
a528910e | 584 | void *shadow = NULL; |
6072d13c LT |
585 | |
586 | freepage = mapping->a_ops->freepage; | |
a528910e JW |
587 | /* |
588 | * Remember a shadow entry for reclaimed file cache in | |
589 | * order to detect refaults, thus thrashing, later on. | |
590 | * | |
591 | * But don't store shadows in an address space that is | |
592 | * already exiting. This is not just an optizimation, | |
593 | * inode reclaim needs to empty out the radix tree or | |
594 | * the nodes are lost. Don't plant shadows behind its | |
595 | * back. | |
596 | */ | |
597 | if (reclaimed && page_is_file_cache(page) && | |
598 | !mapping_exiting(mapping)) | |
599 | shadow = workingset_eviction(mapping, page); | |
600 | __delete_from_page_cache(page, shadow); | |
19fd6231 | 601 | spin_unlock_irq(&mapping->tree_lock); |
e767e056 | 602 | mem_cgroup_uncharge_cache_page(page); |
6072d13c LT |
603 | |
604 | if (freepage != NULL) | |
605 | freepage(page); | |
49d2e9cc CL |
606 | } |
607 | ||
49d2e9cc CL |
608 | return 1; |
609 | ||
610 | cannot_free: | |
19fd6231 | 611 | spin_unlock_irq(&mapping->tree_lock); |
49d2e9cc CL |
612 | return 0; |
613 | } | |
614 | ||
e286781d NP |
615 | /* |
616 | * Attempt to detach a locked page from its ->mapping. If it is dirty or if | |
617 | * someone else has a ref on the page, abort and return 0. If it was | |
618 | * successfully detached, return 1. Assumes the caller has a single ref on | |
619 | * this page. | |
620 | */ | |
621 | int remove_mapping(struct address_space *mapping, struct page *page) | |
622 | { | |
a528910e | 623 | if (__remove_mapping(mapping, page, false)) { |
e286781d NP |
624 | /* |
625 | * Unfreezing the refcount with 1 rather than 2 effectively | |
626 | * drops the pagecache ref for us without requiring another | |
627 | * atomic operation. | |
628 | */ | |
629 | page_unfreeze_refs(page, 1); | |
630 | return 1; | |
631 | } | |
632 | return 0; | |
633 | } | |
634 | ||
894bc310 LS |
635 | /** |
636 | * putback_lru_page - put previously isolated page onto appropriate LRU list | |
637 | * @page: page to be put back to appropriate lru list | |
638 | * | |
639 | * Add previously isolated @page to appropriate LRU list. | |
640 | * Page may still be unevictable for other reasons. | |
641 | * | |
642 | * lru_lock must not be held, interrupts must be enabled. | |
643 | */ | |
894bc310 LS |
644 | void putback_lru_page(struct page *page) |
645 | { | |
0ec3b74c | 646 | bool is_unevictable; |
bbfd28ee | 647 | int was_unevictable = PageUnevictable(page); |
894bc310 | 648 | |
309381fe | 649 | VM_BUG_ON_PAGE(PageLRU(page), page); |
894bc310 LS |
650 | |
651 | redo: | |
652 | ClearPageUnevictable(page); | |
653 | ||
39b5f29a | 654 | if (page_evictable(page)) { |
894bc310 LS |
655 | /* |
656 | * For evictable pages, we can use the cache. | |
657 | * In event of a race, worst case is we end up with an | |
658 | * unevictable page on [in]active list. | |
659 | * We know how to handle that. | |
660 | */ | |
0ec3b74c | 661 | is_unevictable = false; |
c53954a0 | 662 | lru_cache_add(page); |
894bc310 LS |
663 | } else { |
664 | /* | |
665 | * Put unevictable pages directly on zone's unevictable | |
666 | * list. | |
667 | */ | |
0ec3b74c | 668 | is_unevictable = true; |
894bc310 | 669 | add_page_to_unevictable_list(page); |
6a7b9548 | 670 | /* |
21ee9f39 MK |
671 | * When racing with an mlock or AS_UNEVICTABLE clearing |
672 | * (page is unlocked) make sure that if the other thread | |
673 | * does not observe our setting of PG_lru and fails | |
24513264 | 674 | * isolation/check_move_unevictable_pages, |
21ee9f39 | 675 | * we see PG_mlocked/AS_UNEVICTABLE cleared below and move |
6a7b9548 JW |
676 | * the page back to the evictable list. |
677 | * | |
21ee9f39 | 678 | * The other side is TestClearPageMlocked() or shmem_lock(). |
6a7b9548 JW |
679 | */ |
680 | smp_mb(); | |
894bc310 | 681 | } |
894bc310 LS |
682 | |
683 | /* | |
684 | * page's status can change while we move it among lru. If an evictable | |
685 | * page is on unevictable list, it never be freed. To avoid that, | |
686 | * check after we added it to the list, again. | |
687 | */ | |
0ec3b74c | 688 | if (is_unevictable && page_evictable(page)) { |
894bc310 LS |
689 | if (!isolate_lru_page(page)) { |
690 | put_page(page); | |
691 | goto redo; | |
692 | } | |
693 | /* This means someone else dropped this page from LRU | |
694 | * So, it will be freed or putback to LRU again. There is | |
695 | * nothing to do here. | |
696 | */ | |
697 | } | |
698 | ||
0ec3b74c | 699 | if (was_unevictable && !is_unevictable) |
bbfd28ee | 700 | count_vm_event(UNEVICTABLE_PGRESCUED); |
0ec3b74c | 701 | else if (!was_unevictable && is_unevictable) |
bbfd28ee LS |
702 | count_vm_event(UNEVICTABLE_PGCULLED); |
703 | ||
894bc310 LS |
704 | put_page(page); /* drop ref from isolate */ |
705 | } | |
706 | ||
dfc8d636 JW |
707 | enum page_references { |
708 | PAGEREF_RECLAIM, | |
709 | PAGEREF_RECLAIM_CLEAN, | |
64574746 | 710 | PAGEREF_KEEP, |
dfc8d636 JW |
711 | PAGEREF_ACTIVATE, |
712 | }; | |
713 | ||
714 | static enum page_references page_check_references(struct page *page, | |
715 | struct scan_control *sc) | |
716 | { | |
64574746 | 717 | int referenced_ptes, referenced_page; |
dfc8d636 | 718 | unsigned long vm_flags; |
dfc8d636 | 719 | |
c3ac9a8a JW |
720 | referenced_ptes = page_referenced(page, 1, sc->target_mem_cgroup, |
721 | &vm_flags); | |
64574746 | 722 | referenced_page = TestClearPageReferenced(page); |
dfc8d636 | 723 | |
dfc8d636 JW |
724 | /* |
725 | * Mlock lost the isolation race with us. Let try_to_unmap() | |
726 | * move the page to the unevictable list. | |
727 | */ | |
728 | if (vm_flags & VM_LOCKED) | |
729 | return PAGEREF_RECLAIM; | |
730 | ||
64574746 | 731 | if (referenced_ptes) { |
e4898273 | 732 | if (PageSwapBacked(page)) |
64574746 JW |
733 | return PAGEREF_ACTIVATE; |
734 | /* | |
735 | * All mapped pages start out with page table | |
736 | * references from the instantiating fault, so we need | |
737 | * to look twice if a mapped file page is used more | |
738 | * than once. | |
739 | * | |
740 | * Mark it and spare it for another trip around the | |
741 | * inactive list. Another page table reference will | |
742 | * lead to its activation. | |
743 | * | |
744 | * Note: the mark is set for activated pages as well | |
745 | * so that recently deactivated but used pages are | |
746 | * quickly recovered. | |
747 | */ | |
748 | SetPageReferenced(page); | |
749 | ||
34dbc67a | 750 | if (referenced_page || referenced_ptes > 1) |
64574746 JW |
751 | return PAGEREF_ACTIVATE; |
752 | ||
c909e993 KK |
753 | /* |
754 | * Activate file-backed executable pages after first usage. | |
755 | */ | |
756 | if (vm_flags & VM_EXEC) | |
757 | return PAGEREF_ACTIVATE; | |
758 | ||
64574746 JW |
759 | return PAGEREF_KEEP; |
760 | } | |
dfc8d636 JW |
761 | |
762 | /* Reclaim if clean, defer dirty pages to writeback */ | |
2e30244a | 763 | if (referenced_page && !PageSwapBacked(page)) |
64574746 JW |
764 | return PAGEREF_RECLAIM_CLEAN; |
765 | ||
766 | return PAGEREF_RECLAIM; | |
dfc8d636 JW |
767 | } |
768 | ||
e2be15f6 MG |
769 | /* Check if a page is dirty or under writeback */ |
770 | static void page_check_dirty_writeback(struct page *page, | |
771 | bool *dirty, bool *writeback) | |
772 | { | |
b4597226 MG |
773 | struct address_space *mapping; |
774 | ||
e2be15f6 MG |
775 | /* |
776 | * Anonymous pages are not handled by flushers and must be written | |
777 | * from reclaim context. Do not stall reclaim based on them | |
778 | */ | |
779 | if (!page_is_file_cache(page)) { | |
780 | *dirty = false; | |
781 | *writeback = false; | |
782 | return; | |
783 | } | |
784 | ||
785 | /* By default assume that the page flags are accurate */ | |
786 | *dirty = PageDirty(page); | |
787 | *writeback = PageWriteback(page); | |
b4597226 MG |
788 | |
789 | /* Verify dirty/writeback state if the filesystem supports it */ | |
790 | if (!page_has_private(page)) | |
791 | return; | |
792 | ||
793 | mapping = page_mapping(page); | |
794 | if (mapping && mapping->a_ops->is_dirty_writeback) | |
795 | mapping->a_ops->is_dirty_writeback(page, dirty, writeback); | |
e2be15f6 MG |
796 | } |
797 | ||
1da177e4 | 798 | /* |
1742f19f | 799 | * shrink_page_list() returns the number of reclaimed pages |
1da177e4 | 800 | */ |
1742f19f | 801 | static unsigned long shrink_page_list(struct list_head *page_list, |
6a18adb3 | 802 | struct zone *zone, |
f84f6e2b | 803 | struct scan_control *sc, |
02c6de8d | 804 | enum ttu_flags ttu_flags, |
8e950282 | 805 | unsigned long *ret_nr_dirty, |
d43006d5 | 806 | unsigned long *ret_nr_unqueued_dirty, |
8e950282 | 807 | unsigned long *ret_nr_congested, |
02c6de8d | 808 | unsigned long *ret_nr_writeback, |
b1a6f21e | 809 | unsigned long *ret_nr_immediate, |
02c6de8d | 810 | bool force_reclaim) |
1da177e4 LT |
811 | { |
812 | LIST_HEAD(ret_pages); | |
abe4c3b5 | 813 | LIST_HEAD(free_pages); |
1da177e4 | 814 | int pgactivate = 0; |
d43006d5 | 815 | unsigned long nr_unqueued_dirty = 0; |
0e093d99 MG |
816 | unsigned long nr_dirty = 0; |
817 | unsigned long nr_congested = 0; | |
05ff5137 | 818 | unsigned long nr_reclaimed = 0; |
92df3a72 | 819 | unsigned long nr_writeback = 0; |
b1a6f21e | 820 | unsigned long nr_immediate = 0; |
1da177e4 LT |
821 | |
822 | cond_resched(); | |
823 | ||
69980e31 | 824 | mem_cgroup_uncharge_start(); |
1da177e4 LT |
825 | while (!list_empty(page_list)) { |
826 | struct address_space *mapping; | |
827 | struct page *page; | |
828 | int may_enter_fs; | |
02c6de8d | 829 | enum page_references references = PAGEREF_RECLAIM_CLEAN; |
e2be15f6 | 830 | bool dirty, writeback; |
1da177e4 LT |
831 | |
832 | cond_resched(); | |
833 | ||
834 | page = lru_to_page(page_list); | |
835 | list_del(&page->lru); | |
836 | ||
529ae9aa | 837 | if (!trylock_page(page)) |
1da177e4 LT |
838 | goto keep; |
839 | ||
309381fe SL |
840 | VM_BUG_ON_PAGE(PageActive(page), page); |
841 | VM_BUG_ON_PAGE(page_zone(page) != zone, page); | |
1da177e4 LT |
842 | |
843 | sc->nr_scanned++; | |
80e43426 | 844 | |
39b5f29a | 845 | if (unlikely(!page_evictable(page))) |
b291f000 | 846 | goto cull_mlocked; |
894bc310 | 847 | |
a6dc60f8 | 848 | if (!sc->may_unmap && page_mapped(page)) |
80e43426 CL |
849 | goto keep_locked; |
850 | ||
1da177e4 LT |
851 | /* Double the slab pressure for mapped and swapcache pages */ |
852 | if (page_mapped(page) || PageSwapCache(page)) | |
853 | sc->nr_scanned++; | |
854 | ||
c661b078 AW |
855 | may_enter_fs = (sc->gfp_mask & __GFP_FS) || |
856 | (PageSwapCache(page) && (sc->gfp_mask & __GFP_IO)); | |
857 | ||
e2be15f6 MG |
858 | /* |
859 | * The number of dirty pages determines if a zone is marked | |
860 | * reclaim_congested which affects wait_iff_congested. kswapd | |
861 | * will stall and start writing pages if the tail of the LRU | |
862 | * is all dirty unqueued pages. | |
863 | */ | |
864 | page_check_dirty_writeback(page, &dirty, &writeback); | |
865 | if (dirty || writeback) | |
866 | nr_dirty++; | |
867 | ||
868 | if (dirty && !writeback) | |
869 | nr_unqueued_dirty++; | |
870 | ||
d04e8acd MG |
871 | /* |
872 | * Treat this page as congested if the underlying BDI is or if | |
873 | * pages are cycling through the LRU so quickly that the | |
874 | * pages marked for immediate reclaim are making it to the | |
875 | * end of the LRU a second time. | |
876 | */ | |
e2be15f6 | 877 | mapping = page_mapping(page); |
d04e8acd MG |
878 | if ((mapping && bdi_write_congested(mapping->backing_dev_info)) || |
879 | (writeback && PageReclaim(page))) | |
e2be15f6 MG |
880 | nr_congested++; |
881 | ||
283aba9f MG |
882 | /* |
883 | * If a page at the tail of the LRU is under writeback, there | |
884 | * are three cases to consider. | |
885 | * | |
886 | * 1) If reclaim is encountering an excessive number of pages | |
887 | * under writeback and this page is both under writeback and | |
888 | * PageReclaim then it indicates that pages are being queued | |
889 | * for IO but are being recycled through the LRU before the | |
890 | * IO can complete. Waiting on the page itself risks an | |
891 | * indefinite stall if it is impossible to writeback the | |
892 | * page due to IO error or disconnected storage so instead | |
b1a6f21e MG |
893 | * note that the LRU is being scanned too quickly and the |
894 | * caller can stall after page list has been processed. | |
283aba9f MG |
895 | * |
896 | * 2) Global reclaim encounters a page, memcg encounters a | |
897 | * page that is not marked for immediate reclaim or | |
898 | * the caller does not have __GFP_IO. In this case mark | |
899 | * the page for immediate reclaim and continue scanning. | |
900 | * | |
901 | * __GFP_IO is checked because a loop driver thread might | |
902 | * enter reclaim, and deadlock if it waits on a page for | |
903 | * which it is needed to do the write (loop masks off | |
904 | * __GFP_IO|__GFP_FS for this reason); but more thought | |
905 | * would probably show more reasons. | |
906 | * | |
907 | * Don't require __GFP_FS, since we're not going into the | |
908 | * FS, just waiting on its writeback completion. Worryingly, | |
909 | * ext4 gfs2 and xfs allocate pages with | |
910 | * grab_cache_page_write_begin(,,AOP_FLAG_NOFS), so testing | |
911 | * may_enter_fs here is liable to OOM on them. | |
912 | * | |
913 | * 3) memcg encounters a page that is not already marked | |
914 | * PageReclaim. memcg does not have any dirty pages | |
915 | * throttling so we could easily OOM just because too many | |
916 | * pages are in writeback and there is nothing else to | |
917 | * reclaim. Wait for the writeback to complete. | |
918 | */ | |
c661b078 | 919 | if (PageWriteback(page)) { |
283aba9f MG |
920 | /* Case 1 above */ |
921 | if (current_is_kswapd() && | |
922 | PageReclaim(page) && | |
923 | zone_is_reclaim_writeback(zone)) { | |
b1a6f21e MG |
924 | nr_immediate++; |
925 | goto keep_locked; | |
283aba9f MG |
926 | |
927 | /* Case 2 above */ | |
928 | } else if (global_reclaim(sc) || | |
c3b94f44 HD |
929 | !PageReclaim(page) || !(sc->gfp_mask & __GFP_IO)) { |
930 | /* | |
931 | * This is slightly racy - end_page_writeback() | |
932 | * might have just cleared PageReclaim, then | |
933 | * setting PageReclaim here end up interpreted | |
934 | * as PageReadahead - but that does not matter | |
935 | * enough to care. What we do want is for this | |
936 | * page to have PageReclaim set next time memcg | |
937 | * reclaim reaches the tests above, so it will | |
938 | * then wait_on_page_writeback() to avoid OOM; | |
939 | * and it's also appropriate in global reclaim. | |
940 | */ | |
941 | SetPageReclaim(page); | |
e62e384e | 942 | nr_writeback++; |
283aba9f | 943 | |
c3b94f44 | 944 | goto keep_locked; |
283aba9f MG |
945 | |
946 | /* Case 3 above */ | |
947 | } else { | |
948 | wait_on_page_writeback(page); | |
e62e384e | 949 | } |
c661b078 | 950 | } |
1da177e4 | 951 | |
02c6de8d MK |
952 | if (!force_reclaim) |
953 | references = page_check_references(page, sc); | |
954 | ||
dfc8d636 JW |
955 | switch (references) { |
956 | case PAGEREF_ACTIVATE: | |
1da177e4 | 957 | goto activate_locked; |
64574746 JW |
958 | case PAGEREF_KEEP: |
959 | goto keep_locked; | |
dfc8d636 JW |
960 | case PAGEREF_RECLAIM: |
961 | case PAGEREF_RECLAIM_CLEAN: | |
962 | ; /* try to reclaim the page below */ | |
963 | } | |
1da177e4 | 964 | |
1da177e4 LT |
965 | /* |
966 | * Anonymous process memory has backing store? | |
967 | * Try to allocate it some swap space here. | |
968 | */ | |
b291f000 | 969 | if (PageAnon(page) && !PageSwapCache(page)) { |
63eb6b93 HD |
970 | if (!(sc->gfp_mask & __GFP_IO)) |
971 | goto keep_locked; | |
5bc7b8ac | 972 | if (!add_to_swap(page, page_list)) |
1da177e4 | 973 | goto activate_locked; |
63eb6b93 | 974 | may_enter_fs = 1; |
1da177e4 | 975 | |
e2be15f6 MG |
976 | /* Adding to swap updated mapping */ |
977 | mapping = page_mapping(page); | |
978 | } | |
1da177e4 LT |
979 | |
980 | /* | |
981 | * The page is mapped into the page tables of one or more | |
982 | * processes. Try to unmap it here. | |
983 | */ | |
984 | if (page_mapped(page) && mapping) { | |
02c6de8d | 985 | switch (try_to_unmap(page, ttu_flags)) { |
1da177e4 LT |
986 | case SWAP_FAIL: |
987 | goto activate_locked; | |
988 | case SWAP_AGAIN: | |
989 | goto keep_locked; | |
b291f000 NP |
990 | case SWAP_MLOCK: |
991 | goto cull_mlocked; | |
1da177e4 LT |
992 | case SWAP_SUCCESS: |
993 | ; /* try to free the page below */ | |
994 | } | |
995 | } | |
996 | ||
997 | if (PageDirty(page)) { | |
ee72886d MG |
998 | /* |
999 | * Only kswapd can writeback filesystem pages to | |
d43006d5 MG |
1000 | * avoid risk of stack overflow but only writeback |
1001 | * if many dirty pages have been encountered. | |
ee72886d | 1002 | */ |
f84f6e2b | 1003 | if (page_is_file_cache(page) && |
9e3b2f8c | 1004 | (!current_is_kswapd() || |
d43006d5 | 1005 | !zone_is_reclaim_dirty(zone))) { |
49ea7eb6 MG |
1006 | /* |
1007 | * Immediately reclaim when written back. | |
1008 | * Similar in principal to deactivate_page() | |
1009 | * except we already have the page isolated | |
1010 | * and know it's dirty | |
1011 | */ | |
1012 | inc_zone_page_state(page, NR_VMSCAN_IMMEDIATE); | |
1013 | SetPageReclaim(page); | |
1014 | ||
ee72886d MG |
1015 | goto keep_locked; |
1016 | } | |
1017 | ||
dfc8d636 | 1018 | if (references == PAGEREF_RECLAIM_CLEAN) |
1da177e4 | 1019 | goto keep_locked; |
4dd4b920 | 1020 | if (!may_enter_fs) |
1da177e4 | 1021 | goto keep_locked; |
52a8363e | 1022 | if (!sc->may_writepage) |
1da177e4 LT |
1023 | goto keep_locked; |
1024 | ||
1025 | /* Page is dirty, try to write it out here */ | |
7d3579e8 | 1026 | switch (pageout(page, mapping, sc)) { |
1da177e4 LT |
1027 | case PAGE_KEEP: |
1028 | goto keep_locked; | |
1029 | case PAGE_ACTIVATE: | |
1030 | goto activate_locked; | |
1031 | case PAGE_SUCCESS: | |
7d3579e8 | 1032 | if (PageWriteback(page)) |
41ac1999 | 1033 | goto keep; |
7d3579e8 | 1034 | if (PageDirty(page)) |
1da177e4 | 1035 | goto keep; |
7d3579e8 | 1036 | |
1da177e4 LT |
1037 | /* |
1038 | * A synchronous write - probably a ramdisk. Go | |
1039 | * ahead and try to reclaim the page. | |
1040 | */ | |
529ae9aa | 1041 | if (!trylock_page(page)) |
1da177e4 LT |
1042 | goto keep; |
1043 | if (PageDirty(page) || PageWriteback(page)) | |
1044 | goto keep_locked; | |
1045 | mapping = page_mapping(page); | |
1046 | case PAGE_CLEAN: | |
1047 | ; /* try to free the page below */ | |
1048 | } | |
1049 | } | |
1050 | ||
1051 | /* | |
1052 | * If the page has buffers, try to free the buffer mappings | |
1053 | * associated with this page. If we succeed we try to free | |
1054 | * the page as well. | |
1055 | * | |
1056 | * We do this even if the page is PageDirty(). | |
1057 | * try_to_release_page() does not perform I/O, but it is | |
1058 | * possible for a page to have PageDirty set, but it is actually | |
1059 | * clean (all its buffers are clean). This happens if the | |
1060 | * buffers were written out directly, with submit_bh(). ext3 | |
894bc310 | 1061 | * will do this, as well as the blockdev mapping. |
1da177e4 LT |
1062 | * try_to_release_page() will discover that cleanness and will |
1063 | * drop the buffers and mark the page clean - it can be freed. | |
1064 | * | |
1065 | * Rarely, pages can have buffers and no ->mapping. These are | |
1066 | * the pages which were not successfully invalidated in | |
1067 | * truncate_complete_page(). We try to drop those buffers here | |
1068 | * and if that worked, and the page is no longer mapped into | |
1069 | * process address space (page_count == 1) it can be freed. | |
1070 | * Otherwise, leave the page on the LRU so it is swappable. | |
1071 | */ | |
266cf658 | 1072 | if (page_has_private(page)) { |
1da177e4 LT |
1073 | if (!try_to_release_page(page, sc->gfp_mask)) |
1074 | goto activate_locked; | |
e286781d NP |
1075 | if (!mapping && page_count(page) == 1) { |
1076 | unlock_page(page); | |
1077 | if (put_page_testzero(page)) | |
1078 | goto free_it; | |
1079 | else { | |
1080 | /* | |
1081 | * rare race with speculative reference. | |
1082 | * the speculative reference will free | |
1083 | * this page shortly, so we may | |
1084 | * increment nr_reclaimed here (and | |
1085 | * leave it off the LRU). | |
1086 | */ | |
1087 | nr_reclaimed++; | |
1088 | continue; | |
1089 | } | |
1090 | } | |
1da177e4 LT |
1091 | } |
1092 | ||
a528910e | 1093 | if (!mapping || !__remove_mapping(mapping, page, true)) |
49d2e9cc | 1094 | goto keep_locked; |
1da177e4 | 1095 | |
a978d6f5 NP |
1096 | /* |
1097 | * At this point, we have no other references and there is | |
1098 | * no way to pick any more up (removed from LRU, removed | |
1099 | * from pagecache). Can use non-atomic bitops now (and | |
1100 | * we obviously don't have to worry about waking up a process | |
1101 | * waiting on the page lock, because there are no references. | |
1102 | */ | |
1103 | __clear_page_locked(page); | |
e286781d | 1104 | free_it: |
05ff5137 | 1105 | nr_reclaimed++; |
abe4c3b5 MG |
1106 | |
1107 | /* | |
1108 | * Is there need to periodically free_page_list? It would | |
1109 | * appear not as the counts should be low | |
1110 | */ | |
1111 | list_add(&page->lru, &free_pages); | |
1da177e4 LT |
1112 | continue; |
1113 | ||
b291f000 | 1114 | cull_mlocked: |
63d6c5ad HD |
1115 | if (PageSwapCache(page)) |
1116 | try_to_free_swap(page); | |
b291f000 NP |
1117 | unlock_page(page); |
1118 | putback_lru_page(page); | |
1119 | continue; | |
1120 | ||
1da177e4 | 1121 | activate_locked: |
68a22394 RR |
1122 | /* Not a candidate for swapping, so reclaim swap space. */ |
1123 | if (PageSwapCache(page) && vm_swap_full()) | |
a2c43eed | 1124 | try_to_free_swap(page); |
309381fe | 1125 | VM_BUG_ON_PAGE(PageActive(page), page); |
1da177e4 LT |
1126 | SetPageActive(page); |
1127 | pgactivate++; | |
1128 | keep_locked: | |
1129 | unlock_page(page); | |
1130 | keep: | |
1131 | list_add(&page->lru, &ret_pages); | |
309381fe | 1132 | VM_BUG_ON_PAGE(PageLRU(page) || PageUnevictable(page), page); |
1da177e4 | 1133 | } |
abe4c3b5 | 1134 | |
b745bc85 | 1135 | free_hot_cold_page_list(&free_pages, true); |
abe4c3b5 | 1136 | |
1da177e4 | 1137 | list_splice(&ret_pages, page_list); |
f8891e5e | 1138 | count_vm_events(PGACTIVATE, pgactivate); |
69980e31 | 1139 | mem_cgroup_uncharge_end(); |
8e950282 MG |
1140 | *ret_nr_dirty += nr_dirty; |
1141 | *ret_nr_congested += nr_congested; | |
d43006d5 | 1142 | *ret_nr_unqueued_dirty += nr_unqueued_dirty; |
92df3a72 | 1143 | *ret_nr_writeback += nr_writeback; |
b1a6f21e | 1144 | *ret_nr_immediate += nr_immediate; |
05ff5137 | 1145 | return nr_reclaimed; |
1da177e4 LT |
1146 | } |
1147 | ||
02c6de8d MK |
1148 | unsigned long reclaim_clean_pages_from_list(struct zone *zone, |
1149 | struct list_head *page_list) | |
1150 | { | |
1151 | struct scan_control sc = { | |
1152 | .gfp_mask = GFP_KERNEL, | |
1153 | .priority = DEF_PRIORITY, | |
1154 | .may_unmap = 1, | |
1155 | }; | |
8e950282 | 1156 | unsigned long ret, dummy1, dummy2, dummy3, dummy4, dummy5; |
02c6de8d MK |
1157 | struct page *page, *next; |
1158 | LIST_HEAD(clean_pages); | |
1159 | ||
1160 | list_for_each_entry_safe(page, next, page_list, lru) { | |
117aad1e RA |
1161 | if (page_is_file_cache(page) && !PageDirty(page) && |
1162 | !isolated_balloon_page(page)) { | |
02c6de8d MK |
1163 | ClearPageActive(page); |
1164 | list_move(&page->lru, &clean_pages); | |
1165 | } | |
1166 | } | |
1167 | ||
1168 | ret = shrink_page_list(&clean_pages, zone, &sc, | |
8e950282 MG |
1169 | TTU_UNMAP|TTU_IGNORE_ACCESS, |
1170 | &dummy1, &dummy2, &dummy3, &dummy4, &dummy5, true); | |
02c6de8d | 1171 | list_splice(&clean_pages, page_list); |
83da7510 | 1172 | mod_zone_page_state(zone, NR_ISOLATED_FILE, -ret); |
02c6de8d MK |
1173 | return ret; |
1174 | } | |
1175 | ||
5ad333eb AW |
1176 | /* |
1177 | * Attempt to remove the specified page from its LRU. Only take this page | |
1178 | * if it is of the appropriate PageActive status. Pages which are being | |
1179 | * freed elsewhere are also ignored. | |
1180 | * | |
1181 | * page: page to consider | |
1182 | * mode: one of the LRU isolation modes defined above | |
1183 | * | |
1184 | * returns 0 on success, -ve errno on failure. | |
1185 | */ | |
f3fd4a61 | 1186 | int __isolate_lru_page(struct page *page, isolate_mode_t mode) |
5ad333eb AW |
1187 | { |
1188 | int ret = -EINVAL; | |
1189 | ||
1190 | /* Only take pages on the LRU. */ | |
1191 | if (!PageLRU(page)) | |
1192 | return ret; | |
1193 | ||
e46a2879 MK |
1194 | /* Compaction should not handle unevictable pages but CMA can do so */ |
1195 | if (PageUnevictable(page) && !(mode & ISOLATE_UNEVICTABLE)) | |
894bc310 LS |
1196 | return ret; |
1197 | ||
5ad333eb | 1198 | ret = -EBUSY; |
08e552c6 | 1199 | |
c8244935 MG |
1200 | /* |
1201 | * To minimise LRU disruption, the caller can indicate that it only | |
1202 | * wants to isolate pages it will be able to operate on without | |
1203 | * blocking - clean pages for the most part. | |
1204 | * | |
1205 | * ISOLATE_CLEAN means that only clean pages should be isolated. This | |
1206 | * is used by reclaim when it is cannot write to backing storage | |
1207 | * | |
1208 | * ISOLATE_ASYNC_MIGRATE is used to indicate that it only wants to pages | |
1209 | * that it is possible to migrate without blocking | |
1210 | */ | |
1211 | if (mode & (ISOLATE_CLEAN|ISOLATE_ASYNC_MIGRATE)) { | |
1212 | /* All the caller can do on PageWriteback is block */ | |
1213 | if (PageWriteback(page)) | |
1214 | return ret; | |
1215 | ||
1216 | if (PageDirty(page)) { | |
1217 | struct address_space *mapping; | |
1218 | ||
1219 | /* ISOLATE_CLEAN means only clean pages */ | |
1220 | if (mode & ISOLATE_CLEAN) | |
1221 | return ret; | |
1222 | ||
1223 | /* | |
1224 | * Only pages without mappings or that have a | |
1225 | * ->migratepage callback are possible to migrate | |
1226 | * without blocking | |
1227 | */ | |
1228 | mapping = page_mapping(page); | |
1229 | if (mapping && !mapping->a_ops->migratepage) | |
1230 | return ret; | |
1231 | } | |
1232 | } | |
39deaf85 | 1233 | |
f80c0673 MK |
1234 | if ((mode & ISOLATE_UNMAPPED) && page_mapped(page)) |
1235 | return ret; | |
1236 | ||
5ad333eb AW |
1237 | if (likely(get_page_unless_zero(page))) { |
1238 | /* | |
1239 | * Be careful not to clear PageLRU until after we're | |
1240 | * sure the page is not being freed elsewhere -- the | |
1241 | * page release code relies on it. | |
1242 | */ | |
1243 | ClearPageLRU(page); | |
1244 | ret = 0; | |
1245 | } | |
1246 | ||
1247 | return ret; | |
1248 | } | |
1249 | ||
1da177e4 LT |
1250 | /* |
1251 | * zone->lru_lock is heavily contended. Some of the functions that | |
1252 | * shrink the lists perform better by taking out a batch of pages | |
1253 | * and working on them outside the LRU lock. | |
1254 | * | |
1255 | * For pagecache intensive workloads, this function is the hottest | |
1256 | * spot in the kernel (apart from copy_*_user functions). | |
1257 | * | |
1258 | * Appropriate locks must be held before calling this function. | |
1259 | * | |
1260 | * @nr_to_scan: The number of pages to look through on the list. | |
5dc35979 | 1261 | * @lruvec: The LRU vector to pull pages from. |
1da177e4 | 1262 | * @dst: The temp list to put pages on to. |
f626012d | 1263 | * @nr_scanned: The number of pages that were scanned. |
fe2c2a10 | 1264 | * @sc: The scan_control struct for this reclaim session |
5ad333eb | 1265 | * @mode: One of the LRU isolation modes |
3cb99451 | 1266 | * @lru: LRU list id for isolating |
1da177e4 LT |
1267 | * |
1268 | * returns how many pages were moved onto *@dst. | |
1269 | */ | |
69e05944 | 1270 | static unsigned long isolate_lru_pages(unsigned long nr_to_scan, |
5dc35979 | 1271 | struct lruvec *lruvec, struct list_head *dst, |
fe2c2a10 | 1272 | unsigned long *nr_scanned, struct scan_control *sc, |
3cb99451 | 1273 | isolate_mode_t mode, enum lru_list lru) |
1da177e4 | 1274 | { |
75b00af7 | 1275 | struct list_head *src = &lruvec->lists[lru]; |
69e05944 | 1276 | unsigned long nr_taken = 0; |
c9b02d97 | 1277 | unsigned long scan; |
1da177e4 | 1278 | |
c9b02d97 | 1279 | for (scan = 0; scan < nr_to_scan && !list_empty(src); scan++) { |
5ad333eb | 1280 | struct page *page; |
fa9add64 | 1281 | int nr_pages; |
5ad333eb | 1282 | |
1da177e4 LT |
1283 | page = lru_to_page(src); |
1284 | prefetchw_prev_lru_page(page, src, flags); | |
1285 | ||
309381fe | 1286 | VM_BUG_ON_PAGE(!PageLRU(page), page); |
8d438f96 | 1287 | |
f3fd4a61 | 1288 | switch (__isolate_lru_page(page, mode)) { |
5ad333eb | 1289 | case 0: |
fa9add64 HD |
1290 | nr_pages = hpage_nr_pages(page); |
1291 | mem_cgroup_update_lru_size(lruvec, lru, -nr_pages); | |
5ad333eb | 1292 | list_move(&page->lru, dst); |
fa9add64 | 1293 | nr_taken += nr_pages; |
5ad333eb AW |
1294 | break; |
1295 | ||
1296 | case -EBUSY: | |
1297 | /* else it is being freed elsewhere */ | |
1298 | list_move(&page->lru, src); | |
1299 | continue; | |
46453a6e | 1300 | |
5ad333eb AW |
1301 | default: |
1302 | BUG(); | |
1303 | } | |
1da177e4 LT |
1304 | } |
1305 | ||
f626012d | 1306 | *nr_scanned = scan; |
75b00af7 HD |
1307 | trace_mm_vmscan_lru_isolate(sc->order, nr_to_scan, scan, |
1308 | nr_taken, mode, is_file_lru(lru)); | |
1da177e4 LT |
1309 | return nr_taken; |
1310 | } | |
1311 | ||
62695a84 NP |
1312 | /** |
1313 | * isolate_lru_page - tries to isolate a page from its LRU list | |
1314 | * @page: page to isolate from its LRU list | |
1315 | * | |
1316 | * Isolates a @page from an LRU list, clears PageLRU and adjusts the | |
1317 | * vmstat statistic corresponding to whatever LRU list the page was on. | |
1318 | * | |
1319 | * Returns 0 if the page was removed from an LRU list. | |
1320 | * Returns -EBUSY if the page was not on an LRU list. | |
1321 | * | |
1322 | * The returned page will have PageLRU() cleared. If it was found on | |
894bc310 LS |
1323 | * the active list, it will have PageActive set. If it was found on |
1324 | * the unevictable list, it will have the PageUnevictable bit set. That flag | |
1325 | * may need to be cleared by the caller before letting the page go. | |
62695a84 NP |
1326 | * |
1327 | * The vmstat statistic corresponding to the list on which the page was | |
1328 | * found will be decremented. | |
1329 | * | |
1330 | * Restrictions: | |
1331 | * (1) Must be called with an elevated refcount on the page. This is a | |
1332 | * fundamentnal difference from isolate_lru_pages (which is called | |
1333 | * without a stable reference). | |
1334 | * (2) the lru_lock must not be held. | |
1335 | * (3) interrupts must be enabled. | |
1336 | */ | |
1337 | int isolate_lru_page(struct page *page) | |
1338 | { | |
1339 | int ret = -EBUSY; | |
1340 | ||
309381fe | 1341 | VM_BUG_ON_PAGE(!page_count(page), page); |
0c917313 | 1342 | |
62695a84 NP |
1343 | if (PageLRU(page)) { |
1344 | struct zone *zone = page_zone(page); | |
fa9add64 | 1345 | struct lruvec *lruvec; |
62695a84 NP |
1346 | |
1347 | spin_lock_irq(&zone->lru_lock); | |
fa9add64 | 1348 | lruvec = mem_cgroup_page_lruvec(page, zone); |
0c917313 | 1349 | if (PageLRU(page)) { |
894bc310 | 1350 | int lru = page_lru(page); |
0c917313 | 1351 | get_page(page); |
62695a84 | 1352 | ClearPageLRU(page); |
fa9add64 HD |
1353 | del_page_from_lru_list(page, lruvec, lru); |
1354 | ret = 0; | |
62695a84 NP |
1355 | } |
1356 | spin_unlock_irq(&zone->lru_lock); | |
1357 | } | |
1358 | return ret; | |
1359 | } | |
1360 | ||
35cd7815 | 1361 | /* |
d37dd5dc FW |
1362 | * A direct reclaimer may isolate SWAP_CLUSTER_MAX pages from the LRU list and |
1363 | * then get resheduled. When there are massive number of tasks doing page | |
1364 | * allocation, such sleeping direct reclaimers may keep piling up on each CPU, | |
1365 | * the LRU list will go small and be scanned faster than necessary, leading to | |
1366 | * unnecessary swapping, thrashing and OOM. | |
35cd7815 RR |
1367 | */ |
1368 | static int too_many_isolated(struct zone *zone, int file, | |
1369 | struct scan_control *sc) | |
1370 | { | |
1371 | unsigned long inactive, isolated; | |
1372 | ||
1373 | if (current_is_kswapd()) | |
1374 | return 0; | |
1375 | ||
89b5fae5 | 1376 | if (!global_reclaim(sc)) |
35cd7815 RR |
1377 | return 0; |
1378 | ||
1379 | if (file) { | |
1380 | inactive = zone_page_state(zone, NR_INACTIVE_FILE); | |
1381 | isolated = zone_page_state(zone, NR_ISOLATED_FILE); | |
1382 | } else { | |
1383 | inactive = zone_page_state(zone, NR_INACTIVE_ANON); | |
1384 | isolated = zone_page_state(zone, NR_ISOLATED_ANON); | |
1385 | } | |
1386 | ||
3cf23841 FW |
1387 | /* |
1388 | * GFP_NOIO/GFP_NOFS callers are allowed to isolate more pages, so they | |
1389 | * won't get blocked by normal direct-reclaimers, forming a circular | |
1390 | * deadlock. | |
1391 | */ | |
1392 | if ((sc->gfp_mask & GFP_IOFS) == GFP_IOFS) | |
1393 | inactive >>= 3; | |
1394 | ||
35cd7815 RR |
1395 | return isolated > inactive; |
1396 | } | |
1397 | ||
66635629 | 1398 | static noinline_for_stack void |
75b00af7 | 1399 | putback_inactive_pages(struct lruvec *lruvec, struct list_head *page_list) |
66635629 | 1400 | { |
27ac81d8 KK |
1401 | struct zone_reclaim_stat *reclaim_stat = &lruvec->reclaim_stat; |
1402 | struct zone *zone = lruvec_zone(lruvec); | |
3f79768f | 1403 | LIST_HEAD(pages_to_free); |
66635629 | 1404 | |
66635629 MG |
1405 | /* |
1406 | * Put back any unfreeable pages. | |
1407 | */ | |
66635629 | 1408 | while (!list_empty(page_list)) { |
3f79768f | 1409 | struct page *page = lru_to_page(page_list); |
66635629 | 1410 | int lru; |
3f79768f | 1411 | |
309381fe | 1412 | VM_BUG_ON_PAGE(PageLRU(page), page); |
66635629 | 1413 | list_del(&page->lru); |
39b5f29a | 1414 | if (unlikely(!page_evictable(page))) { |
66635629 MG |
1415 | spin_unlock_irq(&zone->lru_lock); |
1416 | putback_lru_page(page); | |
1417 | spin_lock_irq(&zone->lru_lock); | |
1418 | continue; | |
1419 | } | |
fa9add64 HD |
1420 | |
1421 | lruvec = mem_cgroup_page_lruvec(page, zone); | |
1422 | ||
7a608572 | 1423 | SetPageLRU(page); |
66635629 | 1424 | lru = page_lru(page); |
fa9add64 HD |
1425 | add_page_to_lru_list(page, lruvec, lru); |
1426 | ||
66635629 MG |
1427 | if (is_active_lru(lru)) { |
1428 | int file = is_file_lru(lru); | |
9992af10 RR |
1429 | int numpages = hpage_nr_pages(page); |
1430 | reclaim_stat->recent_rotated[file] += numpages; | |
66635629 | 1431 | } |
2bcf8879 HD |
1432 | if (put_page_testzero(page)) { |
1433 | __ClearPageLRU(page); | |
1434 | __ClearPageActive(page); | |
fa9add64 | 1435 | del_page_from_lru_list(page, lruvec, lru); |
2bcf8879 HD |
1436 | |
1437 | if (unlikely(PageCompound(page))) { | |
1438 | spin_unlock_irq(&zone->lru_lock); | |
1439 | (*get_compound_page_dtor(page))(page); | |
1440 | spin_lock_irq(&zone->lru_lock); | |
1441 | } else | |
1442 | list_add(&page->lru, &pages_to_free); | |
66635629 MG |
1443 | } |
1444 | } | |
66635629 | 1445 | |
3f79768f HD |
1446 | /* |
1447 | * To save our caller's stack, now use input list for pages to free. | |
1448 | */ | |
1449 | list_splice(&pages_to_free, page_list); | |
66635629 MG |
1450 | } |
1451 | ||
399ba0b9 N |
1452 | /* |
1453 | * If a kernel thread (such as nfsd for loop-back mounts) services | |
1454 | * a backing device by writing to the page cache it sets PF_LESS_THROTTLE. | |
1455 | * In that case we should only throttle if the backing device it is | |
1456 | * writing to is congested. In other cases it is safe to throttle. | |
1457 | */ | |
1458 | static int current_may_throttle(void) | |
1459 | { | |
1460 | return !(current->flags & PF_LESS_THROTTLE) || | |
1461 | current->backing_dev_info == NULL || | |
1462 | bdi_write_congested(current->backing_dev_info); | |
1463 | } | |
1464 | ||
1da177e4 | 1465 | /* |
1742f19f AM |
1466 | * shrink_inactive_list() is a helper for shrink_zone(). It returns the number |
1467 | * of reclaimed pages | |
1da177e4 | 1468 | */ |
66635629 | 1469 | static noinline_for_stack unsigned long |
1a93be0e | 1470 | shrink_inactive_list(unsigned long nr_to_scan, struct lruvec *lruvec, |
9e3b2f8c | 1471 | struct scan_control *sc, enum lru_list lru) |
1da177e4 LT |
1472 | { |
1473 | LIST_HEAD(page_list); | |
e247dbce | 1474 | unsigned long nr_scanned; |
05ff5137 | 1475 | unsigned long nr_reclaimed = 0; |
e247dbce | 1476 | unsigned long nr_taken; |
8e950282 MG |
1477 | unsigned long nr_dirty = 0; |
1478 | unsigned long nr_congested = 0; | |
e2be15f6 | 1479 | unsigned long nr_unqueued_dirty = 0; |
92df3a72 | 1480 | unsigned long nr_writeback = 0; |
b1a6f21e | 1481 | unsigned long nr_immediate = 0; |
f3fd4a61 | 1482 | isolate_mode_t isolate_mode = 0; |
3cb99451 | 1483 | int file = is_file_lru(lru); |
1a93be0e KK |
1484 | struct zone *zone = lruvec_zone(lruvec); |
1485 | struct zone_reclaim_stat *reclaim_stat = &lruvec->reclaim_stat; | |
78dc583d | 1486 | |
35cd7815 | 1487 | while (unlikely(too_many_isolated(zone, file, sc))) { |
58355c78 | 1488 | congestion_wait(BLK_RW_ASYNC, HZ/10); |
35cd7815 RR |
1489 | |
1490 | /* We are about to die and free our memory. Return now. */ | |
1491 | if (fatal_signal_pending(current)) | |
1492 | return SWAP_CLUSTER_MAX; | |
1493 | } | |
1494 | ||
1da177e4 | 1495 | lru_add_drain(); |
f80c0673 MK |
1496 | |
1497 | if (!sc->may_unmap) | |
61317289 | 1498 | isolate_mode |= ISOLATE_UNMAPPED; |
f80c0673 | 1499 | if (!sc->may_writepage) |
61317289 | 1500 | isolate_mode |= ISOLATE_CLEAN; |
f80c0673 | 1501 | |
1da177e4 | 1502 | spin_lock_irq(&zone->lru_lock); |
b35ea17b | 1503 | |
5dc35979 KK |
1504 | nr_taken = isolate_lru_pages(nr_to_scan, lruvec, &page_list, |
1505 | &nr_scanned, sc, isolate_mode, lru); | |
95d918fc KK |
1506 | |
1507 | __mod_zone_page_state(zone, NR_LRU_BASE + lru, -nr_taken); | |
1508 | __mod_zone_page_state(zone, NR_ISOLATED_ANON + file, nr_taken); | |
1509 | ||
89b5fae5 | 1510 | if (global_reclaim(sc)) { |
e247dbce KM |
1511 | zone->pages_scanned += nr_scanned; |
1512 | if (current_is_kswapd()) | |
75b00af7 | 1513 | __count_zone_vm_events(PGSCAN_KSWAPD, zone, nr_scanned); |
e247dbce | 1514 | else |
75b00af7 | 1515 | __count_zone_vm_events(PGSCAN_DIRECT, zone, nr_scanned); |
e247dbce | 1516 | } |
d563c050 | 1517 | spin_unlock_irq(&zone->lru_lock); |
b35ea17b | 1518 | |
d563c050 | 1519 | if (nr_taken == 0) |
66635629 | 1520 | return 0; |
5ad333eb | 1521 | |
02c6de8d | 1522 | nr_reclaimed = shrink_page_list(&page_list, zone, sc, TTU_UNMAP, |
8e950282 MG |
1523 | &nr_dirty, &nr_unqueued_dirty, &nr_congested, |
1524 | &nr_writeback, &nr_immediate, | |
1525 | false); | |
c661b078 | 1526 | |
3f79768f HD |
1527 | spin_lock_irq(&zone->lru_lock); |
1528 | ||
95d918fc | 1529 | reclaim_stat->recent_scanned[file] += nr_taken; |
d563c050 | 1530 | |
904249aa YH |
1531 | if (global_reclaim(sc)) { |
1532 | if (current_is_kswapd()) | |
1533 | __count_zone_vm_events(PGSTEAL_KSWAPD, zone, | |
1534 | nr_reclaimed); | |
1535 | else | |
1536 | __count_zone_vm_events(PGSTEAL_DIRECT, zone, | |
1537 | nr_reclaimed); | |
1538 | } | |
a74609fa | 1539 | |
27ac81d8 | 1540 | putback_inactive_pages(lruvec, &page_list); |
3f79768f | 1541 | |
95d918fc | 1542 | __mod_zone_page_state(zone, NR_ISOLATED_ANON + file, -nr_taken); |
3f79768f HD |
1543 | |
1544 | spin_unlock_irq(&zone->lru_lock); | |
1545 | ||
b745bc85 | 1546 | free_hot_cold_page_list(&page_list, true); |
e11da5b4 | 1547 | |
92df3a72 MG |
1548 | /* |
1549 | * If reclaim is isolating dirty pages under writeback, it implies | |
1550 | * that the long-lived page allocation rate is exceeding the page | |
1551 | * laundering rate. Either the global limits are not being effective | |
1552 | * at throttling processes due to the page distribution throughout | |
1553 | * zones or there is heavy usage of a slow backing device. The | |
1554 | * only option is to throttle from reclaim context which is not ideal | |
1555 | * as there is no guarantee the dirtying process is throttled in the | |
1556 | * same way balance_dirty_pages() manages. | |
1557 | * | |
8e950282 MG |
1558 | * Once a zone is flagged ZONE_WRITEBACK, kswapd will count the number |
1559 | * of pages under pages flagged for immediate reclaim and stall if any | |
1560 | * are encountered in the nr_immediate check below. | |
92df3a72 | 1561 | */ |
918fc718 | 1562 | if (nr_writeback && nr_writeback == nr_taken) |
283aba9f | 1563 | zone_set_flag(zone, ZONE_WRITEBACK); |
92df3a72 | 1564 | |
d43006d5 | 1565 | /* |
b1a6f21e MG |
1566 | * memcg will stall in page writeback so only consider forcibly |
1567 | * stalling for global reclaim | |
d43006d5 | 1568 | */ |
b1a6f21e | 1569 | if (global_reclaim(sc)) { |
8e950282 MG |
1570 | /* |
1571 | * Tag a zone as congested if all the dirty pages scanned were | |
1572 | * backed by a congested BDI and wait_iff_congested will stall. | |
1573 | */ | |
1574 | if (nr_dirty && nr_dirty == nr_congested) | |
1575 | zone_set_flag(zone, ZONE_CONGESTED); | |
1576 | ||
b1a6f21e MG |
1577 | /* |
1578 | * If dirty pages are scanned that are not queued for IO, it | |
1579 | * implies that flushers are not keeping up. In this case, flag | |
1580 | * the zone ZONE_TAIL_LRU_DIRTY and kswapd will start writing | |
b738d764 | 1581 | * pages from reclaim context. |
b1a6f21e MG |
1582 | */ |
1583 | if (nr_unqueued_dirty == nr_taken) | |
1584 | zone_set_flag(zone, ZONE_TAIL_LRU_DIRTY); | |
1585 | ||
1586 | /* | |
b738d764 LT |
1587 | * If kswapd scans pages marked marked for immediate |
1588 | * reclaim and under writeback (nr_immediate), it implies | |
1589 | * that pages are cycling through the LRU faster than | |
b1a6f21e MG |
1590 | * they are written so also forcibly stall. |
1591 | */ | |
b738d764 | 1592 | if (nr_immediate && current_may_throttle()) |
b1a6f21e | 1593 | congestion_wait(BLK_RW_ASYNC, HZ/10); |
e2be15f6 | 1594 | } |
d43006d5 | 1595 | |
8e950282 MG |
1596 | /* |
1597 | * Stall direct reclaim for IO completions if underlying BDIs or zone | |
1598 | * is congested. Allow kswapd to continue until it starts encountering | |
1599 | * unqueued dirty pages or cycling through the LRU too quickly. | |
1600 | */ | |
399ba0b9 N |
1601 | if (!sc->hibernation_mode && !current_is_kswapd() && |
1602 | current_may_throttle()) | |
8e950282 MG |
1603 | wait_iff_congested(zone, BLK_RW_ASYNC, HZ/10); |
1604 | ||
e11da5b4 MG |
1605 | trace_mm_vmscan_lru_shrink_inactive(zone->zone_pgdat->node_id, |
1606 | zone_idx(zone), | |
1607 | nr_scanned, nr_reclaimed, | |
9e3b2f8c | 1608 | sc->priority, |
23b9da55 | 1609 | trace_shrink_flags(file)); |
05ff5137 | 1610 | return nr_reclaimed; |
1da177e4 LT |
1611 | } |
1612 | ||
1613 | /* | |
1614 | * This moves pages from the active list to the inactive list. | |
1615 | * | |
1616 | * We move them the other way if the page is referenced by one or more | |
1617 | * processes, from rmap. | |
1618 | * | |
1619 | * If the pages are mostly unmapped, the processing is fast and it is | |
1620 | * appropriate to hold zone->lru_lock across the whole operation. But if | |
1621 | * the pages are mapped, the processing is slow (page_referenced()) so we | |
1622 | * should drop zone->lru_lock around each page. It's impossible to balance | |
1623 | * this, so instead we remove the pages from the LRU while processing them. | |
1624 | * It is safe to rely on PG_active against the non-LRU pages in here because | |
1625 | * nobody will play with that bit on a non-LRU page. | |
1626 | * | |
1627 | * The downside is that we have to touch page->_count against each page. | |
1628 | * But we had to alter page->flags anyway. | |
1629 | */ | |
1cfb419b | 1630 | |
fa9add64 | 1631 | static void move_active_pages_to_lru(struct lruvec *lruvec, |
3eb4140f | 1632 | struct list_head *list, |
2bcf8879 | 1633 | struct list_head *pages_to_free, |
3eb4140f WF |
1634 | enum lru_list lru) |
1635 | { | |
fa9add64 | 1636 | struct zone *zone = lruvec_zone(lruvec); |
3eb4140f | 1637 | unsigned long pgmoved = 0; |
3eb4140f | 1638 | struct page *page; |
fa9add64 | 1639 | int nr_pages; |
3eb4140f | 1640 | |
3eb4140f WF |
1641 | while (!list_empty(list)) { |
1642 | page = lru_to_page(list); | |
fa9add64 | 1643 | lruvec = mem_cgroup_page_lruvec(page, zone); |
3eb4140f | 1644 | |
309381fe | 1645 | VM_BUG_ON_PAGE(PageLRU(page), page); |
3eb4140f WF |
1646 | SetPageLRU(page); |
1647 | ||
fa9add64 HD |
1648 | nr_pages = hpage_nr_pages(page); |
1649 | mem_cgroup_update_lru_size(lruvec, lru, nr_pages); | |
925b7673 | 1650 | list_move(&page->lru, &lruvec->lists[lru]); |
fa9add64 | 1651 | pgmoved += nr_pages; |
3eb4140f | 1652 | |
2bcf8879 HD |
1653 | if (put_page_testzero(page)) { |
1654 | __ClearPageLRU(page); | |
1655 | __ClearPageActive(page); | |
fa9add64 | 1656 | del_page_from_lru_list(page, lruvec, lru); |
2bcf8879 HD |
1657 | |
1658 | if (unlikely(PageCompound(page))) { | |
1659 | spin_unlock_irq(&zone->lru_lock); | |
1660 | (*get_compound_page_dtor(page))(page); | |
1661 | spin_lock_irq(&zone->lru_lock); | |
1662 | } else | |
1663 | list_add(&page->lru, pages_to_free); | |
3eb4140f WF |
1664 | } |
1665 | } | |
1666 | __mod_zone_page_state(zone, NR_LRU_BASE + lru, pgmoved); | |
1667 | if (!is_active_lru(lru)) | |
1668 | __count_vm_events(PGDEACTIVATE, pgmoved); | |
1669 | } | |
1cfb419b | 1670 | |
f626012d | 1671 | static void shrink_active_list(unsigned long nr_to_scan, |
1a93be0e | 1672 | struct lruvec *lruvec, |
f16015fb | 1673 | struct scan_control *sc, |
9e3b2f8c | 1674 | enum lru_list lru) |
1da177e4 | 1675 | { |
44c241f1 | 1676 | unsigned long nr_taken; |
f626012d | 1677 | unsigned long nr_scanned; |
6fe6b7e3 | 1678 | unsigned long vm_flags; |
1da177e4 | 1679 | LIST_HEAD(l_hold); /* The pages which were snipped off */ |
8cab4754 | 1680 | LIST_HEAD(l_active); |
b69408e8 | 1681 | LIST_HEAD(l_inactive); |
1da177e4 | 1682 | struct page *page; |
1a93be0e | 1683 | struct zone_reclaim_stat *reclaim_stat = &lruvec->reclaim_stat; |
44c241f1 | 1684 | unsigned long nr_rotated = 0; |
f3fd4a61 | 1685 | isolate_mode_t isolate_mode = 0; |
3cb99451 | 1686 | int file = is_file_lru(lru); |
1a93be0e | 1687 | struct zone *zone = lruvec_zone(lruvec); |
1da177e4 LT |
1688 | |
1689 | lru_add_drain(); | |
f80c0673 MK |
1690 | |
1691 | if (!sc->may_unmap) | |
61317289 | 1692 | isolate_mode |= ISOLATE_UNMAPPED; |
f80c0673 | 1693 | if (!sc->may_writepage) |
61317289 | 1694 | isolate_mode |= ISOLATE_CLEAN; |
f80c0673 | 1695 | |
1da177e4 | 1696 | spin_lock_irq(&zone->lru_lock); |
925b7673 | 1697 | |
5dc35979 KK |
1698 | nr_taken = isolate_lru_pages(nr_to_scan, lruvec, &l_hold, |
1699 | &nr_scanned, sc, isolate_mode, lru); | |
89b5fae5 | 1700 | if (global_reclaim(sc)) |
f626012d | 1701 | zone->pages_scanned += nr_scanned; |
89b5fae5 | 1702 | |
b7c46d15 | 1703 | reclaim_stat->recent_scanned[file] += nr_taken; |
1cfb419b | 1704 | |
f626012d | 1705 | __count_zone_vm_events(PGREFILL, zone, nr_scanned); |
3cb99451 | 1706 | __mod_zone_page_state(zone, NR_LRU_BASE + lru, -nr_taken); |
a731286d | 1707 | __mod_zone_page_state(zone, NR_ISOLATED_ANON + file, nr_taken); |
1da177e4 LT |
1708 | spin_unlock_irq(&zone->lru_lock); |
1709 | ||
1da177e4 LT |
1710 | while (!list_empty(&l_hold)) { |
1711 | cond_resched(); | |
1712 | page = lru_to_page(&l_hold); | |
1713 | list_del(&page->lru); | |
7e9cd484 | 1714 | |
39b5f29a | 1715 | if (unlikely(!page_evictable(page))) { |
894bc310 LS |
1716 | putback_lru_page(page); |
1717 | continue; | |
1718 | } | |
1719 | ||
cc715d99 MG |
1720 | if (unlikely(buffer_heads_over_limit)) { |
1721 | if (page_has_private(page) && trylock_page(page)) { | |
1722 | if (page_has_private(page)) | |
1723 | try_to_release_page(page, 0); | |
1724 | unlock_page(page); | |
1725 | } | |
1726 | } | |
1727 | ||
c3ac9a8a JW |
1728 | if (page_referenced(page, 0, sc->target_mem_cgroup, |
1729 | &vm_flags)) { | |
9992af10 | 1730 | nr_rotated += hpage_nr_pages(page); |
8cab4754 WF |
1731 | /* |
1732 | * Identify referenced, file-backed active pages and | |
1733 | * give them one more trip around the active list. So | |
1734 | * that executable code get better chances to stay in | |
1735 | * memory under moderate memory pressure. Anon pages | |
1736 | * are not likely to be evicted by use-once streaming | |
1737 | * IO, plus JVM can create lots of anon VM_EXEC pages, | |
1738 | * so we ignore them here. | |
1739 | */ | |
41e20983 | 1740 | if ((vm_flags & VM_EXEC) && page_is_file_cache(page)) { |
8cab4754 WF |
1741 | list_add(&page->lru, &l_active); |
1742 | continue; | |
1743 | } | |
1744 | } | |
7e9cd484 | 1745 | |
5205e56e | 1746 | ClearPageActive(page); /* we are de-activating */ |
1da177e4 LT |
1747 | list_add(&page->lru, &l_inactive); |
1748 | } | |
1749 | ||
b555749a | 1750 | /* |
8cab4754 | 1751 | * Move pages back to the lru list. |
b555749a | 1752 | */ |
2a1dc509 | 1753 | spin_lock_irq(&zone->lru_lock); |
556adecb | 1754 | /* |
8cab4754 WF |
1755 | * Count referenced pages from currently used mappings as rotated, |
1756 | * even though only some of them are actually re-activated. This | |
1757 | * helps balance scan pressure between file and anonymous pages in | |
1758 | * get_scan_ratio. | |
7e9cd484 | 1759 | */ |
b7c46d15 | 1760 | reclaim_stat->recent_rotated[file] += nr_rotated; |
556adecb | 1761 | |
fa9add64 HD |
1762 | move_active_pages_to_lru(lruvec, &l_active, &l_hold, lru); |
1763 | move_active_pages_to_lru(lruvec, &l_inactive, &l_hold, lru - LRU_ACTIVE); | |
a731286d | 1764 | __mod_zone_page_state(zone, NR_ISOLATED_ANON + file, -nr_taken); |
f8891e5e | 1765 | spin_unlock_irq(&zone->lru_lock); |
2bcf8879 | 1766 | |
b745bc85 | 1767 | free_hot_cold_page_list(&l_hold, true); |
1da177e4 LT |
1768 | } |
1769 | ||
74e3f3c3 | 1770 | #ifdef CONFIG_SWAP |
14797e23 | 1771 | static int inactive_anon_is_low_global(struct zone *zone) |
f89eb90e KM |
1772 | { |
1773 | unsigned long active, inactive; | |
1774 | ||
1775 | active = zone_page_state(zone, NR_ACTIVE_ANON); | |
1776 | inactive = zone_page_state(zone, NR_INACTIVE_ANON); | |
1777 | ||
1778 | if (inactive * zone->inactive_ratio < active) | |
1779 | return 1; | |
1780 | ||
1781 | return 0; | |
1782 | } | |
1783 | ||
14797e23 KM |
1784 | /** |
1785 | * inactive_anon_is_low - check if anonymous pages need to be deactivated | |
c56d5c7d | 1786 | * @lruvec: LRU vector to check |
14797e23 KM |
1787 | * |
1788 | * Returns true if the zone does not have enough inactive anon pages, | |
1789 | * meaning some active anon pages need to be deactivated. | |
1790 | */ | |
c56d5c7d | 1791 | static int inactive_anon_is_low(struct lruvec *lruvec) |
14797e23 | 1792 | { |
74e3f3c3 MK |
1793 | /* |
1794 | * If we don't have swap space, anonymous page deactivation | |
1795 | * is pointless. | |
1796 | */ | |
1797 | if (!total_swap_pages) | |
1798 | return 0; | |
1799 | ||
c3c787e8 | 1800 | if (!mem_cgroup_disabled()) |
c56d5c7d | 1801 | return mem_cgroup_inactive_anon_is_low(lruvec); |
f16015fb | 1802 | |
c56d5c7d | 1803 | return inactive_anon_is_low_global(lruvec_zone(lruvec)); |
14797e23 | 1804 | } |
74e3f3c3 | 1805 | #else |
c56d5c7d | 1806 | static inline int inactive_anon_is_low(struct lruvec *lruvec) |
74e3f3c3 MK |
1807 | { |
1808 | return 0; | |
1809 | } | |
1810 | #endif | |
14797e23 | 1811 | |
56e49d21 RR |
1812 | /** |
1813 | * inactive_file_is_low - check if file pages need to be deactivated | |
c56d5c7d | 1814 | * @lruvec: LRU vector to check |
56e49d21 RR |
1815 | * |
1816 | * When the system is doing streaming IO, memory pressure here | |
1817 | * ensures that active file pages get deactivated, until more | |
1818 | * than half of the file pages are on the inactive list. | |
1819 | * | |
1820 | * Once we get to that situation, protect the system's working | |
1821 | * set from being evicted by disabling active file page aging. | |
1822 | * | |
1823 | * This uses a different ratio than the anonymous pages, because | |
1824 | * the page cache uses a use-once replacement algorithm. | |
1825 | */ | |
c56d5c7d | 1826 | static int inactive_file_is_low(struct lruvec *lruvec) |
56e49d21 | 1827 | { |
e3790144 JW |
1828 | unsigned long inactive; |
1829 | unsigned long active; | |
1830 | ||
1831 | inactive = get_lru_size(lruvec, LRU_INACTIVE_FILE); | |
1832 | active = get_lru_size(lruvec, LRU_ACTIVE_FILE); | |
56e49d21 | 1833 | |
e3790144 | 1834 | return active > inactive; |
56e49d21 RR |
1835 | } |
1836 | ||
75b00af7 | 1837 | static int inactive_list_is_low(struct lruvec *lruvec, enum lru_list lru) |
b39415b2 | 1838 | { |
75b00af7 | 1839 | if (is_file_lru(lru)) |
c56d5c7d | 1840 | return inactive_file_is_low(lruvec); |
b39415b2 | 1841 | else |
c56d5c7d | 1842 | return inactive_anon_is_low(lruvec); |
b39415b2 RR |
1843 | } |
1844 | ||
4f98a2fe | 1845 | static unsigned long shrink_list(enum lru_list lru, unsigned long nr_to_scan, |
1a93be0e | 1846 | struct lruvec *lruvec, struct scan_control *sc) |
b69408e8 | 1847 | { |
b39415b2 | 1848 | if (is_active_lru(lru)) { |
75b00af7 | 1849 | if (inactive_list_is_low(lruvec, lru)) |
1a93be0e | 1850 | shrink_active_list(nr_to_scan, lruvec, sc, lru); |
556adecb RR |
1851 | return 0; |
1852 | } | |
1853 | ||
1a93be0e | 1854 | return shrink_inactive_list(nr_to_scan, lruvec, sc, lru); |
4f98a2fe RR |
1855 | } |
1856 | ||
9a265114 JW |
1857 | enum scan_balance { |
1858 | SCAN_EQUAL, | |
1859 | SCAN_FRACT, | |
1860 | SCAN_ANON, | |
1861 | SCAN_FILE, | |
1862 | }; | |
1863 | ||
4f98a2fe RR |
1864 | /* |
1865 | * Determine how aggressively the anon and file LRU lists should be | |
1866 | * scanned. The relative value of each set of LRU lists is determined | |
1867 | * by looking at the fraction of the pages scanned we did rotate back | |
1868 | * onto the active list instead of evict. | |
1869 | * | |
be7bd59d WL |
1870 | * nr[0] = anon inactive pages to scan; nr[1] = anon active pages to scan |
1871 | * nr[2] = file inactive pages to scan; nr[3] = file active pages to scan | |
4f98a2fe | 1872 | */ |
02695175 JW |
1873 | static void get_scan_count(struct lruvec *lruvec, int swappiness, |
1874 | struct scan_control *sc, unsigned long *nr) | |
4f98a2fe | 1875 | { |
9a265114 JW |
1876 | struct zone_reclaim_stat *reclaim_stat = &lruvec->reclaim_stat; |
1877 | u64 fraction[2]; | |
1878 | u64 denominator = 0; /* gcc */ | |
1879 | struct zone *zone = lruvec_zone(lruvec); | |
4f98a2fe | 1880 | unsigned long anon_prio, file_prio; |
9a265114 | 1881 | enum scan_balance scan_balance; |
0bf1457f | 1882 | unsigned long anon, file; |
9a265114 | 1883 | bool force_scan = false; |
4f98a2fe | 1884 | unsigned long ap, fp; |
4111304d | 1885 | enum lru_list lru; |
6f04f48d SS |
1886 | bool some_scanned; |
1887 | int pass; | |
246e87a9 | 1888 | |
f11c0ca5 JW |
1889 | /* |
1890 | * If the zone or memcg is small, nr[l] can be 0. This | |
1891 | * results in no scanning on this priority and a potential | |
1892 | * priority drop. Global direct reclaim can go to the next | |
1893 | * zone and tends to have no problems. Global kswapd is for | |
1894 | * zone balancing and it needs to scan a minimum amount. When | |
1895 | * reclaiming for a memcg, a priority drop can cause high | |
1896 | * latencies, so it's better to scan a minimum amount there as | |
1897 | * well. | |
1898 | */ | |
6e543d57 | 1899 | if (current_is_kswapd() && !zone_reclaimable(zone)) |
a4d3e9e7 | 1900 | force_scan = true; |
89b5fae5 | 1901 | if (!global_reclaim(sc)) |
a4d3e9e7 | 1902 | force_scan = true; |
76a33fc3 SL |
1903 | |
1904 | /* If we have no swap space, do not bother scanning anon pages. */ | |
ec8acf20 | 1905 | if (!sc->may_swap || (get_nr_swap_pages() <= 0)) { |
9a265114 | 1906 | scan_balance = SCAN_FILE; |
76a33fc3 SL |
1907 | goto out; |
1908 | } | |
4f98a2fe | 1909 | |
10316b31 JW |
1910 | /* |
1911 | * Global reclaim will swap to prevent OOM even with no | |
1912 | * swappiness, but memcg users want to use this knob to | |
1913 | * disable swapping for individual groups completely when | |
1914 | * using the memory controller's swap limit feature would be | |
1915 | * too expensive. | |
1916 | */ | |
02695175 | 1917 | if (!global_reclaim(sc) && !swappiness) { |
9a265114 | 1918 | scan_balance = SCAN_FILE; |
10316b31 JW |
1919 | goto out; |
1920 | } | |
1921 | ||
1922 | /* | |
1923 | * Do not apply any pressure balancing cleverness when the | |
1924 | * system is close to OOM, scan both anon and file equally | |
1925 | * (unless the swappiness setting disagrees with swapping). | |
1926 | */ | |
02695175 | 1927 | if (!sc->priority && swappiness) { |
9a265114 | 1928 | scan_balance = SCAN_EQUAL; |
10316b31 JW |
1929 | goto out; |
1930 | } | |
1931 | ||
4d7dcca2 HD |
1932 | anon = get_lru_size(lruvec, LRU_ACTIVE_ANON) + |
1933 | get_lru_size(lruvec, LRU_INACTIVE_ANON); | |
1934 | file = get_lru_size(lruvec, LRU_ACTIVE_FILE) + | |
1935 | get_lru_size(lruvec, LRU_INACTIVE_FILE); | |
a4d3e9e7 | 1936 | |
62376251 JW |
1937 | /* |
1938 | * Prevent the reclaimer from falling into the cache trap: as | |
1939 | * cache pages start out inactive, every cache fault will tip | |
1940 | * the scan balance towards the file LRU. And as the file LRU | |
1941 | * shrinks, so does the window for rotation from references. | |
1942 | * This means we have a runaway feedback loop where a tiny | |
1943 | * thrashing file LRU becomes infinitely more attractive than | |
1944 | * anon pages. Try to detect this based on file LRU size. | |
1945 | */ | |
1946 | if (global_reclaim(sc)) { | |
1947 | unsigned long free = zone_page_state(zone, NR_FREE_PAGES); | |
1948 | ||
1949 | if (unlikely(file + free <= high_wmark_pages(zone))) { | |
1950 | scan_balance = SCAN_ANON; | |
1951 | goto out; | |
1952 | } | |
1953 | } | |
1954 | ||
7c5bd705 JW |
1955 | /* |
1956 | * There is enough inactive page cache, do not reclaim | |
1957 | * anything from the anonymous working set right now. | |
1958 | */ | |
1959 | if (!inactive_file_is_low(lruvec)) { | |
9a265114 | 1960 | scan_balance = SCAN_FILE; |
7c5bd705 JW |
1961 | goto out; |
1962 | } | |
1963 | ||
9a265114 JW |
1964 | scan_balance = SCAN_FRACT; |
1965 | ||
58c37f6e KM |
1966 | /* |
1967 | * With swappiness at 100, anonymous and file have the same priority. | |
1968 | * This scanning priority is essentially the inverse of IO cost. | |
1969 | */ | |
02695175 | 1970 | anon_prio = swappiness; |
75b00af7 | 1971 | file_prio = 200 - anon_prio; |
58c37f6e | 1972 | |
4f98a2fe RR |
1973 | /* |
1974 | * OK, so we have swap space and a fair amount of page cache | |
1975 | * pages. We use the recently rotated / recently scanned | |
1976 | * ratios to determine how valuable each cache is. | |
1977 | * | |
1978 | * Because workloads change over time (and to avoid overflow) | |
1979 | * we keep these statistics as a floating average, which ends | |
1980 | * up weighing recent references more than old ones. | |
1981 | * | |
1982 | * anon in [0], file in [1] | |
1983 | */ | |
90126375 | 1984 | spin_lock_irq(&zone->lru_lock); |
6e901571 | 1985 | if (unlikely(reclaim_stat->recent_scanned[0] > anon / 4)) { |
6e901571 KM |
1986 | reclaim_stat->recent_scanned[0] /= 2; |
1987 | reclaim_stat->recent_rotated[0] /= 2; | |
4f98a2fe RR |
1988 | } |
1989 | ||
6e901571 | 1990 | if (unlikely(reclaim_stat->recent_scanned[1] > file / 4)) { |
6e901571 KM |
1991 | reclaim_stat->recent_scanned[1] /= 2; |
1992 | reclaim_stat->recent_rotated[1] /= 2; | |
4f98a2fe RR |
1993 | } |
1994 | ||
4f98a2fe | 1995 | /* |
00d8089c RR |
1996 | * The amount of pressure on anon vs file pages is inversely |
1997 | * proportional to the fraction of recently scanned pages on | |
1998 | * each list that were recently referenced and in active use. | |
4f98a2fe | 1999 | */ |
fe35004f | 2000 | ap = anon_prio * (reclaim_stat->recent_scanned[0] + 1); |
6e901571 | 2001 | ap /= reclaim_stat->recent_rotated[0] + 1; |
4f98a2fe | 2002 | |
fe35004f | 2003 | fp = file_prio * (reclaim_stat->recent_scanned[1] + 1); |
6e901571 | 2004 | fp /= reclaim_stat->recent_rotated[1] + 1; |
90126375 | 2005 | spin_unlock_irq(&zone->lru_lock); |
4f98a2fe | 2006 | |
76a33fc3 SL |
2007 | fraction[0] = ap; |
2008 | fraction[1] = fp; | |
2009 | denominator = ap + fp + 1; | |
2010 | out: | |
6f04f48d SS |
2011 | some_scanned = false; |
2012 | /* Only use force_scan on second pass. */ | |
2013 | for (pass = 0; !some_scanned && pass < 2; pass++) { | |
2014 | for_each_evictable_lru(lru) { | |
2015 | int file = is_file_lru(lru); | |
2016 | unsigned long size; | |
2017 | unsigned long scan; | |
6e08a369 | 2018 | |
6f04f48d SS |
2019 | size = get_lru_size(lruvec, lru); |
2020 | scan = size >> sc->priority; | |
9a265114 | 2021 | |
6f04f48d SS |
2022 | if (!scan && pass && force_scan) |
2023 | scan = min(size, SWAP_CLUSTER_MAX); | |
9a265114 | 2024 | |
6f04f48d SS |
2025 | switch (scan_balance) { |
2026 | case SCAN_EQUAL: | |
2027 | /* Scan lists relative to size */ | |
2028 | break; | |
2029 | case SCAN_FRACT: | |
2030 | /* | |
2031 | * Scan types proportional to swappiness and | |
2032 | * their relative recent reclaim efficiency. | |
2033 | */ | |
2034 | scan = div64_u64(scan * fraction[file], | |
2035 | denominator); | |
2036 | break; | |
2037 | case SCAN_FILE: | |
2038 | case SCAN_ANON: | |
2039 | /* Scan one type exclusively */ | |
2040 | if ((scan_balance == SCAN_FILE) != file) | |
2041 | scan = 0; | |
2042 | break; | |
2043 | default: | |
2044 | /* Look ma, no brain */ | |
2045 | BUG(); | |
2046 | } | |
2047 | nr[lru] = scan; | |
9a265114 | 2048 | /* |
6f04f48d SS |
2049 | * Skip the second pass and don't force_scan, |
2050 | * if we found something to scan. | |
9a265114 | 2051 | */ |
6f04f48d | 2052 | some_scanned |= !!scan; |
9a265114 | 2053 | } |
76a33fc3 | 2054 | } |
6e08a369 | 2055 | } |
4f98a2fe | 2056 | |
9b4f98cd JW |
2057 | /* |
2058 | * This is a basic per-zone page freer. Used by both kswapd and direct reclaim. | |
2059 | */ | |
02695175 JW |
2060 | static void shrink_lruvec(struct lruvec *lruvec, int swappiness, |
2061 | struct scan_control *sc) | |
9b4f98cd JW |
2062 | { |
2063 | unsigned long nr[NR_LRU_LISTS]; | |
e82e0561 | 2064 | unsigned long targets[NR_LRU_LISTS]; |
9b4f98cd JW |
2065 | unsigned long nr_to_scan; |
2066 | enum lru_list lru; | |
2067 | unsigned long nr_reclaimed = 0; | |
2068 | unsigned long nr_to_reclaim = sc->nr_to_reclaim; | |
2069 | struct blk_plug plug; | |
1a501907 | 2070 | bool scan_adjusted; |
9b4f98cd | 2071 | |
02695175 | 2072 | get_scan_count(lruvec, swappiness, sc, nr); |
9b4f98cd | 2073 | |
e82e0561 MG |
2074 | /* Record the original scan target for proportional adjustments later */ |
2075 | memcpy(targets, nr, sizeof(nr)); | |
2076 | ||
1a501907 MG |
2077 | /* |
2078 | * Global reclaiming within direct reclaim at DEF_PRIORITY is a normal | |
2079 | * event that can occur when there is little memory pressure e.g. | |
2080 | * multiple streaming readers/writers. Hence, we do not abort scanning | |
2081 | * when the requested number of pages are reclaimed when scanning at | |
2082 | * DEF_PRIORITY on the assumption that the fact we are direct | |
2083 | * reclaiming implies that kswapd is not keeping up and it is best to | |
2084 | * do a batch of work at once. For memcg reclaim one check is made to | |
2085 | * abort proportional reclaim if either the file or anon lru has already | |
2086 | * dropped to zero at the first pass. | |
2087 | */ | |
2088 | scan_adjusted = (global_reclaim(sc) && !current_is_kswapd() && | |
2089 | sc->priority == DEF_PRIORITY); | |
2090 | ||
9b4f98cd JW |
2091 | blk_start_plug(&plug); |
2092 | while (nr[LRU_INACTIVE_ANON] || nr[LRU_ACTIVE_FILE] || | |
2093 | nr[LRU_INACTIVE_FILE]) { | |
e82e0561 MG |
2094 | unsigned long nr_anon, nr_file, percentage; |
2095 | unsigned long nr_scanned; | |
2096 | ||
9b4f98cd JW |
2097 | for_each_evictable_lru(lru) { |
2098 | if (nr[lru]) { | |
2099 | nr_to_scan = min(nr[lru], SWAP_CLUSTER_MAX); | |
2100 | nr[lru] -= nr_to_scan; | |
2101 | ||
2102 | nr_reclaimed += shrink_list(lru, nr_to_scan, | |
2103 | lruvec, sc); | |
2104 | } | |
2105 | } | |
e82e0561 MG |
2106 | |
2107 | if (nr_reclaimed < nr_to_reclaim || scan_adjusted) | |
2108 | continue; | |
2109 | ||
e82e0561 MG |
2110 | /* |
2111 | * For kswapd and memcg, reclaim at least the number of pages | |
1a501907 | 2112 | * requested. Ensure that the anon and file LRUs are scanned |
e82e0561 MG |
2113 | * proportionally what was requested by get_scan_count(). We |
2114 | * stop reclaiming one LRU and reduce the amount scanning | |
2115 | * proportional to the original scan target. | |
2116 | */ | |
2117 | nr_file = nr[LRU_INACTIVE_FILE] + nr[LRU_ACTIVE_FILE]; | |
2118 | nr_anon = nr[LRU_INACTIVE_ANON] + nr[LRU_ACTIVE_ANON]; | |
2119 | ||
1a501907 MG |
2120 | /* |
2121 | * It's just vindictive to attack the larger once the smaller | |
2122 | * has gone to zero. And given the way we stop scanning the | |
2123 | * smaller below, this makes sure that we only make one nudge | |
2124 | * towards proportionality once we've got nr_to_reclaim. | |
2125 | */ | |
2126 | if (!nr_file || !nr_anon) | |
2127 | break; | |
2128 | ||
e82e0561 MG |
2129 | if (nr_file > nr_anon) { |
2130 | unsigned long scan_target = targets[LRU_INACTIVE_ANON] + | |
2131 | targets[LRU_ACTIVE_ANON] + 1; | |
2132 | lru = LRU_BASE; | |
2133 | percentage = nr_anon * 100 / scan_target; | |
2134 | } else { | |
2135 | unsigned long scan_target = targets[LRU_INACTIVE_FILE] + | |
2136 | targets[LRU_ACTIVE_FILE] + 1; | |
2137 | lru = LRU_FILE; | |
2138 | percentage = nr_file * 100 / scan_target; | |
2139 | } | |
2140 | ||
2141 | /* Stop scanning the smaller of the LRU */ | |
2142 | nr[lru] = 0; | |
2143 | nr[lru + LRU_ACTIVE] = 0; | |
2144 | ||
2145 | /* | |
2146 | * Recalculate the other LRU scan count based on its original | |
2147 | * scan target and the percentage scanning already complete | |
2148 | */ | |
2149 | lru = (lru == LRU_FILE) ? LRU_BASE : LRU_FILE; | |
2150 | nr_scanned = targets[lru] - nr[lru]; | |
2151 | nr[lru] = targets[lru] * (100 - percentage) / 100; | |
2152 | nr[lru] -= min(nr[lru], nr_scanned); | |
2153 | ||
2154 | lru += LRU_ACTIVE; | |
2155 | nr_scanned = targets[lru] - nr[lru]; | |
2156 | nr[lru] = targets[lru] * (100 - percentage) / 100; | |
2157 | nr[lru] -= min(nr[lru], nr_scanned); | |
2158 | ||
2159 | scan_adjusted = true; | |
9b4f98cd JW |
2160 | } |
2161 | blk_finish_plug(&plug); | |
2162 | sc->nr_reclaimed += nr_reclaimed; | |
2163 | ||
2164 | /* | |
2165 | * Even if we did not try to evict anon pages at all, we want to | |
2166 | * rebalance the anon lru active/inactive ratio. | |
2167 | */ | |
2168 | if (inactive_anon_is_low(lruvec)) | |
2169 | shrink_active_list(SWAP_CLUSTER_MAX, lruvec, | |
2170 | sc, LRU_ACTIVE_ANON); | |
2171 | ||
2172 | throttle_vm_writeout(sc->gfp_mask); | |
2173 | } | |
2174 | ||
23b9da55 | 2175 | /* Use reclaim/compaction for costly allocs or under memory pressure */ |
9e3b2f8c | 2176 | static bool in_reclaim_compaction(struct scan_control *sc) |
23b9da55 | 2177 | { |
d84da3f9 | 2178 | if (IS_ENABLED(CONFIG_COMPACTION) && sc->order && |
23b9da55 | 2179 | (sc->order > PAGE_ALLOC_COSTLY_ORDER || |
9e3b2f8c | 2180 | sc->priority < DEF_PRIORITY - 2)) |
23b9da55 MG |
2181 | return true; |
2182 | ||
2183 | return false; | |
2184 | } | |
2185 | ||
3e7d3449 | 2186 | /* |
23b9da55 MG |
2187 | * Reclaim/compaction is used for high-order allocation requests. It reclaims |
2188 | * order-0 pages before compacting the zone. should_continue_reclaim() returns | |
2189 | * true if more pages should be reclaimed such that when the page allocator | |
2190 | * calls try_to_compact_zone() that it will have enough free pages to succeed. | |
2191 | * It will give up earlier than that if there is difficulty reclaiming pages. | |
3e7d3449 | 2192 | */ |
9b4f98cd | 2193 | static inline bool should_continue_reclaim(struct zone *zone, |
3e7d3449 MG |
2194 | unsigned long nr_reclaimed, |
2195 | unsigned long nr_scanned, | |
2196 | struct scan_control *sc) | |
2197 | { | |
2198 | unsigned long pages_for_compaction; | |
2199 | unsigned long inactive_lru_pages; | |
2200 | ||
2201 | /* If not in reclaim/compaction mode, stop */ | |
9e3b2f8c | 2202 | if (!in_reclaim_compaction(sc)) |
3e7d3449 MG |
2203 | return false; |
2204 | ||
2876592f MG |
2205 | /* Consider stopping depending on scan and reclaim activity */ |
2206 | if (sc->gfp_mask & __GFP_REPEAT) { | |
2207 | /* | |
2208 | * For __GFP_REPEAT allocations, stop reclaiming if the | |
2209 | * full LRU list has been scanned and we are still failing | |
2210 | * to reclaim pages. This full LRU scan is potentially | |
2211 | * expensive but a __GFP_REPEAT caller really wants to succeed | |
2212 | */ | |
2213 | if (!nr_reclaimed && !nr_scanned) | |
2214 | return false; | |
2215 | } else { | |
2216 | /* | |
2217 | * For non-__GFP_REPEAT allocations which can presumably | |
2218 | * fail without consequence, stop if we failed to reclaim | |
2219 | * any pages from the last SWAP_CLUSTER_MAX number of | |
2220 | * pages that were scanned. This will return to the | |
2221 | * caller faster at the risk reclaim/compaction and | |
2222 | * the resulting allocation attempt fails | |
2223 | */ | |
2224 | if (!nr_reclaimed) | |
2225 | return false; | |
2226 | } | |
3e7d3449 MG |
2227 | |
2228 | /* | |
2229 | * If we have not reclaimed enough pages for compaction and the | |
2230 | * inactive lists are large enough, continue reclaiming | |
2231 | */ | |
2232 | pages_for_compaction = (2UL << sc->order); | |
9b4f98cd | 2233 | inactive_lru_pages = zone_page_state(zone, NR_INACTIVE_FILE); |
ec8acf20 | 2234 | if (get_nr_swap_pages() > 0) |
9b4f98cd | 2235 | inactive_lru_pages += zone_page_state(zone, NR_INACTIVE_ANON); |
3e7d3449 MG |
2236 | if (sc->nr_reclaimed < pages_for_compaction && |
2237 | inactive_lru_pages > pages_for_compaction) | |
2238 | return true; | |
2239 | ||
2240 | /* If compaction would go ahead or the allocation would succeed, stop */ | |
9b4f98cd | 2241 | switch (compaction_suitable(zone, sc->order)) { |
3e7d3449 MG |
2242 | case COMPACT_PARTIAL: |
2243 | case COMPACT_CONTINUE: | |
2244 | return false; | |
2245 | default: | |
2246 | return true; | |
2247 | } | |
2248 | } | |
2249 | ||
2344d7e4 | 2250 | static bool shrink_zone(struct zone *zone, struct scan_control *sc) |
1da177e4 | 2251 | { |
f0fdc5e8 | 2252 | unsigned long nr_reclaimed, nr_scanned; |
2344d7e4 | 2253 | bool reclaimable = false; |
1da177e4 | 2254 | |
9b4f98cd JW |
2255 | do { |
2256 | struct mem_cgroup *root = sc->target_mem_cgroup; | |
2257 | struct mem_cgroup_reclaim_cookie reclaim = { | |
2258 | .zone = zone, | |
2259 | .priority = sc->priority, | |
2260 | }; | |
694fbc0f | 2261 | struct mem_cgroup *memcg; |
3e7d3449 | 2262 | |
9b4f98cd JW |
2263 | nr_reclaimed = sc->nr_reclaimed; |
2264 | nr_scanned = sc->nr_scanned; | |
1da177e4 | 2265 | |
694fbc0f AM |
2266 | memcg = mem_cgroup_iter(root, NULL, &reclaim); |
2267 | do { | |
9b4f98cd | 2268 | struct lruvec *lruvec; |
02695175 | 2269 | int swappiness; |
5660048c | 2270 | |
9b4f98cd | 2271 | lruvec = mem_cgroup_zone_lruvec(zone, memcg); |
02695175 | 2272 | swappiness = mem_cgroup_swappiness(memcg); |
f9be23d6 | 2273 | |
02695175 | 2274 | shrink_lruvec(lruvec, swappiness, sc); |
f16015fb | 2275 | |
9b4f98cd | 2276 | /* |
a394cb8e MH |
2277 | * Direct reclaim and kswapd have to scan all memory |
2278 | * cgroups to fulfill the overall scan target for the | |
9b4f98cd | 2279 | * zone. |
a394cb8e MH |
2280 | * |
2281 | * Limit reclaim, on the other hand, only cares about | |
2282 | * nr_to_reclaim pages to be reclaimed and it will | |
2283 | * retry with decreasing priority if one round over the | |
2284 | * whole hierarchy is not sufficient. | |
9b4f98cd | 2285 | */ |
a394cb8e MH |
2286 | if (!global_reclaim(sc) && |
2287 | sc->nr_reclaimed >= sc->nr_to_reclaim) { | |
9b4f98cd JW |
2288 | mem_cgroup_iter_break(root, memcg); |
2289 | break; | |
2290 | } | |
694fbc0f AM |
2291 | memcg = mem_cgroup_iter(root, memcg, &reclaim); |
2292 | } while (memcg); | |
70ddf637 AV |
2293 | |
2294 | vmpressure(sc->gfp_mask, sc->target_mem_cgroup, | |
2295 | sc->nr_scanned - nr_scanned, | |
2296 | sc->nr_reclaimed - nr_reclaimed); | |
2297 | ||
2344d7e4 JW |
2298 | if (sc->nr_reclaimed - nr_reclaimed) |
2299 | reclaimable = true; | |
2300 | ||
9b4f98cd JW |
2301 | } while (should_continue_reclaim(zone, sc->nr_reclaimed - nr_reclaimed, |
2302 | sc->nr_scanned - nr_scanned, sc)); | |
2344d7e4 JW |
2303 | |
2304 | return reclaimable; | |
f16015fb JW |
2305 | } |
2306 | ||
fe4b1b24 | 2307 | /* Returns true if compaction should go ahead for a high-order request */ |
0b06496a | 2308 | static inline bool compaction_ready(struct zone *zone, int order) |
fe4b1b24 MG |
2309 | { |
2310 | unsigned long balance_gap, watermark; | |
2311 | bool watermark_ok; | |
2312 | ||
fe4b1b24 MG |
2313 | /* |
2314 | * Compaction takes time to run and there are potentially other | |
2315 | * callers using the pages just freed. Continue reclaiming until | |
2316 | * there is a buffer of free pages available to give compaction | |
2317 | * a reasonable chance of completing and allocating the page | |
2318 | */ | |
4be89a34 JZ |
2319 | balance_gap = min(low_wmark_pages(zone), DIV_ROUND_UP( |
2320 | zone->managed_pages, KSWAPD_ZONE_BALANCE_GAP_RATIO)); | |
0b06496a | 2321 | watermark = high_wmark_pages(zone) + balance_gap + (2UL << order); |
fe4b1b24 MG |
2322 | watermark_ok = zone_watermark_ok_safe(zone, 0, watermark, 0, 0); |
2323 | ||
2324 | /* | |
2325 | * If compaction is deferred, reclaim up to a point where | |
2326 | * compaction will have a chance of success when re-enabled | |
2327 | */ | |
0b06496a | 2328 | if (compaction_deferred(zone, order)) |
fe4b1b24 MG |
2329 | return watermark_ok; |
2330 | ||
2331 | /* If compaction is not ready to start, keep reclaiming */ | |
0b06496a | 2332 | if (!compaction_suitable(zone, order)) |
fe4b1b24 MG |
2333 | return false; |
2334 | ||
2335 | return watermark_ok; | |
2336 | } | |
2337 | ||
1da177e4 LT |
2338 | /* |
2339 | * This is the direct reclaim path, for page-allocating processes. We only | |
2340 | * try to reclaim pages from zones which will satisfy the caller's allocation | |
2341 | * request. | |
2342 | * | |
41858966 MG |
2343 | * We reclaim from a zone even if that zone is over high_wmark_pages(zone). |
2344 | * Because: | |
1da177e4 LT |
2345 | * a) The caller may be trying to free *extra* pages to satisfy a higher-order |
2346 | * allocation or | |
41858966 MG |
2347 | * b) The target zone may be at high_wmark_pages(zone) but the lower zones |
2348 | * must go *over* high_wmark_pages(zone) to satisfy the `incremental min' | |
2349 | * zone defense algorithm. | |
1da177e4 | 2350 | * |
1da177e4 LT |
2351 | * If a zone is deemed to be full of pinned pages then just give it a light |
2352 | * scan then give up on it. | |
2344d7e4 JW |
2353 | * |
2354 | * Returns true if a zone was reclaimable. | |
1da177e4 | 2355 | */ |
2344d7e4 | 2356 | static bool shrink_zones(struct zonelist *zonelist, struct scan_control *sc) |
1da177e4 | 2357 | { |
dd1a239f | 2358 | struct zoneref *z; |
54a6eb5c | 2359 | struct zone *zone; |
0608f43d AM |
2360 | unsigned long nr_soft_reclaimed; |
2361 | unsigned long nr_soft_scanned; | |
65ec02cb | 2362 | unsigned long lru_pages = 0; |
65ec02cb | 2363 | struct reclaim_state *reclaim_state = current->reclaim_state; |
619d0d76 | 2364 | gfp_t orig_mask; |
3115cd91 VD |
2365 | struct shrink_control shrink = { |
2366 | .gfp_mask = sc->gfp_mask, | |
2367 | }; | |
9bbc04ee | 2368 | enum zone_type requested_highidx = gfp_zone(sc->gfp_mask); |
2344d7e4 | 2369 | bool reclaimable = false; |
1cfb419b | 2370 | |
cc715d99 MG |
2371 | /* |
2372 | * If the number of buffer_heads in the machine exceeds the maximum | |
2373 | * allowed level, force direct reclaim to scan the highmem zone as | |
2374 | * highmem pages could be pinning lowmem pages storing buffer_heads | |
2375 | */ | |
619d0d76 | 2376 | orig_mask = sc->gfp_mask; |
cc715d99 MG |
2377 | if (buffer_heads_over_limit) |
2378 | sc->gfp_mask |= __GFP_HIGHMEM; | |
2379 | ||
3115cd91 | 2380 | nodes_clear(shrink.nodes_to_scan); |
65ec02cb | 2381 | |
d4debc66 MG |
2382 | for_each_zone_zonelist_nodemask(zone, z, zonelist, |
2383 | gfp_zone(sc->gfp_mask), sc->nodemask) { | |
f3fe6512 | 2384 | if (!populated_zone(zone)) |
1da177e4 | 2385 | continue; |
1cfb419b KH |
2386 | /* |
2387 | * Take care memory controller reclaiming has small influence | |
2388 | * to global LRU. | |
2389 | */ | |
89b5fae5 | 2390 | if (global_reclaim(sc)) { |
1cfb419b KH |
2391 | if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL)) |
2392 | continue; | |
65ec02cb VD |
2393 | |
2394 | lru_pages += zone_reclaimable_pages(zone); | |
3115cd91 | 2395 | node_set(zone_to_nid(zone), shrink.nodes_to_scan); |
65ec02cb | 2396 | |
6e543d57 LD |
2397 | if (sc->priority != DEF_PRIORITY && |
2398 | !zone_reclaimable(zone)) | |
1cfb419b | 2399 | continue; /* Let kswapd poll it */ |
0b06496a JW |
2400 | |
2401 | /* | |
2402 | * If we already have plenty of memory free for | |
2403 | * compaction in this zone, don't free any more. | |
2404 | * Even though compaction is invoked for any | |
2405 | * non-zero order, only frequent costly order | |
2406 | * reclamation is disruptive enough to become a | |
2407 | * noticeable problem, like transparent huge | |
2408 | * page allocations. | |
2409 | */ | |
2410 | if (IS_ENABLED(CONFIG_COMPACTION) && | |
2411 | sc->order > PAGE_ALLOC_COSTLY_ORDER && | |
2412 | zonelist_zone_idx(z) <= requested_highidx && | |
2413 | compaction_ready(zone, sc->order)) { | |
2414 | sc->compaction_ready = true; | |
2415 | continue; | |
e0887c19 | 2416 | } |
0b06496a | 2417 | |
0608f43d AM |
2418 | /* |
2419 | * This steals pages from memory cgroups over softlimit | |
2420 | * and returns the number of reclaimed pages and | |
2421 | * scanned pages. This works for global memory pressure | |
2422 | * and balancing, not for a memcg's limit. | |
2423 | */ | |
2424 | nr_soft_scanned = 0; | |
2425 | nr_soft_reclaimed = mem_cgroup_soft_limit_reclaim(zone, | |
2426 | sc->order, sc->gfp_mask, | |
2427 | &nr_soft_scanned); | |
2428 | sc->nr_reclaimed += nr_soft_reclaimed; | |
2429 | sc->nr_scanned += nr_soft_scanned; | |
2344d7e4 JW |
2430 | if (nr_soft_reclaimed) |
2431 | reclaimable = true; | |
ac34a1a3 | 2432 | /* need some check for avoid more shrink_zone() */ |
1cfb419b | 2433 | } |
408d8544 | 2434 | |
2344d7e4 JW |
2435 | if (shrink_zone(zone, sc)) |
2436 | reclaimable = true; | |
2437 | ||
2438 | if (global_reclaim(sc) && | |
2439 | !reclaimable && zone_reclaimable(zone)) | |
2440 | reclaimable = true; | |
1da177e4 | 2441 | } |
e0c23279 | 2442 | |
65ec02cb VD |
2443 | /* |
2444 | * Don't shrink slabs when reclaiming memory from over limit cgroups | |
2445 | * but do shrink slab at least once when aborting reclaim for | |
2446 | * compaction to avoid unevenly scanning file/anon LRU pages over slab | |
2447 | * pages. | |
2448 | */ | |
2449 | if (global_reclaim(sc)) { | |
3115cd91 | 2450 | shrink_slab(&shrink, sc->nr_scanned, lru_pages); |
65ec02cb VD |
2451 | if (reclaim_state) { |
2452 | sc->nr_reclaimed += reclaim_state->reclaimed_slab; | |
2453 | reclaim_state->reclaimed_slab = 0; | |
2454 | } | |
2455 | } | |
2456 | ||
619d0d76 WY |
2457 | /* |
2458 | * Restore to original mask to avoid the impact on the caller if we | |
2459 | * promoted it to __GFP_HIGHMEM. | |
2460 | */ | |
2461 | sc->gfp_mask = orig_mask; | |
d1908362 | 2462 | |
2344d7e4 | 2463 | return reclaimable; |
1da177e4 | 2464 | } |
4f98a2fe | 2465 | |
1da177e4 LT |
2466 | /* |
2467 | * This is the main entry point to direct page reclaim. | |
2468 | * | |
2469 | * If a full scan of the inactive list fails to free enough memory then we | |
2470 | * are "out of memory" and something needs to be killed. | |
2471 | * | |
2472 | * If the caller is !__GFP_FS then the probability of a failure is reasonably | |
2473 | * high - the zone may be full of dirty or under-writeback pages, which this | |
5b0830cb JA |
2474 | * caller can't do much about. We kick the writeback threads and take explicit |
2475 | * naps in the hope that some of these pages can be written. But if the | |
2476 | * allocating task holds filesystem locks which prevent writeout this might not | |
2477 | * work, and the allocation attempt will fail. | |
a41f24ea NA |
2478 | * |
2479 | * returns: 0, if no pages reclaimed | |
2480 | * else, the number of pages reclaimed | |
1da177e4 | 2481 | */ |
dac1d27b | 2482 | static unsigned long do_try_to_free_pages(struct zonelist *zonelist, |
3115cd91 | 2483 | struct scan_control *sc) |
1da177e4 | 2484 | { |
69e05944 | 2485 | unsigned long total_scanned = 0; |
22fba335 | 2486 | unsigned long writeback_threshold; |
2344d7e4 | 2487 | bool zones_reclaimable; |
1da177e4 | 2488 | |
873b4771 KK |
2489 | delayacct_freepages_start(); |
2490 | ||
89b5fae5 | 2491 | if (global_reclaim(sc)) |
1cfb419b | 2492 | count_vm_event(ALLOCSTALL); |
1da177e4 | 2493 | |
9e3b2f8c | 2494 | do { |
70ddf637 AV |
2495 | vmpressure_prio(sc->gfp_mask, sc->target_mem_cgroup, |
2496 | sc->priority); | |
66e1707b | 2497 | sc->nr_scanned = 0; |
2344d7e4 | 2498 | zones_reclaimable = shrink_zones(zonelist, sc); |
c6a8a8c5 | 2499 | |
66e1707b | 2500 | total_scanned += sc->nr_scanned; |
bb21c7ce | 2501 | if (sc->nr_reclaimed >= sc->nr_to_reclaim) |
0b06496a JW |
2502 | break; |
2503 | ||
2504 | if (sc->compaction_ready) | |
2505 | break; | |
1da177e4 | 2506 | |
0e50ce3b MK |
2507 | /* |
2508 | * If we're getting trouble reclaiming, start doing | |
2509 | * writepage even in laptop mode. | |
2510 | */ | |
2511 | if (sc->priority < DEF_PRIORITY - 2) | |
2512 | sc->may_writepage = 1; | |
2513 | ||
1da177e4 LT |
2514 | /* |
2515 | * Try to write back as many pages as we just scanned. This | |
2516 | * tends to cause slow streaming writers to write data to the | |
2517 | * disk smoothly, at the dirtying rate, which is nice. But | |
2518 | * that's undesirable in laptop mode, where we *want* lumpy | |
2519 | * writeout. So in laptop mode, write out the whole world. | |
2520 | */ | |
22fba335 KM |
2521 | writeback_threshold = sc->nr_to_reclaim + sc->nr_to_reclaim / 2; |
2522 | if (total_scanned > writeback_threshold) { | |
0e175a18 CW |
2523 | wakeup_flusher_threads(laptop_mode ? 0 : total_scanned, |
2524 | WB_REASON_TRY_TO_FREE_PAGES); | |
66e1707b | 2525 | sc->may_writepage = 1; |
1da177e4 | 2526 | } |
0b06496a | 2527 | } while (--sc->priority >= 0); |
bb21c7ce | 2528 | |
873b4771 KK |
2529 | delayacct_freepages_end(); |
2530 | ||
bb21c7ce KM |
2531 | if (sc->nr_reclaimed) |
2532 | return sc->nr_reclaimed; | |
2533 | ||
0cee34fd | 2534 | /* Aborted reclaim to try compaction? don't OOM, then */ |
0b06496a | 2535 | if (sc->compaction_ready) |
7335084d MG |
2536 | return 1; |
2537 | ||
2344d7e4 JW |
2538 | /* Any of the zones still reclaimable? Don't OOM. */ |
2539 | if (zones_reclaimable) | |
bb21c7ce KM |
2540 | return 1; |
2541 | ||
2542 | return 0; | |
1da177e4 LT |
2543 | } |
2544 | ||
5515061d MG |
2545 | static bool pfmemalloc_watermark_ok(pg_data_t *pgdat) |
2546 | { | |
2547 | struct zone *zone; | |
2548 | unsigned long pfmemalloc_reserve = 0; | |
2549 | unsigned long free_pages = 0; | |
2550 | int i; | |
2551 | bool wmark_ok; | |
2552 | ||
2553 | for (i = 0; i <= ZONE_NORMAL; i++) { | |
2554 | zone = &pgdat->node_zones[i]; | |
675becce MG |
2555 | if (!populated_zone(zone)) |
2556 | continue; | |
2557 | ||
5515061d MG |
2558 | pfmemalloc_reserve += min_wmark_pages(zone); |
2559 | free_pages += zone_page_state(zone, NR_FREE_PAGES); | |
2560 | } | |
2561 | ||
675becce MG |
2562 | /* If there are no reserves (unexpected config) then do not throttle */ |
2563 | if (!pfmemalloc_reserve) | |
2564 | return true; | |
2565 | ||
5515061d MG |
2566 | wmark_ok = free_pages > pfmemalloc_reserve / 2; |
2567 | ||
2568 | /* kswapd must be awake if processes are being throttled */ | |
2569 | if (!wmark_ok && waitqueue_active(&pgdat->kswapd_wait)) { | |
2570 | pgdat->classzone_idx = min(pgdat->classzone_idx, | |
2571 | (enum zone_type)ZONE_NORMAL); | |
2572 | wake_up_interruptible(&pgdat->kswapd_wait); | |
2573 | } | |
2574 | ||
2575 | return wmark_ok; | |
2576 | } | |
2577 | ||
2578 | /* | |
2579 | * Throttle direct reclaimers if backing storage is backed by the network | |
2580 | * and the PFMEMALLOC reserve for the preferred node is getting dangerously | |
2581 | * depleted. kswapd will continue to make progress and wake the processes | |
50694c28 MG |
2582 | * when the low watermark is reached. |
2583 | * | |
2584 | * Returns true if a fatal signal was delivered during throttling. If this | |
2585 | * happens, the page allocator should not consider triggering the OOM killer. | |
5515061d | 2586 | */ |
50694c28 | 2587 | static bool throttle_direct_reclaim(gfp_t gfp_mask, struct zonelist *zonelist, |
5515061d MG |
2588 | nodemask_t *nodemask) |
2589 | { | |
675becce | 2590 | struct zoneref *z; |
5515061d | 2591 | struct zone *zone; |
675becce | 2592 | pg_data_t *pgdat = NULL; |
5515061d MG |
2593 | |
2594 | /* | |
2595 | * Kernel threads should not be throttled as they may be indirectly | |
2596 | * responsible for cleaning pages necessary for reclaim to make forward | |
2597 | * progress. kjournald for example may enter direct reclaim while | |
2598 | * committing a transaction where throttling it could forcing other | |
2599 | * processes to block on log_wait_commit(). | |
2600 | */ | |
2601 | if (current->flags & PF_KTHREAD) | |
50694c28 MG |
2602 | goto out; |
2603 | ||
2604 | /* | |
2605 | * If a fatal signal is pending, this process should not throttle. | |
2606 | * It should return quickly so it can exit and free its memory | |
2607 | */ | |
2608 | if (fatal_signal_pending(current)) | |
2609 | goto out; | |
5515061d | 2610 | |
675becce MG |
2611 | /* |
2612 | * Check if the pfmemalloc reserves are ok by finding the first node | |
2613 | * with a usable ZONE_NORMAL or lower zone. The expectation is that | |
2614 | * GFP_KERNEL will be required for allocating network buffers when | |
2615 | * swapping over the network so ZONE_HIGHMEM is unusable. | |
2616 | * | |
2617 | * Throttling is based on the first usable node and throttled processes | |
2618 | * wait on a queue until kswapd makes progress and wakes them. There | |
2619 | * is an affinity then between processes waking up and where reclaim | |
2620 | * progress has been made assuming the process wakes on the same node. | |
2621 | * More importantly, processes running on remote nodes will not compete | |
2622 | * for remote pfmemalloc reserves and processes on different nodes | |
2623 | * should make reasonable progress. | |
2624 | */ | |
2625 | for_each_zone_zonelist_nodemask(zone, z, zonelist, | |
2626 | gfp_mask, nodemask) { | |
2627 | if (zone_idx(zone) > ZONE_NORMAL) | |
2628 | continue; | |
2629 | ||
2630 | /* Throttle based on the first usable node */ | |
2631 | pgdat = zone->zone_pgdat; | |
2632 | if (pfmemalloc_watermark_ok(pgdat)) | |
2633 | goto out; | |
2634 | break; | |
2635 | } | |
2636 | ||
2637 | /* If no zone was usable by the allocation flags then do not throttle */ | |
2638 | if (!pgdat) | |
50694c28 | 2639 | goto out; |
5515061d | 2640 | |
68243e76 MG |
2641 | /* Account for the throttling */ |
2642 | count_vm_event(PGSCAN_DIRECT_THROTTLE); | |
2643 | ||
5515061d MG |
2644 | /* |
2645 | * If the caller cannot enter the filesystem, it's possible that it | |
2646 | * is due to the caller holding an FS lock or performing a journal | |
2647 | * transaction in the case of a filesystem like ext[3|4]. In this case, | |
2648 | * it is not safe to block on pfmemalloc_wait as kswapd could be | |
2649 | * blocked waiting on the same lock. Instead, throttle for up to a | |
2650 | * second before continuing. | |
2651 | */ | |
2652 | if (!(gfp_mask & __GFP_FS)) { | |
2653 | wait_event_interruptible_timeout(pgdat->pfmemalloc_wait, | |
2654 | pfmemalloc_watermark_ok(pgdat), HZ); | |
50694c28 MG |
2655 | |
2656 | goto check_pending; | |
5515061d MG |
2657 | } |
2658 | ||
2659 | /* Throttle until kswapd wakes the process */ | |
2660 | wait_event_killable(zone->zone_pgdat->pfmemalloc_wait, | |
2661 | pfmemalloc_watermark_ok(pgdat)); | |
50694c28 MG |
2662 | |
2663 | check_pending: | |
2664 | if (fatal_signal_pending(current)) | |
2665 | return true; | |
2666 | ||
2667 | out: | |
2668 | return false; | |
5515061d MG |
2669 | } |
2670 | ||
dac1d27b | 2671 | unsigned long try_to_free_pages(struct zonelist *zonelist, int order, |
327c0e96 | 2672 | gfp_t gfp_mask, nodemask_t *nodemask) |
66e1707b | 2673 | { |
33906bc5 | 2674 | unsigned long nr_reclaimed; |
66e1707b | 2675 | struct scan_control sc = { |
ee814fe2 | 2676 | .nr_to_reclaim = SWAP_CLUSTER_MAX, |
21caf2fc | 2677 | .gfp_mask = (gfp_mask = memalloc_noio_flags(gfp_mask)), |
ee814fe2 JW |
2678 | .order = order, |
2679 | .nodemask = nodemask, | |
2680 | .priority = DEF_PRIORITY, | |
66e1707b | 2681 | .may_writepage = !laptop_mode, |
a6dc60f8 | 2682 | .may_unmap = 1, |
2e2e4259 | 2683 | .may_swap = 1, |
66e1707b BS |
2684 | }; |
2685 | ||
5515061d | 2686 | /* |
50694c28 MG |
2687 | * Do not enter reclaim if fatal signal was delivered while throttled. |
2688 | * 1 is returned so that the page allocator does not OOM kill at this | |
2689 | * point. | |
5515061d | 2690 | */ |
50694c28 | 2691 | if (throttle_direct_reclaim(gfp_mask, zonelist, nodemask)) |
5515061d MG |
2692 | return 1; |
2693 | ||
33906bc5 MG |
2694 | trace_mm_vmscan_direct_reclaim_begin(order, |
2695 | sc.may_writepage, | |
2696 | gfp_mask); | |
2697 | ||
3115cd91 | 2698 | nr_reclaimed = do_try_to_free_pages(zonelist, &sc); |
33906bc5 MG |
2699 | |
2700 | trace_mm_vmscan_direct_reclaim_end(nr_reclaimed); | |
2701 | ||
2702 | return nr_reclaimed; | |
66e1707b BS |
2703 | } |
2704 | ||
c255a458 | 2705 | #ifdef CONFIG_MEMCG |
66e1707b | 2706 | |
72835c86 | 2707 | unsigned long mem_cgroup_shrink_node_zone(struct mem_cgroup *memcg, |
4e416953 | 2708 | gfp_t gfp_mask, bool noswap, |
0ae5e89c YH |
2709 | struct zone *zone, |
2710 | unsigned long *nr_scanned) | |
4e416953 BS |
2711 | { |
2712 | struct scan_control sc = { | |
b8f5c566 | 2713 | .nr_to_reclaim = SWAP_CLUSTER_MAX, |
ee814fe2 | 2714 | .target_mem_cgroup = memcg, |
4e416953 BS |
2715 | .may_writepage = !laptop_mode, |
2716 | .may_unmap = 1, | |
2717 | .may_swap = !noswap, | |
4e416953 | 2718 | }; |
f9be23d6 | 2719 | struct lruvec *lruvec = mem_cgroup_zone_lruvec(zone, memcg); |
02695175 | 2720 | int swappiness = mem_cgroup_swappiness(memcg); |
0ae5e89c | 2721 | |
4e416953 BS |
2722 | sc.gfp_mask = (gfp_mask & GFP_RECLAIM_MASK) | |
2723 | (GFP_HIGHUSER_MOVABLE & ~GFP_RECLAIM_MASK); | |
bdce6d9e | 2724 | |
9e3b2f8c | 2725 | trace_mm_vmscan_memcg_softlimit_reclaim_begin(sc.order, |
bdce6d9e KM |
2726 | sc.may_writepage, |
2727 | sc.gfp_mask); | |
2728 | ||
4e416953 BS |
2729 | /* |
2730 | * NOTE: Although we can get the priority field, using it | |
2731 | * here is not a good idea, since it limits the pages we can scan. | |
2732 | * if we don't reclaim here, the shrink_zone from balance_pgdat | |
2733 | * will pick up pages from other mem cgroup's as well. We hack | |
2734 | * the priority and make it zero. | |
2735 | */ | |
02695175 | 2736 | shrink_lruvec(lruvec, swappiness, &sc); |
bdce6d9e KM |
2737 | |
2738 | trace_mm_vmscan_memcg_softlimit_reclaim_end(sc.nr_reclaimed); | |
2739 | ||
0ae5e89c | 2740 | *nr_scanned = sc.nr_scanned; |
4e416953 BS |
2741 | return sc.nr_reclaimed; |
2742 | } | |
2743 | ||
72835c86 | 2744 | unsigned long try_to_free_mem_cgroup_pages(struct mem_cgroup *memcg, |
a7885eb8 | 2745 | gfp_t gfp_mask, |
185efc0f | 2746 | bool noswap) |
66e1707b | 2747 | { |
4e416953 | 2748 | struct zonelist *zonelist; |
bdce6d9e | 2749 | unsigned long nr_reclaimed; |
889976db | 2750 | int nid; |
66e1707b | 2751 | struct scan_control sc = { |
22fba335 | 2752 | .nr_to_reclaim = SWAP_CLUSTER_MAX, |
a09ed5e0 YH |
2753 | .gfp_mask = (gfp_mask & GFP_RECLAIM_MASK) | |
2754 | (GFP_HIGHUSER_MOVABLE & ~GFP_RECLAIM_MASK), | |
ee814fe2 JW |
2755 | .target_mem_cgroup = memcg, |
2756 | .priority = DEF_PRIORITY, | |
2757 | .may_writepage = !laptop_mode, | |
2758 | .may_unmap = 1, | |
2759 | .may_swap = !noswap, | |
a09ed5e0 | 2760 | }; |
66e1707b | 2761 | |
889976db YH |
2762 | /* |
2763 | * Unlike direct reclaim via alloc_pages(), memcg's reclaim doesn't | |
2764 | * take care of from where we get pages. So the node where we start the | |
2765 | * scan does not need to be the current node. | |
2766 | */ | |
72835c86 | 2767 | nid = mem_cgroup_select_victim_node(memcg); |
889976db YH |
2768 | |
2769 | zonelist = NODE_DATA(nid)->node_zonelists; | |
bdce6d9e KM |
2770 | |
2771 | trace_mm_vmscan_memcg_reclaim_begin(0, | |
2772 | sc.may_writepage, | |
2773 | sc.gfp_mask); | |
2774 | ||
3115cd91 | 2775 | nr_reclaimed = do_try_to_free_pages(zonelist, &sc); |
bdce6d9e KM |
2776 | |
2777 | trace_mm_vmscan_memcg_reclaim_end(nr_reclaimed); | |
2778 | ||
2779 | return nr_reclaimed; | |
66e1707b BS |
2780 | } |
2781 | #endif | |
2782 | ||
9e3b2f8c | 2783 | static void age_active_anon(struct zone *zone, struct scan_control *sc) |
f16015fb | 2784 | { |
b95a2f2d | 2785 | struct mem_cgroup *memcg; |
f16015fb | 2786 | |
b95a2f2d JW |
2787 | if (!total_swap_pages) |
2788 | return; | |
2789 | ||
2790 | memcg = mem_cgroup_iter(NULL, NULL, NULL); | |
2791 | do { | |
c56d5c7d | 2792 | struct lruvec *lruvec = mem_cgroup_zone_lruvec(zone, memcg); |
b95a2f2d | 2793 | |
c56d5c7d | 2794 | if (inactive_anon_is_low(lruvec)) |
1a93be0e | 2795 | shrink_active_list(SWAP_CLUSTER_MAX, lruvec, |
9e3b2f8c | 2796 | sc, LRU_ACTIVE_ANON); |
b95a2f2d JW |
2797 | |
2798 | memcg = mem_cgroup_iter(NULL, memcg, NULL); | |
2799 | } while (memcg); | |
f16015fb JW |
2800 | } |
2801 | ||
60cefed4 JW |
2802 | static bool zone_balanced(struct zone *zone, int order, |
2803 | unsigned long balance_gap, int classzone_idx) | |
2804 | { | |
2805 | if (!zone_watermark_ok_safe(zone, order, high_wmark_pages(zone) + | |
2806 | balance_gap, classzone_idx, 0)) | |
2807 | return false; | |
2808 | ||
d84da3f9 KS |
2809 | if (IS_ENABLED(CONFIG_COMPACTION) && order && |
2810 | !compaction_suitable(zone, order)) | |
60cefed4 JW |
2811 | return false; |
2812 | ||
2813 | return true; | |
2814 | } | |
2815 | ||
1741c877 | 2816 | /* |
4ae0a48b ZC |
2817 | * pgdat_balanced() is used when checking if a node is balanced. |
2818 | * | |
2819 | * For order-0, all zones must be balanced! | |
2820 | * | |
2821 | * For high-order allocations only zones that meet watermarks and are in a | |
2822 | * zone allowed by the callers classzone_idx are added to balanced_pages. The | |
2823 | * total of balanced pages must be at least 25% of the zones allowed by | |
2824 | * classzone_idx for the node to be considered balanced. Forcing all zones to | |
2825 | * be balanced for high orders can cause excessive reclaim when there are | |
2826 | * imbalanced zones. | |
1741c877 MG |
2827 | * The choice of 25% is due to |
2828 | * o a 16M DMA zone that is balanced will not balance a zone on any | |
2829 | * reasonable sized machine | |
2830 | * o On all other machines, the top zone must be at least a reasonable | |
25985edc | 2831 | * percentage of the middle zones. For example, on 32-bit x86, highmem |
1741c877 MG |
2832 | * would need to be at least 256M for it to be balance a whole node. |
2833 | * Similarly, on x86-64 the Normal zone would need to be at least 1G | |
2834 | * to balance a node on its own. These seemed like reasonable ratios. | |
2835 | */ | |
4ae0a48b | 2836 | static bool pgdat_balanced(pg_data_t *pgdat, int order, int classzone_idx) |
1741c877 | 2837 | { |
b40da049 | 2838 | unsigned long managed_pages = 0; |
4ae0a48b | 2839 | unsigned long balanced_pages = 0; |
1741c877 MG |
2840 | int i; |
2841 | ||
4ae0a48b ZC |
2842 | /* Check the watermark levels */ |
2843 | for (i = 0; i <= classzone_idx; i++) { | |
2844 | struct zone *zone = pgdat->node_zones + i; | |
1741c877 | 2845 | |
4ae0a48b ZC |
2846 | if (!populated_zone(zone)) |
2847 | continue; | |
2848 | ||
b40da049 | 2849 | managed_pages += zone->managed_pages; |
4ae0a48b ZC |
2850 | |
2851 | /* | |
2852 | * A special case here: | |
2853 | * | |
2854 | * balance_pgdat() skips over all_unreclaimable after | |
2855 | * DEF_PRIORITY. Effectively, it considers them balanced so | |
2856 | * they must be considered balanced here as well! | |
2857 | */ | |
6e543d57 | 2858 | if (!zone_reclaimable(zone)) { |
b40da049 | 2859 | balanced_pages += zone->managed_pages; |
4ae0a48b ZC |
2860 | continue; |
2861 | } | |
2862 | ||
2863 | if (zone_balanced(zone, order, 0, i)) | |
b40da049 | 2864 | balanced_pages += zone->managed_pages; |
4ae0a48b ZC |
2865 | else if (!order) |
2866 | return false; | |
2867 | } | |
2868 | ||
2869 | if (order) | |
b40da049 | 2870 | return balanced_pages >= (managed_pages >> 2); |
4ae0a48b ZC |
2871 | else |
2872 | return true; | |
1741c877 MG |
2873 | } |
2874 | ||
5515061d MG |
2875 | /* |
2876 | * Prepare kswapd for sleeping. This verifies that there are no processes | |
2877 | * waiting in throttle_direct_reclaim() and that watermarks have been met. | |
2878 | * | |
2879 | * Returns true if kswapd is ready to sleep | |
2880 | */ | |
2881 | static bool prepare_kswapd_sleep(pg_data_t *pgdat, int order, long remaining, | |
dc83edd9 | 2882 | int classzone_idx) |
f50de2d3 | 2883 | { |
f50de2d3 MG |
2884 | /* If a direct reclaimer woke kswapd within HZ/10, it's premature */ |
2885 | if (remaining) | |
5515061d MG |
2886 | return false; |
2887 | ||
2888 | /* | |
2889 | * There is a potential race between when kswapd checks its watermarks | |
2890 | * and a process gets throttled. There is also a potential race if | |
2891 | * processes get throttled, kswapd wakes, a large process exits therby | |
2892 | * balancing the zones that causes kswapd to miss a wakeup. If kswapd | |
2893 | * is going to sleep, no process should be sleeping on pfmemalloc_wait | |
2894 | * so wake them now if necessary. If necessary, processes will wake | |
2895 | * kswapd and get throttled again | |
2896 | */ | |
2897 | if (waitqueue_active(&pgdat->pfmemalloc_wait)) { | |
2898 | wake_up(&pgdat->pfmemalloc_wait); | |
2899 | return false; | |
2900 | } | |
f50de2d3 | 2901 | |
4ae0a48b | 2902 | return pgdat_balanced(pgdat, order, classzone_idx); |
f50de2d3 MG |
2903 | } |
2904 | ||
75485363 MG |
2905 | /* |
2906 | * kswapd shrinks the zone by the number of pages required to reach | |
2907 | * the high watermark. | |
b8e83b94 MG |
2908 | * |
2909 | * Returns true if kswapd scanned at least the requested number of pages to | |
283aba9f MG |
2910 | * reclaim or if the lack of progress was due to pages under writeback. |
2911 | * This is used to determine if the scanning priority needs to be raised. | |
75485363 | 2912 | */ |
b8e83b94 | 2913 | static bool kswapd_shrink_zone(struct zone *zone, |
7c954f6d | 2914 | int classzone_idx, |
75485363 | 2915 | struct scan_control *sc, |
2ab44f43 MG |
2916 | unsigned long lru_pages, |
2917 | unsigned long *nr_attempted) | |
75485363 | 2918 | { |
7c954f6d MG |
2919 | int testorder = sc->order; |
2920 | unsigned long balance_gap; | |
75485363 MG |
2921 | struct reclaim_state *reclaim_state = current->reclaim_state; |
2922 | struct shrink_control shrink = { | |
2923 | .gfp_mask = sc->gfp_mask, | |
2924 | }; | |
7c954f6d | 2925 | bool lowmem_pressure; |
75485363 MG |
2926 | |
2927 | /* Reclaim above the high watermark. */ | |
2928 | sc->nr_to_reclaim = max(SWAP_CLUSTER_MAX, high_wmark_pages(zone)); | |
7c954f6d MG |
2929 | |
2930 | /* | |
2931 | * Kswapd reclaims only single pages with compaction enabled. Trying | |
2932 | * too hard to reclaim until contiguous free pages have become | |
2933 | * available can hurt performance by evicting too much useful data | |
2934 | * from memory. Do not reclaim more than needed for compaction. | |
2935 | */ | |
2936 | if (IS_ENABLED(CONFIG_COMPACTION) && sc->order && | |
2937 | compaction_suitable(zone, sc->order) != | |
2938 | COMPACT_SKIPPED) | |
2939 | testorder = 0; | |
2940 | ||
2941 | /* | |
2942 | * We put equal pressure on every zone, unless one zone has way too | |
2943 | * many pages free already. The "too many pages" is defined as the | |
2944 | * high wmark plus a "gap" where the gap is either the low | |
2945 | * watermark or 1% of the zone, whichever is smaller. | |
2946 | */ | |
4be89a34 JZ |
2947 | balance_gap = min(low_wmark_pages(zone), DIV_ROUND_UP( |
2948 | zone->managed_pages, KSWAPD_ZONE_BALANCE_GAP_RATIO)); | |
7c954f6d MG |
2949 | |
2950 | /* | |
2951 | * If there is no low memory pressure or the zone is balanced then no | |
2952 | * reclaim is necessary | |
2953 | */ | |
2954 | lowmem_pressure = (buffer_heads_over_limit && is_highmem(zone)); | |
2955 | if (!lowmem_pressure && zone_balanced(zone, testorder, | |
2956 | balance_gap, classzone_idx)) | |
2957 | return true; | |
2958 | ||
75485363 | 2959 | shrink_zone(zone, sc); |
0ce3d744 DC |
2960 | nodes_clear(shrink.nodes_to_scan); |
2961 | node_set(zone_to_nid(zone), shrink.nodes_to_scan); | |
75485363 MG |
2962 | |
2963 | reclaim_state->reclaimed_slab = 0; | |
6e543d57 | 2964 | shrink_slab(&shrink, sc->nr_scanned, lru_pages); |
75485363 MG |
2965 | sc->nr_reclaimed += reclaim_state->reclaimed_slab; |
2966 | ||
2ab44f43 MG |
2967 | /* Account for the number of pages attempted to reclaim */ |
2968 | *nr_attempted += sc->nr_to_reclaim; | |
2969 | ||
283aba9f MG |
2970 | zone_clear_flag(zone, ZONE_WRITEBACK); |
2971 | ||
7c954f6d MG |
2972 | /* |
2973 | * If a zone reaches its high watermark, consider it to be no longer | |
2974 | * congested. It's possible there are dirty pages backed by congested | |
2975 | * BDIs but as pressure is relieved, speculatively avoid congestion | |
2976 | * waits. | |
2977 | */ | |
6e543d57 | 2978 | if (zone_reclaimable(zone) && |
7c954f6d MG |
2979 | zone_balanced(zone, testorder, 0, classzone_idx)) { |
2980 | zone_clear_flag(zone, ZONE_CONGESTED); | |
2981 | zone_clear_flag(zone, ZONE_TAIL_LRU_DIRTY); | |
2982 | } | |
2983 | ||
b8e83b94 | 2984 | return sc->nr_scanned >= sc->nr_to_reclaim; |
75485363 MG |
2985 | } |
2986 | ||
1da177e4 LT |
2987 | /* |
2988 | * For kswapd, balance_pgdat() will work across all this node's zones until | |
41858966 | 2989 | * they are all at high_wmark_pages(zone). |
1da177e4 | 2990 | * |
0abdee2b | 2991 | * Returns the final order kswapd was reclaiming at |
1da177e4 LT |
2992 | * |
2993 | * There is special handling here for zones which are full of pinned pages. | |
2994 | * This can happen if the pages are all mlocked, or if they are all used by | |
2995 | * device drivers (say, ZONE_DMA). Or if they are all in use by hugetlb. | |
2996 | * What we do is to detect the case where all pages in the zone have been | |
2997 | * scanned twice and there has been zero successful reclaim. Mark the zone as | |
2998 | * dead and from now on, only perform a short scan. Basically we're polling | |
2999 | * the zone for when the problem goes away. | |
3000 | * | |
3001 | * kswapd scans the zones in the highmem->normal->dma direction. It skips | |
41858966 MG |
3002 | * zones which have free_pages > high_wmark_pages(zone), but once a zone is |
3003 | * found to have free_pages <= high_wmark_pages(zone), we scan that zone and the | |
3004 | * lower zones regardless of the number of free pages in the lower zones. This | |
3005 | * interoperates with the page allocator fallback scheme to ensure that aging | |
3006 | * of pages is balanced across the zones. | |
1da177e4 | 3007 | */ |
99504748 | 3008 | static unsigned long balance_pgdat(pg_data_t *pgdat, int order, |
dc83edd9 | 3009 | int *classzone_idx) |
1da177e4 | 3010 | { |
1da177e4 | 3011 | int i; |
99504748 | 3012 | int end_zone = 0; /* Inclusive. 0 = ZONE_DMA */ |
0608f43d AM |
3013 | unsigned long nr_soft_reclaimed; |
3014 | unsigned long nr_soft_scanned; | |
179e9639 AM |
3015 | struct scan_control sc = { |
3016 | .gfp_mask = GFP_KERNEL, | |
ee814fe2 | 3017 | .order = order, |
b8e83b94 | 3018 | .priority = DEF_PRIORITY, |
ee814fe2 | 3019 | .may_writepage = !laptop_mode, |
a6dc60f8 | 3020 | .may_unmap = 1, |
2e2e4259 | 3021 | .may_swap = 1, |
179e9639 | 3022 | }; |
f8891e5e | 3023 | count_vm_event(PAGEOUTRUN); |
1da177e4 | 3024 | |
9e3b2f8c | 3025 | do { |
1da177e4 | 3026 | unsigned long lru_pages = 0; |
2ab44f43 | 3027 | unsigned long nr_attempted = 0; |
b8e83b94 | 3028 | bool raise_priority = true; |
2ab44f43 | 3029 | bool pgdat_needs_compaction = (order > 0); |
b8e83b94 MG |
3030 | |
3031 | sc.nr_reclaimed = 0; | |
1da177e4 | 3032 | |
d6277db4 RW |
3033 | /* |
3034 | * Scan in the highmem->dma direction for the highest | |
3035 | * zone which needs scanning | |
3036 | */ | |
3037 | for (i = pgdat->nr_zones - 1; i >= 0; i--) { | |
3038 | struct zone *zone = pgdat->node_zones + i; | |
1da177e4 | 3039 | |
d6277db4 RW |
3040 | if (!populated_zone(zone)) |
3041 | continue; | |
1da177e4 | 3042 | |
6e543d57 LD |
3043 | if (sc.priority != DEF_PRIORITY && |
3044 | !zone_reclaimable(zone)) | |
d6277db4 | 3045 | continue; |
1da177e4 | 3046 | |
556adecb RR |
3047 | /* |
3048 | * Do some background aging of the anon list, to give | |
3049 | * pages a chance to be referenced before reclaiming. | |
3050 | */ | |
9e3b2f8c | 3051 | age_active_anon(zone, &sc); |
556adecb | 3052 | |
cc715d99 MG |
3053 | /* |
3054 | * If the number of buffer_heads in the machine | |
3055 | * exceeds the maximum allowed level and this node | |
3056 | * has a highmem zone, force kswapd to reclaim from | |
3057 | * it to relieve lowmem pressure. | |
3058 | */ | |
3059 | if (buffer_heads_over_limit && is_highmem_idx(i)) { | |
3060 | end_zone = i; | |
3061 | break; | |
3062 | } | |
3063 | ||
60cefed4 | 3064 | if (!zone_balanced(zone, order, 0, 0)) { |
d6277db4 | 3065 | end_zone = i; |
e1dbeda6 | 3066 | break; |
439423f6 | 3067 | } else { |
d43006d5 MG |
3068 | /* |
3069 | * If balanced, clear the dirty and congested | |
3070 | * flags | |
3071 | */ | |
439423f6 | 3072 | zone_clear_flag(zone, ZONE_CONGESTED); |
d43006d5 | 3073 | zone_clear_flag(zone, ZONE_TAIL_LRU_DIRTY); |
1da177e4 | 3074 | } |
1da177e4 | 3075 | } |
dafcb73e | 3076 | |
b8e83b94 | 3077 | if (i < 0) |
e1dbeda6 AM |
3078 | goto out; |
3079 | ||
1da177e4 LT |
3080 | for (i = 0; i <= end_zone; i++) { |
3081 | struct zone *zone = pgdat->node_zones + i; | |
3082 | ||
2ab44f43 MG |
3083 | if (!populated_zone(zone)) |
3084 | continue; | |
3085 | ||
adea02a1 | 3086 | lru_pages += zone_reclaimable_pages(zone); |
2ab44f43 MG |
3087 | |
3088 | /* | |
3089 | * If any zone is currently balanced then kswapd will | |
3090 | * not call compaction as it is expected that the | |
3091 | * necessary pages are already available. | |
3092 | */ | |
3093 | if (pgdat_needs_compaction && | |
3094 | zone_watermark_ok(zone, order, | |
3095 | low_wmark_pages(zone), | |
3096 | *classzone_idx, 0)) | |
3097 | pgdat_needs_compaction = false; | |
1da177e4 LT |
3098 | } |
3099 | ||
b7ea3c41 MG |
3100 | /* |
3101 | * If we're getting trouble reclaiming, start doing writepage | |
3102 | * even in laptop mode. | |
3103 | */ | |
3104 | if (sc.priority < DEF_PRIORITY - 2) | |
3105 | sc.may_writepage = 1; | |
3106 | ||
1da177e4 LT |
3107 | /* |
3108 | * Now scan the zone in the dma->highmem direction, stopping | |
3109 | * at the last zone which needs scanning. | |
3110 | * | |
3111 | * We do this because the page allocator works in the opposite | |
3112 | * direction. This prevents the page allocator from allocating | |
3113 | * pages behind kswapd's direction of progress, which would | |
3114 | * cause too much scanning of the lower zones. | |
3115 | */ | |
3116 | for (i = 0; i <= end_zone; i++) { | |
3117 | struct zone *zone = pgdat->node_zones + i; | |
3118 | ||
f3fe6512 | 3119 | if (!populated_zone(zone)) |
1da177e4 LT |
3120 | continue; |
3121 | ||
6e543d57 LD |
3122 | if (sc.priority != DEF_PRIORITY && |
3123 | !zone_reclaimable(zone)) | |
1da177e4 LT |
3124 | continue; |
3125 | ||
1da177e4 | 3126 | sc.nr_scanned = 0; |
4e416953 | 3127 | |
0608f43d AM |
3128 | nr_soft_scanned = 0; |
3129 | /* | |
3130 | * Call soft limit reclaim before calling shrink_zone. | |
3131 | */ | |
3132 | nr_soft_reclaimed = mem_cgroup_soft_limit_reclaim(zone, | |
3133 | order, sc.gfp_mask, | |
3134 | &nr_soft_scanned); | |
3135 | sc.nr_reclaimed += nr_soft_reclaimed; | |
3136 | ||
32a4330d | 3137 | /* |
7c954f6d MG |
3138 | * There should be no need to raise the scanning |
3139 | * priority if enough pages are already being scanned | |
3140 | * that that high watermark would be met at 100% | |
3141 | * efficiency. | |
fe2c2a10 | 3142 | */ |
7c954f6d MG |
3143 | if (kswapd_shrink_zone(zone, end_zone, &sc, |
3144 | lru_pages, &nr_attempted)) | |
3145 | raise_priority = false; | |
1da177e4 | 3146 | } |
5515061d MG |
3147 | |
3148 | /* | |
3149 | * If the low watermark is met there is no need for processes | |
3150 | * to be throttled on pfmemalloc_wait as they should not be | |
3151 | * able to safely make forward progress. Wake them | |
3152 | */ | |
3153 | if (waitqueue_active(&pgdat->pfmemalloc_wait) && | |
3154 | pfmemalloc_watermark_ok(pgdat)) | |
3155 | wake_up(&pgdat->pfmemalloc_wait); | |
3156 | ||
1da177e4 | 3157 | /* |
b8e83b94 MG |
3158 | * Fragmentation may mean that the system cannot be rebalanced |
3159 | * for high-order allocations in all zones. If twice the | |
3160 | * allocation size has been reclaimed and the zones are still | |
3161 | * not balanced then recheck the watermarks at order-0 to | |
3162 | * prevent kswapd reclaiming excessively. Assume that a | |
3163 | * process requested a high-order can direct reclaim/compact. | |
1da177e4 | 3164 | */ |
b8e83b94 MG |
3165 | if (order && sc.nr_reclaimed >= 2UL << order) |
3166 | order = sc.order = 0; | |
8357376d | 3167 | |
b8e83b94 MG |
3168 | /* Check if kswapd should be suspending */ |
3169 | if (try_to_freeze() || kthread_should_stop()) | |
3170 | break; | |
8357376d | 3171 | |
2ab44f43 MG |
3172 | /* |
3173 | * Compact if necessary and kswapd is reclaiming at least the | |
3174 | * high watermark number of pages as requsted | |
3175 | */ | |
3176 | if (pgdat_needs_compaction && sc.nr_reclaimed > nr_attempted) | |
3177 | compact_pgdat(pgdat, order); | |
3178 | ||
73ce02e9 | 3179 | /* |
b8e83b94 MG |
3180 | * Raise priority if scanning rate is too low or there was no |
3181 | * progress in reclaiming pages | |
73ce02e9 | 3182 | */ |
b8e83b94 MG |
3183 | if (raise_priority || !sc.nr_reclaimed) |
3184 | sc.priority--; | |
9aa41348 | 3185 | } while (sc.priority >= 1 && |
b8e83b94 | 3186 | !pgdat_balanced(pgdat, order, *classzone_idx)); |
1da177e4 | 3187 | |
b8e83b94 | 3188 | out: |
0abdee2b | 3189 | /* |
5515061d | 3190 | * Return the order we were reclaiming at so prepare_kswapd_sleep() |
0abdee2b MG |
3191 | * makes a decision on the order we were last reclaiming at. However, |
3192 | * if another caller entered the allocator slow path while kswapd | |
3193 | * was awake, order will remain at the higher level | |
3194 | */ | |
dc83edd9 | 3195 | *classzone_idx = end_zone; |
0abdee2b | 3196 | return order; |
1da177e4 LT |
3197 | } |
3198 | ||
dc83edd9 | 3199 | static void kswapd_try_to_sleep(pg_data_t *pgdat, int order, int classzone_idx) |
f0bc0a60 KM |
3200 | { |
3201 | long remaining = 0; | |
3202 | DEFINE_WAIT(wait); | |
3203 | ||
3204 | if (freezing(current) || kthread_should_stop()) | |
3205 | return; | |
3206 | ||
3207 | prepare_to_wait(&pgdat->kswapd_wait, &wait, TASK_INTERRUPTIBLE); | |
3208 | ||
3209 | /* Try to sleep for a short interval */ | |
5515061d | 3210 | if (prepare_kswapd_sleep(pgdat, order, remaining, classzone_idx)) { |
f0bc0a60 KM |
3211 | remaining = schedule_timeout(HZ/10); |
3212 | finish_wait(&pgdat->kswapd_wait, &wait); | |
3213 | prepare_to_wait(&pgdat->kswapd_wait, &wait, TASK_INTERRUPTIBLE); | |
3214 | } | |
3215 | ||
3216 | /* | |
3217 | * After a short sleep, check if it was a premature sleep. If not, then | |
3218 | * go fully to sleep until explicitly woken up. | |
3219 | */ | |
5515061d | 3220 | if (prepare_kswapd_sleep(pgdat, order, remaining, classzone_idx)) { |
f0bc0a60 KM |
3221 | trace_mm_vmscan_kswapd_sleep(pgdat->node_id); |
3222 | ||
3223 | /* | |
3224 | * vmstat counters are not perfectly accurate and the estimated | |
3225 | * value for counters such as NR_FREE_PAGES can deviate from the | |
3226 | * true value by nr_online_cpus * threshold. To avoid the zone | |
3227 | * watermarks being breached while under pressure, we reduce the | |
3228 | * per-cpu vmstat threshold while kswapd is awake and restore | |
3229 | * them before going back to sleep. | |
3230 | */ | |
3231 | set_pgdat_percpu_threshold(pgdat, calculate_normal_threshold); | |
1c7e7f6c | 3232 | |
62997027 MG |
3233 | /* |
3234 | * Compaction records what page blocks it recently failed to | |
3235 | * isolate pages from and skips them in the future scanning. | |
3236 | * When kswapd is going to sleep, it is reasonable to assume | |
3237 | * that pages and compaction may succeed so reset the cache. | |
3238 | */ | |
3239 | reset_isolation_suitable(pgdat); | |
3240 | ||
1c7e7f6c AK |
3241 | if (!kthread_should_stop()) |
3242 | schedule(); | |
3243 | ||
f0bc0a60 KM |
3244 | set_pgdat_percpu_threshold(pgdat, calculate_pressure_threshold); |
3245 | } else { | |
3246 | if (remaining) | |
3247 | count_vm_event(KSWAPD_LOW_WMARK_HIT_QUICKLY); | |
3248 | else | |
3249 | count_vm_event(KSWAPD_HIGH_WMARK_HIT_QUICKLY); | |
3250 | } | |
3251 | finish_wait(&pgdat->kswapd_wait, &wait); | |
3252 | } | |
3253 | ||
1da177e4 LT |
3254 | /* |
3255 | * The background pageout daemon, started as a kernel thread | |
4f98a2fe | 3256 | * from the init process. |
1da177e4 LT |
3257 | * |
3258 | * This basically trickles out pages so that we have _some_ | |
3259 | * free memory available even if there is no other activity | |
3260 | * that frees anything up. This is needed for things like routing | |
3261 | * etc, where we otherwise might have all activity going on in | |
3262 | * asynchronous contexts that cannot page things out. | |
3263 | * | |
3264 | * If there are applications that are active memory-allocators | |
3265 | * (most normal use), this basically shouldn't matter. | |
3266 | */ | |
3267 | static int kswapd(void *p) | |
3268 | { | |
215ddd66 | 3269 | unsigned long order, new_order; |
d2ebd0f6 | 3270 | unsigned balanced_order; |
215ddd66 | 3271 | int classzone_idx, new_classzone_idx; |
d2ebd0f6 | 3272 | int balanced_classzone_idx; |
1da177e4 LT |
3273 | pg_data_t *pgdat = (pg_data_t*)p; |
3274 | struct task_struct *tsk = current; | |
f0bc0a60 | 3275 | |
1da177e4 LT |
3276 | struct reclaim_state reclaim_state = { |
3277 | .reclaimed_slab = 0, | |
3278 | }; | |
a70f7302 | 3279 | const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id); |
1da177e4 | 3280 | |
cf40bd16 NP |
3281 | lockdep_set_current_reclaim_state(GFP_KERNEL); |
3282 | ||
174596a0 | 3283 | if (!cpumask_empty(cpumask)) |
c5f59f08 | 3284 | set_cpus_allowed_ptr(tsk, cpumask); |
1da177e4 LT |
3285 | current->reclaim_state = &reclaim_state; |
3286 | ||
3287 | /* | |
3288 | * Tell the memory management that we're a "memory allocator", | |
3289 | * and that if we need more memory we should get access to it | |
3290 | * regardless (see "__alloc_pages()"). "kswapd" should | |
3291 | * never get caught in the normal page freeing logic. | |
3292 | * | |
3293 | * (Kswapd normally doesn't need memory anyway, but sometimes | |
3294 | * you need a small amount of memory in order to be able to | |
3295 | * page out something else, and this flag essentially protects | |
3296 | * us from recursively trying to free more memory as we're | |
3297 | * trying to free the first piece of memory in the first place). | |
3298 | */ | |
930d9152 | 3299 | tsk->flags |= PF_MEMALLOC | PF_SWAPWRITE | PF_KSWAPD; |
83144186 | 3300 | set_freezable(); |
1da177e4 | 3301 | |
215ddd66 | 3302 | order = new_order = 0; |
d2ebd0f6 | 3303 | balanced_order = 0; |
215ddd66 | 3304 | classzone_idx = new_classzone_idx = pgdat->nr_zones - 1; |
d2ebd0f6 | 3305 | balanced_classzone_idx = classzone_idx; |
1da177e4 | 3306 | for ( ; ; ) { |
6f6313d4 | 3307 | bool ret; |
3e1d1d28 | 3308 | |
215ddd66 MG |
3309 | /* |
3310 | * If the last balance_pgdat was unsuccessful it's unlikely a | |
3311 | * new request of a similar or harder type will succeed soon | |
3312 | * so consider going to sleep on the basis we reclaimed at | |
3313 | */ | |
d2ebd0f6 AS |
3314 | if (balanced_classzone_idx >= new_classzone_idx && |
3315 | balanced_order == new_order) { | |
215ddd66 MG |
3316 | new_order = pgdat->kswapd_max_order; |
3317 | new_classzone_idx = pgdat->classzone_idx; | |
3318 | pgdat->kswapd_max_order = 0; | |
3319 | pgdat->classzone_idx = pgdat->nr_zones - 1; | |
3320 | } | |
3321 | ||
99504748 | 3322 | if (order < new_order || classzone_idx > new_classzone_idx) { |
1da177e4 LT |
3323 | /* |
3324 | * Don't sleep if someone wants a larger 'order' | |
99504748 | 3325 | * allocation or has tigher zone constraints |
1da177e4 LT |
3326 | */ |
3327 | order = new_order; | |
99504748 | 3328 | classzone_idx = new_classzone_idx; |
1da177e4 | 3329 | } else { |
d2ebd0f6 AS |
3330 | kswapd_try_to_sleep(pgdat, balanced_order, |
3331 | balanced_classzone_idx); | |
1da177e4 | 3332 | order = pgdat->kswapd_max_order; |
99504748 | 3333 | classzone_idx = pgdat->classzone_idx; |
f0dfcde0 AS |
3334 | new_order = order; |
3335 | new_classzone_idx = classzone_idx; | |
4d40502e | 3336 | pgdat->kswapd_max_order = 0; |
215ddd66 | 3337 | pgdat->classzone_idx = pgdat->nr_zones - 1; |
1da177e4 | 3338 | } |
1da177e4 | 3339 | |
8fe23e05 DR |
3340 | ret = try_to_freeze(); |
3341 | if (kthread_should_stop()) | |
3342 | break; | |
3343 | ||
3344 | /* | |
3345 | * We can speed up thawing tasks if we don't call balance_pgdat | |
3346 | * after returning from the refrigerator | |
3347 | */ | |
33906bc5 MG |
3348 | if (!ret) { |
3349 | trace_mm_vmscan_kswapd_wake(pgdat->node_id, order); | |
d2ebd0f6 AS |
3350 | balanced_classzone_idx = classzone_idx; |
3351 | balanced_order = balance_pgdat(pgdat, order, | |
3352 | &balanced_classzone_idx); | |
33906bc5 | 3353 | } |
1da177e4 | 3354 | } |
b0a8cc58 | 3355 | |
71abdc15 | 3356 | tsk->flags &= ~(PF_MEMALLOC | PF_SWAPWRITE | PF_KSWAPD); |
b0a8cc58 | 3357 | current->reclaim_state = NULL; |
71abdc15 JW |
3358 | lockdep_clear_current_reclaim_state(); |
3359 | ||
1da177e4 LT |
3360 | return 0; |
3361 | } | |
3362 | ||
3363 | /* | |
3364 | * A zone is low on free memory, so wake its kswapd task to service it. | |
3365 | */ | |
99504748 | 3366 | void wakeup_kswapd(struct zone *zone, int order, enum zone_type classzone_idx) |
1da177e4 LT |
3367 | { |
3368 | pg_data_t *pgdat; | |
3369 | ||
f3fe6512 | 3370 | if (!populated_zone(zone)) |
1da177e4 LT |
3371 | return; |
3372 | ||
88f5acf8 | 3373 | if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL)) |
1da177e4 | 3374 | return; |
88f5acf8 | 3375 | pgdat = zone->zone_pgdat; |
99504748 | 3376 | if (pgdat->kswapd_max_order < order) { |
1da177e4 | 3377 | pgdat->kswapd_max_order = order; |
99504748 MG |
3378 | pgdat->classzone_idx = min(pgdat->classzone_idx, classzone_idx); |
3379 | } | |
8d0986e2 | 3380 | if (!waitqueue_active(&pgdat->kswapd_wait)) |
1da177e4 | 3381 | return; |
892f795d | 3382 | if (zone_balanced(zone, order, 0, 0)) |
88f5acf8 MG |
3383 | return; |
3384 | ||
3385 | trace_mm_vmscan_wakeup_kswapd(pgdat->node_id, zone_idx(zone), order); | |
8d0986e2 | 3386 | wake_up_interruptible(&pgdat->kswapd_wait); |
1da177e4 LT |
3387 | } |
3388 | ||
c6f37f12 | 3389 | #ifdef CONFIG_HIBERNATION |
1da177e4 | 3390 | /* |
7b51755c | 3391 | * Try to free `nr_to_reclaim' of memory, system-wide, and return the number of |
d6277db4 RW |
3392 | * freed pages. |
3393 | * | |
3394 | * Rather than trying to age LRUs the aim is to preserve the overall | |
3395 | * LRU order by reclaiming preferentially | |
3396 | * inactive > active > active referenced > active mapped | |
1da177e4 | 3397 | */ |
7b51755c | 3398 | unsigned long shrink_all_memory(unsigned long nr_to_reclaim) |
1da177e4 | 3399 | { |
d6277db4 | 3400 | struct reclaim_state reclaim_state; |
d6277db4 | 3401 | struct scan_control sc = { |
ee814fe2 | 3402 | .nr_to_reclaim = nr_to_reclaim, |
7b51755c | 3403 | .gfp_mask = GFP_HIGHUSER_MOVABLE, |
ee814fe2 | 3404 | .priority = DEF_PRIORITY, |
d6277db4 | 3405 | .may_writepage = 1, |
ee814fe2 JW |
3406 | .may_unmap = 1, |
3407 | .may_swap = 1, | |
7b51755c | 3408 | .hibernation_mode = 1, |
1da177e4 | 3409 | }; |
a09ed5e0 | 3410 | struct zonelist *zonelist = node_zonelist(numa_node_id(), sc.gfp_mask); |
7b51755c KM |
3411 | struct task_struct *p = current; |
3412 | unsigned long nr_reclaimed; | |
1da177e4 | 3413 | |
7b51755c KM |
3414 | p->flags |= PF_MEMALLOC; |
3415 | lockdep_set_current_reclaim_state(sc.gfp_mask); | |
3416 | reclaim_state.reclaimed_slab = 0; | |
3417 | p->reclaim_state = &reclaim_state; | |
d6277db4 | 3418 | |
3115cd91 | 3419 | nr_reclaimed = do_try_to_free_pages(zonelist, &sc); |
d979677c | 3420 | |
7b51755c KM |
3421 | p->reclaim_state = NULL; |
3422 | lockdep_clear_current_reclaim_state(); | |
3423 | p->flags &= ~PF_MEMALLOC; | |
d6277db4 | 3424 | |
7b51755c | 3425 | return nr_reclaimed; |
1da177e4 | 3426 | } |
c6f37f12 | 3427 | #endif /* CONFIG_HIBERNATION */ |
1da177e4 | 3428 | |
1da177e4 LT |
3429 | /* It's optimal to keep kswapds on the same CPUs as their memory, but |
3430 | not required for correctness. So if the last cpu in a node goes | |
3431 | away, we get changed to run anywhere: as the first one comes back, | |
3432 | restore their cpu bindings. */ | |
fcb35a9b GKH |
3433 | static int cpu_callback(struct notifier_block *nfb, unsigned long action, |
3434 | void *hcpu) | |
1da177e4 | 3435 | { |
58c0a4a7 | 3436 | int nid; |
1da177e4 | 3437 | |
8bb78442 | 3438 | if (action == CPU_ONLINE || action == CPU_ONLINE_FROZEN) { |
48fb2e24 | 3439 | for_each_node_state(nid, N_MEMORY) { |
c5f59f08 | 3440 | pg_data_t *pgdat = NODE_DATA(nid); |
a70f7302 RR |
3441 | const struct cpumask *mask; |
3442 | ||
3443 | mask = cpumask_of_node(pgdat->node_id); | |
c5f59f08 | 3444 | |
3e597945 | 3445 | if (cpumask_any_and(cpu_online_mask, mask) < nr_cpu_ids) |
1da177e4 | 3446 | /* One of our CPUs online: restore mask */ |
c5f59f08 | 3447 | set_cpus_allowed_ptr(pgdat->kswapd, mask); |
1da177e4 LT |
3448 | } |
3449 | } | |
3450 | return NOTIFY_OK; | |
3451 | } | |
1da177e4 | 3452 | |
3218ae14 YG |
3453 | /* |
3454 | * This kswapd start function will be called by init and node-hot-add. | |
3455 | * On node-hot-add, kswapd will moved to proper cpus if cpus are hot-added. | |
3456 | */ | |
3457 | int kswapd_run(int nid) | |
3458 | { | |
3459 | pg_data_t *pgdat = NODE_DATA(nid); | |
3460 | int ret = 0; | |
3461 | ||
3462 | if (pgdat->kswapd) | |
3463 | return 0; | |
3464 | ||
3465 | pgdat->kswapd = kthread_run(kswapd, pgdat, "kswapd%d", nid); | |
3466 | if (IS_ERR(pgdat->kswapd)) { | |
3467 | /* failure at boot is fatal */ | |
3468 | BUG_ON(system_state == SYSTEM_BOOTING); | |
d5dc0ad9 GS |
3469 | pr_err("Failed to start kswapd on node %d\n", nid); |
3470 | ret = PTR_ERR(pgdat->kswapd); | |
d72515b8 | 3471 | pgdat->kswapd = NULL; |
3218ae14 YG |
3472 | } |
3473 | return ret; | |
3474 | } | |
3475 | ||
8fe23e05 | 3476 | /* |
d8adde17 | 3477 | * Called by memory hotplug when all memory in a node is offlined. Caller must |
bfc8c901 | 3478 | * hold mem_hotplug_begin/end(). |
8fe23e05 DR |
3479 | */ |
3480 | void kswapd_stop(int nid) | |
3481 | { | |
3482 | struct task_struct *kswapd = NODE_DATA(nid)->kswapd; | |
3483 | ||
d8adde17 | 3484 | if (kswapd) { |
8fe23e05 | 3485 | kthread_stop(kswapd); |
d8adde17 JL |
3486 | NODE_DATA(nid)->kswapd = NULL; |
3487 | } | |
8fe23e05 DR |
3488 | } |
3489 | ||
1da177e4 LT |
3490 | static int __init kswapd_init(void) |
3491 | { | |
3218ae14 | 3492 | int nid; |
69e05944 | 3493 | |
1da177e4 | 3494 | swap_setup(); |
48fb2e24 | 3495 | for_each_node_state(nid, N_MEMORY) |
3218ae14 | 3496 | kswapd_run(nid); |
1da177e4 LT |
3497 | hotcpu_notifier(cpu_callback, 0); |
3498 | return 0; | |
3499 | } | |
3500 | ||
3501 | module_init(kswapd_init) | |
9eeff239 CL |
3502 | |
3503 | #ifdef CONFIG_NUMA | |
3504 | /* | |
3505 | * Zone reclaim mode | |
3506 | * | |
3507 | * If non-zero call zone_reclaim when the number of free pages falls below | |
3508 | * the watermarks. | |
9eeff239 CL |
3509 | */ |
3510 | int zone_reclaim_mode __read_mostly; | |
3511 | ||
1b2ffb78 | 3512 | #define RECLAIM_OFF 0 |
7d03431c | 3513 | #define RECLAIM_ZONE (1<<0) /* Run shrink_inactive_list on the zone */ |
1b2ffb78 CL |
3514 | #define RECLAIM_WRITE (1<<1) /* Writeout pages during reclaim */ |
3515 | #define RECLAIM_SWAP (1<<2) /* Swap pages out during reclaim */ | |
3516 | ||
a92f7126 CL |
3517 | /* |
3518 | * Priority for ZONE_RECLAIM. This determines the fraction of pages | |
3519 | * of a node considered for each zone_reclaim. 4 scans 1/16th of | |
3520 | * a zone. | |
3521 | */ | |
3522 | #define ZONE_RECLAIM_PRIORITY 4 | |
3523 | ||
9614634f CL |
3524 | /* |
3525 | * Percentage of pages in a zone that must be unmapped for zone_reclaim to | |
3526 | * occur. | |
3527 | */ | |
3528 | int sysctl_min_unmapped_ratio = 1; | |
3529 | ||
0ff38490 CL |
3530 | /* |
3531 | * If the number of slab pages in a zone grows beyond this percentage then | |
3532 | * slab reclaim needs to occur. | |
3533 | */ | |
3534 | int sysctl_min_slab_ratio = 5; | |
3535 | ||
90afa5de MG |
3536 | static inline unsigned long zone_unmapped_file_pages(struct zone *zone) |
3537 | { | |
3538 | unsigned long file_mapped = zone_page_state(zone, NR_FILE_MAPPED); | |
3539 | unsigned long file_lru = zone_page_state(zone, NR_INACTIVE_FILE) + | |
3540 | zone_page_state(zone, NR_ACTIVE_FILE); | |
3541 | ||
3542 | /* | |
3543 | * It's possible for there to be more file mapped pages than | |
3544 | * accounted for by the pages on the file LRU lists because | |
3545 | * tmpfs pages accounted for as ANON can also be FILE_MAPPED | |
3546 | */ | |
3547 | return (file_lru > file_mapped) ? (file_lru - file_mapped) : 0; | |
3548 | } | |
3549 | ||
3550 | /* Work out how many page cache pages we can reclaim in this reclaim_mode */ | |
3551 | static long zone_pagecache_reclaimable(struct zone *zone) | |
3552 | { | |
3553 | long nr_pagecache_reclaimable; | |
3554 | long delta = 0; | |
3555 | ||
3556 | /* | |
3557 | * If RECLAIM_SWAP is set, then all file pages are considered | |
3558 | * potentially reclaimable. Otherwise, we have to worry about | |
3559 | * pages like swapcache and zone_unmapped_file_pages() provides | |
3560 | * a better estimate | |
3561 | */ | |
3562 | if (zone_reclaim_mode & RECLAIM_SWAP) | |
3563 | nr_pagecache_reclaimable = zone_page_state(zone, NR_FILE_PAGES); | |
3564 | else | |
3565 | nr_pagecache_reclaimable = zone_unmapped_file_pages(zone); | |
3566 | ||
3567 | /* If we can't clean pages, remove dirty pages from consideration */ | |
3568 | if (!(zone_reclaim_mode & RECLAIM_WRITE)) | |
3569 | delta += zone_page_state(zone, NR_FILE_DIRTY); | |
3570 | ||
3571 | /* Watch for any possible underflows due to delta */ | |
3572 | if (unlikely(delta > nr_pagecache_reclaimable)) | |
3573 | delta = nr_pagecache_reclaimable; | |
3574 | ||
3575 | return nr_pagecache_reclaimable - delta; | |
3576 | } | |
3577 | ||
9eeff239 CL |
3578 | /* |
3579 | * Try to free up some pages from this zone through reclaim. | |
3580 | */ | |
179e9639 | 3581 | static int __zone_reclaim(struct zone *zone, gfp_t gfp_mask, unsigned int order) |
9eeff239 | 3582 | { |
7fb2d46d | 3583 | /* Minimum pages needed in order to stay on node */ |
69e05944 | 3584 | const unsigned long nr_pages = 1 << order; |
9eeff239 CL |
3585 | struct task_struct *p = current; |
3586 | struct reclaim_state reclaim_state; | |
179e9639 | 3587 | struct scan_control sc = { |
62b726c1 | 3588 | .nr_to_reclaim = max(nr_pages, SWAP_CLUSTER_MAX), |
21caf2fc | 3589 | .gfp_mask = (gfp_mask = memalloc_noio_flags(gfp_mask)), |
bd2f6199 | 3590 | .order = order, |
9e3b2f8c | 3591 | .priority = ZONE_RECLAIM_PRIORITY, |
ee814fe2 JW |
3592 | .may_writepage = !!(zone_reclaim_mode & RECLAIM_WRITE), |
3593 | .may_unmap = !!(zone_reclaim_mode & RECLAIM_SWAP), | |
3594 | .may_swap = 1, | |
179e9639 | 3595 | }; |
a09ed5e0 YH |
3596 | struct shrink_control shrink = { |
3597 | .gfp_mask = sc.gfp_mask, | |
3598 | }; | |
15748048 | 3599 | unsigned long nr_slab_pages0, nr_slab_pages1; |
9eeff239 | 3600 | |
9eeff239 | 3601 | cond_resched(); |
d4f7796e CL |
3602 | /* |
3603 | * We need to be able to allocate from the reserves for RECLAIM_SWAP | |
3604 | * and we also need to be able to write out pages for RECLAIM_WRITE | |
3605 | * and RECLAIM_SWAP. | |
3606 | */ | |
3607 | p->flags |= PF_MEMALLOC | PF_SWAPWRITE; | |
76ca542d | 3608 | lockdep_set_current_reclaim_state(gfp_mask); |
9eeff239 CL |
3609 | reclaim_state.reclaimed_slab = 0; |
3610 | p->reclaim_state = &reclaim_state; | |
c84db23c | 3611 | |
90afa5de | 3612 | if (zone_pagecache_reclaimable(zone) > zone->min_unmapped_pages) { |
0ff38490 CL |
3613 | /* |
3614 | * Free memory by calling shrink zone with increasing | |
3615 | * priorities until we have enough memory freed. | |
3616 | */ | |
0ff38490 | 3617 | do { |
9e3b2f8c KK |
3618 | shrink_zone(zone, &sc); |
3619 | } while (sc.nr_reclaimed < nr_pages && --sc.priority >= 0); | |
0ff38490 | 3620 | } |
c84db23c | 3621 | |
15748048 KM |
3622 | nr_slab_pages0 = zone_page_state(zone, NR_SLAB_RECLAIMABLE); |
3623 | if (nr_slab_pages0 > zone->min_slab_pages) { | |
2a16e3f4 | 3624 | /* |
7fb2d46d | 3625 | * shrink_slab() does not currently allow us to determine how |
0ff38490 CL |
3626 | * many pages were freed in this zone. So we take the current |
3627 | * number of slab pages and shake the slab until it is reduced | |
3628 | * by the same nr_pages that we used for reclaiming unmapped | |
3629 | * pages. | |
2a16e3f4 | 3630 | */ |
0ce3d744 DC |
3631 | nodes_clear(shrink.nodes_to_scan); |
3632 | node_set(zone_to_nid(zone), shrink.nodes_to_scan); | |
4dc4b3d9 KM |
3633 | for (;;) { |
3634 | unsigned long lru_pages = zone_reclaimable_pages(zone); | |
3635 | ||
3636 | /* No reclaimable slab or very low memory pressure */ | |
1495f230 | 3637 | if (!shrink_slab(&shrink, sc.nr_scanned, lru_pages)) |
4dc4b3d9 KM |
3638 | break; |
3639 | ||
3640 | /* Freed enough memory */ | |
3641 | nr_slab_pages1 = zone_page_state(zone, | |
3642 | NR_SLAB_RECLAIMABLE); | |
3643 | if (nr_slab_pages1 + nr_pages <= nr_slab_pages0) | |
3644 | break; | |
3645 | } | |
83e33a47 CL |
3646 | |
3647 | /* | |
3648 | * Update nr_reclaimed by the number of slab pages we | |
3649 | * reclaimed from this zone. | |
3650 | */ | |
15748048 KM |
3651 | nr_slab_pages1 = zone_page_state(zone, NR_SLAB_RECLAIMABLE); |
3652 | if (nr_slab_pages1 < nr_slab_pages0) | |
3653 | sc.nr_reclaimed += nr_slab_pages0 - nr_slab_pages1; | |
2a16e3f4 CL |
3654 | } |
3655 | ||
9eeff239 | 3656 | p->reclaim_state = NULL; |
d4f7796e | 3657 | current->flags &= ~(PF_MEMALLOC | PF_SWAPWRITE); |
76ca542d | 3658 | lockdep_clear_current_reclaim_state(); |
a79311c1 | 3659 | return sc.nr_reclaimed >= nr_pages; |
9eeff239 | 3660 | } |
179e9639 AM |
3661 | |
3662 | int zone_reclaim(struct zone *zone, gfp_t gfp_mask, unsigned int order) | |
3663 | { | |
179e9639 | 3664 | int node_id; |
d773ed6b | 3665 | int ret; |
179e9639 AM |
3666 | |
3667 | /* | |
0ff38490 CL |
3668 | * Zone reclaim reclaims unmapped file backed pages and |
3669 | * slab pages if we are over the defined limits. | |
34aa1330 | 3670 | * |
9614634f CL |
3671 | * A small portion of unmapped file backed pages is needed for |
3672 | * file I/O otherwise pages read by file I/O will be immediately | |
3673 | * thrown out if the zone is overallocated. So we do not reclaim | |
3674 | * if less than a specified percentage of the zone is used by | |
3675 | * unmapped file backed pages. | |
179e9639 | 3676 | */ |
90afa5de MG |
3677 | if (zone_pagecache_reclaimable(zone) <= zone->min_unmapped_pages && |
3678 | zone_page_state(zone, NR_SLAB_RECLAIMABLE) <= zone->min_slab_pages) | |
fa5e084e | 3679 | return ZONE_RECLAIM_FULL; |
179e9639 | 3680 | |
6e543d57 | 3681 | if (!zone_reclaimable(zone)) |
fa5e084e | 3682 | return ZONE_RECLAIM_FULL; |
d773ed6b | 3683 | |
179e9639 | 3684 | /* |
d773ed6b | 3685 | * Do not scan if the allocation should not be delayed. |
179e9639 | 3686 | */ |
d773ed6b | 3687 | if (!(gfp_mask & __GFP_WAIT) || (current->flags & PF_MEMALLOC)) |
fa5e084e | 3688 | return ZONE_RECLAIM_NOSCAN; |
179e9639 AM |
3689 | |
3690 | /* | |
3691 | * Only run zone reclaim on the local zone or on zones that do not | |
3692 | * have associated processors. This will favor the local processor | |
3693 | * over remote processors and spread off node memory allocations | |
3694 | * as wide as possible. | |
3695 | */ | |
89fa3024 | 3696 | node_id = zone_to_nid(zone); |
37c0708d | 3697 | if (node_state(node_id, N_CPU) && node_id != numa_node_id()) |
fa5e084e | 3698 | return ZONE_RECLAIM_NOSCAN; |
d773ed6b DR |
3699 | |
3700 | if (zone_test_and_set_flag(zone, ZONE_RECLAIM_LOCKED)) | |
fa5e084e MG |
3701 | return ZONE_RECLAIM_NOSCAN; |
3702 | ||
d773ed6b DR |
3703 | ret = __zone_reclaim(zone, gfp_mask, order); |
3704 | zone_clear_flag(zone, ZONE_RECLAIM_LOCKED); | |
3705 | ||
24cf7251 MG |
3706 | if (!ret) |
3707 | count_vm_event(PGSCAN_ZONE_RECLAIM_FAILED); | |
3708 | ||
d773ed6b | 3709 | return ret; |
179e9639 | 3710 | } |
9eeff239 | 3711 | #endif |
894bc310 | 3712 | |
894bc310 LS |
3713 | /* |
3714 | * page_evictable - test whether a page is evictable | |
3715 | * @page: the page to test | |
894bc310 LS |
3716 | * |
3717 | * Test whether page is evictable--i.e., should be placed on active/inactive | |
39b5f29a | 3718 | * lists vs unevictable list. |
894bc310 LS |
3719 | * |
3720 | * Reasons page might not be evictable: | |
ba9ddf49 | 3721 | * (1) page's mapping marked unevictable |
b291f000 | 3722 | * (2) page is part of an mlocked VMA |
ba9ddf49 | 3723 | * |
894bc310 | 3724 | */ |
39b5f29a | 3725 | int page_evictable(struct page *page) |
894bc310 | 3726 | { |
39b5f29a | 3727 | return !mapping_unevictable(page_mapping(page)) && !PageMlocked(page); |
894bc310 | 3728 | } |
89e004ea | 3729 | |
85046579 | 3730 | #ifdef CONFIG_SHMEM |
89e004ea | 3731 | /** |
24513264 HD |
3732 | * check_move_unevictable_pages - check pages for evictability and move to appropriate zone lru list |
3733 | * @pages: array of pages to check | |
3734 | * @nr_pages: number of pages to check | |
89e004ea | 3735 | * |
24513264 | 3736 | * Checks pages for evictability and moves them to the appropriate lru list. |
85046579 HD |
3737 | * |
3738 | * This function is only used for SysV IPC SHM_UNLOCK. | |
89e004ea | 3739 | */ |
24513264 | 3740 | void check_move_unevictable_pages(struct page **pages, int nr_pages) |
89e004ea | 3741 | { |
925b7673 | 3742 | struct lruvec *lruvec; |
24513264 HD |
3743 | struct zone *zone = NULL; |
3744 | int pgscanned = 0; | |
3745 | int pgrescued = 0; | |
3746 | int i; | |
89e004ea | 3747 | |
24513264 HD |
3748 | for (i = 0; i < nr_pages; i++) { |
3749 | struct page *page = pages[i]; | |
3750 | struct zone *pagezone; | |
89e004ea | 3751 | |
24513264 HD |
3752 | pgscanned++; |
3753 | pagezone = page_zone(page); | |
3754 | if (pagezone != zone) { | |
3755 | if (zone) | |
3756 | spin_unlock_irq(&zone->lru_lock); | |
3757 | zone = pagezone; | |
3758 | spin_lock_irq(&zone->lru_lock); | |
3759 | } | |
fa9add64 | 3760 | lruvec = mem_cgroup_page_lruvec(page, zone); |
89e004ea | 3761 | |
24513264 HD |
3762 | if (!PageLRU(page) || !PageUnevictable(page)) |
3763 | continue; | |
89e004ea | 3764 | |
39b5f29a | 3765 | if (page_evictable(page)) { |
24513264 HD |
3766 | enum lru_list lru = page_lru_base_type(page); |
3767 | ||
309381fe | 3768 | VM_BUG_ON_PAGE(PageActive(page), page); |
24513264 | 3769 | ClearPageUnevictable(page); |
fa9add64 HD |
3770 | del_page_from_lru_list(page, lruvec, LRU_UNEVICTABLE); |
3771 | add_page_to_lru_list(page, lruvec, lru); | |
24513264 | 3772 | pgrescued++; |
89e004ea | 3773 | } |
24513264 | 3774 | } |
89e004ea | 3775 | |
24513264 HD |
3776 | if (zone) { |
3777 | __count_vm_events(UNEVICTABLE_PGRESCUED, pgrescued); | |
3778 | __count_vm_events(UNEVICTABLE_PGSCANNED, pgscanned); | |
3779 | spin_unlock_irq(&zone->lru_lock); | |
89e004ea | 3780 | } |
89e004ea | 3781 | } |
85046579 | 3782 | #endif /* CONFIG_SHMEM */ |
af936a16 | 3783 | |
264e56d8 | 3784 | static void warn_scan_unevictable_pages(void) |
af936a16 | 3785 | { |
264e56d8 | 3786 | printk_once(KERN_WARNING |
25bd91bd | 3787 | "%s: The scan_unevictable_pages sysctl/node-interface has been " |
264e56d8 | 3788 | "disabled for lack of a legitimate use case. If you have " |
25bd91bd KM |
3789 | "one, please send an email to linux-mm@kvack.org.\n", |
3790 | current->comm); | |
af936a16 LS |
3791 | } |
3792 | ||
3793 | /* | |
3794 | * scan_unevictable_pages [vm] sysctl handler. On demand re-scan of | |
3795 | * all nodes' unevictable lists for evictable pages | |
3796 | */ | |
3797 | unsigned long scan_unevictable_pages; | |
3798 | ||
3799 | int scan_unevictable_handler(struct ctl_table *table, int write, | |
8d65af78 | 3800 | void __user *buffer, |
af936a16 LS |
3801 | size_t *length, loff_t *ppos) |
3802 | { | |
264e56d8 | 3803 | warn_scan_unevictable_pages(); |
8d65af78 | 3804 | proc_doulongvec_minmax(table, write, buffer, length, ppos); |
af936a16 LS |
3805 | scan_unevictable_pages = 0; |
3806 | return 0; | |
3807 | } | |
3808 | ||
e4455abb | 3809 | #ifdef CONFIG_NUMA |
af936a16 LS |
3810 | /* |
3811 | * per node 'scan_unevictable_pages' attribute. On demand re-scan of | |
3812 | * a specified node's per zone unevictable lists for evictable pages. | |
3813 | */ | |
3814 | ||
10fbcf4c KS |
3815 | static ssize_t read_scan_unevictable_node(struct device *dev, |
3816 | struct device_attribute *attr, | |
af936a16 LS |
3817 | char *buf) |
3818 | { | |
264e56d8 | 3819 | warn_scan_unevictable_pages(); |
af936a16 LS |
3820 | return sprintf(buf, "0\n"); /* always zero; should fit... */ |
3821 | } | |
3822 | ||
10fbcf4c KS |
3823 | static ssize_t write_scan_unevictable_node(struct device *dev, |
3824 | struct device_attribute *attr, | |
af936a16 LS |
3825 | const char *buf, size_t count) |
3826 | { | |
264e56d8 | 3827 | warn_scan_unevictable_pages(); |
af936a16 LS |
3828 | return 1; |
3829 | } | |
3830 | ||
3831 | ||
10fbcf4c | 3832 | static DEVICE_ATTR(scan_unevictable_pages, S_IRUGO | S_IWUSR, |
af936a16 LS |
3833 | read_scan_unevictable_node, |
3834 | write_scan_unevictable_node); | |
3835 | ||
3836 | int scan_unevictable_register_node(struct node *node) | |
3837 | { | |
10fbcf4c | 3838 | return device_create_file(&node->dev, &dev_attr_scan_unevictable_pages); |
af936a16 LS |
3839 | } |
3840 | ||
3841 | void scan_unevictable_unregister_node(struct node *node) | |
3842 | { | |
10fbcf4c | 3843 | device_remove_file(&node->dev, &dev_attr_scan_unevictable_pages); |
af936a16 | 3844 | } |
e4455abb | 3845 | #endif |