Lines Matching refs:each
23 implementations. In the multi-gen LRU, each generation represents a
82 Evictable pages are divided into multiple generations for each
121 and calls ``walk_page_range()`` with each ``mm_struct`` on this list
122 to scan PTEs, and after each iteration, it increments ``max_seq``. For
162 An ``mm_struct`` list is maintained for each memcg, and an
167 ``walk_page_range()`` with each ``mm_struct`` on this list to scan
168 PTEs. When multiple page table walkers iterate the same list, each of
183 Searching the rmap for PTEs mapping each page on an LRU list (to test
220 varying memory pressure. It calculates a moving average for each new
226 since each node and memcg combination has an LRU of folios (see
243 1. Sharding, which allows each thread to start at a random memcg (in