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