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