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> | |
e129b5c2 | 22 | #include <linux/vmstat.h> |
1da177e4 LT |
23 | #include <linux/file.h> |
24 | #include <linux/writeback.h> | |
25 | #include <linux/blkdev.h> | |
26 | #include <linux/buffer_head.h> /* for try_to_release_page(), | |
27 | buffer_heads_over_limit */ | |
28 | #include <linux/mm_inline.h> | |
29 | #include <linux/pagevec.h> | |
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> | |
35 | #include <linux/notifier.h> | |
36 | #include <linux/rwsem.h> | |
248a0301 | 37 | #include <linux/delay.h> |
3218ae14 | 38 | #include <linux/kthread.h> |
7dfb7103 | 39 | #include <linux/freezer.h> |
66e1707b | 40 | #include <linux/memcontrol.h> |
873b4771 | 41 | #include <linux/delayacct.h> |
af936a16 | 42 | #include <linux/sysctl.h> |
1da177e4 LT |
43 | |
44 | #include <asm/tlbflush.h> | |
45 | #include <asm/div64.h> | |
46 | ||
47 | #include <linux/swapops.h> | |
48 | ||
0f8053a5 NP |
49 | #include "internal.h" |
50 | ||
1da177e4 | 51 | struct scan_control { |
1da177e4 LT |
52 | /* Incremented by the number of inactive pages that were scanned */ |
53 | unsigned long nr_scanned; | |
54 | ||
a79311c1 RR |
55 | /* Number of pages freed so far during a call to shrink_zones() */ |
56 | unsigned long nr_reclaimed; | |
57 | ||
22fba335 KM |
58 | /* How many pages shrink_list() should reclaim */ |
59 | unsigned long nr_to_reclaim; | |
60 | ||
7b51755c KM |
61 | unsigned long hibernation_mode; |
62 | ||
1da177e4 | 63 | /* This context's GFP mask */ |
6daa0e28 | 64 | gfp_t gfp_mask; |
1da177e4 LT |
65 | |
66 | int may_writepage; | |
67 | ||
a6dc60f8 JW |
68 | /* Can mapped pages be reclaimed? */ |
69 | int may_unmap; | |
f1fd1067 | 70 | |
2e2e4259 KM |
71 | /* Can pages be swapped as part of reclaim? */ |
72 | int may_swap; | |
73 | ||
d6277db4 | 74 | int swappiness; |
408d8544 | 75 | |
5ad333eb | 76 | int order; |
66e1707b | 77 | |
5f53e762 KM |
78 | /* |
79 | * Intend to reclaim enough contenious memory rather than to reclaim | |
80 | * enough amount memory. I.e, it's the mode for high order allocation. | |
81 | */ | |
82 | bool lumpy_reclaim_mode; | |
83 | ||
66e1707b BS |
84 | /* Which cgroup do we reclaim from */ |
85 | struct mem_cgroup *mem_cgroup; | |
86 | ||
327c0e96 KH |
87 | /* |
88 | * Nodemask of nodes allowed by the caller. If NULL, all nodes | |
89 | * are scanned. | |
90 | */ | |
91 | nodemask_t *nodemask; | |
1da177e4 LT |
92 | }; |
93 | ||
1da177e4 LT |
94 | #define lru_to_page(_head) (list_entry((_head)->prev, struct page, lru)) |
95 | ||
96 | #ifdef ARCH_HAS_PREFETCH | |
97 | #define prefetch_prev_lru_page(_page, _base, _field) \ | |
98 | do { \ | |
99 | if ((_page)->lru.prev != _base) { \ | |
100 | struct page *prev; \ | |
101 | \ | |
102 | prev = lru_to_page(&(_page->lru)); \ | |
103 | prefetch(&prev->_field); \ | |
104 | } \ | |
105 | } while (0) | |
106 | #else | |
107 | #define prefetch_prev_lru_page(_page, _base, _field) do { } while (0) | |
108 | #endif | |
109 | ||
110 | #ifdef ARCH_HAS_PREFETCHW | |
111 | #define prefetchw_prev_lru_page(_page, _base, _field) \ | |
112 | do { \ | |
113 | if ((_page)->lru.prev != _base) { \ | |
114 | struct page *prev; \ | |
115 | \ | |
116 | prev = lru_to_page(&(_page->lru)); \ | |
117 | prefetchw(&prev->_field); \ | |
118 | } \ | |
119 | } while (0) | |
120 | #else | |
121 | #define prefetchw_prev_lru_page(_page, _base, _field) do { } while (0) | |
122 | #endif | |
123 | ||
124 | /* | |
125 | * From 0 .. 100. Higher means more swappy. | |
126 | */ | |
127 | int vm_swappiness = 60; | |
bd1e22b8 | 128 | long vm_total_pages; /* The total number of pages which the VM controls */ |
1da177e4 LT |
129 | |
130 | static LIST_HEAD(shrinker_list); | |
131 | static DECLARE_RWSEM(shrinker_rwsem); | |
132 | ||
00f0b825 | 133 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR |
e72e2bd6 | 134 | #define scanning_global_lru(sc) (!(sc)->mem_cgroup) |
91a45470 | 135 | #else |
e72e2bd6 | 136 | #define scanning_global_lru(sc) (1) |
91a45470 KH |
137 | #endif |
138 | ||
6e901571 KM |
139 | static struct zone_reclaim_stat *get_reclaim_stat(struct zone *zone, |
140 | struct scan_control *sc) | |
141 | { | |
e72e2bd6 | 142 | if (!scanning_global_lru(sc)) |
3e2f41f1 KM |
143 | return mem_cgroup_get_reclaim_stat(sc->mem_cgroup, zone); |
144 | ||
6e901571 KM |
145 | return &zone->reclaim_stat; |
146 | } | |
147 | ||
0b217676 VL |
148 | static unsigned long zone_nr_lru_pages(struct zone *zone, |
149 | struct scan_control *sc, enum lru_list lru) | |
c9f299d9 | 150 | { |
e72e2bd6 | 151 | if (!scanning_global_lru(sc)) |
a3d8e054 KM |
152 | return mem_cgroup_zone_nr_pages(sc->mem_cgroup, zone, lru); |
153 | ||
c9f299d9 KM |
154 | return zone_page_state(zone, NR_LRU_BASE + lru); |
155 | } | |
156 | ||
157 | ||
1da177e4 LT |
158 | /* |
159 | * Add a shrinker callback to be called from the vm | |
160 | */ | |
8e1f936b | 161 | void register_shrinker(struct shrinker *shrinker) |
1da177e4 | 162 | { |
8e1f936b RR |
163 | shrinker->nr = 0; |
164 | down_write(&shrinker_rwsem); | |
165 | list_add_tail(&shrinker->list, &shrinker_list); | |
166 | up_write(&shrinker_rwsem); | |
1da177e4 | 167 | } |
8e1f936b | 168 | EXPORT_SYMBOL(register_shrinker); |
1da177e4 LT |
169 | |
170 | /* | |
171 | * Remove one | |
172 | */ | |
8e1f936b | 173 | void unregister_shrinker(struct shrinker *shrinker) |
1da177e4 LT |
174 | { |
175 | down_write(&shrinker_rwsem); | |
176 | list_del(&shrinker->list); | |
177 | up_write(&shrinker_rwsem); | |
1da177e4 | 178 | } |
8e1f936b | 179 | EXPORT_SYMBOL(unregister_shrinker); |
1da177e4 LT |
180 | |
181 | #define SHRINK_BATCH 128 | |
182 | /* | |
183 | * Call the shrink functions to age shrinkable caches | |
184 | * | |
185 | * Here we assume it costs one seek to replace a lru page and that it also | |
186 | * takes a seek to recreate a cache object. With this in mind we age equal | |
187 | * percentages of the lru and ageable caches. This should balance the seeks | |
188 | * generated by these structures. | |
189 | * | |
183ff22b | 190 | * If the vm encountered mapped pages on the LRU it increase the pressure on |
1da177e4 LT |
191 | * slab to avoid swapping. |
192 | * | |
193 | * We do weird things to avoid (scanned*seeks*entries) overflowing 32 bits. | |
194 | * | |
195 | * `lru_pages' represents the number of on-LRU pages in all the zones which | |
196 | * are eligible for the caller's allocation attempt. It is used for balancing | |
197 | * slab reclaim versus page reclaim. | |
b15e0905 | 198 | * |
199 | * Returns the number of slab objects which we shrunk. | |
1da177e4 | 200 | */ |
69e05944 AM |
201 | unsigned long shrink_slab(unsigned long scanned, gfp_t gfp_mask, |
202 | unsigned long lru_pages) | |
1da177e4 LT |
203 | { |
204 | struct shrinker *shrinker; | |
69e05944 | 205 | unsigned long ret = 0; |
1da177e4 LT |
206 | |
207 | if (scanned == 0) | |
208 | scanned = SWAP_CLUSTER_MAX; | |
209 | ||
210 | if (!down_read_trylock(&shrinker_rwsem)) | |
b15e0905 | 211 | return 1; /* Assume we'll be able to shrink next time */ |
1da177e4 LT |
212 | |
213 | list_for_each_entry(shrinker, &shrinker_list, list) { | |
214 | unsigned long long delta; | |
215 | unsigned long total_scan; | |
8e1f936b | 216 | unsigned long max_pass = (*shrinker->shrink)(0, gfp_mask); |
1da177e4 LT |
217 | |
218 | delta = (4 * scanned) / shrinker->seeks; | |
ea164d73 | 219 | delta *= max_pass; |
1da177e4 LT |
220 | do_div(delta, lru_pages + 1); |
221 | shrinker->nr += delta; | |
ea164d73 | 222 | if (shrinker->nr < 0) { |
88c3bd70 DR |
223 | printk(KERN_ERR "shrink_slab: %pF negative objects to " |
224 | "delete nr=%ld\n", | |
225 | shrinker->shrink, shrinker->nr); | |
ea164d73 AA |
226 | shrinker->nr = max_pass; |
227 | } | |
228 | ||
229 | /* | |
230 | * Avoid risking looping forever due to too large nr value: | |
231 | * never try to free more than twice the estimate number of | |
232 | * freeable entries. | |
233 | */ | |
234 | if (shrinker->nr > max_pass * 2) | |
235 | shrinker->nr = max_pass * 2; | |
1da177e4 LT |
236 | |
237 | total_scan = shrinker->nr; | |
238 | shrinker->nr = 0; | |
239 | ||
240 | while (total_scan >= SHRINK_BATCH) { | |
241 | long this_scan = SHRINK_BATCH; | |
242 | int shrink_ret; | |
b15e0905 | 243 | int nr_before; |
1da177e4 | 244 | |
8e1f936b RR |
245 | nr_before = (*shrinker->shrink)(0, gfp_mask); |
246 | shrink_ret = (*shrinker->shrink)(this_scan, gfp_mask); | |
1da177e4 LT |
247 | if (shrink_ret == -1) |
248 | break; | |
b15e0905 | 249 | if (shrink_ret < nr_before) |
250 | ret += nr_before - shrink_ret; | |
f8891e5e | 251 | count_vm_events(SLABS_SCANNED, this_scan); |
1da177e4 LT |
252 | total_scan -= this_scan; |
253 | ||
254 | cond_resched(); | |
255 | } | |
256 | ||
257 | shrinker->nr += total_scan; | |
258 | } | |
259 | up_read(&shrinker_rwsem); | |
b15e0905 | 260 | return ret; |
1da177e4 LT |
261 | } |
262 | ||
1da177e4 LT |
263 | static inline int is_page_cache_freeable(struct page *page) |
264 | { | |
ceddc3a5 JW |
265 | /* |
266 | * A freeable page cache page is referenced only by the caller | |
267 | * that isolated the page, the page cache radix tree and | |
268 | * optional buffer heads at page->private. | |
269 | */ | |
edcf4748 | 270 | return page_count(page) - page_has_private(page) == 2; |
1da177e4 LT |
271 | } |
272 | ||
273 | static int may_write_to_queue(struct backing_dev_info *bdi) | |
274 | { | |
930d9152 | 275 | if (current->flags & PF_SWAPWRITE) |
1da177e4 LT |
276 | return 1; |
277 | if (!bdi_write_congested(bdi)) | |
278 | return 1; | |
279 | if (bdi == current->backing_dev_info) | |
280 | return 1; | |
281 | return 0; | |
282 | } | |
283 | ||
284 | /* | |
285 | * We detected a synchronous write error writing a page out. Probably | |
286 | * -ENOSPC. We need to propagate that into the address_space for a subsequent | |
287 | * fsync(), msync() or close(). | |
288 | * | |
289 | * The tricky part is that after writepage we cannot touch the mapping: nothing | |
290 | * prevents it from being freed up. But we have a ref on the page and once | |
291 | * that page is locked, the mapping is pinned. | |
292 | * | |
293 | * We're allowed to run sleeping lock_page() here because we know the caller has | |
294 | * __GFP_FS. | |
295 | */ | |
296 | static void handle_write_error(struct address_space *mapping, | |
297 | struct page *page, int error) | |
298 | { | |
299 | lock_page(page); | |
3e9f45bd GC |
300 | if (page_mapping(page) == mapping) |
301 | mapping_set_error(mapping, error); | |
1da177e4 LT |
302 | unlock_page(page); |
303 | } | |
304 | ||
c661b078 AW |
305 | /* Request for sync pageout. */ |
306 | enum pageout_io { | |
307 | PAGEOUT_IO_ASYNC, | |
308 | PAGEOUT_IO_SYNC, | |
309 | }; | |
310 | ||
04e62a29 CL |
311 | /* possible outcome of pageout() */ |
312 | typedef enum { | |
313 | /* failed to write page out, page is locked */ | |
314 | PAGE_KEEP, | |
315 | /* move page to the active list, page is locked */ | |
316 | PAGE_ACTIVATE, | |
317 | /* page has been sent to the disk successfully, page is unlocked */ | |
318 | PAGE_SUCCESS, | |
319 | /* page is clean and locked */ | |
320 | PAGE_CLEAN, | |
321 | } pageout_t; | |
322 | ||
1da177e4 | 323 | /* |
1742f19f AM |
324 | * pageout is called by shrink_page_list() for each dirty page. |
325 | * Calls ->writepage(). | |
1da177e4 | 326 | */ |
c661b078 AW |
327 | static pageout_t pageout(struct page *page, struct address_space *mapping, |
328 | enum pageout_io sync_writeback) | |
1da177e4 LT |
329 | { |
330 | /* | |
331 | * If the page is dirty, only perform writeback if that write | |
332 | * will be non-blocking. To prevent this allocation from being | |
333 | * stalled by pagecache activity. But note that there may be | |
334 | * stalls if we need to run get_block(). We could test | |
335 | * PagePrivate for that. | |
336 | * | |
6aceb53b | 337 | * If this process is currently in __generic_file_aio_write() against |
1da177e4 LT |
338 | * this page's queue, we can perform writeback even if that |
339 | * will block. | |
340 | * | |
341 | * If the page is swapcache, write it back even if that would | |
342 | * block, for some throttling. This happens by accident, because | |
343 | * swap_backing_dev_info is bust: it doesn't reflect the | |
344 | * congestion state of the swapdevs. Easy to fix, if needed. | |
1da177e4 LT |
345 | */ |
346 | if (!is_page_cache_freeable(page)) | |
347 | return PAGE_KEEP; | |
348 | if (!mapping) { | |
349 | /* | |
350 | * Some data journaling orphaned pages can have | |
351 | * page->mapping == NULL while being dirty with clean buffers. | |
352 | */ | |
266cf658 | 353 | if (page_has_private(page)) { |
1da177e4 LT |
354 | if (try_to_free_buffers(page)) { |
355 | ClearPageDirty(page); | |
d40cee24 | 356 | printk("%s: orphaned page\n", __func__); |
1da177e4 LT |
357 | return PAGE_CLEAN; |
358 | } | |
359 | } | |
360 | return PAGE_KEEP; | |
361 | } | |
362 | if (mapping->a_ops->writepage == NULL) | |
363 | return PAGE_ACTIVATE; | |
364 | if (!may_write_to_queue(mapping->backing_dev_info)) | |
365 | return PAGE_KEEP; | |
366 | ||
367 | if (clear_page_dirty_for_io(page)) { | |
368 | int res; | |
369 | struct writeback_control wbc = { | |
370 | .sync_mode = WB_SYNC_NONE, | |
371 | .nr_to_write = SWAP_CLUSTER_MAX, | |
111ebb6e OH |
372 | .range_start = 0, |
373 | .range_end = LLONG_MAX, | |
1da177e4 LT |
374 | .nonblocking = 1, |
375 | .for_reclaim = 1, | |
376 | }; | |
377 | ||
378 | SetPageReclaim(page); | |
379 | res = mapping->a_ops->writepage(page, &wbc); | |
380 | if (res < 0) | |
381 | handle_write_error(mapping, page, res); | |
994fc28c | 382 | if (res == AOP_WRITEPAGE_ACTIVATE) { |
1da177e4 LT |
383 | ClearPageReclaim(page); |
384 | return PAGE_ACTIVATE; | |
385 | } | |
c661b078 AW |
386 | |
387 | /* | |
388 | * Wait on writeback if requested to. This happens when | |
389 | * direct reclaiming a large contiguous area and the | |
390 | * first attempt to free a range of pages fails. | |
391 | */ | |
392 | if (PageWriteback(page) && sync_writeback == PAGEOUT_IO_SYNC) | |
393 | wait_on_page_writeback(page); | |
394 | ||
1da177e4 LT |
395 | if (!PageWriteback(page)) { |
396 | /* synchronous write or broken a_ops? */ | |
397 | ClearPageReclaim(page); | |
398 | } | |
e129b5c2 | 399 | inc_zone_page_state(page, NR_VMSCAN_WRITE); |
1da177e4 LT |
400 | return PAGE_SUCCESS; |
401 | } | |
402 | ||
403 | return PAGE_CLEAN; | |
404 | } | |
405 | ||
a649fd92 | 406 | /* |
e286781d NP |
407 | * Same as remove_mapping, but if the page is removed from the mapping, it |
408 | * gets returned with a refcount of 0. | |
a649fd92 | 409 | */ |
e286781d | 410 | static int __remove_mapping(struct address_space *mapping, struct page *page) |
49d2e9cc | 411 | { |
28e4d965 NP |
412 | BUG_ON(!PageLocked(page)); |
413 | BUG_ON(mapping != page_mapping(page)); | |
49d2e9cc | 414 | |
19fd6231 | 415 | spin_lock_irq(&mapping->tree_lock); |
49d2e9cc | 416 | /* |
0fd0e6b0 NP |
417 | * The non racy check for a busy page. |
418 | * | |
419 | * Must be careful with the order of the tests. When someone has | |
420 | * a ref to the page, it may be possible that they dirty it then | |
421 | * drop the reference. So if PageDirty is tested before page_count | |
422 | * here, then the following race may occur: | |
423 | * | |
424 | * get_user_pages(&page); | |
425 | * [user mapping goes away] | |
426 | * write_to(page); | |
427 | * !PageDirty(page) [good] | |
428 | * SetPageDirty(page); | |
429 | * put_page(page); | |
430 | * !page_count(page) [good, discard it] | |
431 | * | |
432 | * [oops, our write_to data is lost] | |
433 | * | |
434 | * Reversing the order of the tests ensures such a situation cannot | |
435 | * escape unnoticed. The smp_rmb is needed to ensure the page->flags | |
436 | * load is not satisfied before that of page->_count. | |
437 | * | |
438 | * Note that if SetPageDirty is always performed via set_page_dirty, | |
439 | * and thus under tree_lock, then this ordering is not required. | |
49d2e9cc | 440 | */ |
e286781d | 441 | if (!page_freeze_refs(page, 2)) |
49d2e9cc | 442 | goto cannot_free; |
e286781d NP |
443 | /* note: atomic_cmpxchg in page_freeze_refs provides the smp_rmb */ |
444 | if (unlikely(PageDirty(page))) { | |
445 | page_unfreeze_refs(page, 2); | |
49d2e9cc | 446 | goto cannot_free; |
e286781d | 447 | } |
49d2e9cc CL |
448 | |
449 | if (PageSwapCache(page)) { | |
450 | swp_entry_t swap = { .val = page_private(page) }; | |
451 | __delete_from_swap_cache(page); | |
19fd6231 | 452 | spin_unlock_irq(&mapping->tree_lock); |
cb4b86ba | 453 | swapcache_free(swap, page); |
e286781d NP |
454 | } else { |
455 | __remove_from_page_cache(page); | |
19fd6231 | 456 | spin_unlock_irq(&mapping->tree_lock); |
e767e056 | 457 | mem_cgroup_uncharge_cache_page(page); |
49d2e9cc CL |
458 | } |
459 | ||
49d2e9cc CL |
460 | return 1; |
461 | ||
462 | cannot_free: | |
19fd6231 | 463 | spin_unlock_irq(&mapping->tree_lock); |
49d2e9cc CL |
464 | return 0; |
465 | } | |
466 | ||
e286781d NP |
467 | /* |
468 | * Attempt to detach a locked page from its ->mapping. If it is dirty or if | |
469 | * someone else has a ref on the page, abort and return 0. If it was | |
470 | * successfully detached, return 1. Assumes the caller has a single ref on | |
471 | * this page. | |
472 | */ | |
473 | int remove_mapping(struct address_space *mapping, struct page *page) | |
474 | { | |
475 | if (__remove_mapping(mapping, page)) { | |
476 | /* | |
477 | * Unfreezing the refcount with 1 rather than 2 effectively | |
478 | * drops the pagecache ref for us without requiring another | |
479 | * atomic operation. | |
480 | */ | |
481 | page_unfreeze_refs(page, 1); | |
482 | return 1; | |
483 | } | |
484 | return 0; | |
485 | } | |
486 | ||
894bc310 LS |
487 | /** |
488 | * putback_lru_page - put previously isolated page onto appropriate LRU list | |
489 | * @page: page to be put back to appropriate lru list | |
490 | * | |
491 | * Add previously isolated @page to appropriate LRU list. | |
492 | * Page may still be unevictable for other reasons. | |
493 | * | |
494 | * lru_lock must not be held, interrupts must be enabled. | |
495 | */ | |
894bc310 LS |
496 | void putback_lru_page(struct page *page) |
497 | { | |
498 | int lru; | |
499 | int active = !!TestClearPageActive(page); | |
bbfd28ee | 500 | int was_unevictable = PageUnevictable(page); |
894bc310 LS |
501 | |
502 | VM_BUG_ON(PageLRU(page)); | |
503 | ||
504 | redo: | |
505 | ClearPageUnevictable(page); | |
506 | ||
507 | if (page_evictable(page, NULL)) { | |
508 | /* | |
509 | * For evictable pages, we can use the cache. | |
510 | * In event of a race, worst case is we end up with an | |
511 | * unevictable page on [in]active list. | |
512 | * We know how to handle that. | |
513 | */ | |
401a8e1c | 514 | lru = active + page_lru_base_type(page); |
894bc310 LS |
515 | lru_cache_add_lru(page, lru); |
516 | } else { | |
517 | /* | |
518 | * Put unevictable pages directly on zone's unevictable | |
519 | * list. | |
520 | */ | |
521 | lru = LRU_UNEVICTABLE; | |
522 | add_page_to_unevictable_list(page); | |
6a7b9548 JW |
523 | /* |
524 | * When racing with an mlock clearing (page is | |
525 | * unlocked), make sure that if the other thread does | |
526 | * not observe our setting of PG_lru and fails | |
527 | * isolation, we see PG_mlocked cleared below and move | |
528 | * the page back to the evictable list. | |
529 | * | |
530 | * The other side is TestClearPageMlocked(). | |
531 | */ | |
532 | smp_mb(); | |
894bc310 | 533 | } |
894bc310 LS |
534 | |
535 | /* | |
536 | * page's status can change while we move it among lru. If an evictable | |
537 | * page is on unevictable list, it never be freed. To avoid that, | |
538 | * check after we added it to the list, again. | |
539 | */ | |
540 | if (lru == LRU_UNEVICTABLE && page_evictable(page, NULL)) { | |
541 | if (!isolate_lru_page(page)) { | |
542 | put_page(page); | |
543 | goto redo; | |
544 | } | |
545 | /* This means someone else dropped this page from LRU | |
546 | * So, it will be freed or putback to LRU again. There is | |
547 | * nothing to do here. | |
548 | */ | |
549 | } | |
550 | ||
bbfd28ee LS |
551 | if (was_unevictable && lru != LRU_UNEVICTABLE) |
552 | count_vm_event(UNEVICTABLE_PGRESCUED); | |
553 | else if (!was_unevictable && lru == LRU_UNEVICTABLE) | |
554 | count_vm_event(UNEVICTABLE_PGCULLED); | |
555 | ||
894bc310 LS |
556 | put_page(page); /* drop ref from isolate */ |
557 | } | |
558 | ||
dfc8d636 JW |
559 | enum page_references { |
560 | PAGEREF_RECLAIM, | |
561 | PAGEREF_RECLAIM_CLEAN, | |
64574746 | 562 | PAGEREF_KEEP, |
dfc8d636 JW |
563 | PAGEREF_ACTIVATE, |
564 | }; | |
565 | ||
566 | static enum page_references page_check_references(struct page *page, | |
567 | struct scan_control *sc) | |
568 | { | |
64574746 | 569 | int referenced_ptes, referenced_page; |
dfc8d636 | 570 | unsigned long vm_flags; |
dfc8d636 | 571 | |
64574746 JW |
572 | referenced_ptes = page_referenced(page, 1, sc->mem_cgroup, &vm_flags); |
573 | referenced_page = TestClearPageReferenced(page); | |
dfc8d636 JW |
574 | |
575 | /* Lumpy reclaim - ignore references */ | |
5f53e762 | 576 | if (sc->lumpy_reclaim_mode) |
dfc8d636 JW |
577 | return PAGEREF_RECLAIM; |
578 | ||
579 | /* | |
580 | * Mlock lost the isolation race with us. Let try_to_unmap() | |
581 | * move the page to the unevictable list. | |
582 | */ | |
583 | if (vm_flags & VM_LOCKED) | |
584 | return PAGEREF_RECLAIM; | |
585 | ||
64574746 JW |
586 | if (referenced_ptes) { |
587 | if (PageAnon(page)) | |
588 | return PAGEREF_ACTIVATE; | |
589 | /* | |
590 | * All mapped pages start out with page table | |
591 | * references from the instantiating fault, so we need | |
592 | * to look twice if a mapped file page is used more | |
593 | * than once. | |
594 | * | |
595 | * Mark it and spare it for another trip around the | |
596 | * inactive list. Another page table reference will | |
597 | * lead to its activation. | |
598 | * | |
599 | * Note: the mark is set for activated pages as well | |
600 | * so that recently deactivated but used pages are | |
601 | * quickly recovered. | |
602 | */ | |
603 | SetPageReferenced(page); | |
604 | ||
605 | if (referenced_page) | |
606 | return PAGEREF_ACTIVATE; | |
607 | ||
608 | return PAGEREF_KEEP; | |
609 | } | |
dfc8d636 JW |
610 | |
611 | /* Reclaim if clean, defer dirty pages to writeback */ | |
64574746 JW |
612 | if (referenced_page) |
613 | return PAGEREF_RECLAIM_CLEAN; | |
614 | ||
615 | return PAGEREF_RECLAIM; | |
dfc8d636 JW |
616 | } |
617 | ||
1da177e4 | 618 | /* |
1742f19f | 619 | * shrink_page_list() returns the number of reclaimed pages |
1da177e4 | 620 | */ |
1742f19f | 621 | static unsigned long shrink_page_list(struct list_head *page_list, |
c661b078 AW |
622 | struct scan_control *sc, |
623 | enum pageout_io sync_writeback) | |
1da177e4 LT |
624 | { |
625 | LIST_HEAD(ret_pages); | |
626 | struct pagevec freed_pvec; | |
627 | int pgactivate = 0; | |
05ff5137 | 628 | unsigned long nr_reclaimed = 0; |
1da177e4 LT |
629 | |
630 | cond_resched(); | |
631 | ||
632 | pagevec_init(&freed_pvec, 1); | |
633 | while (!list_empty(page_list)) { | |
dfc8d636 | 634 | enum page_references references; |
1da177e4 LT |
635 | struct address_space *mapping; |
636 | struct page *page; | |
637 | int may_enter_fs; | |
1da177e4 LT |
638 | |
639 | cond_resched(); | |
640 | ||
641 | page = lru_to_page(page_list); | |
642 | list_del(&page->lru); | |
643 | ||
529ae9aa | 644 | if (!trylock_page(page)) |
1da177e4 LT |
645 | goto keep; |
646 | ||
725d704e | 647 | VM_BUG_ON(PageActive(page)); |
1da177e4 LT |
648 | |
649 | sc->nr_scanned++; | |
80e43426 | 650 | |
b291f000 NP |
651 | if (unlikely(!page_evictable(page, NULL))) |
652 | goto cull_mlocked; | |
894bc310 | 653 | |
a6dc60f8 | 654 | if (!sc->may_unmap && page_mapped(page)) |
80e43426 CL |
655 | goto keep_locked; |
656 | ||
1da177e4 LT |
657 | /* Double the slab pressure for mapped and swapcache pages */ |
658 | if (page_mapped(page) || PageSwapCache(page)) | |
659 | sc->nr_scanned++; | |
660 | ||
c661b078 AW |
661 | may_enter_fs = (sc->gfp_mask & __GFP_FS) || |
662 | (PageSwapCache(page) && (sc->gfp_mask & __GFP_IO)); | |
663 | ||
664 | if (PageWriteback(page)) { | |
665 | /* | |
666 | * Synchronous reclaim is performed in two passes, | |
667 | * first an asynchronous pass over the list to | |
668 | * start parallel writeback, and a second synchronous | |
669 | * pass to wait for the IO to complete. Wait here | |
670 | * for any page for which writeback has already | |
671 | * started. | |
672 | */ | |
673 | if (sync_writeback == PAGEOUT_IO_SYNC && may_enter_fs) | |
674 | wait_on_page_writeback(page); | |
4dd4b920 | 675 | else |
c661b078 AW |
676 | goto keep_locked; |
677 | } | |
1da177e4 | 678 | |
dfc8d636 JW |
679 | references = page_check_references(page, sc); |
680 | switch (references) { | |
681 | case PAGEREF_ACTIVATE: | |
1da177e4 | 682 | goto activate_locked; |
64574746 JW |
683 | case PAGEREF_KEEP: |
684 | goto keep_locked; | |
dfc8d636 JW |
685 | case PAGEREF_RECLAIM: |
686 | case PAGEREF_RECLAIM_CLEAN: | |
687 | ; /* try to reclaim the page below */ | |
688 | } | |
1da177e4 | 689 | |
1da177e4 LT |
690 | /* |
691 | * Anonymous process memory has backing store? | |
692 | * Try to allocate it some swap space here. | |
693 | */ | |
b291f000 | 694 | if (PageAnon(page) && !PageSwapCache(page)) { |
63eb6b93 HD |
695 | if (!(sc->gfp_mask & __GFP_IO)) |
696 | goto keep_locked; | |
ac47b003 | 697 | if (!add_to_swap(page)) |
1da177e4 | 698 | goto activate_locked; |
63eb6b93 | 699 | may_enter_fs = 1; |
b291f000 | 700 | } |
1da177e4 LT |
701 | |
702 | mapping = page_mapping(page); | |
1da177e4 LT |
703 | |
704 | /* | |
705 | * The page is mapped into the page tables of one or more | |
706 | * processes. Try to unmap it here. | |
707 | */ | |
708 | if (page_mapped(page) && mapping) { | |
14fa31b8 | 709 | switch (try_to_unmap(page, TTU_UNMAP)) { |
1da177e4 LT |
710 | case SWAP_FAIL: |
711 | goto activate_locked; | |
712 | case SWAP_AGAIN: | |
713 | goto keep_locked; | |
b291f000 NP |
714 | case SWAP_MLOCK: |
715 | goto cull_mlocked; | |
1da177e4 LT |
716 | case SWAP_SUCCESS: |
717 | ; /* try to free the page below */ | |
718 | } | |
719 | } | |
720 | ||
721 | if (PageDirty(page)) { | |
dfc8d636 | 722 | if (references == PAGEREF_RECLAIM_CLEAN) |
1da177e4 | 723 | goto keep_locked; |
4dd4b920 | 724 | if (!may_enter_fs) |
1da177e4 | 725 | goto keep_locked; |
52a8363e | 726 | if (!sc->may_writepage) |
1da177e4 LT |
727 | goto keep_locked; |
728 | ||
729 | /* Page is dirty, try to write it out here */ | |
c661b078 | 730 | switch (pageout(page, mapping, sync_writeback)) { |
1da177e4 LT |
731 | case PAGE_KEEP: |
732 | goto keep_locked; | |
733 | case PAGE_ACTIVATE: | |
734 | goto activate_locked; | |
735 | case PAGE_SUCCESS: | |
4dd4b920 | 736 | if (PageWriteback(page) || PageDirty(page)) |
1da177e4 LT |
737 | goto keep; |
738 | /* | |
739 | * A synchronous write - probably a ramdisk. Go | |
740 | * ahead and try to reclaim the page. | |
741 | */ | |
529ae9aa | 742 | if (!trylock_page(page)) |
1da177e4 LT |
743 | goto keep; |
744 | if (PageDirty(page) || PageWriteback(page)) | |
745 | goto keep_locked; | |
746 | mapping = page_mapping(page); | |
747 | case PAGE_CLEAN: | |
748 | ; /* try to free the page below */ | |
749 | } | |
750 | } | |
751 | ||
752 | /* | |
753 | * If the page has buffers, try to free the buffer mappings | |
754 | * associated with this page. If we succeed we try to free | |
755 | * the page as well. | |
756 | * | |
757 | * We do this even if the page is PageDirty(). | |
758 | * try_to_release_page() does not perform I/O, but it is | |
759 | * possible for a page to have PageDirty set, but it is actually | |
760 | * clean (all its buffers are clean). This happens if the | |
761 | * buffers were written out directly, with submit_bh(). ext3 | |
894bc310 | 762 | * will do this, as well as the blockdev mapping. |
1da177e4 LT |
763 | * try_to_release_page() will discover that cleanness and will |
764 | * drop the buffers and mark the page clean - it can be freed. | |
765 | * | |
766 | * Rarely, pages can have buffers and no ->mapping. These are | |
767 | * the pages which were not successfully invalidated in | |
768 | * truncate_complete_page(). We try to drop those buffers here | |
769 | * and if that worked, and the page is no longer mapped into | |
770 | * process address space (page_count == 1) it can be freed. | |
771 | * Otherwise, leave the page on the LRU so it is swappable. | |
772 | */ | |
266cf658 | 773 | if (page_has_private(page)) { |
1da177e4 LT |
774 | if (!try_to_release_page(page, sc->gfp_mask)) |
775 | goto activate_locked; | |
e286781d NP |
776 | if (!mapping && page_count(page) == 1) { |
777 | unlock_page(page); | |
778 | if (put_page_testzero(page)) | |
779 | goto free_it; | |
780 | else { | |
781 | /* | |
782 | * rare race with speculative reference. | |
783 | * the speculative reference will free | |
784 | * this page shortly, so we may | |
785 | * increment nr_reclaimed here (and | |
786 | * leave it off the LRU). | |
787 | */ | |
788 | nr_reclaimed++; | |
789 | continue; | |
790 | } | |
791 | } | |
1da177e4 LT |
792 | } |
793 | ||
e286781d | 794 | if (!mapping || !__remove_mapping(mapping, page)) |
49d2e9cc | 795 | goto keep_locked; |
1da177e4 | 796 | |
a978d6f5 NP |
797 | /* |
798 | * At this point, we have no other references and there is | |
799 | * no way to pick any more up (removed from LRU, removed | |
800 | * from pagecache). Can use non-atomic bitops now (and | |
801 | * we obviously don't have to worry about waking up a process | |
802 | * waiting on the page lock, because there are no references. | |
803 | */ | |
804 | __clear_page_locked(page); | |
e286781d | 805 | free_it: |
05ff5137 | 806 | nr_reclaimed++; |
e286781d NP |
807 | if (!pagevec_add(&freed_pvec, page)) { |
808 | __pagevec_free(&freed_pvec); | |
809 | pagevec_reinit(&freed_pvec); | |
810 | } | |
1da177e4 LT |
811 | continue; |
812 | ||
b291f000 | 813 | cull_mlocked: |
63d6c5ad HD |
814 | if (PageSwapCache(page)) |
815 | try_to_free_swap(page); | |
b291f000 NP |
816 | unlock_page(page); |
817 | putback_lru_page(page); | |
818 | continue; | |
819 | ||
1da177e4 | 820 | activate_locked: |
68a22394 RR |
821 | /* Not a candidate for swapping, so reclaim swap space. */ |
822 | if (PageSwapCache(page) && vm_swap_full()) | |
a2c43eed | 823 | try_to_free_swap(page); |
894bc310 | 824 | VM_BUG_ON(PageActive(page)); |
1da177e4 LT |
825 | SetPageActive(page); |
826 | pgactivate++; | |
827 | keep_locked: | |
828 | unlock_page(page); | |
829 | keep: | |
830 | list_add(&page->lru, &ret_pages); | |
b291f000 | 831 | VM_BUG_ON(PageLRU(page) || PageUnevictable(page)); |
1da177e4 LT |
832 | } |
833 | list_splice(&ret_pages, page_list); | |
834 | if (pagevec_count(&freed_pvec)) | |
e286781d | 835 | __pagevec_free(&freed_pvec); |
f8891e5e | 836 | count_vm_events(PGACTIVATE, pgactivate); |
05ff5137 | 837 | return nr_reclaimed; |
1da177e4 LT |
838 | } |
839 | ||
5ad333eb AW |
840 | /* |
841 | * Attempt to remove the specified page from its LRU. Only take this page | |
842 | * if it is of the appropriate PageActive status. Pages which are being | |
843 | * freed elsewhere are also ignored. | |
844 | * | |
845 | * page: page to consider | |
846 | * mode: one of the LRU isolation modes defined above | |
847 | * | |
848 | * returns 0 on success, -ve errno on failure. | |
849 | */ | |
4f98a2fe | 850 | int __isolate_lru_page(struct page *page, int mode, int file) |
5ad333eb AW |
851 | { |
852 | int ret = -EINVAL; | |
853 | ||
854 | /* Only take pages on the LRU. */ | |
855 | if (!PageLRU(page)) | |
856 | return ret; | |
857 | ||
858 | /* | |
859 | * When checking the active state, we need to be sure we are | |
860 | * dealing with comparible boolean values. Take the logical not | |
861 | * of each. | |
862 | */ | |
863 | if (mode != ISOLATE_BOTH && (!PageActive(page) != !mode)) | |
864 | return ret; | |
865 | ||
6c0b1351 | 866 | if (mode != ISOLATE_BOTH && page_is_file_cache(page) != file) |
4f98a2fe RR |
867 | return ret; |
868 | ||
894bc310 LS |
869 | /* |
870 | * When this function is being called for lumpy reclaim, we | |
871 | * initially look into all LRU pages, active, inactive and | |
872 | * unevictable; only give shrink_page_list evictable pages. | |
873 | */ | |
874 | if (PageUnevictable(page)) | |
875 | return ret; | |
876 | ||
5ad333eb | 877 | ret = -EBUSY; |
08e552c6 | 878 | |
5ad333eb AW |
879 | if (likely(get_page_unless_zero(page))) { |
880 | /* | |
881 | * Be careful not to clear PageLRU until after we're | |
882 | * sure the page is not being freed elsewhere -- the | |
883 | * page release code relies on it. | |
884 | */ | |
885 | ClearPageLRU(page); | |
886 | ret = 0; | |
887 | } | |
888 | ||
889 | return ret; | |
890 | } | |
891 | ||
1da177e4 LT |
892 | /* |
893 | * zone->lru_lock is heavily contended. Some of the functions that | |
894 | * shrink the lists perform better by taking out a batch of pages | |
895 | * and working on them outside the LRU lock. | |
896 | * | |
897 | * For pagecache intensive workloads, this function is the hottest | |
898 | * spot in the kernel (apart from copy_*_user functions). | |
899 | * | |
900 | * Appropriate locks must be held before calling this function. | |
901 | * | |
902 | * @nr_to_scan: The number of pages to look through on the list. | |
903 | * @src: The LRU list to pull pages off. | |
904 | * @dst: The temp list to put pages on to. | |
905 | * @scanned: The number of pages that were scanned. | |
5ad333eb AW |
906 | * @order: The caller's attempted allocation order |
907 | * @mode: One of the LRU isolation modes | |
4f98a2fe | 908 | * @file: True [1] if isolating file [!anon] pages |
1da177e4 LT |
909 | * |
910 | * returns how many pages were moved onto *@dst. | |
911 | */ | |
69e05944 AM |
912 | static unsigned long isolate_lru_pages(unsigned long nr_to_scan, |
913 | struct list_head *src, struct list_head *dst, | |
4f98a2fe | 914 | unsigned long *scanned, int order, int mode, int file) |
1da177e4 | 915 | { |
69e05944 | 916 | unsigned long nr_taken = 0; |
c9b02d97 | 917 | unsigned long scan; |
1da177e4 | 918 | |
c9b02d97 | 919 | for (scan = 0; scan < nr_to_scan && !list_empty(src); scan++) { |
5ad333eb AW |
920 | struct page *page; |
921 | unsigned long pfn; | |
922 | unsigned long end_pfn; | |
923 | unsigned long page_pfn; | |
924 | int zone_id; | |
925 | ||
1da177e4 LT |
926 | page = lru_to_page(src); |
927 | prefetchw_prev_lru_page(page, src, flags); | |
928 | ||
725d704e | 929 | VM_BUG_ON(!PageLRU(page)); |
8d438f96 | 930 | |
4f98a2fe | 931 | switch (__isolate_lru_page(page, mode, file)) { |
5ad333eb AW |
932 | case 0: |
933 | list_move(&page->lru, dst); | |
2ffebca6 | 934 | mem_cgroup_del_lru(page); |
7c8ee9a8 | 935 | nr_taken++; |
5ad333eb AW |
936 | break; |
937 | ||
938 | case -EBUSY: | |
939 | /* else it is being freed elsewhere */ | |
940 | list_move(&page->lru, src); | |
2ffebca6 | 941 | mem_cgroup_rotate_lru_list(page, page_lru(page)); |
5ad333eb | 942 | continue; |
46453a6e | 943 | |
5ad333eb AW |
944 | default: |
945 | BUG(); | |
946 | } | |
947 | ||
948 | if (!order) | |
949 | continue; | |
950 | ||
951 | /* | |
952 | * Attempt to take all pages in the order aligned region | |
953 | * surrounding the tag page. Only take those pages of | |
954 | * the same active state as that tag page. We may safely | |
955 | * round the target page pfn down to the requested order | |
956 | * as the mem_map is guarenteed valid out to MAX_ORDER, | |
957 | * where that page is in a different zone we will detect | |
958 | * it from its zone id and abort this block scan. | |
959 | */ | |
960 | zone_id = page_zone_id(page); | |
961 | page_pfn = page_to_pfn(page); | |
962 | pfn = page_pfn & ~((1 << order) - 1); | |
963 | end_pfn = pfn + (1 << order); | |
964 | for (; pfn < end_pfn; pfn++) { | |
965 | struct page *cursor_page; | |
966 | ||
967 | /* The target page is in the block, ignore it. */ | |
968 | if (unlikely(pfn == page_pfn)) | |
969 | continue; | |
970 | ||
971 | /* Avoid holes within the zone. */ | |
972 | if (unlikely(!pfn_valid_within(pfn))) | |
973 | break; | |
974 | ||
975 | cursor_page = pfn_to_page(pfn); | |
4f98a2fe | 976 | |
5ad333eb AW |
977 | /* Check that we have not crossed a zone boundary. */ |
978 | if (unlikely(page_zone_id(cursor_page) != zone_id)) | |
979 | continue; | |
de2e7567 MK |
980 | |
981 | /* | |
982 | * If we don't have enough swap space, reclaiming of | |
983 | * anon page which don't already have a swap slot is | |
984 | * pointless. | |
985 | */ | |
986 | if (nr_swap_pages <= 0 && PageAnon(cursor_page) && | |
987 | !PageSwapCache(cursor_page)) | |
988 | continue; | |
989 | ||
ee993b13 | 990 | if (__isolate_lru_page(cursor_page, mode, file) == 0) { |
5ad333eb | 991 | list_move(&cursor_page->lru, dst); |
cb4cbcf6 | 992 | mem_cgroup_del_lru(cursor_page); |
5ad333eb AW |
993 | nr_taken++; |
994 | scan++; | |
5ad333eb AW |
995 | } |
996 | } | |
1da177e4 LT |
997 | } |
998 | ||
999 | *scanned = scan; | |
1000 | return nr_taken; | |
1001 | } | |
1002 | ||
66e1707b BS |
1003 | static unsigned long isolate_pages_global(unsigned long nr, |
1004 | struct list_head *dst, | |
1005 | unsigned long *scanned, int order, | |
1006 | int mode, struct zone *z, | |
4f98a2fe | 1007 | int active, int file) |
66e1707b | 1008 | { |
4f98a2fe | 1009 | int lru = LRU_BASE; |
66e1707b | 1010 | if (active) |
4f98a2fe RR |
1011 | lru += LRU_ACTIVE; |
1012 | if (file) | |
1013 | lru += LRU_FILE; | |
1014 | return isolate_lru_pages(nr, &z->lru[lru].list, dst, scanned, order, | |
b7c46d15 | 1015 | mode, file); |
66e1707b BS |
1016 | } |
1017 | ||
5ad333eb AW |
1018 | /* |
1019 | * clear_active_flags() is a helper for shrink_active_list(), clearing | |
1020 | * any active bits from the pages in the list. | |
1021 | */ | |
4f98a2fe RR |
1022 | static unsigned long clear_active_flags(struct list_head *page_list, |
1023 | unsigned int *count) | |
5ad333eb AW |
1024 | { |
1025 | int nr_active = 0; | |
4f98a2fe | 1026 | int lru; |
5ad333eb AW |
1027 | struct page *page; |
1028 | ||
4f98a2fe | 1029 | list_for_each_entry(page, page_list, lru) { |
401a8e1c | 1030 | lru = page_lru_base_type(page); |
5ad333eb | 1031 | if (PageActive(page)) { |
4f98a2fe | 1032 | lru += LRU_ACTIVE; |
5ad333eb AW |
1033 | ClearPageActive(page); |
1034 | nr_active++; | |
1035 | } | |
4f98a2fe RR |
1036 | count[lru]++; |
1037 | } | |
5ad333eb AW |
1038 | |
1039 | return nr_active; | |
1040 | } | |
1041 | ||
62695a84 NP |
1042 | /** |
1043 | * isolate_lru_page - tries to isolate a page from its LRU list | |
1044 | * @page: page to isolate from its LRU list | |
1045 | * | |
1046 | * Isolates a @page from an LRU list, clears PageLRU and adjusts the | |
1047 | * vmstat statistic corresponding to whatever LRU list the page was on. | |
1048 | * | |
1049 | * Returns 0 if the page was removed from an LRU list. | |
1050 | * Returns -EBUSY if the page was not on an LRU list. | |
1051 | * | |
1052 | * The returned page will have PageLRU() cleared. If it was found on | |
894bc310 LS |
1053 | * the active list, it will have PageActive set. If it was found on |
1054 | * the unevictable list, it will have the PageUnevictable bit set. That flag | |
1055 | * may need to be cleared by the caller before letting the page go. | |
62695a84 NP |
1056 | * |
1057 | * The vmstat statistic corresponding to the list on which the page was | |
1058 | * found will be decremented. | |
1059 | * | |
1060 | * Restrictions: | |
1061 | * (1) Must be called with an elevated refcount on the page. This is a | |
1062 | * fundamentnal difference from isolate_lru_pages (which is called | |
1063 | * without a stable reference). | |
1064 | * (2) the lru_lock must not be held. | |
1065 | * (3) interrupts must be enabled. | |
1066 | */ | |
1067 | int isolate_lru_page(struct page *page) | |
1068 | { | |
1069 | int ret = -EBUSY; | |
1070 | ||
1071 | if (PageLRU(page)) { | |
1072 | struct zone *zone = page_zone(page); | |
1073 | ||
1074 | spin_lock_irq(&zone->lru_lock); | |
1075 | if (PageLRU(page) && get_page_unless_zero(page)) { | |
894bc310 | 1076 | int lru = page_lru(page); |
62695a84 NP |
1077 | ret = 0; |
1078 | ClearPageLRU(page); | |
4f98a2fe | 1079 | |
4f98a2fe | 1080 | del_page_from_lru_list(zone, page, lru); |
62695a84 NP |
1081 | } |
1082 | spin_unlock_irq(&zone->lru_lock); | |
1083 | } | |
1084 | return ret; | |
1085 | } | |
1086 | ||
35cd7815 RR |
1087 | /* |
1088 | * Are there way too many processes in the direct reclaim path already? | |
1089 | */ | |
1090 | static int too_many_isolated(struct zone *zone, int file, | |
1091 | struct scan_control *sc) | |
1092 | { | |
1093 | unsigned long inactive, isolated; | |
1094 | ||
1095 | if (current_is_kswapd()) | |
1096 | return 0; | |
1097 | ||
1098 | if (!scanning_global_lru(sc)) | |
1099 | return 0; | |
1100 | ||
1101 | if (file) { | |
1102 | inactive = zone_page_state(zone, NR_INACTIVE_FILE); | |
1103 | isolated = zone_page_state(zone, NR_ISOLATED_FILE); | |
1104 | } else { | |
1105 | inactive = zone_page_state(zone, NR_INACTIVE_ANON); | |
1106 | isolated = zone_page_state(zone, NR_ISOLATED_ANON); | |
1107 | } | |
1108 | ||
1109 | return isolated > inactive; | |
1110 | } | |
1111 | ||
1da177e4 | 1112 | /* |
1742f19f AM |
1113 | * shrink_inactive_list() is a helper for shrink_zone(). It returns the number |
1114 | * of reclaimed pages | |
1da177e4 | 1115 | */ |
1742f19f | 1116 | static unsigned long shrink_inactive_list(unsigned long max_scan, |
33c120ed RR |
1117 | struct zone *zone, struct scan_control *sc, |
1118 | int priority, int file) | |
1da177e4 LT |
1119 | { |
1120 | LIST_HEAD(page_list); | |
1121 | struct pagevec pvec; | |
69e05944 | 1122 | unsigned long nr_scanned = 0; |
05ff5137 | 1123 | unsigned long nr_reclaimed = 0; |
6e901571 | 1124 | struct zone_reclaim_stat *reclaim_stat = get_reclaim_stat(zone, sc); |
78dc583d | 1125 | |
35cd7815 | 1126 | while (unlikely(too_many_isolated(zone, file, sc))) { |
58355c78 | 1127 | congestion_wait(BLK_RW_ASYNC, HZ/10); |
35cd7815 RR |
1128 | |
1129 | /* We are about to die and free our memory. Return now. */ | |
1130 | if (fatal_signal_pending(current)) | |
1131 | return SWAP_CLUSTER_MAX; | |
1132 | } | |
1133 | ||
1da177e4 LT |
1134 | |
1135 | pagevec_init(&pvec, 1); | |
1136 | ||
1137 | lru_add_drain(); | |
1138 | spin_lock_irq(&zone->lru_lock); | |
69e05944 | 1139 | do { |
1da177e4 | 1140 | struct page *page; |
69e05944 AM |
1141 | unsigned long nr_taken; |
1142 | unsigned long nr_scan; | |
1143 | unsigned long nr_freed; | |
5ad333eb | 1144 | unsigned long nr_active; |
4f98a2fe | 1145 | unsigned int count[NR_LRU_LISTS] = { 0, }; |
5f53e762 | 1146 | int mode = sc->lumpy_reclaim_mode ? ISOLATE_BOTH : ISOLATE_INACTIVE; |
a731286d KM |
1147 | unsigned long nr_anon; |
1148 | unsigned long nr_file; | |
1da177e4 | 1149 | |
b35ea17b | 1150 | if (scanning_global_lru(sc)) { |
8b25c6d2 JW |
1151 | nr_taken = isolate_pages_global(SWAP_CLUSTER_MAX, |
1152 | &page_list, &nr_scan, | |
1153 | sc->order, mode, | |
1154 | zone, 0, file); | |
b35ea17b KM |
1155 | zone->pages_scanned += nr_scan; |
1156 | if (current_is_kswapd()) | |
1157 | __count_zone_vm_events(PGSCAN_KSWAPD, zone, | |
1158 | nr_scan); | |
1159 | else | |
1160 | __count_zone_vm_events(PGSCAN_DIRECT, zone, | |
1161 | nr_scan); | |
8b25c6d2 JW |
1162 | } else { |
1163 | nr_taken = mem_cgroup_isolate_pages(SWAP_CLUSTER_MAX, | |
1164 | &page_list, &nr_scan, | |
1165 | sc->order, mode, | |
1166 | zone, sc->mem_cgroup, | |
1167 | 0, file); | |
1168 | /* | |
1169 | * mem_cgroup_isolate_pages() keeps track of | |
1170 | * scanned pages on its own. | |
1171 | */ | |
b35ea17b KM |
1172 | } |
1173 | ||
1174 | if (nr_taken == 0) | |
1175 | goto done; | |
1176 | ||
4f98a2fe | 1177 | nr_active = clear_active_flags(&page_list, count); |
e9187bdc | 1178 | __count_vm_events(PGDEACTIVATE, nr_active); |
5ad333eb | 1179 | |
4f98a2fe RR |
1180 | __mod_zone_page_state(zone, NR_ACTIVE_FILE, |
1181 | -count[LRU_ACTIVE_FILE]); | |
1182 | __mod_zone_page_state(zone, NR_INACTIVE_FILE, | |
1183 | -count[LRU_INACTIVE_FILE]); | |
1184 | __mod_zone_page_state(zone, NR_ACTIVE_ANON, | |
1185 | -count[LRU_ACTIVE_ANON]); | |
1186 | __mod_zone_page_state(zone, NR_INACTIVE_ANON, | |
1187 | -count[LRU_INACTIVE_ANON]); | |
1188 | ||
a731286d KM |
1189 | nr_anon = count[LRU_ACTIVE_ANON] + count[LRU_INACTIVE_ANON]; |
1190 | nr_file = count[LRU_ACTIVE_FILE] + count[LRU_INACTIVE_FILE]; | |
1191 | __mod_zone_page_state(zone, NR_ISOLATED_ANON, nr_anon); | |
1192 | __mod_zone_page_state(zone, NR_ISOLATED_FILE, nr_file); | |
3e2f41f1 | 1193 | |
62c0c2f1 HS |
1194 | reclaim_stat->recent_scanned[0] += nr_anon; |
1195 | reclaim_stat->recent_scanned[1] += nr_file; | |
3e2f41f1 | 1196 | |
1da177e4 LT |
1197 | spin_unlock_irq(&zone->lru_lock); |
1198 | ||
69e05944 | 1199 | nr_scanned += nr_scan; |
c661b078 AW |
1200 | nr_freed = shrink_page_list(&page_list, sc, PAGEOUT_IO_ASYNC); |
1201 | ||
1202 | /* | |
1203 | * If we are direct reclaiming for contiguous pages and we do | |
1204 | * not reclaim everything in the list, try again and wait | |
1205 | * for IO to complete. This will stall high-order allocations | |
1206 | * but that should be acceptable to the caller | |
1207 | */ | |
1208 | if (nr_freed < nr_taken && !current_is_kswapd() && | |
5f53e762 | 1209 | sc->lumpy_reclaim_mode) { |
8aa7e847 | 1210 | congestion_wait(BLK_RW_ASYNC, HZ/10); |
c661b078 AW |
1211 | |
1212 | /* | |
1213 | * The attempt at page out may have made some | |
1214 | * of the pages active, mark them inactive again. | |
1215 | */ | |
4f98a2fe | 1216 | nr_active = clear_active_flags(&page_list, count); |
c661b078 AW |
1217 | count_vm_events(PGDEACTIVATE, nr_active); |
1218 | ||
1219 | nr_freed += shrink_page_list(&page_list, sc, | |
1220 | PAGEOUT_IO_SYNC); | |
1221 | } | |
1222 | ||
05ff5137 | 1223 | nr_reclaimed += nr_freed; |
b35ea17b | 1224 | |
a74609fa | 1225 | local_irq_disable(); |
b35ea17b | 1226 | if (current_is_kswapd()) |
f8891e5e | 1227 | __count_vm_events(KSWAPD_STEAL, nr_freed); |
918d3f90 | 1228 | __count_zone_vm_events(PGSTEAL, zone, nr_freed); |
a74609fa NP |
1229 | |
1230 | spin_lock(&zone->lru_lock); | |
1da177e4 LT |
1231 | /* |
1232 | * Put back any unfreeable pages. | |
1233 | */ | |
1234 | while (!list_empty(&page_list)) { | |
894bc310 | 1235 | int lru; |
1da177e4 | 1236 | page = lru_to_page(&page_list); |
725d704e | 1237 | VM_BUG_ON(PageLRU(page)); |
1da177e4 | 1238 | list_del(&page->lru); |
894bc310 LS |
1239 | if (unlikely(!page_evictable(page, NULL))) { |
1240 | spin_unlock_irq(&zone->lru_lock); | |
1241 | putback_lru_page(page); | |
1242 | spin_lock_irq(&zone->lru_lock); | |
1243 | continue; | |
1244 | } | |
1245 | SetPageLRU(page); | |
1246 | lru = page_lru(page); | |
1247 | add_page_to_lru_list(zone, page, lru); | |
74a1c48f | 1248 | if (is_active_lru(lru)) { |
b7c46d15 | 1249 | int file = is_file_lru(lru); |
6e901571 | 1250 | reclaim_stat->recent_rotated[file]++; |
4f98a2fe | 1251 | } |
1da177e4 LT |
1252 | if (!pagevec_add(&pvec, page)) { |
1253 | spin_unlock_irq(&zone->lru_lock); | |
1254 | __pagevec_release(&pvec); | |
1255 | spin_lock_irq(&zone->lru_lock); | |
1256 | } | |
1257 | } | |
a731286d KM |
1258 | __mod_zone_page_state(zone, NR_ISOLATED_ANON, -nr_anon); |
1259 | __mod_zone_page_state(zone, NR_ISOLATED_FILE, -nr_file); | |
1260 | ||
69e05944 | 1261 | } while (nr_scanned < max_scan); |
b35ea17b | 1262 | |
1da177e4 | 1263 | done: |
b35ea17b | 1264 | spin_unlock_irq(&zone->lru_lock); |
1da177e4 | 1265 | pagevec_release(&pvec); |
05ff5137 | 1266 | return nr_reclaimed; |
1da177e4 LT |
1267 | } |
1268 | ||
3bb1a852 MB |
1269 | /* |
1270 | * We are about to scan this zone at a certain priority level. If that priority | |
1271 | * level is smaller (ie: more urgent) than the previous priority, then note | |
1272 | * that priority level within the zone. This is done so that when the next | |
1273 | * process comes in to scan this zone, it will immediately start out at this | |
1274 | * priority level rather than having to build up its own scanning priority. | |
1275 | * Here, this priority affects only the reclaim-mapped threshold. | |
1276 | */ | |
1277 | static inline void note_zone_scanning_priority(struct zone *zone, int priority) | |
1278 | { | |
1279 | if (priority < zone->prev_priority) | |
1280 | zone->prev_priority = priority; | |
1281 | } | |
1282 | ||
1da177e4 LT |
1283 | /* |
1284 | * This moves pages from the active list to the inactive list. | |
1285 | * | |
1286 | * We move them the other way if the page is referenced by one or more | |
1287 | * processes, from rmap. | |
1288 | * | |
1289 | * If the pages are mostly unmapped, the processing is fast and it is | |
1290 | * appropriate to hold zone->lru_lock across the whole operation. But if | |
1291 | * the pages are mapped, the processing is slow (page_referenced()) so we | |
1292 | * should drop zone->lru_lock around each page. It's impossible to balance | |
1293 | * this, so instead we remove the pages from the LRU while processing them. | |
1294 | * It is safe to rely on PG_active against the non-LRU pages in here because | |
1295 | * nobody will play with that bit on a non-LRU page. | |
1296 | * | |
1297 | * The downside is that we have to touch page->_count against each page. | |
1298 | * But we had to alter page->flags anyway. | |
1299 | */ | |
1cfb419b | 1300 | |
3eb4140f WF |
1301 | static void move_active_pages_to_lru(struct zone *zone, |
1302 | struct list_head *list, | |
1303 | enum lru_list lru) | |
1304 | { | |
1305 | unsigned long pgmoved = 0; | |
1306 | struct pagevec pvec; | |
1307 | struct page *page; | |
1308 | ||
1309 | pagevec_init(&pvec, 1); | |
1310 | ||
1311 | while (!list_empty(list)) { | |
1312 | page = lru_to_page(list); | |
3eb4140f WF |
1313 | |
1314 | VM_BUG_ON(PageLRU(page)); | |
1315 | SetPageLRU(page); | |
1316 | ||
3eb4140f WF |
1317 | list_move(&page->lru, &zone->lru[lru].list); |
1318 | mem_cgroup_add_lru_list(page, lru); | |
1319 | pgmoved++; | |
1320 | ||
1321 | if (!pagevec_add(&pvec, page) || list_empty(list)) { | |
1322 | spin_unlock_irq(&zone->lru_lock); | |
1323 | if (buffer_heads_over_limit) | |
1324 | pagevec_strip(&pvec); | |
1325 | __pagevec_release(&pvec); | |
1326 | spin_lock_irq(&zone->lru_lock); | |
1327 | } | |
1328 | } | |
1329 | __mod_zone_page_state(zone, NR_LRU_BASE + lru, pgmoved); | |
1330 | if (!is_active_lru(lru)) | |
1331 | __count_vm_events(PGDEACTIVATE, pgmoved); | |
1332 | } | |
1cfb419b | 1333 | |
1742f19f | 1334 | static void shrink_active_list(unsigned long nr_pages, struct zone *zone, |
4f98a2fe | 1335 | struct scan_control *sc, int priority, int file) |
1da177e4 | 1336 | { |
44c241f1 | 1337 | unsigned long nr_taken; |
69e05944 | 1338 | unsigned long pgscanned; |
6fe6b7e3 | 1339 | unsigned long vm_flags; |
1da177e4 | 1340 | LIST_HEAD(l_hold); /* The pages which were snipped off */ |
8cab4754 | 1341 | LIST_HEAD(l_active); |
b69408e8 | 1342 | LIST_HEAD(l_inactive); |
1da177e4 | 1343 | struct page *page; |
6e901571 | 1344 | struct zone_reclaim_stat *reclaim_stat = get_reclaim_stat(zone, sc); |
44c241f1 | 1345 | unsigned long nr_rotated = 0; |
1da177e4 LT |
1346 | |
1347 | lru_add_drain(); | |
1348 | spin_lock_irq(&zone->lru_lock); | |
e72e2bd6 | 1349 | if (scanning_global_lru(sc)) { |
8b25c6d2 JW |
1350 | nr_taken = isolate_pages_global(nr_pages, &l_hold, |
1351 | &pgscanned, sc->order, | |
1352 | ISOLATE_ACTIVE, zone, | |
1353 | 1, file); | |
1cfb419b | 1354 | zone->pages_scanned += pgscanned; |
8b25c6d2 JW |
1355 | } else { |
1356 | nr_taken = mem_cgroup_isolate_pages(nr_pages, &l_hold, | |
1357 | &pgscanned, sc->order, | |
1358 | ISOLATE_ACTIVE, zone, | |
1359 | sc->mem_cgroup, 1, file); | |
1360 | /* | |
1361 | * mem_cgroup_isolate_pages() keeps track of | |
1362 | * scanned pages on its own. | |
1363 | */ | |
4f98a2fe | 1364 | } |
8b25c6d2 | 1365 | |
b7c46d15 | 1366 | reclaim_stat->recent_scanned[file] += nr_taken; |
1cfb419b | 1367 | |
3eb4140f | 1368 | __count_zone_vm_events(PGREFILL, zone, pgscanned); |
4f98a2fe | 1369 | if (file) |
44c241f1 | 1370 | __mod_zone_page_state(zone, NR_ACTIVE_FILE, -nr_taken); |
4f98a2fe | 1371 | else |
44c241f1 | 1372 | __mod_zone_page_state(zone, NR_ACTIVE_ANON, -nr_taken); |
a731286d | 1373 | __mod_zone_page_state(zone, NR_ISOLATED_ANON + file, nr_taken); |
1da177e4 LT |
1374 | spin_unlock_irq(&zone->lru_lock); |
1375 | ||
1da177e4 LT |
1376 | while (!list_empty(&l_hold)) { |
1377 | cond_resched(); | |
1378 | page = lru_to_page(&l_hold); | |
1379 | list_del(&page->lru); | |
7e9cd484 | 1380 | |
894bc310 LS |
1381 | if (unlikely(!page_evictable(page, NULL))) { |
1382 | putback_lru_page(page); | |
1383 | continue; | |
1384 | } | |
1385 | ||
64574746 | 1386 | if (page_referenced(page, 0, sc->mem_cgroup, &vm_flags)) { |
44c241f1 | 1387 | nr_rotated++; |
8cab4754 WF |
1388 | /* |
1389 | * Identify referenced, file-backed active pages and | |
1390 | * give them one more trip around the active list. So | |
1391 | * that executable code get better chances to stay in | |
1392 | * memory under moderate memory pressure. Anon pages | |
1393 | * are not likely to be evicted by use-once streaming | |
1394 | * IO, plus JVM can create lots of anon VM_EXEC pages, | |
1395 | * so we ignore them here. | |
1396 | */ | |
41e20983 | 1397 | if ((vm_flags & VM_EXEC) && page_is_file_cache(page)) { |
8cab4754 WF |
1398 | list_add(&page->lru, &l_active); |
1399 | continue; | |
1400 | } | |
1401 | } | |
7e9cd484 | 1402 | |
5205e56e | 1403 | ClearPageActive(page); /* we are de-activating */ |
1da177e4 LT |
1404 | list_add(&page->lru, &l_inactive); |
1405 | } | |
1406 | ||
b555749a | 1407 | /* |
8cab4754 | 1408 | * Move pages back to the lru list. |
b555749a | 1409 | */ |
2a1dc509 | 1410 | spin_lock_irq(&zone->lru_lock); |
556adecb | 1411 | /* |
8cab4754 WF |
1412 | * Count referenced pages from currently used mappings as rotated, |
1413 | * even though only some of them are actually re-activated. This | |
1414 | * helps balance scan pressure between file and anonymous pages in | |
1415 | * get_scan_ratio. | |
7e9cd484 | 1416 | */ |
b7c46d15 | 1417 | reclaim_stat->recent_rotated[file] += nr_rotated; |
556adecb | 1418 | |
3eb4140f WF |
1419 | move_active_pages_to_lru(zone, &l_active, |
1420 | LRU_ACTIVE + file * LRU_FILE); | |
1421 | move_active_pages_to_lru(zone, &l_inactive, | |
1422 | LRU_BASE + file * LRU_FILE); | |
a731286d | 1423 | __mod_zone_page_state(zone, NR_ISOLATED_ANON + file, -nr_taken); |
f8891e5e | 1424 | spin_unlock_irq(&zone->lru_lock); |
1da177e4 LT |
1425 | } |
1426 | ||
14797e23 | 1427 | static int inactive_anon_is_low_global(struct zone *zone) |
f89eb90e KM |
1428 | { |
1429 | unsigned long active, inactive; | |
1430 | ||
1431 | active = zone_page_state(zone, NR_ACTIVE_ANON); | |
1432 | inactive = zone_page_state(zone, NR_INACTIVE_ANON); | |
1433 | ||
1434 | if (inactive * zone->inactive_ratio < active) | |
1435 | return 1; | |
1436 | ||
1437 | return 0; | |
1438 | } | |
1439 | ||
14797e23 KM |
1440 | /** |
1441 | * inactive_anon_is_low - check if anonymous pages need to be deactivated | |
1442 | * @zone: zone to check | |
1443 | * @sc: scan control of this context | |
1444 | * | |
1445 | * Returns true if the zone does not have enough inactive anon pages, | |
1446 | * meaning some active anon pages need to be deactivated. | |
1447 | */ | |
1448 | static int inactive_anon_is_low(struct zone *zone, struct scan_control *sc) | |
1449 | { | |
1450 | int low; | |
1451 | ||
e72e2bd6 | 1452 | if (scanning_global_lru(sc)) |
14797e23 KM |
1453 | low = inactive_anon_is_low_global(zone); |
1454 | else | |
c772be93 | 1455 | low = mem_cgroup_inactive_anon_is_low(sc->mem_cgroup); |
14797e23 KM |
1456 | return low; |
1457 | } | |
1458 | ||
56e49d21 RR |
1459 | static int inactive_file_is_low_global(struct zone *zone) |
1460 | { | |
1461 | unsigned long active, inactive; | |
1462 | ||
1463 | active = zone_page_state(zone, NR_ACTIVE_FILE); | |
1464 | inactive = zone_page_state(zone, NR_INACTIVE_FILE); | |
1465 | ||
1466 | return (active > inactive); | |
1467 | } | |
1468 | ||
1469 | /** | |
1470 | * inactive_file_is_low - check if file pages need to be deactivated | |
1471 | * @zone: zone to check | |
1472 | * @sc: scan control of this context | |
1473 | * | |
1474 | * When the system is doing streaming IO, memory pressure here | |
1475 | * ensures that active file pages get deactivated, until more | |
1476 | * than half of the file pages are on the inactive list. | |
1477 | * | |
1478 | * Once we get to that situation, protect the system's working | |
1479 | * set from being evicted by disabling active file page aging. | |
1480 | * | |
1481 | * This uses a different ratio than the anonymous pages, because | |
1482 | * the page cache uses a use-once replacement algorithm. | |
1483 | */ | |
1484 | static int inactive_file_is_low(struct zone *zone, struct scan_control *sc) | |
1485 | { | |
1486 | int low; | |
1487 | ||
1488 | if (scanning_global_lru(sc)) | |
1489 | low = inactive_file_is_low_global(zone); | |
1490 | else | |
1491 | low = mem_cgroup_inactive_file_is_low(sc->mem_cgroup); | |
1492 | return low; | |
1493 | } | |
1494 | ||
b39415b2 RR |
1495 | static int inactive_list_is_low(struct zone *zone, struct scan_control *sc, |
1496 | int file) | |
1497 | { | |
1498 | if (file) | |
1499 | return inactive_file_is_low(zone, sc); | |
1500 | else | |
1501 | return inactive_anon_is_low(zone, sc); | |
1502 | } | |
1503 | ||
4f98a2fe | 1504 | static unsigned long shrink_list(enum lru_list lru, unsigned long nr_to_scan, |
b69408e8 CL |
1505 | struct zone *zone, struct scan_control *sc, int priority) |
1506 | { | |
4f98a2fe RR |
1507 | int file = is_file_lru(lru); |
1508 | ||
b39415b2 RR |
1509 | if (is_active_lru(lru)) { |
1510 | if (inactive_list_is_low(zone, sc, file)) | |
1511 | shrink_active_list(nr_to_scan, zone, sc, priority, file); | |
556adecb RR |
1512 | return 0; |
1513 | } | |
1514 | ||
33c120ed | 1515 | return shrink_inactive_list(nr_to_scan, zone, sc, priority, file); |
4f98a2fe RR |
1516 | } |
1517 | ||
76a33fc3 SL |
1518 | /* |
1519 | * Smallish @nr_to_scan's are deposited in @nr_saved_scan, | |
1520 | * until we collected @swap_cluster_max pages to scan. | |
1521 | */ | |
1522 | static unsigned long nr_scan_try_batch(unsigned long nr_to_scan, | |
1523 | unsigned long *nr_saved_scan) | |
1524 | { | |
1525 | unsigned long nr; | |
1526 | ||
1527 | *nr_saved_scan += nr_to_scan; | |
1528 | nr = *nr_saved_scan; | |
1529 | ||
1530 | if (nr >= SWAP_CLUSTER_MAX) | |
1531 | *nr_saved_scan = 0; | |
1532 | else | |
1533 | nr = 0; | |
1534 | ||
1535 | return nr; | |
1536 | } | |
1537 | ||
4f98a2fe RR |
1538 | /* |
1539 | * Determine how aggressively the anon and file LRU lists should be | |
1540 | * scanned. The relative value of each set of LRU lists is determined | |
1541 | * by looking at the fraction of the pages scanned we did rotate back | |
1542 | * onto the active list instead of evict. | |
1543 | * | |
76a33fc3 | 1544 | * nr[0] = anon pages to scan; nr[1] = file pages to scan |
4f98a2fe | 1545 | */ |
76a33fc3 SL |
1546 | static void get_scan_count(struct zone *zone, struct scan_control *sc, |
1547 | unsigned long *nr, int priority) | |
4f98a2fe RR |
1548 | { |
1549 | unsigned long anon, file, free; | |
1550 | unsigned long anon_prio, file_prio; | |
1551 | unsigned long ap, fp; | |
6e901571 | 1552 | struct zone_reclaim_stat *reclaim_stat = get_reclaim_stat(zone, sc); |
76a33fc3 SL |
1553 | u64 fraction[2], denominator; |
1554 | enum lru_list l; | |
1555 | int noswap = 0; | |
1556 | ||
1557 | /* If we have no swap space, do not bother scanning anon pages. */ | |
1558 | if (!sc->may_swap || (nr_swap_pages <= 0)) { | |
1559 | noswap = 1; | |
1560 | fraction[0] = 0; | |
1561 | fraction[1] = 1; | |
1562 | denominator = 1; | |
1563 | goto out; | |
1564 | } | |
4f98a2fe | 1565 | |
0b217676 VL |
1566 | anon = zone_nr_lru_pages(zone, sc, LRU_ACTIVE_ANON) + |
1567 | zone_nr_lru_pages(zone, sc, LRU_INACTIVE_ANON); | |
1568 | file = zone_nr_lru_pages(zone, sc, LRU_ACTIVE_FILE) + | |
1569 | zone_nr_lru_pages(zone, sc, LRU_INACTIVE_FILE); | |
b962716b | 1570 | |
e72e2bd6 | 1571 | if (scanning_global_lru(sc)) { |
eeee9a8c KM |
1572 | free = zone_page_state(zone, NR_FREE_PAGES); |
1573 | /* If we have very few page cache pages, | |
1574 | force-scan anon pages. */ | |
41858966 | 1575 | if (unlikely(file + free <= high_wmark_pages(zone))) { |
76a33fc3 SL |
1576 | fraction[0] = 1; |
1577 | fraction[1] = 0; | |
1578 | denominator = 1; | |
1579 | goto out; | |
eeee9a8c | 1580 | } |
4f98a2fe RR |
1581 | } |
1582 | ||
1583 | /* | |
1584 | * OK, so we have swap space and a fair amount of page cache | |
1585 | * pages. We use the recently rotated / recently scanned | |
1586 | * ratios to determine how valuable each cache is. | |
1587 | * | |
1588 | * Because workloads change over time (and to avoid overflow) | |
1589 | * we keep these statistics as a floating average, which ends | |
1590 | * up weighing recent references more than old ones. | |
1591 | * | |
1592 | * anon in [0], file in [1] | |
1593 | */ | |
6e901571 | 1594 | if (unlikely(reclaim_stat->recent_scanned[0] > anon / 4)) { |
4f98a2fe | 1595 | spin_lock_irq(&zone->lru_lock); |
6e901571 KM |
1596 | reclaim_stat->recent_scanned[0] /= 2; |
1597 | reclaim_stat->recent_rotated[0] /= 2; | |
4f98a2fe RR |
1598 | spin_unlock_irq(&zone->lru_lock); |
1599 | } | |
1600 | ||
6e901571 | 1601 | if (unlikely(reclaim_stat->recent_scanned[1] > file / 4)) { |
4f98a2fe | 1602 | spin_lock_irq(&zone->lru_lock); |
6e901571 KM |
1603 | reclaim_stat->recent_scanned[1] /= 2; |
1604 | reclaim_stat->recent_rotated[1] /= 2; | |
4f98a2fe RR |
1605 | spin_unlock_irq(&zone->lru_lock); |
1606 | } | |
1607 | ||
1608 | /* | |
1609 | * With swappiness at 100, anonymous and file have the same priority. | |
1610 | * This scanning priority is essentially the inverse of IO cost. | |
1611 | */ | |
1612 | anon_prio = sc->swappiness; | |
1613 | file_prio = 200 - sc->swappiness; | |
1614 | ||
1615 | /* | |
00d8089c RR |
1616 | * The amount of pressure on anon vs file pages is inversely |
1617 | * proportional to the fraction of recently scanned pages on | |
1618 | * each list that were recently referenced and in active use. | |
4f98a2fe | 1619 | */ |
6e901571 KM |
1620 | ap = (anon_prio + 1) * (reclaim_stat->recent_scanned[0] + 1); |
1621 | ap /= reclaim_stat->recent_rotated[0] + 1; | |
4f98a2fe | 1622 | |
6e901571 KM |
1623 | fp = (file_prio + 1) * (reclaim_stat->recent_scanned[1] + 1); |
1624 | fp /= reclaim_stat->recent_rotated[1] + 1; | |
4f98a2fe | 1625 | |
76a33fc3 SL |
1626 | fraction[0] = ap; |
1627 | fraction[1] = fp; | |
1628 | denominator = ap + fp + 1; | |
1629 | out: | |
1630 | for_each_evictable_lru(l) { | |
1631 | int file = is_file_lru(l); | |
1632 | unsigned long scan; | |
6e08a369 | 1633 | |
76a33fc3 SL |
1634 | scan = zone_nr_lru_pages(zone, sc, l); |
1635 | if (priority || noswap) { | |
1636 | scan >>= priority; | |
1637 | scan = div64_u64(scan * fraction[file], denominator); | |
1638 | } | |
1639 | nr[l] = nr_scan_try_batch(scan, | |
1640 | &reclaim_stat->nr_saved_scan[l]); | |
1641 | } | |
6e08a369 | 1642 | } |
4f98a2fe | 1643 | |
5f53e762 KM |
1644 | static void set_lumpy_reclaim_mode(int priority, struct scan_control *sc) |
1645 | { | |
1646 | /* | |
1647 | * If we need a large contiguous chunk of memory, or have | |
1648 | * trouble getting a small set of contiguous pages, we | |
1649 | * will reclaim both active and inactive pages. | |
1650 | */ | |
1651 | if (sc->order > PAGE_ALLOC_COSTLY_ORDER) | |
1652 | sc->lumpy_reclaim_mode = 1; | |
1653 | else if (sc->order && priority < DEF_PRIORITY - 2) | |
1654 | sc->lumpy_reclaim_mode = 1; | |
1655 | else | |
1656 | sc->lumpy_reclaim_mode = 0; | |
1657 | } | |
1658 | ||
1da177e4 LT |
1659 | /* |
1660 | * This is a basic per-zone page freer. Used by both kswapd and direct reclaim. | |
1661 | */ | |
a79311c1 | 1662 | static void shrink_zone(int priority, struct zone *zone, |
05ff5137 | 1663 | struct scan_control *sc) |
1da177e4 | 1664 | { |
b69408e8 | 1665 | unsigned long nr[NR_LRU_LISTS]; |
8695949a | 1666 | unsigned long nr_to_scan; |
b69408e8 | 1667 | enum lru_list l; |
01dbe5c9 | 1668 | unsigned long nr_reclaimed = sc->nr_reclaimed; |
22fba335 | 1669 | unsigned long nr_to_reclaim = sc->nr_to_reclaim; |
e0f79b8f | 1670 | |
76a33fc3 | 1671 | get_scan_count(zone, sc, nr, priority); |
1da177e4 | 1672 | |
5f53e762 KM |
1673 | set_lumpy_reclaim_mode(priority, sc); |
1674 | ||
556adecb RR |
1675 | while (nr[LRU_INACTIVE_ANON] || nr[LRU_ACTIVE_FILE] || |
1676 | nr[LRU_INACTIVE_FILE]) { | |
894bc310 | 1677 | for_each_evictable_lru(l) { |
b69408e8 | 1678 | if (nr[l]) { |
ece74b2e KM |
1679 | nr_to_scan = min_t(unsigned long, |
1680 | nr[l], SWAP_CLUSTER_MAX); | |
b69408e8 | 1681 | nr[l] -= nr_to_scan; |
1da177e4 | 1682 | |
01dbe5c9 KM |
1683 | nr_reclaimed += shrink_list(l, nr_to_scan, |
1684 | zone, sc, priority); | |
b69408e8 | 1685 | } |
1da177e4 | 1686 | } |
a79311c1 RR |
1687 | /* |
1688 | * On large memory systems, scan >> priority can become | |
1689 | * really large. This is fine for the starting priority; | |
1690 | * we want to put equal scanning pressure on each zone. | |
1691 | * However, if the VM has a harder time of freeing pages, | |
1692 | * with multiple processes reclaiming pages, the total | |
1693 | * freeing target can get unreasonably large. | |
1694 | */ | |
338fde90 | 1695 | if (nr_reclaimed >= nr_to_reclaim && priority < DEF_PRIORITY) |
a79311c1 | 1696 | break; |
1da177e4 LT |
1697 | } |
1698 | ||
01dbe5c9 KM |
1699 | sc->nr_reclaimed = nr_reclaimed; |
1700 | ||
556adecb RR |
1701 | /* |
1702 | * Even if we did not try to evict anon pages at all, we want to | |
1703 | * rebalance the anon lru active/inactive ratio. | |
1704 | */ | |
69c85481 | 1705 | if (inactive_anon_is_low(zone, sc) && nr_swap_pages > 0) |
556adecb RR |
1706 | shrink_active_list(SWAP_CLUSTER_MAX, zone, sc, priority, 0); |
1707 | ||
232ea4d6 | 1708 | throttle_vm_writeout(sc->gfp_mask); |
1da177e4 LT |
1709 | } |
1710 | ||
1711 | /* | |
1712 | * This is the direct reclaim path, for page-allocating processes. We only | |
1713 | * try to reclaim pages from zones which will satisfy the caller's allocation | |
1714 | * request. | |
1715 | * | |
41858966 MG |
1716 | * We reclaim from a zone even if that zone is over high_wmark_pages(zone). |
1717 | * Because: | |
1da177e4 LT |
1718 | * a) The caller may be trying to free *extra* pages to satisfy a higher-order |
1719 | * allocation or | |
41858966 MG |
1720 | * b) The target zone may be at high_wmark_pages(zone) but the lower zones |
1721 | * must go *over* high_wmark_pages(zone) to satisfy the `incremental min' | |
1722 | * zone defense algorithm. | |
1da177e4 | 1723 | * |
1da177e4 LT |
1724 | * If a zone is deemed to be full of pinned pages then just give it a light |
1725 | * scan then give up on it. | |
1726 | */ | |
0aeb2339 | 1727 | static int shrink_zones(int priority, struct zonelist *zonelist, |
05ff5137 | 1728 | struct scan_control *sc) |
1da177e4 | 1729 | { |
54a6eb5c | 1730 | enum zone_type high_zoneidx = gfp_zone(sc->gfp_mask); |
dd1a239f | 1731 | struct zoneref *z; |
54a6eb5c | 1732 | struct zone *zone; |
0aeb2339 | 1733 | int progress = 0; |
1cfb419b | 1734 | |
327c0e96 KH |
1735 | for_each_zone_zonelist_nodemask(zone, z, zonelist, high_zoneidx, |
1736 | sc->nodemask) { | |
f3fe6512 | 1737 | if (!populated_zone(zone)) |
1da177e4 | 1738 | continue; |
1cfb419b KH |
1739 | /* |
1740 | * Take care memory controller reclaiming has small influence | |
1741 | * to global LRU. | |
1742 | */ | |
e72e2bd6 | 1743 | if (scanning_global_lru(sc)) { |
1cfb419b KH |
1744 | if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL)) |
1745 | continue; | |
1746 | note_zone_scanning_priority(zone, priority); | |
1da177e4 | 1747 | |
93e4a89a | 1748 | if (zone->all_unreclaimable && priority != DEF_PRIORITY) |
1cfb419b | 1749 | continue; /* Let kswapd poll it */ |
1cfb419b KH |
1750 | } else { |
1751 | /* | |
1752 | * Ignore cpuset limitation here. We just want to reduce | |
1753 | * # of used pages by us regardless of memory shortage. | |
1754 | */ | |
1cfb419b KH |
1755 | mem_cgroup_note_reclaim_priority(sc->mem_cgroup, |
1756 | priority); | |
1757 | } | |
408d8544 | 1758 | |
a79311c1 | 1759 | shrink_zone(priority, zone, sc); |
0aeb2339 | 1760 | progress = 1; |
1da177e4 | 1761 | } |
0aeb2339 | 1762 | return progress; |
1da177e4 | 1763 | } |
4f98a2fe | 1764 | |
1da177e4 LT |
1765 | /* |
1766 | * This is the main entry point to direct page reclaim. | |
1767 | * | |
1768 | * If a full scan of the inactive list fails to free enough memory then we | |
1769 | * are "out of memory" and something needs to be killed. | |
1770 | * | |
1771 | * If the caller is !__GFP_FS then the probability of a failure is reasonably | |
1772 | * high - the zone may be full of dirty or under-writeback pages, which this | |
5b0830cb JA |
1773 | * caller can't do much about. We kick the writeback threads and take explicit |
1774 | * naps in the hope that some of these pages can be written. But if the | |
1775 | * allocating task holds filesystem locks which prevent writeout this might not | |
1776 | * work, and the allocation attempt will fail. | |
a41f24ea NA |
1777 | * |
1778 | * returns: 0, if no pages reclaimed | |
1779 | * else, the number of pages reclaimed | |
1da177e4 | 1780 | */ |
dac1d27b | 1781 | static unsigned long do_try_to_free_pages(struct zonelist *zonelist, |
dd1a239f | 1782 | struct scan_control *sc) |
1da177e4 LT |
1783 | { |
1784 | int priority; | |
c700be3d | 1785 | unsigned long ret = 0; |
69e05944 | 1786 | unsigned long total_scanned = 0; |
1da177e4 | 1787 | struct reclaim_state *reclaim_state = current->reclaim_state; |
1da177e4 | 1788 | unsigned long lru_pages = 0; |
dd1a239f | 1789 | struct zoneref *z; |
54a6eb5c | 1790 | struct zone *zone; |
dd1a239f | 1791 | enum zone_type high_zoneidx = gfp_zone(sc->gfp_mask); |
22fba335 | 1792 | unsigned long writeback_threshold; |
1da177e4 | 1793 | |
c0ff7453 | 1794 | get_mems_allowed(); |
873b4771 KK |
1795 | delayacct_freepages_start(); |
1796 | ||
e72e2bd6 | 1797 | if (scanning_global_lru(sc)) |
1cfb419b KH |
1798 | count_vm_event(ALLOCSTALL); |
1799 | /* | |
1800 | * mem_cgroup will not do shrink_slab. | |
1801 | */ | |
e72e2bd6 | 1802 | if (scanning_global_lru(sc)) { |
54a6eb5c | 1803 | for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) { |
1da177e4 | 1804 | |
1cfb419b KH |
1805 | if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL)) |
1806 | continue; | |
1da177e4 | 1807 | |
adea02a1 | 1808 | lru_pages += zone_reclaimable_pages(zone); |
1cfb419b | 1809 | } |
1da177e4 LT |
1810 | } |
1811 | ||
1812 | for (priority = DEF_PRIORITY; priority >= 0; priority--) { | |
66e1707b | 1813 | sc->nr_scanned = 0; |
f7b7fd8f RR |
1814 | if (!priority) |
1815 | disable_swap_token(); | |
0aeb2339 | 1816 | ret = shrink_zones(priority, zonelist, sc); |
66e1707b BS |
1817 | /* |
1818 | * Don't shrink slabs when reclaiming memory from | |
1819 | * over limit cgroups | |
1820 | */ | |
e72e2bd6 | 1821 | if (scanning_global_lru(sc)) { |
dd1a239f | 1822 | shrink_slab(sc->nr_scanned, sc->gfp_mask, lru_pages); |
91a45470 | 1823 | if (reclaim_state) { |
a79311c1 | 1824 | sc->nr_reclaimed += reclaim_state->reclaimed_slab; |
91a45470 KH |
1825 | reclaim_state->reclaimed_slab = 0; |
1826 | } | |
1da177e4 | 1827 | } |
66e1707b | 1828 | total_scanned += sc->nr_scanned; |
22fba335 | 1829 | if (sc->nr_reclaimed >= sc->nr_to_reclaim) { |
a79311c1 | 1830 | ret = sc->nr_reclaimed; |
1da177e4 LT |
1831 | goto out; |
1832 | } | |
1833 | ||
1834 | /* | |
1835 | * Try to write back as many pages as we just scanned. This | |
1836 | * tends to cause slow streaming writers to write data to the | |
1837 | * disk smoothly, at the dirtying rate, which is nice. But | |
1838 | * that's undesirable in laptop mode, where we *want* lumpy | |
1839 | * writeout. So in laptop mode, write out the whole world. | |
1840 | */ | |
22fba335 KM |
1841 | writeback_threshold = sc->nr_to_reclaim + sc->nr_to_reclaim / 2; |
1842 | if (total_scanned > writeback_threshold) { | |
03ba3782 | 1843 | wakeup_flusher_threads(laptop_mode ? 0 : total_scanned); |
66e1707b | 1844 | sc->may_writepage = 1; |
1da177e4 LT |
1845 | } |
1846 | ||
1847 | /* Take a nap, wait for some writeback to complete */ | |
7b51755c KM |
1848 | if (!sc->hibernation_mode && sc->nr_scanned && |
1849 | priority < DEF_PRIORITY - 2) | |
8aa7e847 | 1850 | congestion_wait(BLK_RW_ASYNC, HZ/10); |
1da177e4 | 1851 | } |
87547ee9 | 1852 | /* top priority shrink_zones still had more to do? don't OOM, then */ |
0aeb2339 | 1853 | if (ret && scanning_global_lru(sc)) |
a79311c1 | 1854 | ret = sc->nr_reclaimed; |
1da177e4 | 1855 | out: |
3bb1a852 MB |
1856 | /* |
1857 | * Now that we've scanned all the zones at this priority level, note | |
1858 | * that level within the zone so that the next thread which performs | |
1859 | * scanning of this zone will immediately start out at this priority | |
1860 | * level. This affects only the decision whether or not to bring | |
1861 | * mapped pages onto the inactive list. | |
1862 | */ | |
1863 | if (priority < 0) | |
1864 | priority = 0; | |
1da177e4 | 1865 | |
e72e2bd6 | 1866 | if (scanning_global_lru(sc)) { |
54a6eb5c | 1867 | for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) { |
1cfb419b KH |
1868 | |
1869 | if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL)) | |
1870 | continue; | |
1871 | ||
1872 | zone->prev_priority = priority; | |
1873 | } | |
1874 | } else | |
1875 | mem_cgroup_record_reclaim_priority(sc->mem_cgroup, priority); | |
1da177e4 | 1876 | |
873b4771 | 1877 | delayacct_freepages_end(); |
c0ff7453 | 1878 | put_mems_allowed(); |
873b4771 | 1879 | |
1da177e4 LT |
1880 | return ret; |
1881 | } | |
1882 | ||
dac1d27b | 1883 | unsigned long try_to_free_pages(struct zonelist *zonelist, int order, |
327c0e96 | 1884 | gfp_t gfp_mask, nodemask_t *nodemask) |
66e1707b BS |
1885 | { |
1886 | struct scan_control sc = { | |
1887 | .gfp_mask = gfp_mask, | |
1888 | .may_writepage = !laptop_mode, | |
22fba335 | 1889 | .nr_to_reclaim = SWAP_CLUSTER_MAX, |
a6dc60f8 | 1890 | .may_unmap = 1, |
2e2e4259 | 1891 | .may_swap = 1, |
66e1707b BS |
1892 | .swappiness = vm_swappiness, |
1893 | .order = order, | |
1894 | .mem_cgroup = NULL, | |
327c0e96 | 1895 | .nodemask = nodemask, |
66e1707b BS |
1896 | }; |
1897 | ||
dd1a239f | 1898 | return do_try_to_free_pages(zonelist, &sc); |
66e1707b BS |
1899 | } |
1900 | ||
00f0b825 | 1901 | #ifdef CONFIG_CGROUP_MEM_RES_CTLR |
66e1707b | 1902 | |
4e416953 BS |
1903 | unsigned long mem_cgroup_shrink_node_zone(struct mem_cgroup *mem, |
1904 | gfp_t gfp_mask, bool noswap, | |
1905 | unsigned int swappiness, | |
1906 | struct zone *zone, int nid) | |
1907 | { | |
1908 | struct scan_control sc = { | |
1909 | .may_writepage = !laptop_mode, | |
1910 | .may_unmap = 1, | |
1911 | .may_swap = !noswap, | |
4e416953 BS |
1912 | .swappiness = swappiness, |
1913 | .order = 0, | |
1914 | .mem_cgroup = mem, | |
4e416953 BS |
1915 | }; |
1916 | nodemask_t nm = nodemask_of_node(nid); | |
1917 | ||
1918 | sc.gfp_mask = (gfp_mask & GFP_RECLAIM_MASK) | | |
1919 | (GFP_HIGHUSER_MOVABLE & ~GFP_RECLAIM_MASK); | |
1920 | sc.nodemask = &nm; | |
1921 | sc.nr_reclaimed = 0; | |
1922 | sc.nr_scanned = 0; | |
1923 | /* | |
1924 | * NOTE: Although we can get the priority field, using it | |
1925 | * here is not a good idea, since it limits the pages we can scan. | |
1926 | * if we don't reclaim here, the shrink_zone from balance_pgdat | |
1927 | * will pick up pages from other mem cgroup's as well. We hack | |
1928 | * the priority and make it zero. | |
1929 | */ | |
1930 | shrink_zone(0, zone, &sc); | |
1931 | return sc.nr_reclaimed; | |
1932 | } | |
1933 | ||
e1a1cd59 | 1934 | unsigned long try_to_free_mem_cgroup_pages(struct mem_cgroup *mem_cont, |
a7885eb8 KM |
1935 | gfp_t gfp_mask, |
1936 | bool noswap, | |
1937 | unsigned int swappiness) | |
66e1707b | 1938 | { |
4e416953 | 1939 | struct zonelist *zonelist; |
66e1707b | 1940 | struct scan_control sc = { |
66e1707b | 1941 | .may_writepage = !laptop_mode, |
a6dc60f8 | 1942 | .may_unmap = 1, |
2e2e4259 | 1943 | .may_swap = !noswap, |
22fba335 | 1944 | .nr_to_reclaim = SWAP_CLUSTER_MAX, |
a7885eb8 | 1945 | .swappiness = swappiness, |
66e1707b BS |
1946 | .order = 0, |
1947 | .mem_cgroup = mem_cont, | |
327c0e96 | 1948 | .nodemask = NULL, /* we don't care the placement */ |
66e1707b | 1949 | }; |
66e1707b | 1950 | |
dd1a239f MG |
1951 | sc.gfp_mask = (gfp_mask & GFP_RECLAIM_MASK) | |
1952 | (GFP_HIGHUSER_MOVABLE & ~GFP_RECLAIM_MASK); | |
1953 | zonelist = NODE_DATA(numa_node_id())->node_zonelists; | |
1954 | return do_try_to_free_pages(zonelist, &sc); | |
66e1707b BS |
1955 | } |
1956 | #endif | |
1957 | ||
f50de2d3 | 1958 | /* is kswapd sleeping prematurely? */ |
bb3ab596 | 1959 | static int sleeping_prematurely(pg_data_t *pgdat, int order, long remaining) |
f50de2d3 | 1960 | { |
bb3ab596 | 1961 | int i; |
f50de2d3 MG |
1962 | |
1963 | /* If a direct reclaimer woke kswapd within HZ/10, it's premature */ | |
1964 | if (remaining) | |
1965 | return 1; | |
1966 | ||
1967 | /* If after HZ/10, a zone is below the high mark, it's premature */ | |
bb3ab596 KM |
1968 | for (i = 0; i < pgdat->nr_zones; i++) { |
1969 | struct zone *zone = pgdat->node_zones + i; | |
1970 | ||
1971 | if (!populated_zone(zone)) | |
1972 | continue; | |
1973 | ||
93e4a89a | 1974 | if (zone->all_unreclaimable) |
de3fab39 KM |
1975 | continue; |
1976 | ||
f50de2d3 MG |
1977 | if (!zone_watermark_ok(zone, order, high_wmark_pages(zone), |
1978 | 0, 0)) | |
1979 | return 1; | |
bb3ab596 | 1980 | } |
f50de2d3 MG |
1981 | |
1982 | return 0; | |
1983 | } | |
1984 | ||
1da177e4 LT |
1985 | /* |
1986 | * For kswapd, balance_pgdat() will work across all this node's zones until | |
41858966 | 1987 | * they are all at high_wmark_pages(zone). |
1da177e4 | 1988 | * |
1da177e4 LT |
1989 | * Returns the number of pages which were actually freed. |
1990 | * | |
1991 | * There is special handling here for zones which are full of pinned pages. | |
1992 | * This can happen if the pages are all mlocked, or if they are all used by | |
1993 | * device drivers (say, ZONE_DMA). Or if they are all in use by hugetlb. | |
1994 | * What we do is to detect the case where all pages in the zone have been | |
1995 | * scanned twice and there has been zero successful reclaim. Mark the zone as | |
1996 | * dead and from now on, only perform a short scan. Basically we're polling | |
1997 | * the zone for when the problem goes away. | |
1998 | * | |
1999 | * kswapd scans the zones in the highmem->normal->dma direction. It skips | |
41858966 MG |
2000 | * zones which have free_pages > high_wmark_pages(zone), but once a zone is |
2001 | * found to have free_pages <= high_wmark_pages(zone), we scan that zone and the | |
2002 | * lower zones regardless of the number of free pages in the lower zones. This | |
2003 | * interoperates with the page allocator fallback scheme to ensure that aging | |
2004 | * of pages is balanced across the zones. | |
1da177e4 | 2005 | */ |
d6277db4 | 2006 | static unsigned long balance_pgdat(pg_data_t *pgdat, int order) |
1da177e4 | 2007 | { |
1da177e4 LT |
2008 | int all_zones_ok; |
2009 | int priority; | |
2010 | int i; | |
69e05944 | 2011 | unsigned long total_scanned; |
1da177e4 | 2012 | struct reclaim_state *reclaim_state = current->reclaim_state; |
179e9639 AM |
2013 | struct scan_control sc = { |
2014 | .gfp_mask = GFP_KERNEL, | |
a6dc60f8 | 2015 | .may_unmap = 1, |
2e2e4259 | 2016 | .may_swap = 1, |
22fba335 KM |
2017 | /* |
2018 | * kswapd doesn't want to be bailed out while reclaim. because | |
2019 | * we want to put equal scanning pressure on each zone. | |
2020 | */ | |
2021 | .nr_to_reclaim = ULONG_MAX, | |
d6277db4 | 2022 | .swappiness = vm_swappiness, |
5ad333eb | 2023 | .order = order, |
66e1707b | 2024 | .mem_cgroup = NULL, |
179e9639 | 2025 | }; |
3bb1a852 MB |
2026 | /* |
2027 | * temp_priority is used to remember the scanning priority at which | |
41858966 MG |
2028 | * this zone was successfully refilled to |
2029 | * free_pages == high_wmark_pages(zone). | |
3bb1a852 MB |
2030 | */ |
2031 | int temp_priority[MAX_NR_ZONES]; | |
1da177e4 LT |
2032 | |
2033 | loop_again: | |
2034 | total_scanned = 0; | |
a79311c1 | 2035 | sc.nr_reclaimed = 0; |
c0bbbc73 | 2036 | sc.may_writepage = !laptop_mode; |
f8891e5e | 2037 | count_vm_event(PAGEOUTRUN); |
1da177e4 | 2038 | |
3bb1a852 MB |
2039 | for (i = 0; i < pgdat->nr_zones; i++) |
2040 | temp_priority[i] = DEF_PRIORITY; | |
1da177e4 LT |
2041 | |
2042 | for (priority = DEF_PRIORITY; priority >= 0; priority--) { | |
2043 | int end_zone = 0; /* Inclusive. 0 = ZONE_DMA */ | |
2044 | unsigned long lru_pages = 0; | |
bb3ab596 | 2045 | int has_under_min_watermark_zone = 0; |
1da177e4 | 2046 | |
f7b7fd8f RR |
2047 | /* The swap token gets in the way of swapout... */ |
2048 | if (!priority) | |
2049 | disable_swap_token(); | |
2050 | ||
1da177e4 LT |
2051 | all_zones_ok = 1; |
2052 | ||
d6277db4 RW |
2053 | /* |
2054 | * Scan in the highmem->dma direction for the highest | |
2055 | * zone which needs scanning | |
2056 | */ | |
2057 | for (i = pgdat->nr_zones - 1; i >= 0; i--) { | |
2058 | struct zone *zone = pgdat->node_zones + i; | |
1da177e4 | 2059 | |
d6277db4 RW |
2060 | if (!populated_zone(zone)) |
2061 | continue; | |
1da177e4 | 2062 | |
93e4a89a | 2063 | if (zone->all_unreclaimable && priority != DEF_PRIORITY) |
d6277db4 | 2064 | continue; |
1da177e4 | 2065 | |
556adecb RR |
2066 | /* |
2067 | * Do some background aging of the anon list, to give | |
2068 | * pages a chance to be referenced before reclaiming. | |
2069 | */ | |
14797e23 | 2070 | if (inactive_anon_is_low(zone, &sc)) |
556adecb RR |
2071 | shrink_active_list(SWAP_CLUSTER_MAX, zone, |
2072 | &sc, priority, 0); | |
2073 | ||
41858966 MG |
2074 | if (!zone_watermark_ok(zone, order, |
2075 | high_wmark_pages(zone), 0, 0)) { | |
d6277db4 | 2076 | end_zone = i; |
e1dbeda6 | 2077 | break; |
1da177e4 | 2078 | } |
1da177e4 | 2079 | } |
e1dbeda6 AM |
2080 | if (i < 0) |
2081 | goto out; | |
2082 | ||
1da177e4 LT |
2083 | for (i = 0; i <= end_zone; i++) { |
2084 | struct zone *zone = pgdat->node_zones + i; | |
2085 | ||
adea02a1 | 2086 | lru_pages += zone_reclaimable_pages(zone); |
1da177e4 LT |
2087 | } |
2088 | ||
2089 | /* | |
2090 | * Now scan the zone in the dma->highmem direction, stopping | |
2091 | * at the last zone which needs scanning. | |
2092 | * | |
2093 | * We do this because the page allocator works in the opposite | |
2094 | * direction. This prevents the page allocator from allocating | |
2095 | * pages behind kswapd's direction of progress, which would | |
2096 | * cause too much scanning of the lower zones. | |
2097 | */ | |
2098 | for (i = 0; i <= end_zone; i++) { | |
2099 | struct zone *zone = pgdat->node_zones + i; | |
b15e0905 | 2100 | int nr_slab; |
4e416953 | 2101 | int nid, zid; |
1da177e4 | 2102 | |
f3fe6512 | 2103 | if (!populated_zone(zone)) |
1da177e4 LT |
2104 | continue; |
2105 | ||
93e4a89a | 2106 | if (zone->all_unreclaimable && priority != DEF_PRIORITY) |
1da177e4 LT |
2107 | continue; |
2108 | ||
3bb1a852 | 2109 | temp_priority[i] = priority; |
1da177e4 | 2110 | sc.nr_scanned = 0; |
3bb1a852 | 2111 | note_zone_scanning_priority(zone, priority); |
4e416953 BS |
2112 | |
2113 | nid = pgdat->node_id; | |
2114 | zid = zone_idx(zone); | |
2115 | /* | |
2116 | * Call soft limit reclaim before calling shrink_zone. | |
2117 | * For now we ignore the return value | |
2118 | */ | |
2119 | mem_cgroup_soft_limit_reclaim(zone, order, sc.gfp_mask, | |
2120 | nid, zid); | |
32a4330d RR |
2121 | /* |
2122 | * We put equal pressure on every zone, unless one | |
2123 | * zone has way too many pages free already. | |
2124 | */ | |
41858966 MG |
2125 | if (!zone_watermark_ok(zone, order, |
2126 | 8*high_wmark_pages(zone), end_zone, 0)) | |
a79311c1 | 2127 | shrink_zone(priority, zone, &sc); |
1da177e4 | 2128 | reclaim_state->reclaimed_slab = 0; |
b15e0905 | 2129 | nr_slab = shrink_slab(sc.nr_scanned, GFP_KERNEL, |
2130 | lru_pages); | |
a79311c1 | 2131 | sc.nr_reclaimed += reclaim_state->reclaimed_slab; |
1da177e4 | 2132 | total_scanned += sc.nr_scanned; |
93e4a89a | 2133 | if (zone->all_unreclaimable) |
1da177e4 | 2134 | continue; |
93e4a89a KM |
2135 | if (nr_slab == 0 && |
2136 | zone->pages_scanned >= (zone_reclaimable_pages(zone) * 6)) | |
2137 | zone->all_unreclaimable = 1; | |
1da177e4 LT |
2138 | /* |
2139 | * If we've done a decent amount of scanning and | |
2140 | * the reclaim ratio is low, start doing writepage | |
2141 | * even in laptop mode | |
2142 | */ | |
2143 | if (total_scanned > SWAP_CLUSTER_MAX * 2 && | |
a79311c1 | 2144 | total_scanned > sc.nr_reclaimed + sc.nr_reclaimed / 2) |
1da177e4 | 2145 | sc.may_writepage = 1; |
bb3ab596 | 2146 | |
45973d74 MK |
2147 | if (!zone_watermark_ok(zone, order, |
2148 | high_wmark_pages(zone), end_zone, 0)) { | |
2149 | all_zones_ok = 0; | |
2150 | /* | |
2151 | * We are still under min water mark. This | |
2152 | * means that we have a GFP_ATOMIC allocation | |
2153 | * failure risk. Hurry up! | |
2154 | */ | |
2155 | if (!zone_watermark_ok(zone, order, | |
2156 | min_wmark_pages(zone), end_zone, 0)) | |
2157 | has_under_min_watermark_zone = 1; | |
2158 | } | |
bb3ab596 | 2159 | |
1da177e4 | 2160 | } |
1da177e4 LT |
2161 | if (all_zones_ok) |
2162 | break; /* kswapd: all done */ | |
2163 | /* | |
2164 | * OK, kswapd is getting into trouble. Take a nap, then take | |
2165 | * another pass across the zones. | |
2166 | */ | |
bb3ab596 KM |
2167 | if (total_scanned && (priority < DEF_PRIORITY - 2)) { |
2168 | if (has_under_min_watermark_zone) | |
2169 | count_vm_event(KSWAPD_SKIP_CONGESTION_WAIT); | |
2170 | else | |
2171 | congestion_wait(BLK_RW_ASYNC, HZ/10); | |
2172 | } | |
1da177e4 LT |
2173 | |
2174 | /* | |
2175 | * We do this so kswapd doesn't build up large priorities for | |
2176 | * example when it is freeing in parallel with allocators. It | |
2177 | * matches the direct reclaim path behaviour in terms of impact | |
2178 | * on zone->*_priority. | |
2179 | */ | |
a79311c1 | 2180 | if (sc.nr_reclaimed >= SWAP_CLUSTER_MAX) |
1da177e4 LT |
2181 | break; |
2182 | } | |
2183 | out: | |
3bb1a852 MB |
2184 | /* |
2185 | * Note within each zone the priority level at which this zone was | |
2186 | * brought into a happy state. So that the next thread which scans this | |
2187 | * zone will start out at that priority level. | |
2188 | */ | |
1da177e4 LT |
2189 | for (i = 0; i < pgdat->nr_zones; i++) { |
2190 | struct zone *zone = pgdat->node_zones + i; | |
2191 | ||
3bb1a852 | 2192 | zone->prev_priority = temp_priority[i]; |
1da177e4 LT |
2193 | } |
2194 | if (!all_zones_ok) { | |
2195 | cond_resched(); | |
8357376d RW |
2196 | |
2197 | try_to_freeze(); | |
2198 | ||
73ce02e9 KM |
2199 | /* |
2200 | * Fragmentation may mean that the system cannot be | |
2201 | * rebalanced for high-order allocations in all zones. | |
2202 | * At this point, if nr_reclaimed < SWAP_CLUSTER_MAX, | |
2203 | * it means the zones have been fully scanned and are still | |
2204 | * not balanced. For high-order allocations, there is | |
2205 | * little point trying all over again as kswapd may | |
2206 | * infinite loop. | |
2207 | * | |
2208 | * Instead, recheck all watermarks at order-0 as they | |
2209 | * are the most important. If watermarks are ok, kswapd will go | |
2210 | * back to sleep. High-order users can still perform direct | |
2211 | * reclaim if they wish. | |
2212 | */ | |
2213 | if (sc.nr_reclaimed < SWAP_CLUSTER_MAX) | |
2214 | order = sc.order = 0; | |
2215 | ||
1da177e4 LT |
2216 | goto loop_again; |
2217 | } | |
2218 | ||
a79311c1 | 2219 | return sc.nr_reclaimed; |
1da177e4 LT |
2220 | } |
2221 | ||
2222 | /* | |
2223 | * The background pageout daemon, started as a kernel thread | |
4f98a2fe | 2224 | * from the init process. |
1da177e4 LT |
2225 | * |
2226 | * This basically trickles out pages so that we have _some_ | |
2227 | * free memory available even if there is no other activity | |
2228 | * that frees anything up. This is needed for things like routing | |
2229 | * etc, where we otherwise might have all activity going on in | |
2230 | * asynchronous contexts that cannot page things out. | |
2231 | * | |
2232 | * If there are applications that are active memory-allocators | |
2233 | * (most normal use), this basically shouldn't matter. | |
2234 | */ | |
2235 | static int kswapd(void *p) | |
2236 | { | |
2237 | unsigned long order; | |
2238 | pg_data_t *pgdat = (pg_data_t*)p; | |
2239 | struct task_struct *tsk = current; | |
2240 | DEFINE_WAIT(wait); | |
2241 | struct reclaim_state reclaim_state = { | |
2242 | .reclaimed_slab = 0, | |
2243 | }; | |
a70f7302 | 2244 | const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id); |
1da177e4 | 2245 | |
cf40bd16 NP |
2246 | lockdep_set_current_reclaim_state(GFP_KERNEL); |
2247 | ||
174596a0 | 2248 | if (!cpumask_empty(cpumask)) |
c5f59f08 | 2249 | set_cpus_allowed_ptr(tsk, cpumask); |
1da177e4 LT |
2250 | current->reclaim_state = &reclaim_state; |
2251 | ||
2252 | /* | |
2253 | * Tell the memory management that we're a "memory allocator", | |
2254 | * and that if we need more memory we should get access to it | |
2255 | * regardless (see "__alloc_pages()"). "kswapd" should | |
2256 | * never get caught in the normal page freeing logic. | |
2257 | * | |
2258 | * (Kswapd normally doesn't need memory anyway, but sometimes | |
2259 | * you need a small amount of memory in order to be able to | |
2260 | * page out something else, and this flag essentially protects | |
2261 | * us from recursively trying to free more memory as we're | |
2262 | * trying to free the first piece of memory in the first place). | |
2263 | */ | |
930d9152 | 2264 | tsk->flags |= PF_MEMALLOC | PF_SWAPWRITE | PF_KSWAPD; |
83144186 | 2265 | set_freezable(); |
1da177e4 LT |
2266 | |
2267 | order = 0; | |
2268 | for ( ; ; ) { | |
2269 | unsigned long new_order; | |
8fe23e05 | 2270 | int ret; |
3e1d1d28 | 2271 | |
1da177e4 LT |
2272 | prepare_to_wait(&pgdat->kswapd_wait, &wait, TASK_INTERRUPTIBLE); |
2273 | new_order = pgdat->kswapd_max_order; | |
2274 | pgdat->kswapd_max_order = 0; | |
2275 | if (order < new_order) { | |
2276 | /* | |
2277 | * Don't sleep if someone wants a larger 'order' | |
2278 | * allocation | |
2279 | */ | |
2280 | order = new_order; | |
2281 | } else { | |
f50de2d3 MG |
2282 | if (!freezing(current) && !kthread_should_stop()) { |
2283 | long remaining = 0; | |
2284 | ||
2285 | /* Try to sleep for a short interval */ | |
bb3ab596 | 2286 | if (!sleeping_prematurely(pgdat, order, remaining)) { |
f50de2d3 MG |
2287 | remaining = schedule_timeout(HZ/10); |
2288 | finish_wait(&pgdat->kswapd_wait, &wait); | |
2289 | prepare_to_wait(&pgdat->kswapd_wait, &wait, TASK_INTERRUPTIBLE); | |
2290 | } | |
2291 | ||
2292 | /* | |
2293 | * After a short sleep, check if it was a | |
2294 | * premature sleep. If not, then go fully | |
2295 | * to sleep until explicitly woken up | |
2296 | */ | |
bb3ab596 | 2297 | if (!sleeping_prematurely(pgdat, order, remaining)) |
f50de2d3 MG |
2298 | schedule(); |
2299 | else { | |
2300 | if (remaining) | |
bb3ab596 | 2301 | count_vm_event(KSWAPD_LOW_WMARK_HIT_QUICKLY); |
f50de2d3 | 2302 | else |
bb3ab596 | 2303 | count_vm_event(KSWAPD_HIGH_WMARK_HIT_QUICKLY); |
f50de2d3 MG |
2304 | } |
2305 | } | |
b1296cc4 | 2306 | |
1da177e4 LT |
2307 | order = pgdat->kswapd_max_order; |
2308 | } | |
2309 | finish_wait(&pgdat->kswapd_wait, &wait); | |
2310 | ||
8fe23e05 DR |
2311 | ret = try_to_freeze(); |
2312 | if (kthread_should_stop()) | |
2313 | break; | |
2314 | ||
2315 | /* | |
2316 | * We can speed up thawing tasks if we don't call balance_pgdat | |
2317 | * after returning from the refrigerator | |
2318 | */ | |
2319 | if (!ret) | |
b1296cc4 | 2320 | balance_pgdat(pgdat, order); |
1da177e4 LT |
2321 | } |
2322 | return 0; | |
2323 | } | |
2324 | ||
2325 | /* | |
2326 | * A zone is low on free memory, so wake its kswapd task to service it. | |
2327 | */ | |
2328 | void wakeup_kswapd(struct zone *zone, int order) | |
2329 | { | |
2330 | pg_data_t *pgdat; | |
2331 | ||
f3fe6512 | 2332 | if (!populated_zone(zone)) |
1da177e4 LT |
2333 | return; |
2334 | ||
2335 | pgdat = zone->zone_pgdat; | |
41858966 | 2336 | if (zone_watermark_ok(zone, order, low_wmark_pages(zone), 0, 0)) |
1da177e4 LT |
2337 | return; |
2338 | if (pgdat->kswapd_max_order < order) | |
2339 | pgdat->kswapd_max_order = order; | |
02a0e53d | 2340 | if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL)) |
1da177e4 | 2341 | return; |
8d0986e2 | 2342 | if (!waitqueue_active(&pgdat->kswapd_wait)) |
1da177e4 | 2343 | return; |
8d0986e2 | 2344 | wake_up_interruptible(&pgdat->kswapd_wait); |
1da177e4 LT |
2345 | } |
2346 | ||
adea02a1 WF |
2347 | /* |
2348 | * The reclaimable count would be mostly accurate. | |
2349 | * The less reclaimable pages may be | |
2350 | * - mlocked pages, which will be moved to unevictable list when encountered | |
2351 | * - mapped pages, which may require several travels to be reclaimed | |
2352 | * - dirty pages, which is not "instantly" reclaimable | |
2353 | */ | |
2354 | unsigned long global_reclaimable_pages(void) | |
4f98a2fe | 2355 | { |
adea02a1 WF |
2356 | int nr; |
2357 | ||
2358 | nr = global_page_state(NR_ACTIVE_FILE) + | |
2359 | global_page_state(NR_INACTIVE_FILE); | |
2360 | ||
2361 | if (nr_swap_pages > 0) | |
2362 | nr += global_page_state(NR_ACTIVE_ANON) + | |
2363 | global_page_state(NR_INACTIVE_ANON); | |
2364 | ||
2365 | return nr; | |
2366 | } | |
2367 | ||
2368 | unsigned long zone_reclaimable_pages(struct zone *zone) | |
2369 | { | |
2370 | int nr; | |
2371 | ||
2372 | nr = zone_page_state(zone, NR_ACTIVE_FILE) + | |
2373 | zone_page_state(zone, NR_INACTIVE_FILE); | |
2374 | ||
2375 | if (nr_swap_pages > 0) | |
2376 | nr += zone_page_state(zone, NR_ACTIVE_ANON) + | |
2377 | zone_page_state(zone, NR_INACTIVE_ANON); | |
2378 | ||
2379 | return nr; | |
4f98a2fe RR |
2380 | } |
2381 | ||
c6f37f12 | 2382 | #ifdef CONFIG_HIBERNATION |
1da177e4 | 2383 | /* |
7b51755c | 2384 | * Try to free `nr_to_reclaim' of memory, system-wide, and return the number of |
d6277db4 RW |
2385 | * freed pages. |
2386 | * | |
2387 | * Rather than trying to age LRUs the aim is to preserve the overall | |
2388 | * LRU order by reclaiming preferentially | |
2389 | * inactive > active > active referenced > active mapped | |
1da177e4 | 2390 | */ |
7b51755c | 2391 | unsigned long shrink_all_memory(unsigned long nr_to_reclaim) |
1da177e4 | 2392 | { |
d6277db4 | 2393 | struct reclaim_state reclaim_state; |
d6277db4 | 2394 | struct scan_control sc = { |
7b51755c KM |
2395 | .gfp_mask = GFP_HIGHUSER_MOVABLE, |
2396 | .may_swap = 1, | |
2397 | .may_unmap = 1, | |
d6277db4 | 2398 | .may_writepage = 1, |
7b51755c KM |
2399 | .nr_to_reclaim = nr_to_reclaim, |
2400 | .hibernation_mode = 1, | |
2401 | .swappiness = vm_swappiness, | |
2402 | .order = 0, | |
1da177e4 | 2403 | }; |
7b51755c KM |
2404 | struct zonelist * zonelist = node_zonelist(numa_node_id(), sc.gfp_mask); |
2405 | struct task_struct *p = current; | |
2406 | unsigned long nr_reclaimed; | |
1da177e4 | 2407 | |
7b51755c KM |
2408 | p->flags |= PF_MEMALLOC; |
2409 | lockdep_set_current_reclaim_state(sc.gfp_mask); | |
2410 | reclaim_state.reclaimed_slab = 0; | |
2411 | p->reclaim_state = &reclaim_state; | |
d6277db4 | 2412 | |
7b51755c | 2413 | nr_reclaimed = do_try_to_free_pages(zonelist, &sc); |
d979677c | 2414 | |
7b51755c KM |
2415 | p->reclaim_state = NULL; |
2416 | lockdep_clear_current_reclaim_state(); | |
2417 | p->flags &= ~PF_MEMALLOC; | |
d6277db4 | 2418 | |
7b51755c | 2419 | return nr_reclaimed; |
1da177e4 | 2420 | } |
c6f37f12 | 2421 | #endif /* CONFIG_HIBERNATION */ |
1da177e4 | 2422 | |
1da177e4 LT |
2423 | /* It's optimal to keep kswapds on the same CPUs as their memory, but |
2424 | not required for correctness. So if the last cpu in a node goes | |
2425 | away, we get changed to run anywhere: as the first one comes back, | |
2426 | restore their cpu bindings. */ | |
9c7b216d | 2427 | static int __devinit cpu_callback(struct notifier_block *nfb, |
69e05944 | 2428 | unsigned long action, void *hcpu) |
1da177e4 | 2429 | { |
58c0a4a7 | 2430 | int nid; |
1da177e4 | 2431 | |
8bb78442 | 2432 | if (action == CPU_ONLINE || action == CPU_ONLINE_FROZEN) { |
58c0a4a7 | 2433 | for_each_node_state(nid, N_HIGH_MEMORY) { |
c5f59f08 | 2434 | pg_data_t *pgdat = NODE_DATA(nid); |
a70f7302 RR |
2435 | const struct cpumask *mask; |
2436 | ||
2437 | mask = cpumask_of_node(pgdat->node_id); | |
c5f59f08 | 2438 | |
3e597945 | 2439 | if (cpumask_any_and(cpu_online_mask, mask) < nr_cpu_ids) |
1da177e4 | 2440 | /* One of our CPUs online: restore mask */ |
c5f59f08 | 2441 | set_cpus_allowed_ptr(pgdat->kswapd, mask); |
1da177e4 LT |
2442 | } |
2443 | } | |
2444 | return NOTIFY_OK; | |
2445 | } | |
1da177e4 | 2446 | |
3218ae14 YG |
2447 | /* |
2448 | * This kswapd start function will be called by init and node-hot-add. | |
2449 | * On node-hot-add, kswapd will moved to proper cpus if cpus are hot-added. | |
2450 | */ | |
2451 | int kswapd_run(int nid) | |
2452 | { | |
2453 | pg_data_t *pgdat = NODE_DATA(nid); | |
2454 | int ret = 0; | |
2455 | ||
2456 | if (pgdat->kswapd) | |
2457 | return 0; | |
2458 | ||
2459 | pgdat->kswapd = kthread_run(kswapd, pgdat, "kswapd%d", nid); | |
2460 | if (IS_ERR(pgdat->kswapd)) { | |
2461 | /* failure at boot is fatal */ | |
2462 | BUG_ON(system_state == SYSTEM_BOOTING); | |
2463 | printk("Failed to start kswapd on node %d\n",nid); | |
2464 | ret = -1; | |
2465 | } | |
2466 | return ret; | |
2467 | } | |
2468 | ||
8fe23e05 DR |
2469 | /* |
2470 | * Called by memory hotplug when all memory in a node is offlined. | |
2471 | */ | |
2472 | void kswapd_stop(int nid) | |
2473 | { | |
2474 | struct task_struct *kswapd = NODE_DATA(nid)->kswapd; | |
2475 | ||
2476 | if (kswapd) | |
2477 | kthread_stop(kswapd); | |
2478 | } | |
2479 | ||
1da177e4 LT |
2480 | static int __init kswapd_init(void) |
2481 | { | |
3218ae14 | 2482 | int nid; |
69e05944 | 2483 | |
1da177e4 | 2484 | swap_setup(); |
9422ffba | 2485 | for_each_node_state(nid, N_HIGH_MEMORY) |
3218ae14 | 2486 | kswapd_run(nid); |
1da177e4 LT |
2487 | hotcpu_notifier(cpu_callback, 0); |
2488 | return 0; | |
2489 | } | |
2490 | ||
2491 | module_init(kswapd_init) | |
9eeff239 CL |
2492 | |
2493 | #ifdef CONFIG_NUMA | |
2494 | /* | |
2495 | * Zone reclaim mode | |
2496 | * | |
2497 | * If non-zero call zone_reclaim when the number of free pages falls below | |
2498 | * the watermarks. | |
9eeff239 CL |
2499 | */ |
2500 | int zone_reclaim_mode __read_mostly; | |
2501 | ||
1b2ffb78 | 2502 | #define RECLAIM_OFF 0 |
7d03431c | 2503 | #define RECLAIM_ZONE (1<<0) /* Run shrink_inactive_list on the zone */ |
1b2ffb78 CL |
2504 | #define RECLAIM_WRITE (1<<1) /* Writeout pages during reclaim */ |
2505 | #define RECLAIM_SWAP (1<<2) /* Swap pages out during reclaim */ | |
2506 | ||
a92f7126 CL |
2507 | /* |
2508 | * Priority for ZONE_RECLAIM. This determines the fraction of pages | |
2509 | * of a node considered for each zone_reclaim. 4 scans 1/16th of | |
2510 | * a zone. | |
2511 | */ | |
2512 | #define ZONE_RECLAIM_PRIORITY 4 | |
2513 | ||
9614634f CL |
2514 | /* |
2515 | * Percentage of pages in a zone that must be unmapped for zone_reclaim to | |
2516 | * occur. | |
2517 | */ | |
2518 | int sysctl_min_unmapped_ratio = 1; | |
2519 | ||
0ff38490 CL |
2520 | /* |
2521 | * If the number of slab pages in a zone grows beyond this percentage then | |
2522 | * slab reclaim needs to occur. | |
2523 | */ | |
2524 | int sysctl_min_slab_ratio = 5; | |
2525 | ||
90afa5de MG |
2526 | static inline unsigned long zone_unmapped_file_pages(struct zone *zone) |
2527 | { | |
2528 | unsigned long file_mapped = zone_page_state(zone, NR_FILE_MAPPED); | |
2529 | unsigned long file_lru = zone_page_state(zone, NR_INACTIVE_FILE) + | |
2530 | zone_page_state(zone, NR_ACTIVE_FILE); | |
2531 | ||
2532 | /* | |
2533 | * It's possible for there to be more file mapped pages than | |
2534 | * accounted for by the pages on the file LRU lists because | |
2535 | * tmpfs pages accounted for as ANON can also be FILE_MAPPED | |
2536 | */ | |
2537 | return (file_lru > file_mapped) ? (file_lru - file_mapped) : 0; | |
2538 | } | |
2539 | ||
2540 | /* Work out how many page cache pages we can reclaim in this reclaim_mode */ | |
2541 | static long zone_pagecache_reclaimable(struct zone *zone) | |
2542 | { | |
2543 | long nr_pagecache_reclaimable; | |
2544 | long delta = 0; | |
2545 | ||
2546 | /* | |
2547 | * If RECLAIM_SWAP is set, then all file pages are considered | |
2548 | * potentially reclaimable. Otherwise, we have to worry about | |
2549 | * pages like swapcache and zone_unmapped_file_pages() provides | |
2550 | * a better estimate | |
2551 | */ | |
2552 | if (zone_reclaim_mode & RECLAIM_SWAP) | |
2553 | nr_pagecache_reclaimable = zone_page_state(zone, NR_FILE_PAGES); | |
2554 | else | |
2555 | nr_pagecache_reclaimable = zone_unmapped_file_pages(zone); | |
2556 | ||
2557 | /* If we can't clean pages, remove dirty pages from consideration */ | |
2558 | if (!(zone_reclaim_mode & RECLAIM_WRITE)) | |
2559 | delta += zone_page_state(zone, NR_FILE_DIRTY); | |
2560 | ||
2561 | /* Watch for any possible underflows due to delta */ | |
2562 | if (unlikely(delta > nr_pagecache_reclaimable)) | |
2563 | delta = nr_pagecache_reclaimable; | |
2564 | ||
2565 | return nr_pagecache_reclaimable - delta; | |
2566 | } | |
2567 | ||
9eeff239 CL |
2568 | /* |
2569 | * Try to free up some pages from this zone through reclaim. | |
2570 | */ | |
179e9639 | 2571 | static int __zone_reclaim(struct zone *zone, gfp_t gfp_mask, unsigned int order) |
9eeff239 | 2572 | { |
7fb2d46d | 2573 | /* Minimum pages needed in order to stay on node */ |
69e05944 | 2574 | const unsigned long nr_pages = 1 << order; |
9eeff239 CL |
2575 | struct task_struct *p = current; |
2576 | struct reclaim_state reclaim_state; | |
8695949a | 2577 | int priority; |
179e9639 AM |
2578 | struct scan_control sc = { |
2579 | .may_writepage = !!(zone_reclaim_mode & RECLAIM_WRITE), | |
a6dc60f8 | 2580 | .may_unmap = !!(zone_reclaim_mode & RECLAIM_SWAP), |
2e2e4259 | 2581 | .may_swap = 1, |
22fba335 KM |
2582 | .nr_to_reclaim = max_t(unsigned long, nr_pages, |
2583 | SWAP_CLUSTER_MAX), | |
179e9639 | 2584 | .gfp_mask = gfp_mask, |
d6277db4 | 2585 | .swappiness = vm_swappiness, |
bd2f6199 | 2586 | .order = order, |
179e9639 | 2587 | }; |
83e33a47 | 2588 | unsigned long slab_reclaimable; |
9eeff239 CL |
2589 | |
2590 | disable_swap_token(); | |
9eeff239 | 2591 | cond_resched(); |
d4f7796e CL |
2592 | /* |
2593 | * We need to be able to allocate from the reserves for RECLAIM_SWAP | |
2594 | * and we also need to be able to write out pages for RECLAIM_WRITE | |
2595 | * and RECLAIM_SWAP. | |
2596 | */ | |
2597 | p->flags |= PF_MEMALLOC | PF_SWAPWRITE; | |
76ca542d | 2598 | lockdep_set_current_reclaim_state(gfp_mask); |
9eeff239 CL |
2599 | reclaim_state.reclaimed_slab = 0; |
2600 | p->reclaim_state = &reclaim_state; | |
c84db23c | 2601 | |
90afa5de | 2602 | if (zone_pagecache_reclaimable(zone) > zone->min_unmapped_pages) { |
0ff38490 CL |
2603 | /* |
2604 | * Free memory by calling shrink zone with increasing | |
2605 | * priorities until we have enough memory freed. | |
2606 | */ | |
2607 | priority = ZONE_RECLAIM_PRIORITY; | |
2608 | do { | |
3bb1a852 | 2609 | note_zone_scanning_priority(zone, priority); |
a79311c1 | 2610 | shrink_zone(priority, zone, &sc); |
0ff38490 | 2611 | priority--; |
a79311c1 | 2612 | } while (priority >= 0 && sc.nr_reclaimed < nr_pages); |
0ff38490 | 2613 | } |
c84db23c | 2614 | |
83e33a47 CL |
2615 | slab_reclaimable = zone_page_state(zone, NR_SLAB_RECLAIMABLE); |
2616 | if (slab_reclaimable > zone->min_slab_pages) { | |
2a16e3f4 | 2617 | /* |
7fb2d46d | 2618 | * shrink_slab() does not currently allow us to determine how |
0ff38490 CL |
2619 | * many pages were freed in this zone. So we take the current |
2620 | * number of slab pages and shake the slab until it is reduced | |
2621 | * by the same nr_pages that we used for reclaiming unmapped | |
2622 | * pages. | |
2a16e3f4 | 2623 | * |
0ff38490 CL |
2624 | * Note that shrink_slab will free memory on all zones and may |
2625 | * take a long time. | |
2a16e3f4 | 2626 | */ |
0ff38490 | 2627 | while (shrink_slab(sc.nr_scanned, gfp_mask, order) && |
83e33a47 CL |
2628 | zone_page_state(zone, NR_SLAB_RECLAIMABLE) > |
2629 | slab_reclaimable - nr_pages) | |
0ff38490 | 2630 | ; |
83e33a47 CL |
2631 | |
2632 | /* | |
2633 | * Update nr_reclaimed by the number of slab pages we | |
2634 | * reclaimed from this zone. | |
2635 | */ | |
a79311c1 | 2636 | sc.nr_reclaimed += slab_reclaimable - |
83e33a47 | 2637 | zone_page_state(zone, NR_SLAB_RECLAIMABLE); |
2a16e3f4 CL |
2638 | } |
2639 | ||
9eeff239 | 2640 | p->reclaim_state = NULL; |
d4f7796e | 2641 | current->flags &= ~(PF_MEMALLOC | PF_SWAPWRITE); |
76ca542d | 2642 | lockdep_clear_current_reclaim_state(); |
a79311c1 | 2643 | return sc.nr_reclaimed >= nr_pages; |
9eeff239 | 2644 | } |
179e9639 AM |
2645 | |
2646 | int zone_reclaim(struct zone *zone, gfp_t gfp_mask, unsigned int order) | |
2647 | { | |
179e9639 | 2648 | int node_id; |
d773ed6b | 2649 | int ret; |
179e9639 AM |
2650 | |
2651 | /* | |
0ff38490 CL |
2652 | * Zone reclaim reclaims unmapped file backed pages and |
2653 | * slab pages if we are over the defined limits. | |
34aa1330 | 2654 | * |
9614634f CL |
2655 | * A small portion of unmapped file backed pages is needed for |
2656 | * file I/O otherwise pages read by file I/O will be immediately | |
2657 | * thrown out if the zone is overallocated. So we do not reclaim | |
2658 | * if less than a specified percentage of the zone is used by | |
2659 | * unmapped file backed pages. | |
179e9639 | 2660 | */ |
90afa5de MG |
2661 | if (zone_pagecache_reclaimable(zone) <= zone->min_unmapped_pages && |
2662 | zone_page_state(zone, NR_SLAB_RECLAIMABLE) <= zone->min_slab_pages) | |
fa5e084e | 2663 | return ZONE_RECLAIM_FULL; |
179e9639 | 2664 | |
93e4a89a | 2665 | if (zone->all_unreclaimable) |
fa5e084e | 2666 | return ZONE_RECLAIM_FULL; |
d773ed6b | 2667 | |
179e9639 | 2668 | /* |
d773ed6b | 2669 | * Do not scan if the allocation should not be delayed. |
179e9639 | 2670 | */ |
d773ed6b | 2671 | if (!(gfp_mask & __GFP_WAIT) || (current->flags & PF_MEMALLOC)) |
fa5e084e | 2672 | return ZONE_RECLAIM_NOSCAN; |
179e9639 AM |
2673 | |
2674 | /* | |
2675 | * Only run zone reclaim on the local zone or on zones that do not | |
2676 | * have associated processors. This will favor the local processor | |
2677 | * over remote processors and spread off node memory allocations | |
2678 | * as wide as possible. | |
2679 | */ | |
89fa3024 | 2680 | node_id = zone_to_nid(zone); |
37c0708d | 2681 | if (node_state(node_id, N_CPU) && node_id != numa_node_id()) |
fa5e084e | 2682 | return ZONE_RECLAIM_NOSCAN; |
d773ed6b DR |
2683 | |
2684 | if (zone_test_and_set_flag(zone, ZONE_RECLAIM_LOCKED)) | |
fa5e084e MG |
2685 | return ZONE_RECLAIM_NOSCAN; |
2686 | ||
d773ed6b DR |
2687 | ret = __zone_reclaim(zone, gfp_mask, order); |
2688 | zone_clear_flag(zone, ZONE_RECLAIM_LOCKED); | |
2689 | ||
24cf7251 MG |
2690 | if (!ret) |
2691 | count_vm_event(PGSCAN_ZONE_RECLAIM_FAILED); | |
2692 | ||
d773ed6b | 2693 | return ret; |
179e9639 | 2694 | } |
9eeff239 | 2695 | #endif |
894bc310 | 2696 | |
894bc310 LS |
2697 | /* |
2698 | * page_evictable - test whether a page is evictable | |
2699 | * @page: the page to test | |
2700 | * @vma: the VMA in which the page is or will be mapped, may be NULL | |
2701 | * | |
2702 | * Test whether page is evictable--i.e., should be placed on active/inactive | |
b291f000 NP |
2703 | * lists vs unevictable list. The vma argument is !NULL when called from the |
2704 | * fault path to determine how to instantate a new page. | |
894bc310 LS |
2705 | * |
2706 | * Reasons page might not be evictable: | |
ba9ddf49 | 2707 | * (1) page's mapping marked unevictable |
b291f000 | 2708 | * (2) page is part of an mlocked VMA |
ba9ddf49 | 2709 | * |
894bc310 LS |
2710 | */ |
2711 | int page_evictable(struct page *page, struct vm_area_struct *vma) | |
2712 | { | |
2713 | ||
ba9ddf49 LS |
2714 | if (mapping_unevictable(page_mapping(page))) |
2715 | return 0; | |
2716 | ||
b291f000 NP |
2717 | if (PageMlocked(page) || (vma && is_mlocked_vma(vma, page))) |
2718 | return 0; | |
894bc310 LS |
2719 | |
2720 | return 1; | |
2721 | } | |
89e004ea LS |
2722 | |
2723 | /** | |
2724 | * check_move_unevictable_page - check page for evictability and move to appropriate zone lru list | |
2725 | * @page: page to check evictability and move to appropriate lru list | |
2726 | * @zone: zone page is in | |
2727 | * | |
2728 | * Checks a page for evictability and moves the page to the appropriate | |
2729 | * zone lru list. | |
2730 | * | |
2731 | * Restrictions: zone->lru_lock must be held, page must be on LRU and must | |
2732 | * have PageUnevictable set. | |
2733 | */ | |
2734 | static void check_move_unevictable_page(struct page *page, struct zone *zone) | |
2735 | { | |
2736 | VM_BUG_ON(PageActive(page)); | |
2737 | ||
2738 | retry: | |
2739 | ClearPageUnevictable(page); | |
2740 | if (page_evictable(page, NULL)) { | |
401a8e1c | 2741 | enum lru_list l = page_lru_base_type(page); |
af936a16 | 2742 | |
89e004ea LS |
2743 | __dec_zone_state(zone, NR_UNEVICTABLE); |
2744 | list_move(&page->lru, &zone->lru[l].list); | |
08e552c6 | 2745 | mem_cgroup_move_lists(page, LRU_UNEVICTABLE, l); |
89e004ea LS |
2746 | __inc_zone_state(zone, NR_INACTIVE_ANON + l); |
2747 | __count_vm_event(UNEVICTABLE_PGRESCUED); | |
2748 | } else { | |
2749 | /* | |
2750 | * rotate unevictable list | |
2751 | */ | |
2752 | SetPageUnevictable(page); | |
2753 | list_move(&page->lru, &zone->lru[LRU_UNEVICTABLE].list); | |
08e552c6 | 2754 | mem_cgroup_rotate_lru_list(page, LRU_UNEVICTABLE); |
89e004ea LS |
2755 | if (page_evictable(page, NULL)) |
2756 | goto retry; | |
2757 | } | |
2758 | } | |
2759 | ||
2760 | /** | |
2761 | * scan_mapping_unevictable_pages - scan an address space for evictable pages | |
2762 | * @mapping: struct address_space to scan for evictable pages | |
2763 | * | |
2764 | * Scan all pages in mapping. Check unevictable pages for | |
2765 | * evictability and move them to the appropriate zone lru list. | |
2766 | */ | |
2767 | void scan_mapping_unevictable_pages(struct address_space *mapping) | |
2768 | { | |
2769 | pgoff_t next = 0; | |
2770 | pgoff_t end = (i_size_read(mapping->host) + PAGE_CACHE_SIZE - 1) >> | |
2771 | PAGE_CACHE_SHIFT; | |
2772 | struct zone *zone; | |
2773 | struct pagevec pvec; | |
2774 | ||
2775 | if (mapping->nrpages == 0) | |
2776 | return; | |
2777 | ||
2778 | pagevec_init(&pvec, 0); | |
2779 | while (next < end && | |
2780 | pagevec_lookup(&pvec, mapping, next, PAGEVEC_SIZE)) { | |
2781 | int i; | |
2782 | int pg_scanned = 0; | |
2783 | ||
2784 | zone = NULL; | |
2785 | ||
2786 | for (i = 0; i < pagevec_count(&pvec); i++) { | |
2787 | struct page *page = pvec.pages[i]; | |
2788 | pgoff_t page_index = page->index; | |
2789 | struct zone *pagezone = page_zone(page); | |
2790 | ||
2791 | pg_scanned++; | |
2792 | if (page_index > next) | |
2793 | next = page_index; | |
2794 | next++; | |
2795 | ||
2796 | if (pagezone != zone) { | |
2797 | if (zone) | |
2798 | spin_unlock_irq(&zone->lru_lock); | |
2799 | zone = pagezone; | |
2800 | spin_lock_irq(&zone->lru_lock); | |
2801 | } | |
2802 | ||
2803 | if (PageLRU(page) && PageUnevictable(page)) | |
2804 | check_move_unevictable_page(page, zone); | |
2805 | } | |
2806 | if (zone) | |
2807 | spin_unlock_irq(&zone->lru_lock); | |
2808 | pagevec_release(&pvec); | |
2809 | ||
2810 | count_vm_events(UNEVICTABLE_PGSCANNED, pg_scanned); | |
2811 | } | |
2812 | ||
2813 | } | |
af936a16 LS |
2814 | |
2815 | /** | |
2816 | * scan_zone_unevictable_pages - check unevictable list for evictable pages | |
2817 | * @zone - zone of which to scan the unevictable list | |
2818 | * | |
2819 | * Scan @zone's unevictable LRU lists to check for pages that have become | |
2820 | * evictable. Move those that have to @zone's inactive list where they | |
2821 | * become candidates for reclaim, unless shrink_inactive_zone() decides | |
2822 | * to reactivate them. Pages that are still unevictable are rotated | |
2823 | * back onto @zone's unevictable list. | |
2824 | */ | |
2825 | #define SCAN_UNEVICTABLE_BATCH_SIZE 16UL /* arbitrary lock hold batch size */ | |
14b90b22 | 2826 | static void scan_zone_unevictable_pages(struct zone *zone) |
af936a16 LS |
2827 | { |
2828 | struct list_head *l_unevictable = &zone->lru[LRU_UNEVICTABLE].list; | |
2829 | unsigned long scan; | |
2830 | unsigned long nr_to_scan = zone_page_state(zone, NR_UNEVICTABLE); | |
2831 | ||
2832 | while (nr_to_scan > 0) { | |
2833 | unsigned long batch_size = min(nr_to_scan, | |
2834 | SCAN_UNEVICTABLE_BATCH_SIZE); | |
2835 | ||
2836 | spin_lock_irq(&zone->lru_lock); | |
2837 | for (scan = 0; scan < batch_size; scan++) { | |
2838 | struct page *page = lru_to_page(l_unevictable); | |
2839 | ||
2840 | if (!trylock_page(page)) | |
2841 | continue; | |
2842 | ||
2843 | prefetchw_prev_lru_page(page, l_unevictable, flags); | |
2844 | ||
2845 | if (likely(PageLRU(page) && PageUnevictable(page))) | |
2846 | check_move_unevictable_page(page, zone); | |
2847 | ||
2848 | unlock_page(page); | |
2849 | } | |
2850 | spin_unlock_irq(&zone->lru_lock); | |
2851 | ||
2852 | nr_to_scan -= batch_size; | |
2853 | } | |
2854 | } | |
2855 | ||
2856 | ||
2857 | /** | |
2858 | * scan_all_zones_unevictable_pages - scan all unevictable lists for evictable pages | |
2859 | * | |
2860 | * A really big hammer: scan all zones' unevictable LRU lists to check for | |
2861 | * pages that have become evictable. Move those back to the zones' | |
2862 | * inactive list where they become candidates for reclaim. | |
2863 | * This occurs when, e.g., we have unswappable pages on the unevictable lists, | |
2864 | * and we add swap to the system. As such, it runs in the context of a task | |
2865 | * that has possibly/probably made some previously unevictable pages | |
2866 | * evictable. | |
2867 | */ | |
ff30153b | 2868 | static void scan_all_zones_unevictable_pages(void) |
af936a16 LS |
2869 | { |
2870 | struct zone *zone; | |
2871 | ||
2872 | for_each_zone(zone) { | |
2873 | scan_zone_unevictable_pages(zone); | |
2874 | } | |
2875 | } | |
2876 | ||
2877 | /* | |
2878 | * scan_unevictable_pages [vm] sysctl handler. On demand re-scan of | |
2879 | * all nodes' unevictable lists for evictable pages | |
2880 | */ | |
2881 | unsigned long scan_unevictable_pages; | |
2882 | ||
2883 | int scan_unevictable_handler(struct ctl_table *table, int write, | |
8d65af78 | 2884 | void __user *buffer, |
af936a16 LS |
2885 | size_t *length, loff_t *ppos) |
2886 | { | |
8d65af78 | 2887 | proc_doulongvec_minmax(table, write, buffer, length, ppos); |
af936a16 LS |
2888 | |
2889 | if (write && *(unsigned long *)table->data) | |
2890 | scan_all_zones_unevictable_pages(); | |
2891 | ||
2892 | scan_unevictable_pages = 0; | |
2893 | return 0; | |
2894 | } | |
2895 | ||
2896 | /* | |
2897 | * per node 'scan_unevictable_pages' attribute. On demand re-scan of | |
2898 | * a specified node's per zone unevictable lists for evictable pages. | |
2899 | */ | |
2900 | ||
2901 | static ssize_t read_scan_unevictable_node(struct sys_device *dev, | |
2902 | struct sysdev_attribute *attr, | |
2903 | char *buf) | |
2904 | { | |
2905 | return sprintf(buf, "0\n"); /* always zero; should fit... */ | |
2906 | } | |
2907 | ||
2908 | static ssize_t write_scan_unevictable_node(struct sys_device *dev, | |
2909 | struct sysdev_attribute *attr, | |
2910 | const char *buf, size_t count) | |
2911 | { | |
2912 | struct zone *node_zones = NODE_DATA(dev->id)->node_zones; | |
2913 | struct zone *zone; | |
2914 | unsigned long res; | |
2915 | unsigned long req = strict_strtoul(buf, 10, &res); | |
2916 | ||
2917 | if (!req) | |
2918 | return 1; /* zero is no-op */ | |
2919 | ||
2920 | for (zone = node_zones; zone - node_zones < MAX_NR_ZONES; ++zone) { | |
2921 | if (!populated_zone(zone)) | |
2922 | continue; | |
2923 | scan_zone_unevictable_pages(zone); | |
2924 | } | |
2925 | return 1; | |
2926 | } | |
2927 | ||
2928 | ||
2929 | static SYSDEV_ATTR(scan_unevictable_pages, S_IRUGO | S_IWUSR, | |
2930 | read_scan_unevictable_node, | |
2931 | write_scan_unevictable_node); | |
2932 | ||
2933 | int scan_unevictable_register_node(struct node *node) | |
2934 | { | |
2935 | return sysdev_create_file(&node->sysdev, &attr_scan_unevictable_pages); | |
2936 | } | |
2937 | ||
2938 | void scan_unevictable_unregister_node(struct node *node) | |
2939 | { | |
2940 | sysdev_remove_file(&node->sysdev, &attr_scan_unevictable_pages); | |
2941 | } | |
2942 |