4 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
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.
15 #include <linux/module.h>
16 #include <linux/gfp.h>
17 #include <linux/kernel_stat.h>
18 #include <linux/swap.h>
19 #include <linux/pagemap.h>
20 #include <linux/init.h>
21 #include <linux/highmem.h>
22 #include <linux/vmstat.h>
23 #include <linux/file.h>
24 #include <linux/writeback.h>
25 #include <linux/blkdev.h>
26 #include <linux/buffer_head.h> /* for try_to_release_page(),
27 buffer_heads_over_limit */
28 #include <linux/mm_inline.h>
29 #include <linux/pagevec.h>
30 #include <linux/backing-dev.h>
31 #include <linux/rmap.h>
32 #include <linux/topology.h>
33 #include <linux/cpu.h>
34 #include <linux/cpuset.h>
35 #include <linux/compaction.h>
36 #include <linux/notifier.h>
37 #include <linux/rwsem.h>
38 #include <linux/delay.h>
39 #include <linux/kthread.h>
40 #include <linux/freezer.h>
41 #include <linux/memcontrol.h>
42 #include <linux/delayacct.h>
43 #include <linux/sysctl.h>
44 #include <linux/oom.h>
45 #include <linux/prefetch.h>
47 #include <asm/tlbflush.h>
48 #include <asm/div64.h>
50 #include <linux/swapops.h>
54 #define CREATE_TRACE_POINTS
55 #include <trace/events/vmscan.h>
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
63 * page from the LRU and reclaim all pages within a
64 * naturally aligned range
65 * RECLAIM_MODE_COMPACTION: For high-order allocations, reclaim a number of
66 * order-0 pages and then compact the zone
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)
76 /* Incremented by the number of inactive pages that were scanned */
77 unsigned long nr_scanned;
79 /* Number of pages freed so far during a call to shrink_zones() */
80 unsigned long nr_reclaimed;
82 /* How many pages shrink_list() should reclaim */
83 unsigned long nr_to_reclaim;
85 unsigned long hibernation_mode;
87 /* This context's GFP mask */
92 /* Can mapped pages be reclaimed? */
95 /* Can pages be swapped as part of reclaim? */
101 * Intend to reclaim enough continuous memory rather than reclaim
102 * enough amount of memory. i.e, mode for high order allocation.
104 reclaim_mode_t reclaim_mode;
106 /* Which cgroup do we reclaim from */
107 struct mem_cgroup *mem_cgroup;
110 * Nodemask of nodes allowed by the caller. If NULL, all nodes
113 nodemask_t *nodemask;
116 #define lru_to_page(_head) (list_entry((_head)->prev, struct page, lru))
118 #ifdef ARCH_HAS_PREFETCH
119 #define prefetch_prev_lru_page(_page, _base, _field) \
121 if ((_page)->lru.prev != _base) { \
124 prev = lru_to_page(&(_page->lru)); \
125 prefetch(&prev->_field); \
129 #define prefetch_prev_lru_page(_page, _base, _field) do { } while (0)
132 #ifdef ARCH_HAS_PREFETCHW
133 #define prefetchw_prev_lru_page(_page, _base, _field) \
135 if ((_page)->lru.prev != _base) { \
138 prev = lru_to_page(&(_page->lru)); \
139 prefetchw(&prev->_field); \
143 #define prefetchw_prev_lru_page(_page, _base, _field) do { } while (0)
147 * From 0 .. 100. Higher means more swappy.
149 int vm_swappiness = 60;
150 long vm_total_pages; /* The total number of pages which the VM controls */
152 static LIST_HEAD(shrinker_list);
153 static DECLARE_RWSEM(shrinker_rwsem);
155 #ifdef CONFIG_CGROUP_MEM_RES_CTLR
156 #define scanning_global_lru(sc) (!(sc)->mem_cgroup)
158 #define scanning_global_lru(sc) (1)
161 static struct zone_reclaim_stat *get_reclaim_stat(struct zone *zone,
162 struct scan_control *sc)
164 if (!scanning_global_lru(sc))
165 return mem_cgroup_get_reclaim_stat(sc->mem_cgroup, zone);
167 return &zone->reclaim_stat;
170 static unsigned long zone_nr_lru_pages(struct zone *zone,
171 struct scan_control *sc, enum lru_list lru)
173 if (!scanning_global_lru(sc))
174 return mem_cgroup_zone_nr_lru_pages(sc->mem_cgroup,
175 zone_to_nid(zone), zone_idx(zone), BIT(lru));
177 return zone_page_state(zone, NR_LRU_BASE + lru);
182 * Add a shrinker callback to be called from the vm
184 void register_shrinker(struct shrinker *shrinker)
187 down_write(&shrinker_rwsem);
188 list_add_tail(&shrinker->list, &shrinker_list);
189 up_write(&shrinker_rwsem);
191 EXPORT_SYMBOL(register_shrinker);
196 void unregister_shrinker(struct shrinker *shrinker)
198 down_write(&shrinker_rwsem);
199 list_del(&shrinker->list);
200 up_write(&shrinker_rwsem);
202 EXPORT_SYMBOL(unregister_shrinker);
204 static inline int do_shrinker_shrink(struct shrinker *shrinker,
205 struct shrink_control *sc,
206 unsigned long nr_to_scan)
208 sc->nr_to_scan = nr_to_scan;
209 return (*shrinker->shrink)(shrinker, sc);
212 #define SHRINK_BATCH 128
214 * Call the shrink functions to age shrinkable caches
216 * Here we assume it costs one seek to replace a lru page and that it also
217 * takes a seek to recreate a cache object. With this in mind we age equal
218 * percentages of the lru and ageable caches. This should balance the seeks
219 * generated by these structures.
221 * If the vm encountered mapped pages on the LRU it increase the pressure on
222 * slab to avoid swapping.
224 * We do weird things to avoid (scanned*seeks*entries) overflowing 32 bits.
226 * `lru_pages' represents the number of on-LRU pages in all the zones which
227 * are eligible for the caller's allocation attempt. It is used for balancing
228 * slab reclaim versus page reclaim.
230 * Returns the number of slab objects which we shrunk.
232 unsigned long shrink_slab(struct shrink_control *shrink,
233 unsigned long nr_pages_scanned,
234 unsigned long lru_pages)
236 struct shrinker *shrinker;
237 unsigned long ret = 0;
239 if (nr_pages_scanned == 0)
240 nr_pages_scanned = SWAP_CLUSTER_MAX;
242 if (!down_read_trylock(&shrinker_rwsem)) {
243 /* Assume we'll be able to shrink next time */
248 list_for_each_entry(shrinker, &shrinker_list, list) {
249 unsigned long long delta;
250 unsigned long total_scan;
251 unsigned long max_pass;
255 long batch_size = shrinker->batch ? shrinker->batch
259 * copy the current shrinker scan count into a local variable
260 * and zero it so that other concurrent shrinker invocations
261 * don't also do this scanning work.
265 } while (cmpxchg(&shrinker->nr, nr, 0) != nr);
268 max_pass = do_shrinker_shrink(shrinker, shrink, 0);
269 delta = (4 * nr_pages_scanned) / shrinker->seeks;
271 do_div(delta, lru_pages + 1);
273 if (total_scan < 0) {
274 printk(KERN_ERR "shrink_slab: %pF negative objects to "
276 shrinker->shrink, total_scan);
277 total_scan = max_pass;
281 * We need to avoid excessive windup on filesystem shrinkers
282 * due to large numbers of GFP_NOFS allocations causing the
283 * shrinkers to return -1 all the time. This results in a large
284 * nr being built up so when a shrink that can do some work
285 * comes along it empties the entire cache due to nr >>>
286 * max_pass. This is bad for sustaining a working set in
289 * Hence only allow the shrinker to scan the entire cache when
290 * a large delta change is calculated directly.
292 if (delta < max_pass / 4)
293 total_scan = min(total_scan, max_pass / 2);
296 * Avoid risking looping forever due to too large nr value:
297 * never try to free more than twice the estimate number of
300 if (total_scan > max_pass * 2)
301 total_scan = max_pass * 2;
303 trace_mm_shrink_slab_start(shrinker, shrink, nr,
304 nr_pages_scanned, lru_pages,
305 max_pass, delta, total_scan);
307 while (total_scan >= batch_size) {
310 nr_before = do_shrinker_shrink(shrinker, shrink, 0);
311 shrink_ret = do_shrinker_shrink(shrinker, shrink,
313 if (shrink_ret == -1)
315 if (shrink_ret < nr_before)
316 ret += nr_before - shrink_ret;
317 count_vm_events(SLABS_SCANNED, batch_size);
318 total_scan -= batch_size;
324 * move the unused scan count back into the shrinker in a
325 * manner that handles concurrent updates. If we exhausted the
326 * scan, there is no need to do an update.
330 new_nr = total_scan + nr;
333 } while (cmpxchg(&shrinker->nr, nr, new_nr) != nr);
335 trace_mm_shrink_slab_end(shrinker, shrink_ret, nr, new_nr);
337 up_read(&shrinker_rwsem);
343 static void set_reclaim_mode(int priority, struct scan_control *sc,
346 reclaim_mode_t syncmode = sync ? RECLAIM_MODE_SYNC : RECLAIM_MODE_ASYNC;
349 * Initially assume we are entering either lumpy reclaim or
350 * reclaim/compaction.Depending on the order, we will either set the
351 * sync mode or just reclaim order-0 pages later.
353 if (COMPACTION_BUILD)
354 sc->reclaim_mode = RECLAIM_MODE_COMPACTION;
356 sc->reclaim_mode = RECLAIM_MODE_LUMPYRECLAIM;
359 * Avoid using lumpy reclaim or reclaim/compaction if possible by
360 * restricting when its set to either costly allocations or when
361 * under memory pressure
363 if (sc->order > PAGE_ALLOC_COSTLY_ORDER)
364 sc->reclaim_mode |= syncmode;
365 else if (sc->order && priority < DEF_PRIORITY - 2)
366 sc->reclaim_mode |= syncmode;
368 sc->reclaim_mode = RECLAIM_MODE_SINGLE | RECLAIM_MODE_ASYNC;
371 static void reset_reclaim_mode(struct scan_control *sc)
373 sc->reclaim_mode = RECLAIM_MODE_SINGLE | RECLAIM_MODE_ASYNC;
376 static inline int is_page_cache_freeable(struct page *page)
379 * A freeable page cache page is referenced only by the caller
380 * that isolated the page, the page cache radix tree and
381 * optional buffer heads at page->private.
383 return page_count(page) - page_has_private(page) == 2;
386 static int may_write_to_queue(struct backing_dev_info *bdi,
387 struct scan_control *sc)
389 if (current->flags & PF_SWAPWRITE)
391 if (!bdi_write_congested(bdi))
393 if (bdi == current->backing_dev_info)
396 /* lumpy reclaim for hugepage often need a lot of write */
397 if (sc->order > PAGE_ALLOC_COSTLY_ORDER)
403 * We detected a synchronous write error writing a page out. Probably
404 * -ENOSPC. We need to propagate that into the address_space for a subsequent
405 * fsync(), msync() or close().
407 * The tricky part is that after writepage we cannot touch the mapping: nothing
408 * prevents it from being freed up. But we have a ref on the page and once
409 * that page is locked, the mapping is pinned.
411 * We're allowed to run sleeping lock_page() here because we know the caller has
414 static void handle_write_error(struct address_space *mapping,
415 struct page *page, int error)
418 if (page_mapping(page) == mapping)
419 mapping_set_error(mapping, error);
423 /* possible outcome of pageout() */
425 /* failed to write page out, page is locked */
427 /* move page to the active list, page is locked */
429 /* page has been sent to the disk successfully, page is unlocked */
431 /* page is clean and locked */
436 * pageout is called by shrink_page_list() for each dirty page.
437 * Calls ->writepage().
439 static pageout_t pageout(struct page *page, struct address_space *mapping,
440 struct scan_control *sc)
443 * If the page is dirty, only perform writeback if that write
444 * will be non-blocking. To prevent this allocation from being
445 * stalled by pagecache activity. But note that there may be
446 * stalls if we need to run get_block(). We could test
447 * PagePrivate for that.
449 * If this process is currently in __generic_file_aio_write() against
450 * this page's queue, we can perform writeback even if that
453 * If the page is swapcache, write it back even if that would
454 * block, for some throttling. This happens by accident, because
455 * swap_backing_dev_info is bust: it doesn't reflect the
456 * congestion state of the swapdevs. Easy to fix, if needed.
458 if (!is_page_cache_freeable(page))
462 * Some data journaling orphaned pages can have
463 * page->mapping == NULL while being dirty with clean buffers.
465 if (page_has_private(page)) {
466 if (try_to_free_buffers(page)) {
467 ClearPageDirty(page);
468 printk("%s: orphaned page\n", __func__);
474 if (mapping->a_ops->writepage == NULL)
475 return PAGE_ACTIVATE;
476 if (!may_write_to_queue(mapping->backing_dev_info, sc))
479 if (clear_page_dirty_for_io(page)) {
481 struct writeback_control wbc = {
482 .sync_mode = WB_SYNC_NONE,
483 .nr_to_write = SWAP_CLUSTER_MAX,
485 .range_end = LLONG_MAX,
489 SetPageReclaim(page);
490 res = mapping->a_ops->writepage(page, &wbc);
492 handle_write_error(mapping, page, res);
493 if (res == AOP_WRITEPAGE_ACTIVATE) {
494 ClearPageReclaim(page);
495 return PAGE_ACTIVATE;
498 if (!PageWriteback(page)) {
499 /* synchronous write or broken a_ops? */
500 ClearPageReclaim(page);
502 trace_mm_vmscan_writepage(page,
503 trace_reclaim_flags(page, sc->reclaim_mode));
504 inc_zone_page_state(page, NR_VMSCAN_WRITE);
512 * Same as remove_mapping, but if the page is removed from the mapping, it
513 * gets returned with a refcount of 0.
515 static int __remove_mapping(struct address_space *mapping, struct page *page)
517 BUG_ON(!PageLocked(page));
518 BUG_ON(mapping != page_mapping(page));
520 spin_lock_irq(&mapping->tree_lock);
522 * The non racy check for a busy page.
524 * Must be careful with the order of the tests. When someone has
525 * a ref to the page, it may be possible that they dirty it then
526 * drop the reference. So if PageDirty is tested before page_count
527 * here, then the following race may occur:
529 * get_user_pages(&page);
530 * [user mapping goes away]
532 * !PageDirty(page) [good]
533 * SetPageDirty(page);
535 * !page_count(page) [good, discard it]
537 * [oops, our write_to data is lost]
539 * Reversing the order of the tests ensures such a situation cannot
540 * escape unnoticed. The smp_rmb is needed to ensure the page->flags
541 * load is not satisfied before that of page->_count.
543 * Note that if SetPageDirty is always performed via set_page_dirty,
544 * and thus under tree_lock, then this ordering is not required.
546 if (!page_freeze_refs(page, 2))
548 /* note: atomic_cmpxchg in page_freeze_refs provides the smp_rmb */
549 if (unlikely(PageDirty(page))) {
550 page_unfreeze_refs(page, 2);
554 if (PageSwapCache(page)) {
555 swp_entry_t swap = { .val = page_private(page) };
556 __delete_from_swap_cache(page);
557 spin_unlock_irq(&mapping->tree_lock);
558 swapcache_free(swap, page);
560 void (*freepage)(struct page *);
562 freepage = mapping->a_ops->freepage;
564 __delete_from_page_cache(page);
565 spin_unlock_irq(&mapping->tree_lock);
566 mem_cgroup_uncharge_cache_page(page);
568 if (freepage != NULL)
575 spin_unlock_irq(&mapping->tree_lock);
580 * Attempt to detach a locked page from its ->mapping. If it is dirty or if
581 * someone else has a ref on the page, abort and return 0. If it was
582 * successfully detached, return 1. Assumes the caller has a single ref on
585 int remove_mapping(struct address_space *mapping, struct page *page)
587 if (__remove_mapping(mapping, page)) {
589 * Unfreezing the refcount with 1 rather than 2 effectively
590 * drops the pagecache ref for us without requiring another
593 page_unfreeze_refs(page, 1);
600 * putback_lru_page - put previously isolated page onto appropriate LRU list
601 * @page: page to be put back to appropriate lru list
603 * Add previously isolated @page to appropriate LRU list.
604 * Page may still be unevictable for other reasons.
606 * lru_lock must not be held, interrupts must be enabled.
608 void putback_lru_page(struct page *page)
611 int active = !!TestClearPageActive(page);
612 int was_unevictable = PageUnevictable(page);
614 VM_BUG_ON(PageLRU(page));
617 ClearPageUnevictable(page);
619 if (page_evictable(page, NULL)) {
621 * For evictable pages, we can use the cache.
622 * In event of a race, worst case is we end up with an
623 * unevictable page on [in]active list.
624 * We know how to handle that.
626 lru = active + page_lru_base_type(page);
627 lru_cache_add_lru(page, lru);
630 * Put unevictable pages directly on zone's unevictable
633 lru = LRU_UNEVICTABLE;
634 add_page_to_unevictable_list(page);
636 * When racing with an mlock clearing (page is
637 * unlocked), make sure that if the other thread does
638 * not observe our setting of PG_lru and fails
639 * isolation, we see PG_mlocked cleared below and move
640 * the page back to the evictable list.
642 * The other side is TestClearPageMlocked().
648 * page's status can change while we move it among lru. If an evictable
649 * page is on unevictable list, it never be freed. To avoid that,
650 * check after we added it to the list, again.
652 if (lru == LRU_UNEVICTABLE && page_evictable(page, NULL)) {
653 if (!isolate_lru_page(page)) {
657 /* This means someone else dropped this page from LRU
658 * So, it will be freed or putback to LRU again. There is
659 * nothing to do here.
663 if (was_unevictable && lru != LRU_UNEVICTABLE)
664 count_vm_event(UNEVICTABLE_PGRESCUED);
665 else if (!was_unevictable && lru == LRU_UNEVICTABLE)
666 count_vm_event(UNEVICTABLE_PGCULLED);
668 put_page(page); /* drop ref from isolate */
671 enum page_references {
673 PAGEREF_RECLAIM_CLEAN,
678 static enum page_references page_check_references(struct page *page,
679 struct scan_control *sc)
681 int referenced_ptes, referenced_page;
682 unsigned long vm_flags;
684 referenced_ptes = page_referenced(page, 1, sc->mem_cgroup, &vm_flags);
685 referenced_page = TestClearPageReferenced(page);
687 /* Lumpy reclaim - ignore references */
688 if (sc->reclaim_mode & RECLAIM_MODE_LUMPYRECLAIM)
689 return PAGEREF_RECLAIM;
692 * Mlock lost the isolation race with us. Let try_to_unmap()
693 * move the page to the unevictable list.
695 if (vm_flags & VM_LOCKED)
696 return PAGEREF_RECLAIM;
698 if (referenced_ptes) {
700 return PAGEREF_ACTIVATE;
702 * All mapped pages start out with page table
703 * references from the instantiating fault, so we need
704 * to look twice if a mapped file page is used more
707 * Mark it and spare it for another trip around the
708 * inactive list. Another page table reference will
709 * lead to its activation.
711 * Note: the mark is set for activated pages as well
712 * so that recently deactivated but used pages are
715 SetPageReferenced(page);
718 return PAGEREF_ACTIVATE;
723 /* Reclaim if clean, defer dirty pages to writeback */
724 if (referenced_page && !PageSwapBacked(page))
725 return PAGEREF_RECLAIM_CLEAN;
727 return PAGEREF_RECLAIM;
730 static noinline_for_stack void free_page_list(struct list_head *free_pages)
732 struct pagevec freed_pvec;
733 struct page *page, *tmp;
735 pagevec_init(&freed_pvec, 1);
737 list_for_each_entry_safe(page, tmp, free_pages, lru) {
738 list_del(&page->lru);
739 if (!pagevec_add(&freed_pvec, page)) {
740 __pagevec_free(&freed_pvec);
741 pagevec_reinit(&freed_pvec);
745 pagevec_free(&freed_pvec);
749 * shrink_page_list() returns the number of reclaimed pages
751 static unsigned long shrink_page_list(struct list_head *page_list,
753 struct scan_control *sc,
756 LIST_HEAD(ret_pages);
757 LIST_HEAD(free_pages);
759 unsigned long nr_dirty = 0;
760 unsigned long nr_congested = 0;
761 unsigned long nr_reclaimed = 0;
765 while (!list_empty(page_list)) {
766 enum page_references references;
767 struct address_space *mapping;
773 page = lru_to_page(page_list);
774 list_del(&page->lru);
776 if (!trylock_page(page))
779 VM_BUG_ON(PageActive(page));
780 VM_BUG_ON(page_zone(page) != zone);
784 if (unlikely(!page_evictable(page, NULL)))
787 if (!sc->may_unmap && page_mapped(page))
790 /* Double the slab pressure for mapped and swapcache pages */
791 if (page_mapped(page) || PageSwapCache(page))
794 may_enter_fs = (sc->gfp_mask & __GFP_FS) ||
795 (PageSwapCache(page) && (sc->gfp_mask & __GFP_IO));
797 if (PageWriteback(page)) {
799 * Synchronous reclaim cannot queue pages for
800 * writeback due to the possibility of stack overflow
801 * but if it encounters a page under writeback, wait
802 * for the IO to complete.
804 if ((sc->reclaim_mode & RECLAIM_MODE_SYNC) &&
806 wait_on_page_writeback(page);
813 references = page_check_references(page, sc);
814 switch (references) {
815 case PAGEREF_ACTIVATE:
816 goto activate_locked;
819 case PAGEREF_RECLAIM:
820 case PAGEREF_RECLAIM_CLEAN:
821 ; /* try to reclaim the page below */
825 * Anonymous process memory has backing store?
826 * Try to allocate it some swap space here.
828 if (PageAnon(page) && !PageSwapCache(page)) {
829 if (!(sc->gfp_mask & __GFP_IO))
831 if (!add_to_swap(page))
832 goto activate_locked;
836 mapping = page_mapping(page);
839 * The page is mapped into the page tables of one or more
840 * processes. Try to unmap it here.
842 if (page_mapped(page) && mapping) {
843 switch (try_to_unmap(page, TTU_UNMAP)) {
845 goto activate_locked;
851 ; /* try to free the page below */
855 if (PageDirty(page)) {
859 * Only kswapd can writeback filesystem pages to
860 * avoid risk of stack overflow but do not writeback
861 * unless under significant pressure.
863 if (page_is_file_cache(page) &&
864 (!current_is_kswapd() || priority >= DEF_PRIORITY - 2)) {
865 inc_zone_page_state(page, NR_VMSCAN_WRITE_SKIP);
869 if (references == PAGEREF_RECLAIM_CLEAN)
873 if (!sc->may_writepage)
876 /* Page is dirty, try to write it out here */
877 switch (pageout(page, mapping, sc)) {
882 goto activate_locked;
884 if (PageWriteback(page))
890 * A synchronous write - probably a ramdisk. Go
891 * ahead and try to reclaim the page.
893 if (!trylock_page(page))
895 if (PageDirty(page) || PageWriteback(page))
897 mapping = page_mapping(page);
899 ; /* try to free the page below */
904 * If the page has buffers, try to free the buffer mappings
905 * associated with this page. If we succeed we try to free
908 * We do this even if the page is PageDirty().
909 * try_to_release_page() does not perform I/O, but it is
910 * possible for a page to have PageDirty set, but it is actually
911 * clean (all its buffers are clean). This happens if the
912 * buffers were written out directly, with submit_bh(). ext3
913 * will do this, as well as the blockdev mapping.
914 * try_to_release_page() will discover that cleanness and will
915 * drop the buffers and mark the page clean - it can be freed.
917 * Rarely, pages can have buffers and no ->mapping. These are
918 * the pages which were not successfully invalidated in
919 * truncate_complete_page(). We try to drop those buffers here
920 * and if that worked, and the page is no longer mapped into
921 * process address space (page_count == 1) it can be freed.
922 * Otherwise, leave the page on the LRU so it is swappable.
924 if (page_has_private(page)) {
925 if (!try_to_release_page(page, sc->gfp_mask))
926 goto activate_locked;
927 if (!mapping && page_count(page) == 1) {
929 if (put_page_testzero(page))
933 * rare race with speculative reference.
934 * the speculative reference will free
935 * this page shortly, so we may
936 * increment nr_reclaimed here (and
937 * leave it off the LRU).
945 if (!mapping || !__remove_mapping(mapping, page))
949 * At this point, we have no other references and there is
950 * no way to pick any more up (removed from LRU, removed
951 * from pagecache). Can use non-atomic bitops now (and
952 * we obviously don't have to worry about waking up a process
953 * waiting on the page lock, because there are no references.
955 __clear_page_locked(page);
960 * Is there need to periodically free_page_list? It would
961 * appear not as the counts should be low
963 list_add(&page->lru, &free_pages);
967 if (PageSwapCache(page))
968 try_to_free_swap(page);
970 putback_lru_page(page);
971 reset_reclaim_mode(sc);
975 /* Not a candidate for swapping, so reclaim swap space. */
976 if (PageSwapCache(page) && vm_swap_full())
977 try_to_free_swap(page);
978 VM_BUG_ON(PageActive(page));
984 reset_reclaim_mode(sc);
986 list_add(&page->lru, &ret_pages);
987 VM_BUG_ON(PageLRU(page) || PageUnevictable(page));
991 * Tag a zone as congested if all the dirty pages encountered were
992 * backed by a congested BDI. In this case, reclaimers should just
993 * back off and wait for congestion to clear because further reclaim
994 * will encounter the same problem
996 if (nr_dirty && nr_dirty == nr_congested && scanning_global_lru(sc))
997 zone_set_flag(zone, ZONE_CONGESTED);
999 free_page_list(&free_pages);
1001 list_splice(&ret_pages, page_list);
1002 count_vm_events(PGACTIVATE, pgactivate);
1003 return nr_reclaimed;
1007 * Attempt to remove the specified page from its LRU. Only take this page
1008 * if it is of the appropriate PageActive status. Pages which are being
1009 * freed elsewhere are also ignored.
1011 * page: page to consider
1012 * mode: one of the LRU isolation modes defined above
1014 * returns 0 on success, -ve errno on failure.
1016 int __isolate_lru_page(struct page *page, isolate_mode_t mode, int file)
1021 /* Only take pages on the LRU. */
1025 all_lru_mode = (mode & (ISOLATE_ACTIVE|ISOLATE_INACTIVE)) ==
1026 (ISOLATE_ACTIVE|ISOLATE_INACTIVE);
1029 * When checking the active state, we need to be sure we are
1030 * dealing with comparible boolean values. Take the logical not
1033 if (!all_lru_mode && !PageActive(page) != !(mode & ISOLATE_ACTIVE))
1036 if (!all_lru_mode && !!page_is_file_cache(page) != file)
1040 * When this function is being called for lumpy reclaim, we
1041 * initially look into all LRU pages, active, inactive and
1042 * unevictable; only give shrink_page_list evictable pages.
1044 if (PageUnevictable(page))
1049 if ((mode & ISOLATE_CLEAN) && (PageDirty(page) || PageWriteback(page)))
1052 if ((mode & ISOLATE_UNMAPPED) && page_mapped(page))
1055 if (likely(get_page_unless_zero(page))) {
1057 * Be careful not to clear PageLRU until after we're
1058 * sure the page is not being freed elsewhere -- the
1059 * page release code relies on it.
1069 * zone->lru_lock is heavily contended. Some of the functions that
1070 * shrink the lists perform better by taking out a batch of pages
1071 * and working on them outside the LRU lock.
1073 * For pagecache intensive workloads, this function is the hottest
1074 * spot in the kernel (apart from copy_*_user functions).
1076 * Appropriate locks must be held before calling this function.
1078 * @nr_to_scan: The number of pages to look through on the list.
1079 * @src: The LRU list to pull pages off.
1080 * @dst: The temp list to put pages on to.
1081 * @scanned: The number of pages that were scanned.
1082 * @order: The caller's attempted allocation order
1083 * @mode: One of the LRU isolation modes
1084 * @file: True [1] if isolating file [!anon] pages
1086 * returns how many pages were moved onto *@dst.
1088 static unsigned long isolate_lru_pages(unsigned long nr_to_scan,
1089 struct list_head *src, struct list_head *dst,
1090 unsigned long *scanned, int order, isolate_mode_t mode,
1093 unsigned long nr_taken = 0;
1094 unsigned long nr_lumpy_taken = 0;
1095 unsigned long nr_lumpy_dirty = 0;
1096 unsigned long nr_lumpy_failed = 0;
1099 for (scan = 0; scan < nr_to_scan && !list_empty(src); scan++) {
1102 unsigned long end_pfn;
1103 unsigned long page_pfn;
1106 page = lru_to_page(src);
1107 prefetchw_prev_lru_page(page, src, flags);
1109 VM_BUG_ON(!PageLRU(page));
1111 switch (__isolate_lru_page(page, mode, file)) {
1113 list_move(&page->lru, dst);
1114 mem_cgroup_del_lru(page);
1115 nr_taken += hpage_nr_pages(page);
1119 /* else it is being freed elsewhere */
1120 list_move(&page->lru, src);
1121 mem_cgroup_rotate_lru_list(page, page_lru(page));
1132 * Attempt to take all pages in the order aligned region
1133 * surrounding the tag page. Only take those pages of
1134 * the same active state as that tag page. We may safely
1135 * round the target page pfn down to the requested order
1136 * as the mem_map is guaranteed valid out to MAX_ORDER,
1137 * where that page is in a different zone we will detect
1138 * it from its zone id and abort this block scan.
1140 zone_id = page_zone_id(page);
1141 page_pfn = page_to_pfn(page);
1142 pfn = page_pfn & ~((1 << order) - 1);
1143 end_pfn = pfn + (1 << order);
1144 for (; pfn < end_pfn; pfn++) {
1145 struct page *cursor_page;
1147 /* The target page is in the block, ignore it. */
1148 if (unlikely(pfn == page_pfn))
1151 /* Avoid holes within the zone. */
1152 if (unlikely(!pfn_valid_within(pfn)))
1155 cursor_page = pfn_to_page(pfn);
1157 /* Check that we have not crossed a zone boundary. */
1158 if (unlikely(page_zone_id(cursor_page) != zone_id))
1162 * If we don't have enough swap space, reclaiming of
1163 * anon page which don't already have a swap slot is
1166 if (nr_swap_pages <= 0 && PageAnon(cursor_page) &&
1167 !PageSwapCache(cursor_page))
1170 if (__isolate_lru_page(cursor_page, mode, file) == 0) {
1171 list_move(&cursor_page->lru, dst);
1172 mem_cgroup_del_lru(cursor_page);
1173 nr_taken += hpage_nr_pages(page);
1175 if (PageDirty(cursor_page))
1180 * Check if the page is freed already.
1182 * We can't use page_count() as that
1183 * requires compound_head and we don't
1184 * have a pin on the page here. If a
1185 * page is tail, we may or may not
1186 * have isolated the head, so assume
1187 * it's not free, it'd be tricky to
1188 * track the head status without a
1191 if (!PageTail(cursor_page) &&
1192 !atomic_read(&cursor_page->_count))
1198 /* If we break out of the loop above, lumpy reclaim failed */
1205 trace_mm_vmscan_lru_isolate(order,
1208 nr_lumpy_taken, nr_lumpy_dirty, nr_lumpy_failed,
1213 static unsigned long isolate_pages_global(unsigned long nr,
1214 struct list_head *dst,
1215 unsigned long *scanned, int order,
1216 isolate_mode_t mode,
1217 struct zone *z, int active, int file)
1224 return isolate_lru_pages(nr, &z->lru[lru].list, dst, scanned, order,
1229 * clear_active_flags() is a helper for shrink_active_list(), clearing
1230 * any active bits from the pages in the list.
1232 static unsigned long clear_active_flags(struct list_head *page_list,
1233 unsigned int *count)
1239 list_for_each_entry(page, page_list, lru) {
1240 int numpages = hpage_nr_pages(page);
1241 lru = page_lru_base_type(page);
1242 if (PageActive(page)) {
1244 ClearPageActive(page);
1245 nr_active += numpages;
1248 count[lru] += numpages;
1255 * isolate_lru_page - tries to isolate a page from its LRU list
1256 * @page: page to isolate from its LRU list
1258 * Isolates a @page from an LRU list, clears PageLRU and adjusts the
1259 * vmstat statistic corresponding to whatever LRU list the page was on.
1261 * Returns 0 if the page was removed from an LRU list.
1262 * Returns -EBUSY if the page was not on an LRU list.
1264 * The returned page will have PageLRU() cleared. If it was found on
1265 * the active list, it will have PageActive set. If it was found on
1266 * the unevictable list, it will have the PageUnevictable bit set. That flag
1267 * may need to be cleared by the caller before letting the page go.
1269 * The vmstat statistic corresponding to the list on which the page was
1270 * found will be decremented.
1273 * (1) Must be called with an elevated refcount on the page. This is a
1274 * fundamentnal difference from isolate_lru_pages (which is called
1275 * without a stable reference).
1276 * (2) the lru_lock must not be held.
1277 * (3) interrupts must be enabled.
1279 int isolate_lru_page(struct page *page)
1283 VM_BUG_ON(!page_count(page));
1285 if (PageLRU(page)) {
1286 struct zone *zone = page_zone(page);
1288 spin_lock_irq(&zone->lru_lock);
1289 if (PageLRU(page)) {
1290 int lru = page_lru(page);
1295 del_page_from_lru_list(zone, page, lru);
1297 spin_unlock_irq(&zone->lru_lock);
1303 * Are there way too many processes in the direct reclaim path already?
1305 static int too_many_isolated(struct zone *zone, int file,
1306 struct scan_control *sc)
1308 unsigned long inactive, isolated;
1310 if (current_is_kswapd())
1313 if (!scanning_global_lru(sc))
1317 inactive = zone_page_state(zone, NR_INACTIVE_FILE);
1318 isolated = zone_page_state(zone, NR_ISOLATED_FILE);
1320 inactive = zone_page_state(zone, NR_INACTIVE_ANON);
1321 isolated = zone_page_state(zone, NR_ISOLATED_ANON);
1324 return isolated > inactive;
1328 * TODO: Try merging with migrations version of putback_lru_pages
1330 static noinline_for_stack void
1331 putback_lru_pages(struct zone *zone, struct scan_control *sc,
1332 unsigned long nr_anon, unsigned long nr_file,
1333 struct list_head *page_list)
1336 struct pagevec pvec;
1337 struct zone_reclaim_stat *reclaim_stat = get_reclaim_stat(zone, sc);
1339 pagevec_init(&pvec, 1);
1342 * Put back any unfreeable pages.
1344 spin_lock(&zone->lru_lock);
1345 while (!list_empty(page_list)) {
1347 page = lru_to_page(page_list);
1348 VM_BUG_ON(PageLRU(page));
1349 list_del(&page->lru);
1350 if (unlikely(!page_evictable(page, NULL))) {
1351 spin_unlock_irq(&zone->lru_lock);
1352 putback_lru_page(page);
1353 spin_lock_irq(&zone->lru_lock);
1357 lru = page_lru(page);
1358 add_page_to_lru_list(zone, page, lru);
1359 if (is_active_lru(lru)) {
1360 int file = is_file_lru(lru);
1361 int numpages = hpage_nr_pages(page);
1362 reclaim_stat->recent_rotated[file] += numpages;
1364 if (!pagevec_add(&pvec, page)) {
1365 spin_unlock_irq(&zone->lru_lock);
1366 __pagevec_release(&pvec);
1367 spin_lock_irq(&zone->lru_lock);
1370 __mod_zone_page_state(zone, NR_ISOLATED_ANON, -nr_anon);
1371 __mod_zone_page_state(zone, NR_ISOLATED_FILE, -nr_file);
1373 spin_unlock_irq(&zone->lru_lock);
1374 pagevec_release(&pvec);
1377 static noinline_for_stack void update_isolated_counts(struct zone *zone,
1378 struct scan_control *sc,
1379 unsigned long *nr_anon,
1380 unsigned long *nr_file,
1381 struct list_head *isolated_list)
1383 unsigned long nr_active;
1384 unsigned int count[NR_LRU_LISTS] = { 0, };
1385 struct zone_reclaim_stat *reclaim_stat = get_reclaim_stat(zone, sc);
1387 nr_active = clear_active_flags(isolated_list, count);
1388 __count_vm_events(PGDEACTIVATE, nr_active);
1390 __mod_zone_page_state(zone, NR_ACTIVE_FILE,
1391 -count[LRU_ACTIVE_FILE]);
1392 __mod_zone_page_state(zone, NR_INACTIVE_FILE,
1393 -count[LRU_INACTIVE_FILE]);
1394 __mod_zone_page_state(zone, NR_ACTIVE_ANON,
1395 -count[LRU_ACTIVE_ANON]);
1396 __mod_zone_page_state(zone, NR_INACTIVE_ANON,
1397 -count[LRU_INACTIVE_ANON]);
1399 *nr_anon = count[LRU_ACTIVE_ANON] + count[LRU_INACTIVE_ANON];
1400 *nr_file = count[LRU_ACTIVE_FILE] + count[LRU_INACTIVE_FILE];
1401 __mod_zone_page_state(zone, NR_ISOLATED_ANON, *nr_anon);
1402 __mod_zone_page_state(zone, NR_ISOLATED_FILE, *nr_file);
1404 reclaim_stat->recent_scanned[0] += *nr_anon;
1405 reclaim_stat->recent_scanned[1] += *nr_file;
1409 * Returns true if a direct reclaim should wait on pages under writeback.
1411 * If we are direct reclaiming for contiguous pages and we do not reclaim
1412 * everything in the list, try again and wait for writeback IO to complete.
1413 * This will stall high-order allocations noticeably. Only do that when really
1414 * need to free the pages under high memory pressure.
1416 static inline bool should_reclaim_stall(unsigned long nr_taken,
1417 unsigned long nr_freed,
1419 struct scan_control *sc)
1421 int lumpy_stall_priority;
1423 /* kswapd should not stall on sync IO */
1424 if (current_is_kswapd())
1427 /* Only stall on lumpy reclaim */
1428 if (sc->reclaim_mode & RECLAIM_MODE_SINGLE)
1431 /* If we have reclaimed everything on the isolated list, no stall */
1432 if (nr_freed == nr_taken)
1436 * For high-order allocations, there are two stall thresholds.
1437 * High-cost allocations stall immediately where as lower
1438 * order allocations such as stacks require the scanning
1439 * priority to be much higher before stalling.
1441 if (sc->order > PAGE_ALLOC_COSTLY_ORDER)
1442 lumpy_stall_priority = DEF_PRIORITY;
1444 lumpy_stall_priority = DEF_PRIORITY / 3;
1446 return priority <= lumpy_stall_priority;
1450 * shrink_inactive_list() is a helper for shrink_zone(). It returns the number
1451 * of reclaimed pages
1453 static noinline_for_stack unsigned long
1454 shrink_inactive_list(unsigned long nr_to_scan, struct zone *zone,
1455 struct scan_control *sc, int priority, int file)
1457 LIST_HEAD(page_list);
1458 unsigned long nr_scanned;
1459 unsigned long nr_reclaimed = 0;
1460 unsigned long nr_taken;
1461 unsigned long nr_anon;
1462 unsigned long nr_file;
1463 isolate_mode_t reclaim_mode = ISOLATE_INACTIVE;
1465 while (unlikely(too_many_isolated(zone, file, sc))) {
1466 congestion_wait(BLK_RW_ASYNC, HZ/10);
1468 /* We are about to die and free our memory. Return now. */
1469 if (fatal_signal_pending(current))
1470 return SWAP_CLUSTER_MAX;
1473 set_reclaim_mode(priority, sc, false);
1474 if (sc->reclaim_mode & RECLAIM_MODE_LUMPYRECLAIM)
1475 reclaim_mode |= ISOLATE_ACTIVE;
1480 reclaim_mode |= ISOLATE_UNMAPPED;
1481 if (!sc->may_writepage)
1482 reclaim_mode |= ISOLATE_CLEAN;
1484 spin_lock_irq(&zone->lru_lock);
1486 if (scanning_global_lru(sc)) {
1487 nr_taken = isolate_pages_global(nr_to_scan, &page_list,
1488 &nr_scanned, sc->order, reclaim_mode, zone, 0, file);
1489 zone->pages_scanned += nr_scanned;
1490 if (current_is_kswapd())
1491 __count_zone_vm_events(PGSCAN_KSWAPD, zone,
1494 __count_zone_vm_events(PGSCAN_DIRECT, zone,
1497 nr_taken = mem_cgroup_isolate_pages(nr_to_scan, &page_list,
1498 &nr_scanned, sc->order, reclaim_mode, zone,
1499 sc->mem_cgroup, 0, file);
1501 * mem_cgroup_isolate_pages() keeps track of
1502 * scanned pages on its own.
1506 if (nr_taken == 0) {
1507 spin_unlock_irq(&zone->lru_lock);
1511 update_isolated_counts(zone, sc, &nr_anon, &nr_file, &page_list);
1513 spin_unlock_irq(&zone->lru_lock);
1515 nr_reclaimed = shrink_page_list(&page_list, zone, sc, priority);
1517 /* Check if we should syncronously wait for writeback */
1518 if (should_reclaim_stall(nr_taken, nr_reclaimed, priority, sc)) {
1519 set_reclaim_mode(priority, sc, true);
1520 nr_reclaimed += shrink_page_list(&page_list, zone, sc, priority);
1523 local_irq_disable();
1524 if (current_is_kswapd())
1525 __count_vm_events(KSWAPD_STEAL, nr_reclaimed);
1526 __count_zone_vm_events(PGSTEAL, zone, nr_reclaimed);
1528 putback_lru_pages(zone, sc, nr_anon, nr_file, &page_list);
1530 trace_mm_vmscan_lru_shrink_inactive(zone->zone_pgdat->node_id,
1532 nr_scanned, nr_reclaimed,
1534 trace_shrink_flags(file, sc->reclaim_mode));
1535 return nr_reclaimed;
1539 * This moves pages from the active list to the inactive list.
1541 * We move them the other way if the page is referenced by one or more
1542 * processes, from rmap.
1544 * If the pages are mostly unmapped, the processing is fast and it is
1545 * appropriate to hold zone->lru_lock across the whole operation. But if
1546 * the pages are mapped, the processing is slow (page_referenced()) so we
1547 * should drop zone->lru_lock around each page. It's impossible to balance
1548 * this, so instead we remove the pages from the LRU while processing them.
1549 * It is safe to rely on PG_active against the non-LRU pages in here because
1550 * nobody will play with that bit on a non-LRU page.
1552 * The downside is that we have to touch page->_count against each page.
1553 * But we had to alter page->flags anyway.
1556 static void move_active_pages_to_lru(struct zone *zone,
1557 struct list_head *list,
1560 unsigned long pgmoved = 0;
1561 struct pagevec pvec;
1564 pagevec_init(&pvec, 1);
1566 while (!list_empty(list)) {
1567 page = lru_to_page(list);
1569 VM_BUG_ON(PageLRU(page));
1572 list_move(&page->lru, &zone->lru[lru].list);
1573 mem_cgroup_add_lru_list(page, lru);
1574 pgmoved += hpage_nr_pages(page);
1576 if (!pagevec_add(&pvec, page) || list_empty(list)) {
1577 spin_unlock_irq(&zone->lru_lock);
1578 if (buffer_heads_over_limit)
1579 pagevec_strip(&pvec);
1580 __pagevec_release(&pvec);
1581 spin_lock_irq(&zone->lru_lock);
1584 __mod_zone_page_state(zone, NR_LRU_BASE + lru, pgmoved);
1585 if (!is_active_lru(lru))
1586 __count_vm_events(PGDEACTIVATE, pgmoved);
1589 static void shrink_active_list(unsigned long nr_pages, struct zone *zone,
1590 struct scan_control *sc, int priority, int file)
1592 unsigned long nr_taken;
1593 unsigned long pgscanned;
1594 unsigned long vm_flags;
1595 LIST_HEAD(l_hold); /* The pages which were snipped off */
1596 LIST_HEAD(l_active);
1597 LIST_HEAD(l_inactive);
1599 struct zone_reclaim_stat *reclaim_stat = get_reclaim_stat(zone, sc);
1600 unsigned long nr_rotated = 0;
1601 isolate_mode_t reclaim_mode = ISOLATE_ACTIVE;
1606 reclaim_mode |= ISOLATE_UNMAPPED;
1607 if (!sc->may_writepage)
1608 reclaim_mode |= ISOLATE_CLEAN;
1610 spin_lock_irq(&zone->lru_lock);
1611 if (scanning_global_lru(sc)) {
1612 nr_taken = isolate_pages_global(nr_pages, &l_hold,
1613 &pgscanned, sc->order,
1616 zone->pages_scanned += pgscanned;
1618 nr_taken = mem_cgroup_isolate_pages(nr_pages, &l_hold,
1619 &pgscanned, sc->order,
1621 sc->mem_cgroup, 1, file);
1623 * mem_cgroup_isolate_pages() keeps track of
1624 * scanned pages on its own.
1628 reclaim_stat->recent_scanned[file] += nr_taken;
1630 __count_zone_vm_events(PGREFILL, zone, pgscanned);
1632 __mod_zone_page_state(zone, NR_ACTIVE_FILE, -nr_taken);
1634 __mod_zone_page_state(zone, NR_ACTIVE_ANON, -nr_taken);
1635 __mod_zone_page_state(zone, NR_ISOLATED_ANON + file, nr_taken);
1636 spin_unlock_irq(&zone->lru_lock);
1638 while (!list_empty(&l_hold)) {
1640 page = lru_to_page(&l_hold);
1641 list_del(&page->lru);
1643 if (unlikely(!page_evictable(page, NULL))) {
1644 putback_lru_page(page);
1648 if (page_referenced(page, 0, sc->mem_cgroup, &vm_flags)) {
1649 nr_rotated += hpage_nr_pages(page);
1651 * Identify referenced, file-backed active pages and
1652 * give them one more trip around the active list. So
1653 * that executable code get better chances to stay in
1654 * memory under moderate memory pressure. Anon pages
1655 * are not likely to be evicted by use-once streaming
1656 * IO, plus JVM can create lots of anon VM_EXEC pages,
1657 * so we ignore them here.
1659 if ((vm_flags & VM_EXEC) && page_is_file_cache(page)) {
1660 list_add(&page->lru, &l_active);
1665 ClearPageActive(page); /* we are de-activating */
1666 list_add(&page->lru, &l_inactive);
1670 * Move pages back to the lru list.
1672 spin_lock_irq(&zone->lru_lock);
1674 * Count referenced pages from currently used mappings as rotated,
1675 * even though only some of them are actually re-activated. This
1676 * helps balance scan pressure between file and anonymous pages in
1679 reclaim_stat->recent_rotated[file] += nr_rotated;
1681 move_active_pages_to_lru(zone, &l_active,
1682 LRU_ACTIVE + file * LRU_FILE);
1683 move_active_pages_to_lru(zone, &l_inactive,
1684 LRU_BASE + file * LRU_FILE);
1685 __mod_zone_page_state(zone, NR_ISOLATED_ANON + file, -nr_taken);
1686 spin_unlock_irq(&zone->lru_lock);
1690 static int inactive_anon_is_low_global(struct zone *zone)
1692 unsigned long active, inactive;
1694 active = zone_page_state(zone, NR_ACTIVE_ANON);
1695 inactive = zone_page_state(zone, NR_INACTIVE_ANON);
1697 if (inactive * zone->inactive_ratio < active)
1704 * inactive_anon_is_low - check if anonymous pages need to be deactivated
1705 * @zone: zone to check
1706 * @sc: scan control of this context
1708 * Returns true if the zone does not have enough inactive anon pages,
1709 * meaning some active anon pages need to be deactivated.
1711 static int inactive_anon_is_low(struct zone *zone, struct scan_control *sc)
1716 * If we don't have swap space, anonymous page deactivation
1719 if (!total_swap_pages)
1722 if (scanning_global_lru(sc))
1723 low = inactive_anon_is_low_global(zone);
1725 low = mem_cgroup_inactive_anon_is_low(sc->mem_cgroup);
1729 static inline int inactive_anon_is_low(struct zone *zone,
1730 struct scan_control *sc)
1736 static int inactive_file_is_low_global(struct zone *zone)
1738 unsigned long active, inactive;
1740 active = zone_page_state(zone, NR_ACTIVE_FILE);
1741 inactive = zone_page_state(zone, NR_INACTIVE_FILE);
1743 return (active > inactive);
1747 * inactive_file_is_low - check if file pages need to be deactivated
1748 * @zone: zone to check
1749 * @sc: scan control of this context
1751 * When the system is doing streaming IO, memory pressure here
1752 * ensures that active file pages get deactivated, until more
1753 * than half of the file pages are on the inactive list.
1755 * Once we get to that situation, protect the system's working
1756 * set from being evicted by disabling active file page aging.
1758 * This uses a different ratio than the anonymous pages, because
1759 * the page cache uses a use-once replacement algorithm.
1761 static int inactive_file_is_low(struct zone *zone, struct scan_control *sc)
1765 if (scanning_global_lru(sc))
1766 low = inactive_file_is_low_global(zone);
1768 low = mem_cgroup_inactive_file_is_low(sc->mem_cgroup);
1772 static int inactive_list_is_low(struct zone *zone, struct scan_control *sc,
1776 return inactive_file_is_low(zone, sc);
1778 return inactive_anon_is_low(zone, sc);
1781 static unsigned long shrink_list(enum lru_list lru, unsigned long nr_to_scan,
1782 struct zone *zone, struct scan_control *sc, int priority)
1784 int file = is_file_lru(lru);
1786 if (is_active_lru(lru)) {
1787 if (inactive_list_is_low(zone, sc, file))
1788 shrink_active_list(nr_to_scan, zone, sc, priority, file);
1792 return shrink_inactive_list(nr_to_scan, zone, sc, priority, file);
1795 static int vmscan_swappiness(struct scan_control *sc)
1797 if (scanning_global_lru(sc))
1798 return vm_swappiness;
1799 return mem_cgroup_swappiness(sc->mem_cgroup);
1803 * Determine how aggressively the anon and file LRU lists should be
1804 * scanned. The relative value of each set of LRU lists is determined
1805 * by looking at the fraction of the pages scanned we did rotate back
1806 * onto the active list instead of evict.
1808 * nr[0] = anon pages to scan; nr[1] = file pages to scan
1810 static void get_scan_count(struct zone *zone, struct scan_control *sc,
1811 unsigned long *nr, int priority)
1813 unsigned long anon, file, free;
1814 unsigned long anon_prio, file_prio;
1815 unsigned long ap, fp;
1816 struct zone_reclaim_stat *reclaim_stat = get_reclaim_stat(zone, sc);
1817 u64 fraction[2], denominator;
1820 bool force_scan = false;
1823 * If the zone or memcg is small, nr[l] can be 0. This
1824 * results in no scanning on this priority and a potential
1825 * priority drop. Global direct reclaim can go to the next
1826 * zone and tends to have no problems. Global kswapd is for
1827 * zone balancing and it needs to scan a minimum amount. When
1828 * reclaiming for a memcg, a priority drop can cause high
1829 * latencies, so it's better to scan a minimum amount there as
1832 if (scanning_global_lru(sc) && current_is_kswapd())
1834 if (!scanning_global_lru(sc))
1837 /* If we have no swap space, do not bother scanning anon pages. */
1838 if (!sc->may_swap || (nr_swap_pages <= 0)) {
1846 anon = zone_nr_lru_pages(zone, sc, LRU_ACTIVE_ANON) +
1847 zone_nr_lru_pages(zone, sc, LRU_INACTIVE_ANON);
1848 file = zone_nr_lru_pages(zone, sc, LRU_ACTIVE_FILE) +
1849 zone_nr_lru_pages(zone, sc, LRU_INACTIVE_FILE);
1851 if (scanning_global_lru(sc)) {
1852 free = zone_page_state(zone, NR_FREE_PAGES);
1853 /* If we have very few page cache pages,
1854 force-scan anon pages. */
1855 if (unlikely(file + free <= high_wmark_pages(zone))) {
1864 * With swappiness at 100, anonymous and file have the same priority.
1865 * This scanning priority is essentially the inverse of IO cost.
1867 anon_prio = vmscan_swappiness(sc);
1868 file_prio = 200 - vmscan_swappiness(sc);
1871 * OK, so we have swap space and a fair amount of page cache
1872 * pages. We use the recently rotated / recently scanned
1873 * ratios to determine how valuable each cache is.
1875 * Because workloads change over time (and to avoid overflow)
1876 * we keep these statistics as a floating average, which ends
1877 * up weighing recent references more than old ones.
1879 * anon in [0], file in [1]
1881 spin_lock_irq(&zone->lru_lock);
1882 if (unlikely(reclaim_stat->recent_scanned[0] > anon / 4)) {
1883 reclaim_stat->recent_scanned[0] /= 2;
1884 reclaim_stat->recent_rotated[0] /= 2;
1887 if (unlikely(reclaim_stat->recent_scanned[1] > file / 4)) {
1888 reclaim_stat->recent_scanned[1] /= 2;
1889 reclaim_stat->recent_rotated[1] /= 2;
1893 * The amount of pressure on anon vs file pages is inversely
1894 * proportional to the fraction of recently scanned pages on
1895 * each list that were recently referenced and in active use.
1897 ap = (anon_prio + 1) * (reclaim_stat->recent_scanned[0] + 1);
1898 ap /= reclaim_stat->recent_rotated[0] + 1;
1900 fp = (file_prio + 1) * (reclaim_stat->recent_scanned[1] + 1);
1901 fp /= reclaim_stat->recent_rotated[1] + 1;
1902 spin_unlock_irq(&zone->lru_lock);
1906 denominator = ap + fp + 1;
1908 for_each_evictable_lru(l) {
1909 int file = is_file_lru(l);
1912 scan = zone_nr_lru_pages(zone, sc, l);
1913 if (priority || noswap) {
1915 if (!scan && force_scan)
1916 scan = SWAP_CLUSTER_MAX;
1917 scan = div64_u64(scan * fraction[file], denominator);
1924 * Reclaim/compaction depends on a number of pages being freed. To avoid
1925 * disruption to the system, a small number of order-0 pages continue to be
1926 * rotated and reclaimed in the normal fashion. However, by the time we get
1927 * back to the allocator and call try_to_compact_zone(), we ensure that
1928 * there are enough free pages for it to be likely successful
1930 static inline bool should_continue_reclaim(struct zone *zone,
1931 unsigned long nr_reclaimed,
1932 unsigned long nr_scanned,
1933 struct scan_control *sc)
1935 unsigned long pages_for_compaction;
1936 unsigned long inactive_lru_pages;
1938 /* If not in reclaim/compaction mode, stop */
1939 if (!(sc->reclaim_mode & RECLAIM_MODE_COMPACTION))
1942 /* Consider stopping depending on scan and reclaim activity */
1943 if (sc->gfp_mask & __GFP_REPEAT) {
1945 * For __GFP_REPEAT allocations, stop reclaiming if the
1946 * full LRU list has been scanned and we are still failing
1947 * to reclaim pages. This full LRU scan is potentially
1948 * expensive but a __GFP_REPEAT caller really wants to succeed
1950 if (!nr_reclaimed && !nr_scanned)
1954 * For non-__GFP_REPEAT allocations which can presumably
1955 * fail without consequence, stop if we failed to reclaim
1956 * any pages from the last SWAP_CLUSTER_MAX number of
1957 * pages that were scanned. This will return to the
1958 * caller faster at the risk reclaim/compaction and
1959 * the resulting allocation attempt fails
1966 * If we have not reclaimed enough pages for compaction and the
1967 * inactive lists are large enough, continue reclaiming
1969 pages_for_compaction = (2UL << sc->order);
1970 inactive_lru_pages = zone_nr_lru_pages(zone, sc, LRU_INACTIVE_ANON) +
1971 zone_nr_lru_pages(zone, sc, LRU_INACTIVE_FILE);
1972 if (sc->nr_reclaimed < pages_for_compaction &&
1973 inactive_lru_pages > pages_for_compaction)
1976 /* If compaction would go ahead or the allocation would succeed, stop */
1977 switch (compaction_suitable(zone, sc->order)) {
1978 case COMPACT_PARTIAL:
1979 case COMPACT_CONTINUE:
1987 * This is a basic per-zone page freer. Used by both kswapd and direct reclaim.
1989 static void shrink_zone(int priority, struct zone *zone,
1990 struct scan_control *sc)
1992 unsigned long nr[NR_LRU_LISTS];
1993 unsigned long nr_to_scan;
1995 unsigned long nr_reclaimed, nr_scanned;
1996 unsigned long nr_to_reclaim = sc->nr_to_reclaim;
1997 struct blk_plug plug;
2001 nr_scanned = sc->nr_scanned;
2002 get_scan_count(zone, sc, nr, priority);
2004 blk_start_plug(&plug);
2005 while (nr[LRU_INACTIVE_ANON] || nr[LRU_ACTIVE_FILE] ||
2006 nr[LRU_INACTIVE_FILE]) {
2007 for_each_evictable_lru(l) {
2009 nr_to_scan = min_t(unsigned long,
2010 nr[l], SWAP_CLUSTER_MAX);
2011 nr[l] -= nr_to_scan;
2013 nr_reclaimed += shrink_list(l, nr_to_scan,
2014 zone, sc, priority);
2018 * On large memory systems, scan >> priority can become
2019 * really large. This is fine for the starting priority;
2020 * we want to put equal scanning pressure on each zone.
2021 * However, if the VM has a harder time of freeing pages,
2022 * with multiple processes reclaiming pages, the total
2023 * freeing target can get unreasonably large.
2025 if (nr_reclaimed >= nr_to_reclaim && priority < DEF_PRIORITY)
2028 blk_finish_plug(&plug);
2029 sc->nr_reclaimed += nr_reclaimed;
2032 * Even if we did not try to evict anon pages at all, we want to
2033 * rebalance the anon lru active/inactive ratio.
2035 if (inactive_anon_is_low(zone, sc))
2036 shrink_active_list(SWAP_CLUSTER_MAX, zone, sc, priority, 0);
2038 /* reclaim/compaction might need reclaim to continue */
2039 if (should_continue_reclaim(zone, nr_reclaimed,
2040 sc->nr_scanned - nr_scanned, sc))
2043 throttle_vm_writeout(sc->gfp_mask);
2047 * This is the direct reclaim path, for page-allocating processes. We only
2048 * try to reclaim pages from zones which will satisfy the caller's allocation
2051 * We reclaim from a zone even if that zone is over high_wmark_pages(zone).
2053 * a) The caller may be trying to free *extra* pages to satisfy a higher-order
2055 * b) The target zone may be at high_wmark_pages(zone) but the lower zones
2056 * must go *over* high_wmark_pages(zone) to satisfy the `incremental min'
2057 * zone defense algorithm.
2059 * If a zone is deemed to be full of pinned pages then just give it a light
2060 * scan then give up on it.
2062 static void shrink_zones(int priority, struct zonelist *zonelist,
2063 struct scan_control *sc)
2067 unsigned long nr_soft_reclaimed;
2068 unsigned long nr_soft_scanned;
2070 for_each_zone_zonelist_nodemask(zone, z, zonelist,
2071 gfp_zone(sc->gfp_mask), sc->nodemask) {
2072 if (!populated_zone(zone))
2075 * Take care memory controller reclaiming has small influence
2078 if (scanning_global_lru(sc)) {
2079 if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL))
2081 if (zone->all_unreclaimable && priority != DEF_PRIORITY)
2082 continue; /* Let kswapd poll it */
2084 * This steals pages from memory cgroups over softlimit
2085 * and returns the number of reclaimed pages and
2086 * scanned pages. This works for global memory pressure
2087 * and balancing, not for a memcg's limit.
2089 nr_soft_scanned = 0;
2090 nr_soft_reclaimed = mem_cgroup_soft_limit_reclaim(zone,
2091 sc->order, sc->gfp_mask,
2093 sc->nr_reclaimed += nr_soft_reclaimed;
2094 sc->nr_scanned += nr_soft_scanned;
2095 /* need some check for avoid more shrink_zone() */
2098 shrink_zone(priority, zone, sc);
2102 static bool zone_reclaimable(struct zone *zone)
2104 return zone->pages_scanned < zone_reclaimable_pages(zone) * 6;
2107 /* All zones in zonelist are unreclaimable? */
2108 static bool all_unreclaimable(struct zonelist *zonelist,
2109 struct scan_control *sc)
2114 for_each_zone_zonelist_nodemask(zone, z, zonelist,
2115 gfp_zone(sc->gfp_mask), sc->nodemask) {
2116 if (!populated_zone(zone))
2118 if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL))
2120 if (!zone->all_unreclaimable)
2128 * This is the main entry point to direct page reclaim.
2130 * If a full scan of the inactive list fails to free enough memory then we
2131 * are "out of memory" and something needs to be killed.
2133 * If the caller is !__GFP_FS then the probability of a failure is reasonably
2134 * high - the zone may be full of dirty or under-writeback pages, which this
2135 * caller can't do much about. We kick the writeback threads and take explicit
2136 * naps in the hope that some of these pages can be written. But if the
2137 * allocating task holds filesystem locks which prevent writeout this might not
2138 * work, and the allocation attempt will fail.
2140 * returns: 0, if no pages reclaimed
2141 * else, the number of pages reclaimed
2143 static unsigned long do_try_to_free_pages(struct zonelist *zonelist,
2144 struct scan_control *sc,
2145 struct shrink_control *shrink)
2148 unsigned long total_scanned = 0;
2149 struct reclaim_state *reclaim_state = current->reclaim_state;
2152 unsigned long writeback_threshold;
2155 delayacct_freepages_start();
2157 if (scanning_global_lru(sc))
2158 count_vm_event(ALLOCSTALL);
2160 for (priority = DEF_PRIORITY; priority >= 0; priority--) {
2163 disable_swap_token(sc->mem_cgroup);
2164 shrink_zones(priority, zonelist, sc);
2166 * Don't shrink slabs when reclaiming memory from
2167 * over limit cgroups
2169 if (scanning_global_lru(sc)) {
2170 unsigned long lru_pages = 0;
2171 for_each_zone_zonelist(zone, z, zonelist,
2172 gfp_zone(sc->gfp_mask)) {
2173 if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL))
2176 lru_pages += zone_reclaimable_pages(zone);
2179 shrink_slab(shrink, sc->nr_scanned, lru_pages);
2180 if (reclaim_state) {
2181 sc->nr_reclaimed += reclaim_state->reclaimed_slab;
2182 reclaim_state->reclaimed_slab = 0;
2185 total_scanned += sc->nr_scanned;
2186 if (sc->nr_reclaimed >= sc->nr_to_reclaim)
2190 * Try to write back as many pages as we just scanned. This
2191 * tends to cause slow streaming writers to write data to the
2192 * disk smoothly, at the dirtying rate, which is nice. But
2193 * that's undesirable in laptop mode, where we *want* lumpy
2194 * writeout. So in laptop mode, write out the whole world.
2196 writeback_threshold = sc->nr_to_reclaim + sc->nr_to_reclaim / 2;
2197 if (total_scanned > writeback_threshold) {
2198 wakeup_flusher_threads(laptop_mode ? 0 : total_scanned);
2199 sc->may_writepage = 1;
2202 /* Take a nap, wait for some writeback to complete */
2203 if (!sc->hibernation_mode && sc->nr_scanned &&
2204 priority < DEF_PRIORITY - 2) {
2205 struct zone *preferred_zone;
2207 first_zones_zonelist(zonelist, gfp_zone(sc->gfp_mask),
2208 &cpuset_current_mems_allowed,
2210 wait_iff_congested(preferred_zone, BLK_RW_ASYNC, HZ/10);
2215 delayacct_freepages_end();
2218 if (sc->nr_reclaimed)
2219 return sc->nr_reclaimed;
2222 * As hibernation is going on, kswapd is freezed so that it can't mark
2223 * the zone into all_unreclaimable. Thus bypassing all_unreclaimable
2226 if (oom_killer_disabled)
2229 /* top priority shrink_zones still had more to do? don't OOM, then */
2230 if (scanning_global_lru(sc) && !all_unreclaimable(zonelist, sc))
2236 unsigned long try_to_free_pages(struct zonelist *zonelist, int order,
2237 gfp_t gfp_mask, nodemask_t *nodemask)
2239 unsigned long nr_reclaimed;
2240 struct scan_control sc = {
2241 .gfp_mask = gfp_mask,
2242 .may_writepage = !laptop_mode,
2243 .nr_to_reclaim = SWAP_CLUSTER_MAX,
2248 .nodemask = nodemask,
2250 struct shrink_control shrink = {
2251 .gfp_mask = sc.gfp_mask,
2254 trace_mm_vmscan_direct_reclaim_begin(order,
2258 nr_reclaimed = do_try_to_free_pages(zonelist, &sc, &shrink);
2260 trace_mm_vmscan_direct_reclaim_end(nr_reclaimed);
2262 return nr_reclaimed;
2265 #ifdef CONFIG_CGROUP_MEM_RES_CTLR
2267 unsigned long mem_cgroup_shrink_node_zone(struct mem_cgroup *mem,
2268 gfp_t gfp_mask, bool noswap,
2270 unsigned long *nr_scanned)
2272 struct scan_control sc = {
2274 .nr_to_reclaim = SWAP_CLUSTER_MAX,
2275 .may_writepage = !laptop_mode,
2277 .may_swap = !noswap,
2282 sc.gfp_mask = (gfp_mask & GFP_RECLAIM_MASK) |
2283 (GFP_HIGHUSER_MOVABLE & ~GFP_RECLAIM_MASK);
2285 trace_mm_vmscan_memcg_softlimit_reclaim_begin(0,
2290 * NOTE: Although we can get the priority field, using it
2291 * here is not a good idea, since it limits the pages we can scan.
2292 * if we don't reclaim here, the shrink_zone from balance_pgdat
2293 * will pick up pages from other mem cgroup's as well. We hack
2294 * the priority and make it zero.
2296 shrink_zone(0, zone, &sc);
2298 trace_mm_vmscan_memcg_softlimit_reclaim_end(sc.nr_reclaimed);
2300 *nr_scanned = sc.nr_scanned;
2301 return sc.nr_reclaimed;
2304 unsigned long try_to_free_mem_cgroup_pages(struct mem_cgroup *mem_cont,
2308 struct zonelist *zonelist;
2309 unsigned long nr_reclaimed;
2311 struct scan_control sc = {
2312 .may_writepage = !laptop_mode,
2314 .may_swap = !noswap,
2315 .nr_to_reclaim = SWAP_CLUSTER_MAX,
2317 .mem_cgroup = mem_cont,
2318 .nodemask = NULL, /* we don't care the placement */
2319 .gfp_mask = (gfp_mask & GFP_RECLAIM_MASK) |
2320 (GFP_HIGHUSER_MOVABLE & ~GFP_RECLAIM_MASK),
2322 struct shrink_control shrink = {
2323 .gfp_mask = sc.gfp_mask,
2327 * Unlike direct reclaim via alloc_pages(), memcg's reclaim doesn't
2328 * take care of from where we get pages. So the node where we start the
2329 * scan does not need to be the current node.
2331 nid = mem_cgroup_select_victim_node(mem_cont);
2333 zonelist = NODE_DATA(nid)->node_zonelists;
2335 trace_mm_vmscan_memcg_reclaim_begin(0,
2339 nr_reclaimed = do_try_to_free_pages(zonelist, &sc, &shrink);
2341 trace_mm_vmscan_memcg_reclaim_end(nr_reclaimed);
2343 return nr_reclaimed;
2348 * pgdat_balanced is used when checking if a node is balanced for high-order
2349 * allocations. Only zones that meet watermarks and are in a zone allowed
2350 * by the callers classzone_idx are added to balanced_pages. The total of
2351 * balanced pages must be at least 25% of the zones allowed by classzone_idx
2352 * for the node to be considered balanced. Forcing all zones to be balanced
2353 * for high orders can cause excessive reclaim when there are imbalanced zones.
2354 * The choice of 25% is due to
2355 * o a 16M DMA zone that is balanced will not balance a zone on any
2356 * reasonable sized machine
2357 * o On all other machines, the top zone must be at least a reasonable
2358 * percentage of the middle zones. For example, on 32-bit x86, highmem
2359 * would need to be at least 256M for it to be balance a whole node.
2360 * Similarly, on x86-64 the Normal zone would need to be at least 1G
2361 * to balance a node on its own. These seemed like reasonable ratios.
2363 static bool pgdat_balanced(pg_data_t *pgdat, unsigned long balanced_pages,
2366 unsigned long present_pages = 0;
2369 for (i = 0; i <= classzone_idx; i++)
2370 present_pages += pgdat->node_zones[i].present_pages;
2372 /* A special case here: if zone has no page, we think it's balanced */
2373 return balanced_pages >= (present_pages >> 2);
2376 /* is kswapd sleeping prematurely? */
2377 static bool sleeping_prematurely(pg_data_t *pgdat, int order, long remaining,
2381 unsigned long balanced = 0;
2382 bool all_zones_ok = true;
2384 /* If a direct reclaimer woke kswapd within HZ/10, it's premature */
2388 /* Check the watermark levels */
2389 for (i = 0; i <= classzone_idx; i++) {
2390 struct zone *zone = pgdat->node_zones + i;
2392 if (!populated_zone(zone))
2396 * balance_pgdat() skips over all_unreclaimable after
2397 * DEF_PRIORITY. Effectively, it considers them balanced so
2398 * they must be considered balanced here as well if kswapd
2401 if (zone->all_unreclaimable) {
2402 balanced += zone->present_pages;
2406 if (!zone_watermark_ok_safe(zone, order, high_wmark_pages(zone),
2408 all_zones_ok = false;
2410 balanced += zone->present_pages;
2414 * For high-order requests, the balanced zones must contain at least
2415 * 25% of the nodes pages for kswapd to sleep. For order-0, all zones
2419 return !pgdat_balanced(pgdat, balanced, classzone_idx);
2421 return !all_zones_ok;
2425 * For kswapd, balance_pgdat() will work across all this node's zones until
2426 * they are all at high_wmark_pages(zone).
2428 * Returns the final order kswapd was reclaiming at
2430 * There is special handling here for zones which are full of pinned pages.
2431 * This can happen if the pages are all mlocked, or if they are all used by
2432 * device drivers (say, ZONE_DMA). Or if they are all in use by hugetlb.
2433 * What we do is to detect the case where all pages in the zone have been
2434 * scanned twice and there has been zero successful reclaim. Mark the zone as
2435 * dead and from now on, only perform a short scan. Basically we're polling
2436 * the zone for when the problem goes away.
2438 * kswapd scans the zones in the highmem->normal->dma direction. It skips
2439 * zones which have free_pages > high_wmark_pages(zone), but once a zone is
2440 * found to have free_pages <= high_wmark_pages(zone), we scan that zone and the
2441 * lower zones regardless of the number of free pages in the lower zones. This
2442 * interoperates with the page allocator fallback scheme to ensure that aging
2443 * of pages is balanced across the zones.
2445 static unsigned long balance_pgdat(pg_data_t *pgdat, int order,
2449 unsigned long balanced;
2452 int end_zone = 0; /* Inclusive. 0 = ZONE_DMA */
2453 unsigned long total_scanned;
2454 struct reclaim_state *reclaim_state = current->reclaim_state;
2455 unsigned long nr_soft_reclaimed;
2456 unsigned long nr_soft_scanned;
2457 struct scan_control sc = {
2458 .gfp_mask = GFP_KERNEL,
2462 * kswapd doesn't want to be bailed out while reclaim. because
2463 * we want to put equal scanning pressure on each zone.
2465 .nr_to_reclaim = ULONG_MAX,
2469 struct shrink_control shrink = {
2470 .gfp_mask = sc.gfp_mask,
2474 sc.nr_reclaimed = 0;
2475 sc.may_writepage = !laptop_mode;
2476 count_vm_event(PAGEOUTRUN);
2478 for (priority = DEF_PRIORITY; priority >= 0; priority--) {
2479 unsigned long lru_pages = 0;
2480 int has_under_min_watermark_zone = 0;
2482 /* The swap token gets in the way of swapout... */
2484 disable_swap_token(NULL);
2490 * Scan in the highmem->dma direction for the highest
2491 * zone which needs scanning
2493 for (i = pgdat->nr_zones - 1; i >= 0; i--) {
2494 struct zone *zone = pgdat->node_zones + i;
2496 if (!populated_zone(zone))
2499 if (zone->all_unreclaimable && priority != DEF_PRIORITY)
2503 * Do some background aging of the anon list, to give
2504 * pages a chance to be referenced before reclaiming.
2506 if (inactive_anon_is_low(zone, &sc))
2507 shrink_active_list(SWAP_CLUSTER_MAX, zone,
2510 if (!zone_watermark_ok_safe(zone, order,
2511 high_wmark_pages(zone), 0, 0)) {
2515 /* If balanced, clear the congested flag */
2516 zone_clear_flag(zone, ZONE_CONGESTED);
2522 for (i = 0; i <= end_zone; i++) {
2523 struct zone *zone = pgdat->node_zones + i;
2525 lru_pages += zone_reclaimable_pages(zone);
2529 * Now scan the zone in the dma->highmem direction, stopping
2530 * at the last zone which needs scanning.
2532 * We do this because the page allocator works in the opposite
2533 * direction. This prevents the page allocator from allocating
2534 * pages behind kswapd's direction of progress, which would
2535 * cause too much scanning of the lower zones.
2537 for (i = 0; i <= end_zone; i++) {
2538 struct zone *zone = pgdat->node_zones + i;
2540 unsigned long balance_gap;
2542 if (!populated_zone(zone))
2545 if (zone->all_unreclaimable && priority != DEF_PRIORITY)
2550 nr_soft_scanned = 0;
2552 * Call soft limit reclaim before calling shrink_zone.
2554 nr_soft_reclaimed = mem_cgroup_soft_limit_reclaim(zone,
2557 sc.nr_reclaimed += nr_soft_reclaimed;
2558 total_scanned += nr_soft_scanned;
2561 * We put equal pressure on every zone, unless
2562 * one zone has way too many pages free
2563 * already. The "too many pages" is defined
2564 * as the high wmark plus a "gap" where the
2565 * gap is either the low watermark or 1%
2566 * of the zone, whichever is smaller.
2568 balance_gap = min(low_wmark_pages(zone),
2569 (zone->present_pages +
2570 KSWAPD_ZONE_BALANCE_GAP_RATIO-1) /
2571 KSWAPD_ZONE_BALANCE_GAP_RATIO);
2572 if (!zone_watermark_ok_safe(zone, order,
2573 high_wmark_pages(zone) + balance_gap,
2575 shrink_zone(priority, zone, &sc);
2577 reclaim_state->reclaimed_slab = 0;
2578 nr_slab = shrink_slab(&shrink, sc.nr_scanned, lru_pages);
2579 sc.nr_reclaimed += reclaim_state->reclaimed_slab;
2580 total_scanned += sc.nr_scanned;
2582 if (nr_slab == 0 && !zone_reclaimable(zone))
2583 zone->all_unreclaimable = 1;
2587 * If we've done a decent amount of scanning and
2588 * the reclaim ratio is low, start doing writepage
2589 * even in laptop mode
2591 if (total_scanned > SWAP_CLUSTER_MAX * 2 &&
2592 total_scanned > sc.nr_reclaimed + sc.nr_reclaimed / 2)
2593 sc.may_writepage = 1;
2595 if (zone->all_unreclaimable) {
2596 if (end_zone && end_zone == i)
2601 if (!zone_watermark_ok_safe(zone, order,
2602 high_wmark_pages(zone), end_zone, 0)) {
2605 * We are still under min water mark. This
2606 * means that we have a GFP_ATOMIC allocation
2607 * failure risk. Hurry up!
2609 if (!zone_watermark_ok_safe(zone, order,
2610 min_wmark_pages(zone), end_zone, 0))
2611 has_under_min_watermark_zone = 1;
2614 * If a zone reaches its high watermark,
2615 * consider it to be no longer congested. It's
2616 * possible there are dirty pages backed by
2617 * congested BDIs but as pressure is relieved,
2618 * spectulatively avoid congestion waits
2620 zone_clear_flag(zone, ZONE_CONGESTED);
2621 if (i <= *classzone_idx)
2622 balanced += zone->present_pages;
2626 if (all_zones_ok || (order && pgdat_balanced(pgdat, balanced, *classzone_idx)))
2627 break; /* kswapd: all done */
2629 * OK, kswapd is getting into trouble. Take a nap, then take
2630 * another pass across the zones.
2632 if (total_scanned && (priority < DEF_PRIORITY - 2)) {
2633 if (has_under_min_watermark_zone)
2634 count_vm_event(KSWAPD_SKIP_CONGESTION_WAIT);
2636 congestion_wait(BLK_RW_ASYNC, HZ/10);
2640 * We do this so kswapd doesn't build up large priorities for
2641 * example when it is freeing in parallel with allocators. It
2642 * matches the direct reclaim path behaviour in terms of impact
2643 * on zone->*_priority.
2645 if (sc.nr_reclaimed >= SWAP_CLUSTER_MAX)
2651 * order-0: All zones must meet high watermark for a balanced node
2652 * high-order: Balanced zones must make up at least 25% of the node
2653 * for the node to be balanced
2655 if (!(all_zones_ok || (order && pgdat_balanced(pgdat, balanced, *classzone_idx)))) {
2661 * Fragmentation may mean that the system cannot be
2662 * rebalanced for high-order allocations in all zones.
2663 * At this point, if nr_reclaimed < SWAP_CLUSTER_MAX,
2664 * it means the zones have been fully scanned and are still
2665 * not balanced. For high-order allocations, there is
2666 * little point trying all over again as kswapd may
2669 * Instead, recheck all watermarks at order-0 as they
2670 * are the most important. If watermarks are ok, kswapd will go
2671 * back to sleep. High-order users can still perform direct
2672 * reclaim if they wish.
2674 if (sc.nr_reclaimed < SWAP_CLUSTER_MAX)
2675 order = sc.order = 0;
2681 * If kswapd was reclaiming at a higher order, it has the option of
2682 * sleeping without all zones being balanced. Before it does, it must
2683 * ensure that the watermarks for order-0 on *all* zones are met and
2684 * that the congestion flags are cleared. The congestion flag must
2685 * be cleared as kswapd is the only mechanism that clears the flag
2686 * and it is potentially going to sleep here.
2689 for (i = 0; i <= end_zone; i++) {
2690 struct zone *zone = pgdat->node_zones + i;
2692 if (!populated_zone(zone))
2695 if (zone->all_unreclaimable && priority != DEF_PRIORITY)
2698 /* Confirm the zone is balanced for order-0 */
2699 if (!zone_watermark_ok(zone, 0,
2700 high_wmark_pages(zone), 0, 0)) {
2701 order = sc.order = 0;
2705 /* If balanced, clear the congested flag */
2706 zone_clear_flag(zone, ZONE_CONGESTED);
2711 * Return the order we were reclaiming at so sleeping_prematurely()
2712 * makes a decision on the order we were last reclaiming at. However,
2713 * if another caller entered the allocator slow path while kswapd
2714 * was awake, order will remain at the higher level
2716 *classzone_idx = end_zone;
2720 static void kswapd_try_to_sleep(pg_data_t *pgdat, int order, int classzone_idx)
2725 if (freezing(current) || kthread_should_stop())
2728 prepare_to_wait(&pgdat->kswapd_wait, &wait, TASK_INTERRUPTIBLE);
2730 /* Try to sleep for a short interval */
2731 if (!sleeping_prematurely(pgdat, order, remaining, classzone_idx)) {
2732 remaining = schedule_timeout(HZ/10);
2733 finish_wait(&pgdat->kswapd_wait, &wait);
2734 prepare_to_wait(&pgdat->kswapd_wait, &wait, TASK_INTERRUPTIBLE);
2738 * After a short sleep, check if it was a premature sleep. If not, then
2739 * go fully to sleep until explicitly woken up.
2741 if (!sleeping_prematurely(pgdat, order, remaining, classzone_idx)) {
2742 trace_mm_vmscan_kswapd_sleep(pgdat->node_id);
2745 * vmstat counters are not perfectly accurate and the estimated
2746 * value for counters such as NR_FREE_PAGES can deviate from the
2747 * true value by nr_online_cpus * threshold. To avoid the zone
2748 * watermarks being breached while under pressure, we reduce the
2749 * per-cpu vmstat threshold while kswapd is awake and restore
2750 * them before going back to sleep.
2752 set_pgdat_percpu_threshold(pgdat, calculate_normal_threshold);
2754 set_pgdat_percpu_threshold(pgdat, calculate_pressure_threshold);
2757 count_vm_event(KSWAPD_LOW_WMARK_HIT_QUICKLY);
2759 count_vm_event(KSWAPD_HIGH_WMARK_HIT_QUICKLY);
2761 finish_wait(&pgdat->kswapd_wait, &wait);
2765 * The background pageout daemon, started as a kernel thread
2766 * from the init process.
2768 * This basically trickles out pages so that we have _some_
2769 * free memory available even if there is no other activity
2770 * that frees anything up. This is needed for things like routing
2771 * etc, where we otherwise might have all activity going on in
2772 * asynchronous contexts that cannot page things out.
2774 * If there are applications that are active memory-allocators
2775 * (most normal use), this basically shouldn't matter.
2777 static int kswapd(void *p)
2779 unsigned long order, new_order;
2780 int classzone_idx, new_classzone_idx;
2781 pg_data_t *pgdat = (pg_data_t*)p;
2782 struct task_struct *tsk = current;
2784 struct reclaim_state reclaim_state = {
2785 .reclaimed_slab = 0,
2787 const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id);
2789 lockdep_set_current_reclaim_state(GFP_KERNEL);
2791 if (!cpumask_empty(cpumask))
2792 set_cpus_allowed_ptr(tsk, cpumask);
2793 current->reclaim_state = &reclaim_state;
2796 * Tell the memory management that we're a "memory allocator",
2797 * and that if we need more memory we should get access to it
2798 * regardless (see "__alloc_pages()"). "kswapd" should
2799 * never get caught in the normal page freeing logic.
2801 * (Kswapd normally doesn't need memory anyway, but sometimes
2802 * you need a small amount of memory in order to be able to
2803 * page out something else, and this flag essentially protects
2804 * us from recursively trying to free more memory as we're
2805 * trying to free the first piece of memory in the first place).
2807 tsk->flags |= PF_MEMALLOC | PF_SWAPWRITE | PF_KSWAPD;
2810 order = new_order = 0;
2811 classzone_idx = new_classzone_idx = pgdat->nr_zones - 1;
2816 * If the last balance_pgdat was unsuccessful it's unlikely a
2817 * new request of a similar or harder type will succeed soon
2818 * so consider going to sleep on the basis we reclaimed at
2820 if (classzone_idx >= new_classzone_idx && order == new_order) {
2821 new_order = pgdat->kswapd_max_order;
2822 new_classzone_idx = pgdat->classzone_idx;
2823 pgdat->kswapd_max_order = 0;
2824 pgdat->classzone_idx = pgdat->nr_zones - 1;
2827 if (order < new_order || classzone_idx > new_classzone_idx) {
2829 * Don't sleep if someone wants a larger 'order'
2830 * allocation or has tigher zone constraints
2833 classzone_idx = new_classzone_idx;
2835 kswapd_try_to_sleep(pgdat, order, classzone_idx);
2836 order = pgdat->kswapd_max_order;
2837 classzone_idx = pgdat->classzone_idx;
2838 pgdat->kswapd_max_order = 0;
2839 pgdat->classzone_idx = pgdat->nr_zones - 1;
2842 ret = try_to_freeze();
2843 if (kthread_should_stop())
2847 * We can speed up thawing tasks if we don't call balance_pgdat
2848 * after returning from the refrigerator
2851 trace_mm_vmscan_kswapd_wake(pgdat->node_id, order);
2852 order = balance_pgdat(pgdat, order, &classzone_idx);
2859 * A zone is low on free memory, so wake its kswapd task to service it.
2861 void wakeup_kswapd(struct zone *zone, int order, enum zone_type classzone_idx)
2865 if (!populated_zone(zone))
2868 if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL))
2870 pgdat = zone->zone_pgdat;
2871 if (pgdat->kswapd_max_order < order) {
2872 pgdat->kswapd_max_order = order;
2873 pgdat->classzone_idx = min(pgdat->classzone_idx, classzone_idx);
2875 if (!waitqueue_active(&pgdat->kswapd_wait))
2877 if (zone_watermark_ok_safe(zone, order, low_wmark_pages(zone), 0, 0))
2880 trace_mm_vmscan_wakeup_kswapd(pgdat->node_id, zone_idx(zone), order);
2881 wake_up_interruptible(&pgdat->kswapd_wait);
2885 * The reclaimable count would be mostly accurate.
2886 * The less reclaimable pages may be
2887 * - mlocked pages, which will be moved to unevictable list when encountered
2888 * - mapped pages, which may require several travels to be reclaimed
2889 * - dirty pages, which is not "instantly" reclaimable
2891 unsigned long global_reclaimable_pages(void)
2895 nr = global_page_state(NR_ACTIVE_FILE) +
2896 global_page_state(NR_INACTIVE_FILE);
2898 if (nr_swap_pages > 0)
2899 nr += global_page_state(NR_ACTIVE_ANON) +
2900 global_page_state(NR_INACTIVE_ANON);
2905 unsigned long zone_reclaimable_pages(struct zone *zone)
2909 nr = zone_page_state(zone, NR_ACTIVE_FILE) +
2910 zone_page_state(zone, NR_INACTIVE_FILE);
2912 if (nr_swap_pages > 0)
2913 nr += zone_page_state(zone, NR_ACTIVE_ANON) +
2914 zone_page_state(zone, NR_INACTIVE_ANON);
2919 #ifdef CONFIG_HIBERNATION
2921 * Try to free `nr_to_reclaim' of memory, system-wide, and return the number of
2924 * Rather than trying to age LRUs the aim is to preserve the overall
2925 * LRU order by reclaiming preferentially
2926 * inactive > active > active referenced > active mapped
2928 unsigned long shrink_all_memory(unsigned long nr_to_reclaim)
2930 struct reclaim_state reclaim_state;
2931 struct scan_control sc = {
2932 .gfp_mask = GFP_HIGHUSER_MOVABLE,
2936 .nr_to_reclaim = nr_to_reclaim,
2937 .hibernation_mode = 1,
2940 struct shrink_control shrink = {
2941 .gfp_mask = sc.gfp_mask,
2943 struct zonelist *zonelist = node_zonelist(numa_node_id(), sc.gfp_mask);
2944 struct task_struct *p = current;
2945 unsigned long nr_reclaimed;
2947 p->flags |= PF_MEMALLOC;
2948 lockdep_set_current_reclaim_state(sc.gfp_mask);
2949 reclaim_state.reclaimed_slab = 0;
2950 p->reclaim_state = &reclaim_state;
2952 nr_reclaimed = do_try_to_free_pages(zonelist, &sc, &shrink);
2954 p->reclaim_state = NULL;
2955 lockdep_clear_current_reclaim_state();
2956 p->flags &= ~PF_MEMALLOC;
2958 return nr_reclaimed;
2960 #endif /* CONFIG_HIBERNATION */
2962 /* It's optimal to keep kswapds on the same CPUs as their memory, but
2963 not required for correctness. So if the last cpu in a node goes
2964 away, we get changed to run anywhere: as the first one comes back,
2965 restore their cpu bindings. */
2966 static int __devinit cpu_callback(struct notifier_block *nfb,
2967 unsigned long action, void *hcpu)
2971 if (action == CPU_ONLINE || action == CPU_ONLINE_FROZEN) {
2972 for_each_node_state(nid, N_HIGH_MEMORY) {
2973 pg_data_t *pgdat = NODE_DATA(nid);
2974 const struct cpumask *mask;
2976 mask = cpumask_of_node(pgdat->node_id);
2978 if (cpumask_any_and(cpu_online_mask, mask) < nr_cpu_ids)
2979 /* One of our CPUs online: restore mask */
2980 set_cpus_allowed_ptr(pgdat->kswapd, mask);
2987 * This kswapd start function will be called by init and node-hot-add.
2988 * On node-hot-add, kswapd will moved to proper cpus if cpus are hot-added.
2990 int kswapd_run(int nid)
2992 pg_data_t *pgdat = NODE_DATA(nid);
2998 pgdat->kswapd = kthread_run(kswapd, pgdat, "kswapd%d", nid);
2999 if (IS_ERR(pgdat->kswapd)) {
3000 /* failure at boot is fatal */
3001 BUG_ON(system_state == SYSTEM_BOOTING);
3002 printk("Failed to start kswapd on node %d\n",nid);
3009 * Called by memory hotplug when all memory in a node is offlined.
3011 void kswapd_stop(int nid)
3013 struct task_struct *kswapd = NODE_DATA(nid)->kswapd;
3016 kthread_stop(kswapd);
3019 static int __init kswapd_init(void)
3024 for_each_node_state(nid, N_HIGH_MEMORY)
3026 hotcpu_notifier(cpu_callback, 0);
3030 module_init(kswapd_init)
3036 * If non-zero call zone_reclaim when the number of free pages falls below
3039 int zone_reclaim_mode __read_mostly;
3041 #define RECLAIM_OFF 0
3042 #define RECLAIM_ZONE (1<<0) /* Run shrink_inactive_list on the zone */
3043 #define RECLAIM_WRITE (1<<1) /* Writeout pages during reclaim */
3044 #define RECLAIM_SWAP (1<<2) /* Swap pages out during reclaim */
3047 * Priority for ZONE_RECLAIM. This determines the fraction of pages
3048 * of a node considered for each zone_reclaim. 4 scans 1/16th of
3051 #define ZONE_RECLAIM_PRIORITY 4
3054 * Percentage of pages in a zone that must be unmapped for zone_reclaim to
3057 int sysctl_min_unmapped_ratio = 1;
3060 * If the number of slab pages in a zone grows beyond this percentage then
3061 * slab reclaim needs to occur.
3063 int sysctl_min_slab_ratio = 5;
3065 static inline unsigned long zone_unmapped_file_pages(struct zone *zone)
3067 unsigned long file_mapped = zone_page_state(zone, NR_FILE_MAPPED);
3068 unsigned long file_lru = zone_page_state(zone, NR_INACTIVE_FILE) +
3069 zone_page_state(zone, NR_ACTIVE_FILE);
3072 * It's possible for there to be more file mapped pages than
3073 * accounted for by the pages on the file LRU lists because
3074 * tmpfs pages accounted for as ANON can also be FILE_MAPPED
3076 return (file_lru > file_mapped) ? (file_lru - file_mapped) : 0;
3079 /* Work out how many page cache pages we can reclaim in this reclaim_mode */
3080 static long zone_pagecache_reclaimable(struct zone *zone)
3082 long nr_pagecache_reclaimable;
3086 * If RECLAIM_SWAP is set, then all file pages are considered
3087 * potentially reclaimable. Otherwise, we have to worry about
3088 * pages like swapcache and zone_unmapped_file_pages() provides
3091 if (zone_reclaim_mode & RECLAIM_SWAP)
3092 nr_pagecache_reclaimable = zone_page_state(zone, NR_FILE_PAGES);
3094 nr_pagecache_reclaimable = zone_unmapped_file_pages(zone);
3096 /* If we can't clean pages, remove dirty pages from consideration */
3097 if (!(zone_reclaim_mode & RECLAIM_WRITE))
3098 delta += zone_page_state(zone, NR_FILE_DIRTY);
3100 /* Watch for any possible underflows due to delta */
3101 if (unlikely(delta > nr_pagecache_reclaimable))
3102 delta = nr_pagecache_reclaimable;
3104 return nr_pagecache_reclaimable - delta;
3108 * Try to free up some pages from this zone through reclaim.
3110 static int __zone_reclaim(struct zone *zone, gfp_t gfp_mask, unsigned int order)
3112 /* Minimum pages needed in order to stay on node */
3113 const unsigned long nr_pages = 1 << order;
3114 struct task_struct *p = current;
3115 struct reclaim_state reclaim_state;
3117 struct scan_control sc = {
3118 .may_writepage = !!(zone_reclaim_mode & RECLAIM_WRITE),
3119 .may_unmap = !!(zone_reclaim_mode & RECLAIM_SWAP),
3121 .nr_to_reclaim = max_t(unsigned long, nr_pages,
3123 .gfp_mask = gfp_mask,
3126 struct shrink_control shrink = {
3127 .gfp_mask = sc.gfp_mask,
3129 unsigned long nr_slab_pages0, nr_slab_pages1;
3133 * We need to be able to allocate from the reserves for RECLAIM_SWAP
3134 * and we also need to be able to write out pages for RECLAIM_WRITE
3137 p->flags |= PF_MEMALLOC | PF_SWAPWRITE;
3138 lockdep_set_current_reclaim_state(gfp_mask);
3139 reclaim_state.reclaimed_slab = 0;
3140 p->reclaim_state = &reclaim_state;
3142 if (zone_pagecache_reclaimable(zone) > zone->min_unmapped_pages) {
3144 * Free memory by calling shrink zone with increasing
3145 * priorities until we have enough memory freed.
3147 priority = ZONE_RECLAIM_PRIORITY;
3149 shrink_zone(priority, zone, &sc);
3151 } while (priority >= 0 && sc.nr_reclaimed < nr_pages);
3154 nr_slab_pages0 = zone_page_state(zone, NR_SLAB_RECLAIMABLE);
3155 if (nr_slab_pages0 > zone->min_slab_pages) {
3157 * shrink_slab() does not currently allow us to determine how
3158 * many pages were freed in this zone. So we take the current
3159 * number of slab pages and shake the slab until it is reduced
3160 * by the same nr_pages that we used for reclaiming unmapped
3163 * Note that shrink_slab will free memory on all zones and may
3167 unsigned long lru_pages = zone_reclaimable_pages(zone);
3169 /* No reclaimable slab or very low memory pressure */
3170 if (!shrink_slab(&shrink, sc.nr_scanned, lru_pages))
3173 /* Freed enough memory */
3174 nr_slab_pages1 = zone_page_state(zone,
3175 NR_SLAB_RECLAIMABLE);
3176 if (nr_slab_pages1 + nr_pages <= nr_slab_pages0)
3181 * Update nr_reclaimed by the number of slab pages we
3182 * reclaimed from this zone.
3184 nr_slab_pages1 = zone_page_state(zone, NR_SLAB_RECLAIMABLE);
3185 if (nr_slab_pages1 < nr_slab_pages0)
3186 sc.nr_reclaimed += nr_slab_pages0 - nr_slab_pages1;
3189 p->reclaim_state = NULL;
3190 current->flags &= ~(PF_MEMALLOC | PF_SWAPWRITE);
3191 lockdep_clear_current_reclaim_state();
3192 return sc.nr_reclaimed >= nr_pages;
3195 int zone_reclaim(struct zone *zone, gfp_t gfp_mask, unsigned int order)
3201 * Zone reclaim reclaims unmapped file backed pages and
3202 * slab pages if we are over the defined limits.
3204 * A small portion of unmapped file backed pages is needed for
3205 * file I/O otherwise pages read by file I/O will be immediately
3206 * thrown out if the zone is overallocated. So we do not reclaim
3207 * if less than a specified percentage of the zone is used by
3208 * unmapped file backed pages.
3210 if (zone_pagecache_reclaimable(zone) <= zone->min_unmapped_pages &&
3211 zone_page_state(zone, NR_SLAB_RECLAIMABLE) <= zone->min_slab_pages)
3212 return ZONE_RECLAIM_FULL;
3214 if (zone->all_unreclaimable)
3215 return ZONE_RECLAIM_FULL;
3218 * Do not scan if the allocation should not be delayed.
3220 if (!(gfp_mask & __GFP_WAIT) || (current->flags & PF_MEMALLOC))
3221 return ZONE_RECLAIM_NOSCAN;
3224 * Only run zone reclaim on the local zone or on zones that do not
3225 * have associated processors. This will favor the local processor
3226 * over remote processors and spread off node memory allocations
3227 * as wide as possible.
3229 node_id = zone_to_nid(zone);
3230 if (node_state(node_id, N_CPU) && node_id != numa_node_id())
3231 return ZONE_RECLAIM_NOSCAN;
3233 if (zone_test_and_set_flag(zone, ZONE_RECLAIM_LOCKED))
3234 return ZONE_RECLAIM_NOSCAN;
3236 ret = __zone_reclaim(zone, gfp_mask, order);
3237 zone_clear_flag(zone, ZONE_RECLAIM_LOCKED);
3240 count_vm_event(PGSCAN_ZONE_RECLAIM_FAILED);
3247 * page_evictable - test whether a page is evictable
3248 * @page: the page to test
3249 * @vma: the VMA in which the page is or will be mapped, may be NULL
3251 * Test whether page is evictable--i.e., should be placed on active/inactive
3252 * lists vs unevictable list. The vma argument is !NULL when called from the
3253 * fault path to determine how to instantate a new page.
3255 * Reasons page might not be evictable:
3256 * (1) page's mapping marked unevictable
3257 * (2) page is part of an mlocked VMA
3260 int page_evictable(struct page *page, struct vm_area_struct *vma)
3263 if (mapping_unevictable(page_mapping(page)))
3266 if (PageMlocked(page) || (vma && is_mlocked_vma(vma, page)))
3273 * check_move_unevictable_page - check page for evictability and move to appropriate zone lru list
3274 * @page: page to check evictability and move to appropriate lru list
3275 * @zone: zone page is in
3277 * Checks a page for evictability and moves the page to the appropriate
3280 * Restrictions: zone->lru_lock must be held, page must be on LRU and must
3281 * have PageUnevictable set.
3283 static void check_move_unevictable_page(struct page *page, struct zone *zone)
3285 VM_BUG_ON(PageActive(page));
3288 ClearPageUnevictable(page);
3289 if (page_evictable(page, NULL)) {
3290 enum lru_list l = page_lru_base_type(page);
3292 __dec_zone_state(zone, NR_UNEVICTABLE);
3293 list_move(&page->lru, &zone->lru[l].list);
3294 mem_cgroup_move_lists(page, LRU_UNEVICTABLE, l);
3295 __inc_zone_state(zone, NR_INACTIVE_ANON + l);
3296 __count_vm_event(UNEVICTABLE_PGRESCUED);
3299 * rotate unevictable list
3301 SetPageUnevictable(page);
3302 list_move(&page->lru, &zone->lru[LRU_UNEVICTABLE].list);
3303 mem_cgroup_rotate_lru_list(page, LRU_UNEVICTABLE);
3304 if (page_evictable(page, NULL))
3310 * scan_mapping_unevictable_pages - scan an address space for evictable pages
3311 * @mapping: struct address_space to scan for evictable pages
3313 * Scan all pages in mapping. Check unevictable pages for
3314 * evictability and move them to the appropriate zone lru list.
3316 void scan_mapping_unevictable_pages(struct address_space *mapping)
3319 pgoff_t end = (i_size_read(mapping->host) + PAGE_CACHE_SIZE - 1) >>
3322 struct pagevec pvec;
3324 if (mapping->nrpages == 0)
3327 pagevec_init(&pvec, 0);
3328 while (next < end &&
3329 pagevec_lookup(&pvec, mapping, next, PAGEVEC_SIZE)) {
3335 for (i = 0; i < pagevec_count(&pvec); i++) {
3336 struct page *page = pvec.pages[i];
3337 pgoff_t page_index = page->index;
3338 struct zone *pagezone = page_zone(page);
3341 if (page_index > next)
3345 if (pagezone != zone) {
3347 spin_unlock_irq(&zone->lru_lock);
3349 spin_lock_irq(&zone->lru_lock);
3352 if (PageLRU(page) && PageUnevictable(page))
3353 check_move_unevictable_page(page, zone);
3356 spin_unlock_irq(&zone->lru_lock);
3357 pagevec_release(&pvec);
3359 count_vm_events(UNEVICTABLE_PGSCANNED, pg_scanned);
3365 * scan_zone_unevictable_pages - check unevictable list for evictable pages
3366 * @zone - zone of which to scan the unevictable list
3368 * Scan @zone's unevictable LRU lists to check for pages that have become
3369 * evictable. Move those that have to @zone's inactive list where they
3370 * become candidates for reclaim, unless shrink_inactive_zone() decides
3371 * to reactivate them. Pages that are still unevictable are rotated
3372 * back onto @zone's unevictable list.
3374 #define SCAN_UNEVICTABLE_BATCH_SIZE 16UL /* arbitrary lock hold batch size */
3375 static void scan_zone_unevictable_pages(struct zone *zone)
3377 struct list_head *l_unevictable = &zone->lru[LRU_UNEVICTABLE].list;
3379 unsigned long nr_to_scan = zone_page_state(zone, NR_UNEVICTABLE);
3381 while (nr_to_scan > 0) {
3382 unsigned long batch_size = min(nr_to_scan,
3383 SCAN_UNEVICTABLE_BATCH_SIZE);
3385 spin_lock_irq(&zone->lru_lock);
3386 for (scan = 0; scan < batch_size; scan++) {
3387 struct page *page = lru_to_page(l_unevictable);
3389 if (!trylock_page(page))
3392 prefetchw_prev_lru_page(page, l_unevictable, flags);
3394 if (likely(PageLRU(page) && PageUnevictable(page)))
3395 check_move_unevictable_page(page, zone);
3399 spin_unlock_irq(&zone->lru_lock);
3401 nr_to_scan -= batch_size;
3407 * scan_all_zones_unevictable_pages - scan all unevictable lists for evictable pages
3409 * A really big hammer: scan all zones' unevictable LRU lists to check for
3410 * pages that have become evictable. Move those back to the zones'
3411 * inactive list where they become candidates for reclaim.
3412 * This occurs when, e.g., we have unswappable pages on the unevictable lists,
3413 * and we add swap to the system. As such, it runs in the context of a task
3414 * that has possibly/probably made some previously unevictable pages
3417 static void scan_all_zones_unevictable_pages(void)
3421 for_each_zone(zone) {
3422 scan_zone_unevictable_pages(zone);
3427 * scan_unevictable_pages [vm] sysctl handler. On demand re-scan of
3428 * all nodes' unevictable lists for evictable pages
3430 unsigned long scan_unevictable_pages;
3432 int scan_unevictable_handler(struct ctl_table *table, int write,
3433 void __user *buffer,
3434 size_t *length, loff_t *ppos)
3436 proc_doulongvec_minmax(table, write, buffer, length, ppos);
3438 if (write && *(unsigned long *)table->data)
3439 scan_all_zones_unevictable_pages();
3441 scan_unevictable_pages = 0;
3447 * per node 'scan_unevictable_pages' attribute. On demand re-scan of
3448 * a specified node's per zone unevictable lists for evictable pages.
3451 static ssize_t read_scan_unevictable_node(struct sys_device *dev,
3452 struct sysdev_attribute *attr,
3455 return sprintf(buf, "0\n"); /* always zero; should fit... */
3458 static ssize_t write_scan_unevictable_node(struct sys_device *dev,
3459 struct sysdev_attribute *attr,
3460 const char *buf, size_t count)
3462 struct zone *node_zones = NODE_DATA(dev->id)->node_zones;
3465 unsigned long req = strict_strtoul(buf, 10, &res);
3468 return 1; /* zero is no-op */
3470 for (zone = node_zones; zone - node_zones < MAX_NR_ZONES; ++zone) {
3471 if (!populated_zone(zone))
3473 scan_zone_unevictable_pages(zone);
3479 static SYSDEV_ATTR(scan_unevictable_pages, S_IRUGO | S_IWUSR,
3480 read_scan_unevictable_node,
3481 write_scan_unevictable_node);
3483 int scan_unevictable_register_node(struct node *node)
3485 return sysdev_create_file(&node->sysdev, &attr_scan_unevictable_pages);
3488 void scan_unevictable_unregister_node(struct node *node)
3490 sysdev_remove_file(&node->sysdev, &attr_scan_unevictable_pages);