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/notifier.h>
36 #include <linux/rwsem.h>
37 #include <linux/delay.h>
38 #include <linux/kthread.h>
39 #include <linux/freezer.h>
40 #include <linux/memcontrol.h>
41 #include <linux/delayacct.h>
42 #include <linux/sysctl.h>
44 #include <asm/tlbflush.h>
45 #include <asm/div64.h>
47 #include <linux/swapops.h>
51 #define CREATE_TRACE_POINTS
52 #include <trace/events/vmscan.h>
55 /* Incremented by the number of inactive pages that were scanned */
56 unsigned long nr_scanned;
58 /* Number of pages freed so far during a call to shrink_zones() */
59 unsigned long nr_reclaimed;
61 /* How many pages shrink_list() should reclaim */
62 unsigned long nr_to_reclaim;
64 unsigned long hibernation_mode;
66 /* This context's GFP mask */
71 /* Can mapped pages be reclaimed? */
74 /* Can pages be swapped as part of reclaim? */
82 * Intend to reclaim enough contenious memory rather than to reclaim
83 * enough amount memory. I.e, it's the mode for high order allocation.
85 bool lumpy_reclaim_mode;
87 /* Which cgroup do we reclaim from */
88 struct mem_cgroup *mem_cgroup;
91 * Nodemask of nodes allowed by the caller. If NULL, all nodes
97 #define lru_to_page(_head) (list_entry((_head)->prev, struct page, lru))
99 #ifdef ARCH_HAS_PREFETCH
100 #define prefetch_prev_lru_page(_page, _base, _field) \
102 if ((_page)->lru.prev != _base) { \
105 prev = lru_to_page(&(_page->lru)); \
106 prefetch(&prev->_field); \
110 #define prefetch_prev_lru_page(_page, _base, _field) do { } while (0)
113 #ifdef ARCH_HAS_PREFETCHW
114 #define prefetchw_prev_lru_page(_page, _base, _field) \
116 if ((_page)->lru.prev != _base) { \
119 prev = lru_to_page(&(_page->lru)); \
120 prefetchw(&prev->_field); \
124 #define prefetchw_prev_lru_page(_page, _base, _field) do { } while (0)
128 * From 0 .. 100. Higher means more swappy.
130 int vm_swappiness = 60;
131 long vm_total_pages; /* The total number of pages which the VM controls */
133 static LIST_HEAD(shrinker_list);
134 static DECLARE_RWSEM(shrinker_rwsem);
136 #ifdef CONFIG_CGROUP_MEM_RES_CTLR
137 #define scanning_global_lru(sc) (!(sc)->mem_cgroup)
139 #define scanning_global_lru(sc) (1)
142 static struct zone_reclaim_stat *get_reclaim_stat(struct zone *zone,
143 struct scan_control *sc)
145 if (!scanning_global_lru(sc))
146 return mem_cgroup_get_reclaim_stat(sc->mem_cgroup, zone);
148 return &zone->reclaim_stat;
151 static unsigned long zone_nr_lru_pages(struct zone *zone,
152 struct scan_control *sc, enum lru_list lru)
154 if (!scanning_global_lru(sc))
155 return mem_cgroup_zone_nr_pages(sc->mem_cgroup, zone, lru);
157 return zone_page_state(zone, NR_LRU_BASE + lru);
162 * Add a shrinker callback to be called from the vm
164 void register_shrinker(struct shrinker *shrinker)
167 down_write(&shrinker_rwsem);
168 list_add_tail(&shrinker->list, &shrinker_list);
169 up_write(&shrinker_rwsem);
171 EXPORT_SYMBOL(register_shrinker);
176 void unregister_shrinker(struct shrinker *shrinker)
178 down_write(&shrinker_rwsem);
179 list_del(&shrinker->list);
180 up_write(&shrinker_rwsem);
182 EXPORT_SYMBOL(unregister_shrinker);
184 #define SHRINK_BATCH 128
186 * Call the shrink functions to age shrinkable caches
188 * Here we assume it costs one seek to replace a lru page and that it also
189 * takes a seek to recreate a cache object. With this in mind we age equal
190 * percentages of the lru and ageable caches. This should balance the seeks
191 * generated by these structures.
193 * If the vm encountered mapped pages on the LRU it increase the pressure on
194 * slab to avoid swapping.
196 * We do weird things to avoid (scanned*seeks*entries) overflowing 32 bits.
198 * `lru_pages' represents the number of on-LRU pages in all the zones which
199 * are eligible for the caller's allocation attempt. It is used for balancing
200 * slab reclaim versus page reclaim.
202 * Returns the number of slab objects which we shrunk.
204 unsigned long shrink_slab(unsigned long scanned, gfp_t gfp_mask,
205 unsigned long lru_pages)
207 struct shrinker *shrinker;
208 unsigned long ret = 0;
211 scanned = SWAP_CLUSTER_MAX;
213 if (!down_read_trylock(&shrinker_rwsem))
214 return 1; /* Assume we'll be able to shrink next time */
216 list_for_each_entry(shrinker, &shrinker_list, list) {
217 unsigned long long delta;
218 unsigned long total_scan;
219 unsigned long max_pass;
221 max_pass = (*shrinker->shrink)(shrinker, 0, gfp_mask);
222 delta = (4 * scanned) / shrinker->seeks;
224 do_div(delta, lru_pages + 1);
225 shrinker->nr += delta;
226 if (shrinker->nr < 0) {
227 printk(KERN_ERR "shrink_slab: %pF negative objects to "
229 shrinker->shrink, shrinker->nr);
230 shrinker->nr = max_pass;
234 * Avoid risking looping forever due to too large nr value:
235 * never try to free more than twice the estimate number of
238 if (shrinker->nr > max_pass * 2)
239 shrinker->nr = max_pass * 2;
241 total_scan = shrinker->nr;
244 while (total_scan >= SHRINK_BATCH) {
245 long this_scan = SHRINK_BATCH;
249 nr_before = (*shrinker->shrink)(shrinker, 0, gfp_mask);
250 shrink_ret = (*shrinker->shrink)(shrinker, this_scan,
252 if (shrink_ret == -1)
254 if (shrink_ret < nr_before)
255 ret += nr_before - shrink_ret;
256 count_vm_events(SLABS_SCANNED, this_scan);
257 total_scan -= this_scan;
262 shrinker->nr += total_scan;
264 up_read(&shrinker_rwsem);
268 static inline int is_page_cache_freeable(struct page *page)
271 * A freeable page cache page is referenced only by the caller
272 * that isolated the page, the page cache radix tree and
273 * optional buffer heads at page->private.
275 return page_count(page) - page_has_private(page) == 2;
278 static int may_write_to_queue(struct backing_dev_info *bdi)
280 if (current->flags & PF_SWAPWRITE)
282 if (!bdi_write_congested(bdi))
284 if (bdi == current->backing_dev_info)
290 * We detected a synchronous write error writing a page out. Probably
291 * -ENOSPC. We need to propagate that into the address_space for a subsequent
292 * fsync(), msync() or close().
294 * The tricky part is that after writepage we cannot touch the mapping: nothing
295 * prevents it from being freed up. But we have a ref on the page and once
296 * that page is locked, the mapping is pinned.
298 * We're allowed to run sleeping lock_page() here because we know the caller has
301 static void handle_write_error(struct address_space *mapping,
302 struct page *page, int error)
304 lock_page_nosync(page);
305 if (page_mapping(page) == mapping)
306 mapping_set_error(mapping, error);
310 /* Request for sync pageout. */
316 /* possible outcome of pageout() */
318 /* failed to write page out, page is locked */
320 /* move page to the active list, page is locked */
322 /* page has been sent to the disk successfully, page is unlocked */
324 /* page is clean and locked */
329 * pageout is called by shrink_page_list() for each dirty page.
330 * Calls ->writepage().
332 static pageout_t pageout(struct page *page, struct address_space *mapping,
333 enum pageout_io sync_writeback)
336 * If the page is dirty, only perform writeback if that write
337 * will be non-blocking. To prevent this allocation from being
338 * stalled by pagecache activity. But note that there may be
339 * stalls if we need to run get_block(). We could test
340 * PagePrivate for that.
342 * If this process is currently in __generic_file_aio_write() against
343 * this page's queue, we can perform writeback even if that
346 * If the page is swapcache, write it back even if that would
347 * block, for some throttling. This happens by accident, because
348 * swap_backing_dev_info is bust: it doesn't reflect the
349 * congestion state of the swapdevs. Easy to fix, if needed.
351 if (!is_page_cache_freeable(page))
355 * Some data journaling orphaned pages can have
356 * page->mapping == NULL while being dirty with clean buffers.
358 if (page_has_private(page)) {
359 if (try_to_free_buffers(page)) {
360 ClearPageDirty(page);
361 printk("%s: orphaned page\n", __func__);
367 if (mapping->a_ops->writepage == NULL)
368 return PAGE_ACTIVATE;
369 if (!may_write_to_queue(mapping->backing_dev_info))
372 if (clear_page_dirty_for_io(page)) {
374 struct writeback_control wbc = {
375 .sync_mode = WB_SYNC_NONE,
376 .nr_to_write = SWAP_CLUSTER_MAX,
378 .range_end = LLONG_MAX,
383 SetPageReclaim(page);
384 res = mapping->a_ops->writepage(page, &wbc);
386 handle_write_error(mapping, page, res);
387 if (res == AOP_WRITEPAGE_ACTIVATE) {
388 ClearPageReclaim(page);
389 return PAGE_ACTIVATE;
393 * Wait on writeback if requested to. This happens when
394 * direct reclaiming a large contiguous area and the
395 * first attempt to free a range of pages fails.
397 if (PageWriteback(page) && sync_writeback == PAGEOUT_IO_SYNC)
398 wait_on_page_writeback(page);
400 if (!PageWriteback(page)) {
401 /* synchronous write or broken a_ops? */
402 ClearPageReclaim(page);
404 trace_mm_vmscan_writepage(page,
405 trace_reclaim_flags(page, sync_writeback));
406 inc_zone_page_state(page, NR_VMSCAN_WRITE);
414 * Same as remove_mapping, but if the page is removed from the mapping, it
415 * gets returned with a refcount of 0.
417 static int __remove_mapping(struct address_space *mapping, struct page *page)
419 BUG_ON(!PageLocked(page));
420 BUG_ON(mapping != page_mapping(page));
422 spin_lock_irq(&mapping->tree_lock);
424 * The non racy check for a busy page.
426 * Must be careful with the order of the tests. When someone has
427 * a ref to the page, it may be possible that they dirty it then
428 * drop the reference. So if PageDirty is tested before page_count
429 * here, then the following race may occur:
431 * get_user_pages(&page);
432 * [user mapping goes away]
434 * !PageDirty(page) [good]
435 * SetPageDirty(page);
437 * !page_count(page) [good, discard it]
439 * [oops, our write_to data is lost]
441 * Reversing the order of the tests ensures such a situation cannot
442 * escape unnoticed. The smp_rmb is needed to ensure the page->flags
443 * load is not satisfied before that of page->_count.
445 * Note that if SetPageDirty is always performed via set_page_dirty,
446 * and thus under tree_lock, then this ordering is not required.
448 if (!page_freeze_refs(page, 2))
450 /* note: atomic_cmpxchg in page_freeze_refs provides the smp_rmb */
451 if (unlikely(PageDirty(page))) {
452 page_unfreeze_refs(page, 2);
456 if (PageSwapCache(page)) {
457 swp_entry_t swap = { .val = page_private(page) };
458 __delete_from_swap_cache(page);
459 spin_unlock_irq(&mapping->tree_lock);
460 swapcache_free(swap, page);
462 __remove_from_page_cache(page);
463 spin_unlock_irq(&mapping->tree_lock);
464 mem_cgroup_uncharge_cache_page(page);
470 spin_unlock_irq(&mapping->tree_lock);
475 * Attempt to detach a locked page from its ->mapping. If it is dirty or if
476 * someone else has a ref on the page, abort and return 0. If it was
477 * successfully detached, return 1. Assumes the caller has a single ref on
480 int remove_mapping(struct address_space *mapping, struct page *page)
482 if (__remove_mapping(mapping, page)) {
484 * Unfreezing the refcount with 1 rather than 2 effectively
485 * drops the pagecache ref for us without requiring another
488 page_unfreeze_refs(page, 1);
495 * putback_lru_page - put previously isolated page onto appropriate LRU list
496 * @page: page to be put back to appropriate lru list
498 * Add previously isolated @page to appropriate LRU list.
499 * Page may still be unevictable for other reasons.
501 * lru_lock must not be held, interrupts must be enabled.
503 void putback_lru_page(struct page *page)
506 int active = !!TestClearPageActive(page);
507 int was_unevictable = PageUnevictable(page);
509 VM_BUG_ON(PageLRU(page));
512 ClearPageUnevictable(page);
514 if (page_evictable(page, NULL)) {
516 * For evictable pages, we can use the cache.
517 * In event of a race, worst case is we end up with an
518 * unevictable page on [in]active list.
519 * We know how to handle that.
521 lru = active + page_lru_base_type(page);
522 lru_cache_add_lru(page, lru);
525 * Put unevictable pages directly on zone's unevictable
528 lru = LRU_UNEVICTABLE;
529 add_page_to_unevictable_list(page);
531 * When racing with an mlock clearing (page is
532 * unlocked), make sure that if the other thread does
533 * not observe our setting of PG_lru and fails
534 * isolation, we see PG_mlocked cleared below and move
535 * the page back to the evictable list.
537 * The other side is TestClearPageMlocked().
543 * page's status can change while we move it among lru. If an evictable
544 * page is on unevictable list, it never be freed. To avoid that,
545 * check after we added it to the list, again.
547 if (lru == LRU_UNEVICTABLE && page_evictable(page, NULL)) {
548 if (!isolate_lru_page(page)) {
552 /* This means someone else dropped this page from LRU
553 * So, it will be freed or putback to LRU again. There is
554 * nothing to do here.
558 if (was_unevictable && lru != LRU_UNEVICTABLE)
559 count_vm_event(UNEVICTABLE_PGRESCUED);
560 else if (!was_unevictable && lru == LRU_UNEVICTABLE)
561 count_vm_event(UNEVICTABLE_PGCULLED);
563 put_page(page); /* drop ref from isolate */
566 enum page_references {
568 PAGEREF_RECLAIM_CLEAN,
573 static enum page_references page_check_references(struct page *page,
574 struct scan_control *sc)
576 int referenced_ptes, referenced_page;
577 unsigned long vm_flags;
579 referenced_ptes = page_referenced(page, 1, sc->mem_cgroup, &vm_flags);
580 referenced_page = TestClearPageReferenced(page);
582 /* Lumpy reclaim - ignore references */
583 if (sc->lumpy_reclaim_mode)
584 return PAGEREF_RECLAIM;
587 * Mlock lost the isolation race with us. Let try_to_unmap()
588 * move the page to the unevictable list.
590 if (vm_flags & VM_LOCKED)
591 return PAGEREF_RECLAIM;
593 if (referenced_ptes) {
595 return PAGEREF_ACTIVATE;
597 * All mapped pages start out with page table
598 * references from the instantiating fault, so we need
599 * to look twice if a mapped file page is used more
602 * Mark it and spare it for another trip around the
603 * inactive list. Another page table reference will
604 * lead to its activation.
606 * Note: the mark is set for activated pages as well
607 * so that recently deactivated but used pages are
610 SetPageReferenced(page);
613 return PAGEREF_ACTIVATE;
618 /* Reclaim if clean, defer dirty pages to writeback */
620 return PAGEREF_RECLAIM_CLEAN;
622 return PAGEREF_RECLAIM;
626 * shrink_page_list() returns the number of reclaimed pages
628 static unsigned long shrink_page_list(struct list_head *page_list,
629 struct scan_control *sc,
630 enum pageout_io sync_writeback)
632 LIST_HEAD(ret_pages);
633 struct pagevec freed_pvec;
635 unsigned long nr_reclaimed = 0;
639 pagevec_init(&freed_pvec, 1);
640 while (!list_empty(page_list)) {
641 enum page_references references;
642 struct address_space *mapping;
648 page = lru_to_page(page_list);
649 list_del(&page->lru);
651 if (!trylock_page(page))
654 VM_BUG_ON(PageActive(page));
658 if (unlikely(!page_evictable(page, NULL)))
661 if (!sc->may_unmap && page_mapped(page))
664 /* Double the slab pressure for mapped and swapcache pages */
665 if (page_mapped(page) || PageSwapCache(page))
668 may_enter_fs = (sc->gfp_mask & __GFP_FS) ||
669 (PageSwapCache(page) && (sc->gfp_mask & __GFP_IO));
671 if (PageWriteback(page)) {
673 * Synchronous reclaim is performed in two passes,
674 * first an asynchronous pass over the list to
675 * start parallel writeback, and a second synchronous
676 * pass to wait for the IO to complete. Wait here
677 * for any page for which writeback has already
680 if (sync_writeback == PAGEOUT_IO_SYNC && may_enter_fs)
681 wait_on_page_writeback(page);
686 references = page_check_references(page, sc);
687 switch (references) {
688 case PAGEREF_ACTIVATE:
689 goto activate_locked;
692 case PAGEREF_RECLAIM:
693 case PAGEREF_RECLAIM_CLEAN:
694 ; /* try to reclaim the page below */
698 * Anonymous process memory has backing store?
699 * Try to allocate it some swap space here.
701 if (PageAnon(page) && !PageSwapCache(page)) {
702 if (!(sc->gfp_mask & __GFP_IO))
704 if (!add_to_swap(page))
705 goto activate_locked;
709 mapping = page_mapping(page);
712 * The page is mapped into the page tables of one or more
713 * processes. Try to unmap it here.
715 if (page_mapped(page) && mapping) {
716 switch (try_to_unmap(page, TTU_UNMAP)) {
718 goto activate_locked;
724 ; /* try to free the page below */
728 if (PageDirty(page)) {
729 if (references == PAGEREF_RECLAIM_CLEAN)
733 if (!sc->may_writepage)
736 /* Page is dirty, try to write it out here */
737 switch (pageout(page, mapping, sync_writeback)) {
741 goto activate_locked;
743 if (PageWriteback(page) || PageDirty(page))
746 * A synchronous write - probably a ramdisk. Go
747 * ahead and try to reclaim the page.
749 if (!trylock_page(page))
751 if (PageDirty(page) || PageWriteback(page))
753 mapping = page_mapping(page);
755 ; /* try to free the page below */
760 * If the page has buffers, try to free the buffer mappings
761 * associated with this page. If we succeed we try to free
764 * We do this even if the page is PageDirty().
765 * try_to_release_page() does not perform I/O, but it is
766 * possible for a page to have PageDirty set, but it is actually
767 * clean (all its buffers are clean). This happens if the
768 * buffers were written out directly, with submit_bh(). ext3
769 * will do this, as well as the blockdev mapping.
770 * try_to_release_page() will discover that cleanness and will
771 * drop the buffers and mark the page clean - it can be freed.
773 * Rarely, pages can have buffers and no ->mapping. These are
774 * the pages which were not successfully invalidated in
775 * truncate_complete_page(). We try to drop those buffers here
776 * and if that worked, and the page is no longer mapped into
777 * process address space (page_count == 1) it can be freed.
778 * Otherwise, leave the page on the LRU so it is swappable.
780 if (page_has_private(page)) {
781 if (!try_to_release_page(page, sc->gfp_mask))
782 goto activate_locked;
783 if (!mapping && page_count(page) == 1) {
785 if (put_page_testzero(page))
789 * rare race with speculative reference.
790 * the speculative reference will free
791 * this page shortly, so we may
792 * increment nr_reclaimed here (and
793 * leave it off the LRU).
801 if (!mapping || !__remove_mapping(mapping, page))
805 * At this point, we have no other references and there is
806 * no way to pick any more up (removed from LRU, removed
807 * from pagecache). Can use non-atomic bitops now (and
808 * we obviously don't have to worry about waking up a process
809 * waiting on the page lock, because there are no references.
811 __clear_page_locked(page);
814 if (!pagevec_add(&freed_pvec, page)) {
815 __pagevec_free(&freed_pvec);
816 pagevec_reinit(&freed_pvec);
821 if (PageSwapCache(page))
822 try_to_free_swap(page);
824 putback_lru_page(page);
828 /* Not a candidate for swapping, so reclaim swap space. */
829 if (PageSwapCache(page) && vm_swap_full())
830 try_to_free_swap(page);
831 VM_BUG_ON(PageActive(page));
837 list_add(&page->lru, &ret_pages);
838 VM_BUG_ON(PageLRU(page) || PageUnevictable(page));
840 list_splice(&ret_pages, page_list);
841 if (pagevec_count(&freed_pvec))
842 __pagevec_free(&freed_pvec);
843 count_vm_events(PGACTIVATE, pgactivate);
848 * Attempt to remove the specified page from its LRU. Only take this page
849 * if it is of the appropriate PageActive status. Pages which are being
850 * freed elsewhere are also ignored.
852 * page: page to consider
853 * mode: one of the LRU isolation modes defined above
855 * returns 0 on success, -ve errno on failure.
857 int __isolate_lru_page(struct page *page, int mode, int file)
861 /* Only take pages on the LRU. */
866 * When checking the active state, we need to be sure we are
867 * dealing with comparible boolean values. Take the logical not
870 if (mode != ISOLATE_BOTH && (!PageActive(page) != !mode))
873 if (mode != ISOLATE_BOTH && page_is_file_cache(page) != file)
877 * When this function is being called for lumpy reclaim, we
878 * initially look into all LRU pages, active, inactive and
879 * unevictable; only give shrink_page_list evictable pages.
881 if (PageUnevictable(page))
886 if (likely(get_page_unless_zero(page))) {
888 * Be careful not to clear PageLRU until after we're
889 * sure the page is not being freed elsewhere -- the
890 * page release code relies on it.
900 * zone->lru_lock is heavily contended. Some of the functions that
901 * shrink the lists perform better by taking out a batch of pages
902 * and working on them outside the LRU lock.
904 * For pagecache intensive workloads, this function is the hottest
905 * spot in the kernel (apart from copy_*_user functions).
907 * Appropriate locks must be held before calling this function.
909 * @nr_to_scan: The number of pages to look through on the list.
910 * @src: The LRU list to pull pages off.
911 * @dst: The temp list to put pages on to.
912 * @scanned: The number of pages that were scanned.
913 * @order: The caller's attempted allocation order
914 * @mode: One of the LRU isolation modes
915 * @file: True [1] if isolating file [!anon] pages
917 * returns how many pages were moved onto *@dst.
919 static unsigned long isolate_lru_pages(unsigned long nr_to_scan,
920 struct list_head *src, struct list_head *dst,
921 unsigned long *scanned, int order, int mode, int file)
923 unsigned long nr_taken = 0;
924 unsigned long nr_lumpy_taken = 0;
925 unsigned long nr_lumpy_dirty = 0;
926 unsigned long nr_lumpy_failed = 0;
929 for (scan = 0; scan < nr_to_scan && !list_empty(src); scan++) {
932 unsigned long end_pfn;
933 unsigned long page_pfn;
936 page = lru_to_page(src);
937 prefetchw_prev_lru_page(page, src, flags);
939 VM_BUG_ON(!PageLRU(page));
941 switch (__isolate_lru_page(page, mode, file)) {
943 list_move(&page->lru, dst);
944 mem_cgroup_del_lru(page);
949 /* else it is being freed elsewhere */
950 list_move(&page->lru, src);
951 mem_cgroup_rotate_lru_list(page, page_lru(page));
962 * Attempt to take all pages in the order aligned region
963 * surrounding the tag page. Only take those pages of
964 * the same active state as that tag page. We may safely
965 * round the target page pfn down to the requested order
966 * as the mem_map is guarenteed valid out to MAX_ORDER,
967 * where that page is in a different zone we will detect
968 * it from its zone id and abort this block scan.
970 zone_id = page_zone_id(page);
971 page_pfn = page_to_pfn(page);
972 pfn = page_pfn & ~((1 << order) - 1);
973 end_pfn = pfn + (1 << order);
974 for (; pfn < end_pfn; pfn++) {
975 struct page *cursor_page;
977 /* The target page is in the block, ignore it. */
978 if (unlikely(pfn == page_pfn))
981 /* Avoid holes within the zone. */
982 if (unlikely(!pfn_valid_within(pfn)))
985 cursor_page = pfn_to_page(pfn);
987 /* Check that we have not crossed a zone boundary. */
988 if (unlikely(page_zone_id(cursor_page) != zone_id))
992 * If we don't have enough swap space, reclaiming of
993 * anon page which don't already have a swap slot is
996 if (nr_swap_pages <= 0 && PageAnon(cursor_page) &&
997 !PageSwapCache(cursor_page))
1000 if (__isolate_lru_page(cursor_page, mode, file) == 0) {
1001 list_move(&cursor_page->lru, dst);
1002 mem_cgroup_del_lru(cursor_page);
1005 if (PageDirty(cursor_page))
1009 if (mode == ISOLATE_BOTH &&
1010 page_count(cursor_page))
1018 trace_mm_vmscan_lru_isolate(order,
1021 nr_lumpy_taken, nr_lumpy_dirty, nr_lumpy_failed,
1026 static unsigned long isolate_pages_global(unsigned long nr,
1027 struct list_head *dst,
1028 unsigned long *scanned, int order,
1029 int mode, struct zone *z,
1030 int active, int file)
1037 return isolate_lru_pages(nr, &z->lru[lru].list, dst, scanned, order,
1042 * clear_active_flags() is a helper for shrink_active_list(), clearing
1043 * any active bits from the pages in the list.
1045 static unsigned long clear_active_flags(struct list_head *page_list,
1046 unsigned int *count)
1052 list_for_each_entry(page, page_list, lru) {
1053 lru = page_lru_base_type(page);
1054 if (PageActive(page)) {
1056 ClearPageActive(page);
1066 * isolate_lru_page - tries to isolate a page from its LRU list
1067 * @page: page to isolate from its LRU list
1069 * Isolates a @page from an LRU list, clears PageLRU and adjusts the
1070 * vmstat statistic corresponding to whatever LRU list the page was on.
1072 * Returns 0 if the page was removed from an LRU list.
1073 * Returns -EBUSY if the page was not on an LRU list.
1075 * The returned page will have PageLRU() cleared. If it was found on
1076 * the active list, it will have PageActive set. If it was found on
1077 * the unevictable list, it will have the PageUnevictable bit set. That flag
1078 * may need to be cleared by the caller before letting the page go.
1080 * The vmstat statistic corresponding to the list on which the page was
1081 * found will be decremented.
1084 * (1) Must be called with an elevated refcount on the page. This is a
1085 * fundamentnal difference from isolate_lru_pages (which is called
1086 * without a stable reference).
1087 * (2) the lru_lock must not be held.
1088 * (3) interrupts must be enabled.
1090 int isolate_lru_page(struct page *page)
1094 if (PageLRU(page)) {
1095 struct zone *zone = page_zone(page);
1097 spin_lock_irq(&zone->lru_lock);
1098 if (PageLRU(page) && get_page_unless_zero(page)) {
1099 int lru = page_lru(page);
1103 del_page_from_lru_list(zone, page, lru);
1105 spin_unlock_irq(&zone->lru_lock);
1111 * Are there way too many processes in the direct reclaim path already?
1113 static int too_many_isolated(struct zone *zone, int file,
1114 struct scan_control *sc)
1116 unsigned long inactive, isolated;
1118 if (current_is_kswapd())
1121 if (!scanning_global_lru(sc))
1125 inactive = zone_page_state(zone, NR_INACTIVE_FILE);
1126 isolated = zone_page_state(zone, NR_ISOLATED_FILE);
1128 inactive = zone_page_state(zone, NR_INACTIVE_ANON);
1129 isolated = zone_page_state(zone, NR_ISOLATED_ANON);
1132 return isolated > inactive;
1136 * shrink_inactive_list() is a helper for shrink_zone(). It returns the number
1137 * of reclaimed pages
1139 static unsigned long shrink_inactive_list(unsigned long max_scan,
1140 struct zone *zone, struct scan_control *sc,
1141 int priority, int file)
1143 LIST_HEAD(page_list);
1144 struct pagevec pvec;
1145 unsigned long nr_scanned = 0;
1146 unsigned long nr_reclaimed = 0;
1147 struct zone_reclaim_stat *reclaim_stat = get_reclaim_stat(zone, sc);
1149 while (unlikely(too_many_isolated(zone, file, sc))) {
1150 congestion_wait(BLK_RW_ASYNC, HZ/10);
1152 /* We are about to die and free our memory. Return now. */
1153 if (fatal_signal_pending(current))
1154 return SWAP_CLUSTER_MAX;
1158 pagevec_init(&pvec, 1);
1161 spin_lock_irq(&zone->lru_lock);
1164 unsigned long nr_taken;
1165 unsigned long nr_scan;
1166 unsigned long nr_freed;
1167 unsigned long nr_active;
1168 unsigned int count[NR_LRU_LISTS] = { 0, };
1169 int mode = sc->lumpy_reclaim_mode ? ISOLATE_BOTH : ISOLATE_INACTIVE;
1170 unsigned long nr_anon;
1171 unsigned long nr_file;
1173 if (scanning_global_lru(sc)) {
1174 nr_taken = isolate_pages_global(SWAP_CLUSTER_MAX,
1175 &page_list, &nr_scan,
1178 zone->pages_scanned += nr_scan;
1179 if (current_is_kswapd())
1180 __count_zone_vm_events(PGSCAN_KSWAPD, zone,
1183 __count_zone_vm_events(PGSCAN_DIRECT, zone,
1186 nr_taken = mem_cgroup_isolate_pages(SWAP_CLUSTER_MAX,
1187 &page_list, &nr_scan,
1189 zone, sc->mem_cgroup,
1192 * mem_cgroup_isolate_pages() keeps track of
1193 * scanned pages on its own.
1200 nr_active = clear_active_flags(&page_list, count);
1201 __count_vm_events(PGDEACTIVATE, nr_active);
1203 __mod_zone_page_state(zone, NR_ACTIVE_FILE,
1204 -count[LRU_ACTIVE_FILE]);
1205 __mod_zone_page_state(zone, NR_INACTIVE_FILE,
1206 -count[LRU_INACTIVE_FILE]);
1207 __mod_zone_page_state(zone, NR_ACTIVE_ANON,
1208 -count[LRU_ACTIVE_ANON]);
1209 __mod_zone_page_state(zone, NR_INACTIVE_ANON,
1210 -count[LRU_INACTIVE_ANON]);
1212 nr_anon = count[LRU_ACTIVE_ANON] + count[LRU_INACTIVE_ANON];
1213 nr_file = count[LRU_ACTIVE_FILE] + count[LRU_INACTIVE_FILE];
1214 __mod_zone_page_state(zone, NR_ISOLATED_ANON, nr_anon);
1215 __mod_zone_page_state(zone, NR_ISOLATED_FILE, nr_file);
1217 reclaim_stat->recent_scanned[0] += nr_anon;
1218 reclaim_stat->recent_scanned[1] += nr_file;
1220 spin_unlock_irq(&zone->lru_lock);
1222 nr_scanned += nr_scan;
1223 nr_freed = shrink_page_list(&page_list, sc, PAGEOUT_IO_ASYNC);
1226 * If we are direct reclaiming for contiguous pages and we do
1227 * not reclaim everything in the list, try again and wait
1228 * for IO to complete. This will stall high-order allocations
1229 * but that should be acceptable to the caller
1231 if (nr_freed < nr_taken && !current_is_kswapd() &&
1232 sc->lumpy_reclaim_mode) {
1233 congestion_wait(BLK_RW_ASYNC, HZ/10);
1236 * The attempt at page out may have made some
1237 * of the pages active, mark them inactive again.
1239 nr_active = clear_active_flags(&page_list, count);
1240 count_vm_events(PGDEACTIVATE, nr_active);
1242 nr_freed += shrink_page_list(&page_list, sc,
1246 nr_reclaimed += nr_freed;
1248 local_irq_disable();
1249 if (current_is_kswapd())
1250 __count_vm_events(KSWAPD_STEAL, nr_freed);
1251 __count_zone_vm_events(PGSTEAL, zone, nr_freed);
1253 spin_lock(&zone->lru_lock);
1255 * Put back any unfreeable pages.
1257 while (!list_empty(&page_list)) {
1259 page = lru_to_page(&page_list);
1260 VM_BUG_ON(PageLRU(page));
1261 list_del(&page->lru);
1262 if (unlikely(!page_evictable(page, NULL))) {
1263 spin_unlock_irq(&zone->lru_lock);
1264 putback_lru_page(page);
1265 spin_lock_irq(&zone->lru_lock);
1269 lru = page_lru(page);
1270 add_page_to_lru_list(zone, page, lru);
1271 if (is_active_lru(lru)) {
1272 int file = is_file_lru(lru);
1273 reclaim_stat->recent_rotated[file]++;
1275 if (!pagevec_add(&pvec, page)) {
1276 spin_unlock_irq(&zone->lru_lock);
1277 __pagevec_release(&pvec);
1278 spin_lock_irq(&zone->lru_lock);
1281 __mod_zone_page_state(zone, NR_ISOLATED_ANON, -nr_anon);
1282 __mod_zone_page_state(zone, NR_ISOLATED_FILE, -nr_file);
1284 } while (nr_scanned < max_scan);
1287 spin_unlock_irq(&zone->lru_lock);
1288 pagevec_release(&pvec);
1289 return nr_reclaimed;
1293 * This moves pages from the active list to the inactive list.
1295 * We move them the other way if the page is referenced by one or more
1296 * processes, from rmap.
1298 * If the pages are mostly unmapped, the processing is fast and it is
1299 * appropriate to hold zone->lru_lock across the whole operation. But if
1300 * the pages are mapped, the processing is slow (page_referenced()) so we
1301 * should drop zone->lru_lock around each page. It's impossible to balance
1302 * this, so instead we remove the pages from the LRU while processing them.
1303 * It is safe to rely on PG_active against the non-LRU pages in here because
1304 * nobody will play with that bit on a non-LRU page.
1306 * The downside is that we have to touch page->_count against each page.
1307 * But we had to alter page->flags anyway.
1310 static void move_active_pages_to_lru(struct zone *zone,
1311 struct list_head *list,
1314 unsigned long pgmoved = 0;
1315 struct pagevec pvec;
1318 pagevec_init(&pvec, 1);
1320 while (!list_empty(list)) {
1321 page = lru_to_page(list);
1323 VM_BUG_ON(PageLRU(page));
1326 list_move(&page->lru, &zone->lru[lru].list);
1327 mem_cgroup_add_lru_list(page, lru);
1330 if (!pagevec_add(&pvec, page) || list_empty(list)) {
1331 spin_unlock_irq(&zone->lru_lock);
1332 if (buffer_heads_over_limit)
1333 pagevec_strip(&pvec);
1334 __pagevec_release(&pvec);
1335 spin_lock_irq(&zone->lru_lock);
1338 __mod_zone_page_state(zone, NR_LRU_BASE + lru, pgmoved);
1339 if (!is_active_lru(lru))
1340 __count_vm_events(PGDEACTIVATE, pgmoved);
1343 static void shrink_active_list(unsigned long nr_pages, struct zone *zone,
1344 struct scan_control *sc, int priority, int file)
1346 unsigned long nr_taken;
1347 unsigned long pgscanned;
1348 unsigned long vm_flags;
1349 LIST_HEAD(l_hold); /* The pages which were snipped off */
1350 LIST_HEAD(l_active);
1351 LIST_HEAD(l_inactive);
1353 struct zone_reclaim_stat *reclaim_stat = get_reclaim_stat(zone, sc);
1354 unsigned long nr_rotated = 0;
1357 spin_lock_irq(&zone->lru_lock);
1358 if (scanning_global_lru(sc)) {
1359 nr_taken = isolate_pages_global(nr_pages, &l_hold,
1360 &pgscanned, sc->order,
1361 ISOLATE_ACTIVE, zone,
1363 zone->pages_scanned += pgscanned;
1365 nr_taken = mem_cgroup_isolate_pages(nr_pages, &l_hold,
1366 &pgscanned, sc->order,
1367 ISOLATE_ACTIVE, zone,
1368 sc->mem_cgroup, 1, file);
1370 * mem_cgroup_isolate_pages() keeps track of
1371 * scanned pages on its own.
1375 reclaim_stat->recent_scanned[file] += nr_taken;
1377 __count_zone_vm_events(PGREFILL, zone, pgscanned);
1379 __mod_zone_page_state(zone, NR_ACTIVE_FILE, -nr_taken);
1381 __mod_zone_page_state(zone, NR_ACTIVE_ANON, -nr_taken);
1382 __mod_zone_page_state(zone, NR_ISOLATED_ANON + file, nr_taken);
1383 spin_unlock_irq(&zone->lru_lock);
1385 while (!list_empty(&l_hold)) {
1387 page = lru_to_page(&l_hold);
1388 list_del(&page->lru);
1390 if (unlikely(!page_evictable(page, NULL))) {
1391 putback_lru_page(page);
1395 if (page_referenced(page, 0, sc->mem_cgroup, &vm_flags)) {
1398 * Identify referenced, file-backed active pages and
1399 * give them one more trip around the active list. So
1400 * that executable code get better chances to stay in
1401 * memory under moderate memory pressure. Anon pages
1402 * are not likely to be evicted by use-once streaming
1403 * IO, plus JVM can create lots of anon VM_EXEC pages,
1404 * so we ignore them here.
1406 if ((vm_flags & VM_EXEC) && page_is_file_cache(page)) {
1407 list_add(&page->lru, &l_active);
1412 ClearPageActive(page); /* we are de-activating */
1413 list_add(&page->lru, &l_inactive);
1417 * Move pages back to the lru list.
1419 spin_lock_irq(&zone->lru_lock);
1421 * Count referenced pages from currently used mappings as rotated,
1422 * even though only some of them are actually re-activated. This
1423 * helps balance scan pressure between file and anonymous pages in
1426 reclaim_stat->recent_rotated[file] += nr_rotated;
1428 move_active_pages_to_lru(zone, &l_active,
1429 LRU_ACTIVE + file * LRU_FILE);
1430 move_active_pages_to_lru(zone, &l_inactive,
1431 LRU_BASE + file * LRU_FILE);
1432 __mod_zone_page_state(zone, NR_ISOLATED_ANON + file, -nr_taken);
1433 spin_unlock_irq(&zone->lru_lock);
1436 static int inactive_anon_is_low_global(struct zone *zone)
1438 unsigned long active, inactive;
1440 active = zone_page_state(zone, NR_ACTIVE_ANON);
1441 inactive = zone_page_state(zone, NR_INACTIVE_ANON);
1443 if (inactive * zone->inactive_ratio < active)
1450 * inactive_anon_is_low - check if anonymous pages need to be deactivated
1451 * @zone: zone to check
1452 * @sc: scan control of this context
1454 * Returns true if the zone does not have enough inactive anon pages,
1455 * meaning some active anon pages need to be deactivated.
1457 static int inactive_anon_is_low(struct zone *zone, struct scan_control *sc)
1461 if (scanning_global_lru(sc))
1462 low = inactive_anon_is_low_global(zone);
1464 low = mem_cgroup_inactive_anon_is_low(sc->mem_cgroup);
1468 static int inactive_file_is_low_global(struct zone *zone)
1470 unsigned long active, inactive;
1472 active = zone_page_state(zone, NR_ACTIVE_FILE);
1473 inactive = zone_page_state(zone, NR_INACTIVE_FILE);
1475 return (active > inactive);
1479 * inactive_file_is_low - check if file pages need to be deactivated
1480 * @zone: zone to check
1481 * @sc: scan control of this context
1483 * When the system is doing streaming IO, memory pressure here
1484 * ensures that active file pages get deactivated, until more
1485 * than half of the file pages are on the inactive list.
1487 * Once we get to that situation, protect the system's working
1488 * set from being evicted by disabling active file page aging.
1490 * This uses a different ratio than the anonymous pages, because
1491 * the page cache uses a use-once replacement algorithm.
1493 static int inactive_file_is_low(struct zone *zone, struct scan_control *sc)
1497 if (scanning_global_lru(sc))
1498 low = inactive_file_is_low_global(zone);
1500 low = mem_cgroup_inactive_file_is_low(sc->mem_cgroup);
1504 static int inactive_list_is_low(struct zone *zone, struct scan_control *sc,
1508 return inactive_file_is_low(zone, sc);
1510 return inactive_anon_is_low(zone, sc);
1513 static unsigned long shrink_list(enum lru_list lru, unsigned long nr_to_scan,
1514 struct zone *zone, struct scan_control *sc, int priority)
1516 int file = is_file_lru(lru);
1518 if (is_active_lru(lru)) {
1519 if (inactive_list_is_low(zone, sc, file))
1520 shrink_active_list(nr_to_scan, zone, sc, priority, file);
1524 return shrink_inactive_list(nr_to_scan, zone, sc, priority, file);
1528 * Smallish @nr_to_scan's are deposited in @nr_saved_scan,
1529 * until we collected @swap_cluster_max pages to scan.
1531 static unsigned long nr_scan_try_batch(unsigned long nr_to_scan,
1532 unsigned long *nr_saved_scan)
1536 *nr_saved_scan += nr_to_scan;
1537 nr = *nr_saved_scan;
1539 if (nr >= SWAP_CLUSTER_MAX)
1548 * Determine how aggressively the anon and file LRU lists should be
1549 * scanned. The relative value of each set of LRU lists is determined
1550 * by looking at the fraction of the pages scanned we did rotate back
1551 * onto the active list instead of evict.
1553 * nr[0] = anon pages to scan; nr[1] = file pages to scan
1555 static void get_scan_count(struct zone *zone, struct scan_control *sc,
1556 unsigned long *nr, int priority)
1558 unsigned long anon, file, free;
1559 unsigned long anon_prio, file_prio;
1560 unsigned long ap, fp;
1561 struct zone_reclaim_stat *reclaim_stat = get_reclaim_stat(zone, sc);
1562 u64 fraction[2], denominator;
1566 /* If we have no swap space, do not bother scanning anon pages. */
1567 if (!sc->may_swap || (nr_swap_pages <= 0)) {
1575 anon = zone_nr_lru_pages(zone, sc, LRU_ACTIVE_ANON) +
1576 zone_nr_lru_pages(zone, sc, LRU_INACTIVE_ANON);
1577 file = zone_nr_lru_pages(zone, sc, LRU_ACTIVE_FILE) +
1578 zone_nr_lru_pages(zone, sc, LRU_INACTIVE_FILE);
1580 if (scanning_global_lru(sc)) {
1581 free = zone_page_state(zone, NR_FREE_PAGES);
1582 /* If we have very few page cache pages,
1583 force-scan anon pages. */
1584 if (unlikely(file + free <= high_wmark_pages(zone))) {
1593 * OK, so we have swap space and a fair amount of page cache
1594 * pages. We use the recently rotated / recently scanned
1595 * ratios to determine how valuable each cache is.
1597 * Because workloads change over time (and to avoid overflow)
1598 * we keep these statistics as a floating average, which ends
1599 * up weighing recent references more than old ones.
1601 * anon in [0], file in [1]
1603 if (unlikely(reclaim_stat->recent_scanned[0] > anon / 4)) {
1604 spin_lock_irq(&zone->lru_lock);
1605 reclaim_stat->recent_scanned[0] /= 2;
1606 reclaim_stat->recent_rotated[0] /= 2;
1607 spin_unlock_irq(&zone->lru_lock);
1610 if (unlikely(reclaim_stat->recent_scanned[1] > file / 4)) {
1611 spin_lock_irq(&zone->lru_lock);
1612 reclaim_stat->recent_scanned[1] /= 2;
1613 reclaim_stat->recent_rotated[1] /= 2;
1614 spin_unlock_irq(&zone->lru_lock);
1618 * With swappiness at 100, anonymous and file have the same priority.
1619 * This scanning priority is essentially the inverse of IO cost.
1621 anon_prio = sc->swappiness;
1622 file_prio = 200 - sc->swappiness;
1625 * The amount of pressure on anon vs file pages is inversely
1626 * proportional to the fraction of recently scanned pages on
1627 * each list that were recently referenced and in active use.
1629 ap = (anon_prio + 1) * (reclaim_stat->recent_scanned[0] + 1);
1630 ap /= reclaim_stat->recent_rotated[0] + 1;
1632 fp = (file_prio + 1) * (reclaim_stat->recent_scanned[1] + 1);
1633 fp /= reclaim_stat->recent_rotated[1] + 1;
1637 denominator = ap + fp + 1;
1639 for_each_evictable_lru(l) {
1640 int file = is_file_lru(l);
1643 scan = zone_nr_lru_pages(zone, sc, l);
1644 if (priority || noswap) {
1646 scan = div64_u64(scan * fraction[file], denominator);
1648 nr[l] = nr_scan_try_batch(scan,
1649 &reclaim_stat->nr_saved_scan[l]);
1653 static void set_lumpy_reclaim_mode(int priority, struct scan_control *sc)
1656 * If we need a large contiguous chunk of memory, or have
1657 * trouble getting a small set of contiguous pages, we
1658 * will reclaim both active and inactive pages.
1660 if (sc->order > PAGE_ALLOC_COSTLY_ORDER)
1661 sc->lumpy_reclaim_mode = 1;
1662 else if (sc->order && priority < DEF_PRIORITY - 2)
1663 sc->lumpy_reclaim_mode = 1;
1665 sc->lumpy_reclaim_mode = 0;
1669 * This is a basic per-zone page freer. Used by both kswapd and direct reclaim.
1671 static void shrink_zone(int priority, struct zone *zone,
1672 struct scan_control *sc)
1674 unsigned long nr[NR_LRU_LISTS];
1675 unsigned long nr_to_scan;
1677 unsigned long nr_reclaimed = sc->nr_reclaimed;
1678 unsigned long nr_to_reclaim = sc->nr_to_reclaim;
1680 get_scan_count(zone, sc, nr, priority);
1682 set_lumpy_reclaim_mode(priority, sc);
1684 while (nr[LRU_INACTIVE_ANON] || nr[LRU_ACTIVE_FILE] ||
1685 nr[LRU_INACTIVE_FILE]) {
1686 for_each_evictable_lru(l) {
1688 nr_to_scan = min_t(unsigned long,
1689 nr[l], SWAP_CLUSTER_MAX);
1690 nr[l] -= nr_to_scan;
1692 nr_reclaimed += shrink_list(l, nr_to_scan,
1693 zone, sc, priority);
1697 * On large memory systems, scan >> priority can become
1698 * really large. This is fine for the starting priority;
1699 * we want to put equal scanning pressure on each zone.
1700 * However, if the VM has a harder time of freeing pages,
1701 * with multiple processes reclaiming pages, the total
1702 * freeing target can get unreasonably large.
1704 if (nr_reclaimed >= nr_to_reclaim && priority < DEF_PRIORITY)
1708 sc->nr_reclaimed = nr_reclaimed;
1711 * Even if we did not try to evict anon pages at all, we want to
1712 * rebalance the anon lru active/inactive ratio.
1714 if (inactive_anon_is_low(zone, sc) && nr_swap_pages > 0)
1715 shrink_active_list(SWAP_CLUSTER_MAX, zone, sc, priority, 0);
1717 throttle_vm_writeout(sc->gfp_mask);
1721 * This is the direct reclaim path, for page-allocating processes. We only
1722 * try to reclaim pages from zones which will satisfy the caller's allocation
1725 * We reclaim from a zone even if that zone is over high_wmark_pages(zone).
1727 * a) The caller may be trying to free *extra* pages to satisfy a higher-order
1729 * b) The target zone may be at high_wmark_pages(zone) but the lower zones
1730 * must go *over* high_wmark_pages(zone) to satisfy the `incremental min'
1731 * zone defense algorithm.
1733 * If a zone is deemed to be full of pinned pages then just give it a light
1734 * scan then give up on it.
1736 static bool shrink_zones(int priority, struct zonelist *zonelist,
1737 struct scan_control *sc)
1739 enum zone_type high_zoneidx = gfp_zone(sc->gfp_mask);
1742 bool all_unreclaimable = true;
1744 for_each_zone_zonelist_nodemask(zone, z, zonelist, high_zoneidx,
1746 if (!populated_zone(zone))
1749 * Take care memory controller reclaiming has small influence
1752 if (scanning_global_lru(sc)) {
1753 if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL))
1755 if (zone->all_unreclaimable && priority != DEF_PRIORITY)
1756 continue; /* Let kswapd poll it */
1759 shrink_zone(priority, zone, sc);
1760 all_unreclaimable = false;
1762 return all_unreclaimable;
1766 * This is the main entry point to direct page reclaim.
1768 * If a full scan of the inactive list fails to free enough memory then we
1769 * are "out of memory" and something needs to be killed.
1771 * If the caller is !__GFP_FS then the probability of a failure is reasonably
1772 * high - the zone may be full of dirty or under-writeback pages, which this
1773 * caller can't do much about. We kick the writeback threads and take explicit
1774 * naps in the hope that some of these pages can be written. But if the
1775 * allocating task holds filesystem locks which prevent writeout this might not
1776 * work, and the allocation attempt will fail.
1778 * returns: 0, if no pages reclaimed
1779 * else, the number of pages reclaimed
1781 static unsigned long do_try_to_free_pages(struct zonelist *zonelist,
1782 struct scan_control *sc)
1785 bool all_unreclaimable;
1786 unsigned long total_scanned = 0;
1787 struct reclaim_state *reclaim_state = current->reclaim_state;
1790 enum zone_type high_zoneidx = gfp_zone(sc->gfp_mask);
1791 unsigned long writeback_threshold;
1794 delayacct_freepages_start();
1796 if (scanning_global_lru(sc))
1797 count_vm_event(ALLOCSTALL);
1799 for (priority = DEF_PRIORITY; priority >= 0; priority--) {
1802 disable_swap_token();
1803 all_unreclaimable = shrink_zones(priority, zonelist, sc);
1805 * Don't shrink slabs when reclaiming memory from
1806 * over limit cgroups
1808 if (scanning_global_lru(sc)) {
1809 unsigned long lru_pages = 0;
1810 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) {
1811 if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL))
1814 lru_pages += zone_reclaimable_pages(zone);
1817 shrink_slab(sc->nr_scanned, sc->gfp_mask, lru_pages);
1818 if (reclaim_state) {
1819 sc->nr_reclaimed += reclaim_state->reclaimed_slab;
1820 reclaim_state->reclaimed_slab = 0;
1823 total_scanned += sc->nr_scanned;
1824 if (sc->nr_reclaimed >= sc->nr_to_reclaim)
1828 * Try to write back as many pages as we just scanned. This
1829 * tends to cause slow streaming writers to write data to the
1830 * disk smoothly, at the dirtying rate, which is nice. But
1831 * that's undesirable in laptop mode, where we *want* lumpy
1832 * writeout. So in laptop mode, write out the whole world.
1834 writeback_threshold = sc->nr_to_reclaim + sc->nr_to_reclaim / 2;
1835 if (total_scanned > writeback_threshold) {
1836 wakeup_flusher_threads(laptop_mode ? 0 : total_scanned);
1837 sc->may_writepage = 1;
1840 /* Take a nap, wait for some writeback to complete */
1841 if (!sc->hibernation_mode && sc->nr_scanned &&
1842 priority < DEF_PRIORITY - 2)
1843 congestion_wait(BLK_RW_ASYNC, HZ/10);
1848 * Now that we've scanned all the zones at this priority level, note
1849 * that level within the zone so that the next thread which performs
1850 * scanning of this zone will immediately start out at this priority
1851 * level. This affects only the decision whether or not to bring
1852 * mapped pages onto the inactive list.
1857 delayacct_freepages_end();
1860 if (sc->nr_reclaimed)
1861 return sc->nr_reclaimed;
1863 /* top priority shrink_zones still had more to do? don't OOM, then */
1864 if (scanning_global_lru(sc) && !all_unreclaimable)
1870 unsigned long try_to_free_pages(struct zonelist *zonelist, int order,
1871 gfp_t gfp_mask, nodemask_t *nodemask)
1873 unsigned long nr_reclaimed;
1874 struct scan_control sc = {
1875 .gfp_mask = gfp_mask,
1876 .may_writepage = !laptop_mode,
1877 .nr_to_reclaim = SWAP_CLUSTER_MAX,
1880 .swappiness = vm_swappiness,
1883 .nodemask = nodemask,
1886 trace_mm_vmscan_direct_reclaim_begin(order,
1890 nr_reclaimed = do_try_to_free_pages(zonelist, &sc);
1892 trace_mm_vmscan_direct_reclaim_end(nr_reclaimed);
1894 return nr_reclaimed;
1897 #ifdef CONFIG_CGROUP_MEM_RES_CTLR
1899 unsigned long mem_cgroup_shrink_node_zone(struct mem_cgroup *mem,
1900 gfp_t gfp_mask, bool noswap,
1901 unsigned int swappiness,
1902 struct zone *zone, int nid)
1904 struct scan_control sc = {
1905 .may_writepage = !laptop_mode,
1907 .may_swap = !noswap,
1908 .swappiness = swappiness,
1912 nodemask_t nm = nodemask_of_node(nid);
1914 sc.gfp_mask = (gfp_mask & GFP_RECLAIM_MASK) |
1915 (GFP_HIGHUSER_MOVABLE & ~GFP_RECLAIM_MASK);
1917 sc.nr_reclaimed = 0;
1920 * NOTE: Although we can get the priority field, using it
1921 * here is not a good idea, since it limits the pages we can scan.
1922 * if we don't reclaim here, the shrink_zone from balance_pgdat
1923 * will pick up pages from other mem cgroup's as well. We hack
1924 * the priority and make it zero.
1926 shrink_zone(0, zone, &sc);
1927 return sc.nr_reclaimed;
1930 unsigned long try_to_free_mem_cgroup_pages(struct mem_cgroup *mem_cont,
1933 unsigned int swappiness)
1935 struct zonelist *zonelist;
1936 struct scan_control sc = {
1937 .may_writepage = !laptop_mode,
1939 .may_swap = !noswap,
1940 .nr_to_reclaim = SWAP_CLUSTER_MAX,
1941 .swappiness = swappiness,
1943 .mem_cgroup = mem_cont,
1944 .nodemask = NULL, /* we don't care the placement */
1947 sc.gfp_mask = (gfp_mask & GFP_RECLAIM_MASK) |
1948 (GFP_HIGHUSER_MOVABLE & ~GFP_RECLAIM_MASK);
1949 zonelist = NODE_DATA(numa_node_id())->node_zonelists;
1950 return do_try_to_free_pages(zonelist, &sc);
1954 /* is kswapd sleeping prematurely? */
1955 static int sleeping_prematurely(pg_data_t *pgdat, int order, long remaining)
1959 /* If a direct reclaimer woke kswapd within HZ/10, it's premature */
1963 /* If after HZ/10, a zone is below the high mark, it's premature */
1964 for (i = 0; i < pgdat->nr_zones; i++) {
1965 struct zone *zone = pgdat->node_zones + i;
1967 if (!populated_zone(zone))
1970 if (zone->all_unreclaimable)
1973 if (!zone_watermark_ok(zone, order, high_wmark_pages(zone),
1982 * For kswapd, balance_pgdat() will work across all this node's zones until
1983 * they are all at high_wmark_pages(zone).
1985 * Returns the number of pages which were actually freed.
1987 * There is special handling here for zones which are full of pinned pages.
1988 * This can happen if the pages are all mlocked, or if they are all used by
1989 * device drivers (say, ZONE_DMA). Or if they are all in use by hugetlb.
1990 * What we do is to detect the case where all pages in the zone have been
1991 * scanned twice and there has been zero successful reclaim. Mark the zone as
1992 * dead and from now on, only perform a short scan. Basically we're polling
1993 * the zone for when the problem goes away.
1995 * kswapd scans the zones in the highmem->normal->dma direction. It skips
1996 * zones which have free_pages > high_wmark_pages(zone), but once a zone is
1997 * found to have free_pages <= high_wmark_pages(zone), we scan that zone and the
1998 * lower zones regardless of the number of free pages in the lower zones. This
1999 * interoperates with the page allocator fallback scheme to ensure that aging
2000 * of pages is balanced across the zones.
2002 static unsigned long balance_pgdat(pg_data_t *pgdat, int order)
2007 unsigned long total_scanned;
2008 struct reclaim_state *reclaim_state = current->reclaim_state;
2009 struct scan_control sc = {
2010 .gfp_mask = GFP_KERNEL,
2014 * kswapd doesn't want to be bailed out while reclaim. because
2015 * we want to put equal scanning pressure on each zone.
2017 .nr_to_reclaim = ULONG_MAX,
2018 .swappiness = vm_swappiness,
2024 sc.nr_reclaimed = 0;
2025 sc.may_writepage = !laptop_mode;
2026 count_vm_event(PAGEOUTRUN);
2028 for (priority = DEF_PRIORITY; priority >= 0; priority--) {
2029 int end_zone = 0; /* Inclusive. 0 = ZONE_DMA */
2030 unsigned long lru_pages = 0;
2031 int has_under_min_watermark_zone = 0;
2033 /* The swap token gets in the way of swapout... */
2035 disable_swap_token();
2040 * Scan in the highmem->dma direction for the highest
2041 * zone which needs scanning
2043 for (i = pgdat->nr_zones - 1; i >= 0; i--) {
2044 struct zone *zone = pgdat->node_zones + i;
2046 if (!populated_zone(zone))
2049 if (zone->all_unreclaimable && priority != DEF_PRIORITY)
2053 * Do some background aging of the anon list, to give
2054 * pages a chance to be referenced before reclaiming.
2056 if (inactive_anon_is_low(zone, &sc))
2057 shrink_active_list(SWAP_CLUSTER_MAX, zone,
2060 if (!zone_watermark_ok(zone, order,
2061 high_wmark_pages(zone), 0, 0)) {
2069 for (i = 0; i <= end_zone; i++) {
2070 struct zone *zone = pgdat->node_zones + i;
2072 lru_pages += zone_reclaimable_pages(zone);
2076 * Now scan the zone in the dma->highmem direction, stopping
2077 * at the last zone which needs scanning.
2079 * We do this because the page allocator works in the opposite
2080 * direction. This prevents the page allocator from allocating
2081 * pages behind kswapd's direction of progress, which would
2082 * cause too much scanning of the lower zones.
2084 for (i = 0; i <= end_zone; i++) {
2085 struct zone *zone = pgdat->node_zones + i;
2089 if (!populated_zone(zone))
2092 if (zone->all_unreclaimable && priority != DEF_PRIORITY)
2097 nid = pgdat->node_id;
2098 zid = zone_idx(zone);
2100 * Call soft limit reclaim before calling shrink_zone.
2101 * For now we ignore the return value
2103 mem_cgroup_soft_limit_reclaim(zone, order, sc.gfp_mask,
2106 * We put equal pressure on every zone, unless one
2107 * zone has way too many pages free already.
2109 if (!zone_watermark_ok(zone, order,
2110 8*high_wmark_pages(zone), end_zone, 0))
2111 shrink_zone(priority, zone, &sc);
2112 reclaim_state->reclaimed_slab = 0;
2113 nr_slab = shrink_slab(sc.nr_scanned, GFP_KERNEL,
2115 sc.nr_reclaimed += reclaim_state->reclaimed_slab;
2116 total_scanned += sc.nr_scanned;
2117 if (zone->all_unreclaimable)
2120 zone->pages_scanned >= (zone_reclaimable_pages(zone) * 6))
2121 zone->all_unreclaimable = 1;
2123 * If we've done a decent amount of scanning and
2124 * the reclaim ratio is low, start doing writepage
2125 * even in laptop mode
2127 if (total_scanned > SWAP_CLUSTER_MAX * 2 &&
2128 total_scanned > sc.nr_reclaimed + sc.nr_reclaimed / 2)
2129 sc.may_writepage = 1;
2131 if (!zone_watermark_ok(zone, order,
2132 high_wmark_pages(zone), end_zone, 0)) {
2135 * We are still under min water mark. This
2136 * means that we have a GFP_ATOMIC allocation
2137 * failure risk. Hurry up!
2139 if (!zone_watermark_ok(zone, order,
2140 min_wmark_pages(zone), end_zone, 0))
2141 has_under_min_watermark_zone = 1;
2146 break; /* kswapd: all done */
2148 * OK, kswapd is getting into trouble. Take a nap, then take
2149 * another pass across the zones.
2151 if (total_scanned && (priority < DEF_PRIORITY - 2)) {
2152 if (has_under_min_watermark_zone)
2153 count_vm_event(KSWAPD_SKIP_CONGESTION_WAIT);
2155 congestion_wait(BLK_RW_ASYNC, HZ/10);
2159 * We do this so kswapd doesn't build up large priorities for
2160 * example when it is freeing in parallel with allocators. It
2161 * matches the direct reclaim path behaviour in terms of impact
2162 * on zone->*_priority.
2164 if (sc.nr_reclaimed >= SWAP_CLUSTER_MAX)
2168 if (!all_zones_ok) {
2174 * Fragmentation may mean that the system cannot be
2175 * rebalanced for high-order allocations in all zones.
2176 * At this point, if nr_reclaimed < SWAP_CLUSTER_MAX,
2177 * it means the zones have been fully scanned and are still
2178 * not balanced. For high-order allocations, there is
2179 * little point trying all over again as kswapd may
2182 * Instead, recheck all watermarks at order-0 as they
2183 * are the most important. If watermarks are ok, kswapd will go
2184 * back to sleep. High-order users can still perform direct
2185 * reclaim if they wish.
2187 if (sc.nr_reclaimed < SWAP_CLUSTER_MAX)
2188 order = sc.order = 0;
2193 return sc.nr_reclaimed;
2197 * The background pageout daemon, started as a kernel thread
2198 * from the init process.
2200 * This basically trickles out pages so that we have _some_
2201 * free memory available even if there is no other activity
2202 * that frees anything up. This is needed for things like routing
2203 * etc, where we otherwise might have all activity going on in
2204 * asynchronous contexts that cannot page things out.
2206 * If there are applications that are active memory-allocators
2207 * (most normal use), this basically shouldn't matter.
2209 static int kswapd(void *p)
2211 unsigned long order;
2212 pg_data_t *pgdat = (pg_data_t*)p;
2213 struct task_struct *tsk = current;
2215 struct reclaim_state reclaim_state = {
2216 .reclaimed_slab = 0,
2218 const struct cpumask *cpumask = cpumask_of_node(pgdat->node_id);
2220 lockdep_set_current_reclaim_state(GFP_KERNEL);
2222 if (!cpumask_empty(cpumask))
2223 set_cpus_allowed_ptr(tsk, cpumask);
2224 current->reclaim_state = &reclaim_state;
2227 * Tell the memory management that we're a "memory allocator",
2228 * and that if we need more memory we should get access to it
2229 * regardless (see "__alloc_pages()"). "kswapd" should
2230 * never get caught in the normal page freeing logic.
2232 * (Kswapd normally doesn't need memory anyway, but sometimes
2233 * you need a small amount of memory in order to be able to
2234 * page out something else, and this flag essentially protects
2235 * us from recursively trying to free more memory as we're
2236 * trying to free the first piece of memory in the first place).
2238 tsk->flags |= PF_MEMALLOC | PF_SWAPWRITE | PF_KSWAPD;
2243 unsigned long new_order;
2246 prepare_to_wait(&pgdat->kswapd_wait, &wait, TASK_INTERRUPTIBLE);
2247 new_order = pgdat->kswapd_max_order;
2248 pgdat->kswapd_max_order = 0;
2249 if (order < new_order) {
2251 * Don't sleep if someone wants a larger 'order'
2256 if (!freezing(current) && !kthread_should_stop()) {
2259 /* Try to sleep for a short interval */
2260 if (!sleeping_prematurely(pgdat, order, remaining)) {
2261 remaining = schedule_timeout(HZ/10);
2262 finish_wait(&pgdat->kswapd_wait, &wait);
2263 prepare_to_wait(&pgdat->kswapd_wait, &wait, TASK_INTERRUPTIBLE);
2267 * After a short sleep, check if it was a
2268 * premature sleep. If not, then go fully
2269 * to sleep until explicitly woken up
2271 if (!sleeping_prematurely(pgdat, order, remaining)) {
2272 trace_mm_vmscan_kswapd_sleep(pgdat->node_id);
2276 count_vm_event(KSWAPD_LOW_WMARK_HIT_QUICKLY);
2278 count_vm_event(KSWAPD_HIGH_WMARK_HIT_QUICKLY);
2282 order = pgdat->kswapd_max_order;
2284 finish_wait(&pgdat->kswapd_wait, &wait);
2286 ret = try_to_freeze();
2287 if (kthread_should_stop())
2291 * We can speed up thawing tasks if we don't call balance_pgdat
2292 * after returning from the refrigerator
2295 trace_mm_vmscan_kswapd_wake(pgdat->node_id, order);
2296 balance_pgdat(pgdat, order);
2303 * A zone is low on free memory, so wake its kswapd task to service it.
2305 void wakeup_kswapd(struct zone *zone, int order)
2309 if (!populated_zone(zone))
2312 pgdat = zone->zone_pgdat;
2313 if (zone_watermark_ok(zone, order, low_wmark_pages(zone), 0, 0))
2315 if (pgdat->kswapd_max_order < order)
2316 pgdat->kswapd_max_order = order;
2317 trace_mm_vmscan_wakeup_kswapd(pgdat->node_id, zone_idx(zone), order);
2318 if (!cpuset_zone_allowed_hardwall(zone, GFP_KERNEL))
2320 if (!waitqueue_active(&pgdat->kswapd_wait))
2322 wake_up_interruptible(&pgdat->kswapd_wait);
2326 * The reclaimable count would be mostly accurate.
2327 * The less reclaimable pages may be
2328 * - mlocked pages, which will be moved to unevictable list when encountered
2329 * - mapped pages, which may require several travels to be reclaimed
2330 * - dirty pages, which is not "instantly" reclaimable
2332 unsigned long global_reclaimable_pages(void)
2336 nr = global_page_state(NR_ACTIVE_FILE) +
2337 global_page_state(NR_INACTIVE_FILE);
2339 if (nr_swap_pages > 0)
2340 nr += global_page_state(NR_ACTIVE_ANON) +
2341 global_page_state(NR_INACTIVE_ANON);
2346 unsigned long zone_reclaimable_pages(struct zone *zone)
2350 nr = zone_page_state(zone, NR_ACTIVE_FILE) +
2351 zone_page_state(zone, NR_INACTIVE_FILE);
2353 if (nr_swap_pages > 0)
2354 nr += zone_page_state(zone, NR_ACTIVE_ANON) +
2355 zone_page_state(zone, NR_INACTIVE_ANON);
2360 #ifdef CONFIG_HIBERNATION
2362 * Try to free `nr_to_reclaim' of memory, system-wide, and return the number of
2365 * Rather than trying to age LRUs the aim is to preserve the overall
2366 * LRU order by reclaiming preferentially
2367 * inactive > active > active referenced > active mapped
2369 unsigned long shrink_all_memory(unsigned long nr_to_reclaim)
2371 struct reclaim_state reclaim_state;
2372 struct scan_control sc = {
2373 .gfp_mask = GFP_HIGHUSER_MOVABLE,
2377 .nr_to_reclaim = nr_to_reclaim,
2378 .hibernation_mode = 1,
2379 .swappiness = vm_swappiness,
2382 struct zonelist * zonelist = node_zonelist(numa_node_id(), sc.gfp_mask);
2383 struct task_struct *p = current;
2384 unsigned long nr_reclaimed;
2386 p->flags |= PF_MEMALLOC;
2387 lockdep_set_current_reclaim_state(sc.gfp_mask);
2388 reclaim_state.reclaimed_slab = 0;
2389 p->reclaim_state = &reclaim_state;
2391 nr_reclaimed = do_try_to_free_pages(zonelist, &sc);
2393 p->reclaim_state = NULL;
2394 lockdep_clear_current_reclaim_state();
2395 p->flags &= ~PF_MEMALLOC;
2397 return nr_reclaimed;
2399 #endif /* CONFIG_HIBERNATION */
2401 /* It's optimal to keep kswapds on the same CPUs as their memory, but
2402 not required for correctness. So if the last cpu in a node goes
2403 away, we get changed to run anywhere: as the first one comes back,
2404 restore their cpu bindings. */
2405 static int __devinit cpu_callback(struct notifier_block *nfb,
2406 unsigned long action, void *hcpu)
2410 if (action == CPU_ONLINE || action == CPU_ONLINE_FROZEN) {
2411 for_each_node_state(nid, N_HIGH_MEMORY) {
2412 pg_data_t *pgdat = NODE_DATA(nid);
2413 const struct cpumask *mask;
2415 mask = cpumask_of_node(pgdat->node_id);
2417 if (cpumask_any_and(cpu_online_mask, mask) < nr_cpu_ids)
2418 /* One of our CPUs online: restore mask */
2419 set_cpus_allowed_ptr(pgdat->kswapd, mask);
2426 * This kswapd start function will be called by init and node-hot-add.
2427 * On node-hot-add, kswapd will moved to proper cpus if cpus are hot-added.
2429 int kswapd_run(int nid)
2431 pg_data_t *pgdat = NODE_DATA(nid);
2437 pgdat->kswapd = kthread_run(kswapd, pgdat, "kswapd%d", nid);
2438 if (IS_ERR(pgdat->kswapd)) {
2439 /* failure at boot is fatal */
2440 BUG_ON(system_state == SYSTEM_BOOTING);
2441 printk("Failed to start kswapd on node %d\n",nid);
2448 * Called by memory hotplug when all memory in a node is offlined.
2450 void kswapd_stop(int nid)
2452 struct task_struct *kswapd = NODE_DATA(nid)->kswapd;
2455 kthread_stop(kswapd);
2458 static int __init kswapd_init(void)
2463 for_each_node_state(nid, N_HIGH_MEMORY)
2465 hotcpu_notifier(cpu_callback, 0);
2469 module_init(kswapd_init)
2475 * If non-zero call zone_reclaim when the number of free pages falls below
2478 int zone_reclaim_mode __read_mostly;
2480 #define RECLAIM_OFF 0
2481 #define RECLAIM_ZONE (1<<0) /* Run shrink_inactive_list on the zone */
2482 #define RECLAIM_WRITE (1<<1) /* Writeout pages during reclaim */
2483 #define RECLAIM_SWAP (1<<2) /* Swap pages out during reclaim */
2486 * Priority for ZONE_RECLAIM. This determines the fraction of pages
2487 * of a node considered for each zone_reclaim. 4 scans 1/16th of
2490 #define ZONE_RECLAIM_PRIORITY 4
2493 * Percentage of pages in a zone that must be unmapped for zone_reclaim to
2496 int sysctl_min_unmapped_ratio = 1;
2499 * If the number of slab pages in a zone grows beyond this percentage then
2500 * slab reclaim needs to occur.
2502 int sysctl_min_slab_ratio = 5;
2504 static inline unsigned long zone_unmapped_file_pages(struct zone *zone)
2506 unsigned long file_mapped = zone_page_state(zone, NR_FILE_MAPPED);
2507 unsigned long file_lru = zone_page_state(zone, NR_INACTIVE_FILE) +
2508 zone_page_state(zone, NR_ACTIVE_FILE);
2511 * It's possible for there to be more file mapped pages than
2512 * accounted for by the pages on the file LRU lists because
2513 * tmpfs pages accounted for as ANON can also be FILE_MAPPED
2515 return (file_lru > file_mapped) ? (file_lru - file_mapped) : 0;
2518 /* Work out how many page cache pages we can reclaim in this reclaim_mode */
2519 static long zone_pagecache_reclaimable(struct zone *zone)
2521 long nr_pagecache_reclaimable;
2525 * If RECLAIM_SWAP is set, then all file pages are considered
2526 * potentially reclaimable. Otherwise, we have to worry about
2527 * pages like swapcache and zone_unmapped_file_pages() provides
2530 if (zone_reclaim_mode & RECLAIM_SWAP)
2531 nr_pagecache_reclaimable = zone_page_state(zone, NR_FILE_PAGES);
2533 nr_pagecache_reclaimable = zone_unmapped_file_pages(zone);
2535 /* If we can't clean pages, remove dirty pages from consideration */
2536 if (!(zone_reclaim_mode & RECLAIM_WRITE))
2537 delta += zone_page_state(zone, NR_FILE_DIRTY);
2539 /* Watch for any possible underflows due to delta */
2540 if (unlikely(delta > nr_pagecache_reclaimable))
2541 delta = nr_pagecache_reclaimable;
2543 return nr_pagecache_reclaimable - delta;
2547 * Try to free up some pages from this zone through reclaim.
2549 static int __zone_reclaim(struct zone *zone, gfp_t gfp_mask, unsigned int order)
2551 /* Minimum pages needed in order to stay on node */
2552 const unsigned long nr_pages = 1 << order;
2553 struct task_struct *p = current;
2554 struct reclaim_state reclaim_state;
2556 struct scan_control sc = {
2557 .may_writepage = !!(zone_reclaim_mode & RECLAIM_WRITE),
2558 .may_unmap = !!(zone_reclaim_mode & RECLAIM_SWAP),
2560 .nr_to_reclaim = max_t(unsigned long, nr_pages,
2562 .gfp_mask = gfp_mask,
2563 .swappiness = vm_swappiness,
2566 unsigned long slab_reclaimable;
2570 * We need to be able to allocate from the reserves for RECLAIM_SWAP
2571 * and we also need to be able to write out pages for RECLAIM_WRITE
2574 p->flags |= PF_MEMALLOC | PF_SWAPWRITE;
2575 lockdep_set_current_reclaim_state(gfp_mask);
2576 reclaim_state.reclaimed_slab = 0;
2577 p->reclaim_state = &reclaim_state;
2579 if (zone_pagecache_reclaimable(zone) > zone->min_unmapped_pages) {
2581 * Free memory by calling shrink zone with increasing
2582 * priorities until we have enough memory freed.
2584 priority = ZONE_RECLAIM_PRIORITY;
2586 shrink_zone(priority, zone, &sc);
2588 } while (priority >= 0 && sc.nr_reclaimed < nr_pages);
2591 slab_reclaimable = zone_page_state(zone, NR_SLAB_RECLAIMABLE);
2592 if (slab_reclaimable > zone->min_slab_pages) {
2594 * shrink_slab() does not currently allow us to determine how
2595 * many pages were freed in this zone. So we take the current
2596 * number of slab pages and shake the slab until it is reduced
2597 * by the same nr_pages that we used for reclaiming unmapped
2600 * Note that shrink_slab will free memory on all zones and may
2603 while (shrink_slab(sc.nr_scanned, gfp_mask, order) &&
2604 zone_page_state(zone, NR_SLAB_RECLAIMABLE) >
2605 slab_reclaimable - nr_pages)
2609 * Update nr_reclaimed by the number of slab pages we
2610 * reclaimed from this zone.
2612 sc.nr_reclaimed += slab_reclaimable -
2613 zone_page_state(zone, NR_SLAB_RECLAIMABLE);
2616 p->reclaim_state = NULL;
2617 current->flags &= ~(PF_MEMALLOC | PF_SWAPWRITE);
2618 lockdep_clear_current_reclaim_state();
2619 return sc.nr_reclaimed >= nr_pages;
2622 int zone_reclaim(struct zone *zone, gfp_t gfp_mask, unsigned int order)
2628 * Zone reclaim reclaims unmapped file backed pages and
2629 * slab pages if we are over the defined limits.
2631 * A small portion of unmapped file backed pages is needed for
2632 * file I/O otherwise pages read by file I/O will be immediately
2633 * thrown out if the zone is overallocated. So we do not reclaim
2634 * if less than a specified percentage of the zone is used by
2635 * unmapped file backed pages.
2637 if (zone_pagecache_reclaimable(zone) <= zone->min_unmapped_pages &&
2638 zone_page_state(zone, NR_SLAB_RECLAIMABLE) <= zone->min_slab_pages)
2639 return ZONE_RECLAIM_FULL;
2641 if (zone->all_unreclaimable)
2642 return ZONE_RECLAIM_FULL;
2645 * Do not scan if the allocation should not be delayed.
2647 if (!(gfp_mask & __GFP_WAIT) || (current->flags & PF_MEMALLOC))
2648 return ZONE_RECLAIM_NOSCAN;
2651 * Only run zone reclaim on the local zone or on zones that do not
2652 * have associated processors. This will favor the local processor
2653 * over remote processors and spread off node memory allocations
2654 * as wide as possible.
2656 node_id = zone_to_nid(zone);
2657 if (node_state(node_id, N_CPU) && node_id != numa_node_id())
2658 return ZONE_RECLAIM_NOSCAN;
2660 if (zone_test_and_set_flag(zone, ZONE_RECLAIM_LOCKED))
2661 return ZONE_RECLAIM_NOSCAN;
2663 ret = __zone_reclaim(zone, gfp_mask, order);
2664 zone_clear_flag(zone, ZONE_RECLAIM_LOCKED);
2667 count_vm_event(PGSCAN_ZONE_RECLAIM_FAILED);
2674 * page_evictable - test whether a page is evictable
2675 * @page: the page to test
2676 * @vma: the VMA in which the page is or will be mapped, may be NULL
2678 * Test whether page is evictable--i.e., should be placed on active/inactive
2679 * lists vs unevictable list. The vma argument is !NULL when called from the
2680 * fault path to determine how to instantate a new page.
2682 * Reasons page might not be evictable:
2683 * (1) page's mapping marked unevictable
2684 * (2) page is part of an mlocked VMA
2687 int page_evictable(struct page *page, struct vm_area_struct *vma)
2690 if (mapping_unevictable(page_mapping(page)))
2693 if (PageMlocked(page) || (vma && is_mlocked_vma(vma, page)))
2700 * check_move_unevictable_page - check page for evictability and move to appropriate zone lru list
2701 * @page: page to check evictability and move to appropriate lru list
2702 * @zone: zone page is in
2704 * Checks a page for evictability and moves the page to the appropriate
2707 * Restrictions: zone->lru_lock must be held, page must be on LRU and must
2708 * have PageUnevictable set.
2710 static void check_move_unevictable_page(struct page *page, struct zone *zone)
2712 VM_BUG_ON(PageActive(page));
2715 ClearPageUnevictable(page);
2716 if (page_evictable(page, NULL)) {
2717 enum lru_list l = page_lru_base_type(page);
2719 __dec_zone_state(zone, NR_UNEVICTABLE);
2720 list_move(&page->lru, &zone->lru[l].list);
2721 mem_cgroup_move_lists(page, LRU_UNEVICTABLE, l);
2722 __inc_zone_state(zone, NR_INACTIVE_ANON + l);
2723 __count_vm_event(UNEVICTABLE_PGRESCUED);
2726 * rotate unevictable list
2728 SetPageUnevictable(page);
2729 list_move(&page->lru, &zone->lru[LRU_UNEVICTABLE].list);
2730 mem_cgroup_rotate_lru_list(page, LRU_UNEVICTABLE);
2731 if (page_evictable(page, NULL))
2737 * scan_mapping_unevictable_pages - scan an address space for evictable pages
2738 * @mapping: struct address_space to scan for evictable pages
2740 * Scan all pages in mapping. Check unevictable pages for
2741 * evictability and move them to the appropriate zone lru list.
2743 void scan_mapping_unevictable_pages(struct address_space *mapping)
2746 pgoff_t end = (i_size_read(mapping->host) + PAGE_CACHE_SIZE - 1) >>
2749 struct pagevec pvec;
2751 if (mapping->nrpages == 0)
2754 pagevec_init(&pvec, 0);
2755 while (next < end &&
2756 pagevec_lookup(&pvec, mapping, next, PAGEVEC_SIZE)) {
2762 for (i = 0; i < pagevec_count(&pvec); i++) {
2763 struct page *page = pvec.pages[i];
2764 pgoff_t page_index = page->index;
2765 struct zone *pagezone = page_zone(page);
2768 if (page_index > next)
2772 if (pagezone != zone) {
2774 spin_unlock_irq(&zone->lru_lock);
2776 spin_lock_irq(&zone->lru_lock);
2779 if (PageLRU(page) && PageUnevictable(page))
2780 check_move_unevictable_page(page, zone);
2783 spin_unlock_irq(&zone->lru_lock);
2784 pagevec_release(&pvec);
2786 count_vm_events(UNEVICTABLE_PGSCANNED, pg_scanned);
2792 * scan_zone_unevictable_pages - check unevictable list for evictable pages
2793 * @zone - zone of which to scan the unevictable list
2795 * Scan @zone's unevictable LRU lists to check for pages that have become
2796 * evictable. Move those that have to @zone's inactive list where they
2797 * become candidates for reclaim, unless shrink_inactive_zone() decides
2798 * to reactivate them. Pages that are still unevictable are rotated
2799 * back onto @zone's unevictable list.
2801 #define SCAN_UNEVICTABLE_BATCH_SIZE 16UL /* arbitrary lock hold batch size */
2802 static void scan_zone_unevictable_pages(struct zone *zone)
2804 struct list_head *l_unevictable = &zone->lru[LRU_UNEVICTABLE].list;
2806 unsigned long nr_to_scan = zone_page_state(zone, NR_UNEVICTABLE);
2808 while (nr_to_scan > 0) {
2809 unsigned long batch_size = min(nr_to_scan,
2810 SCAN_UNEVICTABLE_BATCH_SIZE);
2812 spin_lock_irq(&zone->lru_lock);
2813 for (scan = 0; scan < batch_size; scan++) {
2814 struct page *page = lru_to_page(l_unevictable);
2816 if (!trylock_page(page))
2819 prefetchw_prev_lru_page(page, l_unevictable, flags);
2821 if (likely(PageLRU(page) && PageUnevictable(page)))
2822 check_move_unevictable_page(page, zone);
2826 spin_unlock_irq(&zone->lru_lock);
2828 nr_to_scan -= batch_size;
2834 * scan_all_zones_unevictable_pages - scan all unevictable lists for evictable pages
2836 * A really big hammer: scan all zones' unevictable LRU lists to check for
2837 * pages that have become evictable. Move those back to the zones'
2838 * inactive list where they become candidates for reclaim.
2839 * This occurs when, e.g., we have unswappable pages on the unevictable lists,
2840 * and we add swap to the system. As such, it runs in the context of a task
2841 * that has possibly/probably made some previously unevictable pages
2844 static void scan_all_zones_unevictable_pages(void)
2848 for_each_zone(zone) {
2849 scan_zone_unevictable_pages(zone);
2854 * scan_unevictable_pages [vm] sysctl handler. On demand re-scan of
2855 * all nodes' unevictable lists for evictable pages
2857 unsigned long scan_unevictable_pages;
2859 int scan_unevictable_handler(struct ctl_table *table, int write,
2860 void __user *buffer,
2861 size_t *length, loff_t *ppos)
2863 proc_doulongvec_minmax(table, write, buffer, length, ppos);
2865 if (write && *(unsigned long *)table->data)
2866 scan_all_zones_unevictable_pages();
2868 scan_unevictable_pages = 0;
2873 * per node 'scan_unevictable_pages' attribute. On demand re-scan of
2874 * a specified node's per zone unevictable lists for evictable pages.
2877 static ssize_t read_scan_unevictable_node(struct sys_device *dev,
2878 struct sysdev_attribute *attr,
2881 return sprintf(buf, "0\n"); /* always zero; should fit... */
2884 static ssize_t write_scan_unevictable_node(struct sys_device *dev,
2885 struct sysdev_attribute *attr,
2886 const char *buf, size_t count)
2888 struct zone *node_zones = NODE_DATA(dev->id)->node_zones;
2891 unsigned long req = strict_strtoul(buf, 10, &res);
2894 return 1; /* zero is no-op */
2896 for (zone = node_zones; zone - node_zones < MAX_NR_ZONES; ++zone) {
2897 if (!populated_zone(zone))
2899 scan_zone_unevictable_pages(zone);
2905 static SYSDEV_ATTR(scan_unevictable_pages, S_IRUGO | S_IWUSR,
2906 read_scan_unevictable_node,
2907 write_scan_unevictable_node);
2909 int scan_unevictable_register_node(struct node *node)
2911 return sysdev_create_file(&node->sysdev, &attr_scan_unevictable_pages);
2914 void scan_unevictable_unregister_node(struct node *node)
2916 sysdev_remove_file(&node->sysdev, &attr_scan_unevictable_pages);