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