Lines Matching full:inactive

25  * inactive and the active list.  Freshly faulted pages start out at
26  * the head of the inactive list and page reclaim scans pages from the
27  * tail.  Pages that are accessed multiple times on the inactive list
29  * whereas active pages are demoted to the inactive list when the
35  *   reclaim <- |   inactive   | <-+-- demotion |    active   | <--+
44  * are evicted from the inactive list every time before another access
53  * inactive list, yet smaller than the size of memory.  In this case,
59  *      +-inactive------+-active----+
65  * thrashing on the inactive list, after which refaulting pages can be
68  * Approximating inactive page access frequency - Observations:
71  *    head of the inactive list, slides every existing inactive page
76  *    the active list, shrinking the inactive list by one slot.  This
77  *    also slides all inactive pages that were faulted into the cache
79  *    inactive list.
84  *    time indicate the minimum number of inactive pages accessed in
87  * 2. Moving one inactive page N page slots towards the tail of the
88  *    list requires at least N inactive page accesses.
93  *    inactive pages accessed while the page was in cache is at least
94  *    the number of page slots on the inactive list.
131  * a deficit in inactive list space (in-cache).  If the inactive list
134  * the only thing eating into inactive list space is active pages.
137  *		Refaulting inactive pages
150  * That means if inactive cache is refaulting with a suitable refault
172  * For each node's LRU lists, a counter for inactive evictions and
365 	 * So when the physical inactive list of a leaf cgroup ages,  in workingset_age_nonresident()
366 	 * the virtual inactive lists of all its parents, including  in workingset_age_nonresident()
674 	 * inactive list. Assume the total cache size for that.  in count_shadow_nodes()