Searched refs:LRU (Results 1 – 25 of 36) sorted by relevance
12
| /linux-6.1.9/Documentation/translations/zh_CN/mm/ |
| D | page_migration.rst | 51 1. 从LRU中移除页面。
68 那么这个页面就会被移动。该页已经通过isolate_lru_page()从LRU中移除，并且refcount被
115 18. 新的页面被移到LRU中，可以被交换器等再次扫描。
117 非LRU页面迁移
122 目前实现的问题是，它被设计为只迁移*LRU*页。然而，有一些潜在的非LRU页面可以在驱动中
129 为了克服这个问题，VM支持非LRU页面迁移，它为非LRU可移动页面提供了通用函数，而在迁移
160 非LRU可移动页标志
162 有两个页面标志用于支持非LRU可移动页面。
180 对于非LRU可移动页面的测试，VM支持__PageMovable()函数。然而，它并不能保证识别
181 非LRU可移动页面，因为page->mapping字段与struct page中的其他变量是统一的。如
[all …]
|
| D | hmm.rst | 281 ``lock_page()``锁定，与LRU隔离（如果系统内存和设备私有页不在LRU上），从进
|
| D | hwpoison.rst | 163 复，目前只有LRU页。
|
| /linux-6.1.9/Documentation/admin-guide/mm/damon/ |
| D | lru_sort.rst | 4 DAMON-based LRU-lists Sorting
7 DAMON-based LRU-lists Sorting (DAMON_LRU_SORT) is a static kernel module that
9 (de)prioritization of pages on their LRU-lists for making LRU-lists a more
12 Where Proactive LRU-lists Sorting is Required?
16 systems, LRU lists are normally not proactively sorted but partially and
18 calls and memory pressure. As a result, LRU lists are sometimes not so
25 DAMON_LRU_SORT could be helpful for making LRU lists more trustworthy access
35 deprioritizing cold pages on their LRU-lists. To avoid it consuming too much
68 no real monitoring and LRU-lists sorting due to the watermarks-based activation
88 identifies the region as hot, and mark it as accessed on the LRU list, so that
[all …]
|
| D | reclaim.rst | 9 It doesn't aim to replace the LRU-list based page_granularity reclamation, but
151 watermarks. In the case, the system falls back to the LRU-list based page
251 do nothing again, so that we can fall back to the LRU-list based page
|
| /linux-6.1.9/Documentation/mm/ |
| D | unevictable-lru.rst | 4 Unevictable LRU Infrastructure
13 This document describes the Linux memory manager's "Unevictable LRU"
26 The Unevictable LRU
29 The Unevictable LRU facility adds an additional LRU list to track unevictable
38 will spend a lot of time scanning the LRU lists looking for the small fraction
55 The Unevictable LRU Page List
58 The Unevictable LRU page list is a lie. It was never an LRU-ordered list, but a
59 companion to the LRU-ordered anonymous and file, active and inactive page lists;
61 this document and in the source, we often imagine it as a fifth LRU page list.
63 The Unevictable LRU infrastructure consists of an additional, per-node, LRU list
[all …]
|
| D | multigen_lru.rst | 4 Multi-Gen LRU
6 The multi-gen LRU is an alternative LRU implementation that optimizes
22 The representation of access recency is at the core of all LRU
23 implementations. In the multi-gen LRU, each generation represents a
101 contrast to moving across generations, which requires the LRU lock,
146 The multi-gen LRU can be disassembled into the following parts:
|
| D | page_migration.rst | 68 1. Remove pages from the LRU.
92 already been removed from the LRU via isolate_lru_page() and the refcount
149 18. The new page is moved to the LRU and can be scanned by the swapper,
152 Non-LRU page migration
158 non-LRU pages, such as zsmalloc and virtio-balloon pages.
|
| /linux-6.1.9/tools/testing/selftests/bpf/progs/ |
| D | timer.c | 58 #define LRU 4 macro
73 int lru_key = LRU; in timer_cb1()
85 } else if (*key == LRU) { in timer_cb1()
88 for (i = LRU + 1; in timer_cb1()
110 if (*key != LRU) in timer_cb1()
127 int lru_key = LRU; in BPF_PROG2()
|
| /linux-6.1.9/Documentation/bpf/ |
| D | map_hash.rst | 5 BPF_MAP_TYPE_HASH, with PERCPU and LRU Variants
27 variants add LRU semantics to their respective hash tables. An LRU hash
29 table reaches capacity. An LRU hash maintains an internal LRU list that
30 is used to select elements for eviction. This internal LRU list is
31 shared across CPUs but it is possible to request a per CPU LRU list with
114 This example shows how to declare an LRU Hash with a struct key and a
|
| /linux-6.1.9/Documentation/translations/zh_CN/admin-guide/mm/damon/ |
| D | reclaim.rst | 17 量级的回收。它的目的不是取代基于LRU列表的页面回收，而是有选择地用于不同程度的内存压力和要
132 它除了定期检查水位外什么都不做。在这种情况下，系统会退回到基于LRU列表的页面粒度回收逻辑。
219 DAMON_RECLAIM再次什么都不做，这样我们就可以退回到基于LRU列表的页面粒度回收了::
|
| D | usage.rst | 213 - ``lru_prio``: 在其LRU列表上对区域进行优先排序。
214 - ``lru_deprio``: 对区域的LRU列表进行降低优先处理。
|
| /linux-6.1.9/Documentation/admin-guide/mm/ |
| D | multigen_lru.rst | 4 Multi-Gen LRU
6 The multi-gen LRU is an alternative LRU implementation that optimizes
38 0x0001 The main switch for the multi-gen LRU.
42 disabled, the multi-gen LRU will suffer a minor performance
49 disabled, the multi-gen LRU will suffer a negligible
68 experience. The multi-gen LRU offers thrashing prevention to the
|
| D | pagemap.rst | 62 5. LRU
152 LRU related page flags
155 5 - LRU
156 The page is in one of the LRU lists.
158 The page is in the active LRU list.
160 The page is in the unevictable (non-)LRU list It is somehow pinned and
161 not a candidate for LRU page reclaims, e.g. ramfs pages,
164 The page has been referenced since last LRU list enqueue/requeue.
|
| D | zswap.rst | 34 Zswap evicts pages from compressed cache on an LRU basis to the backing swap
61 evict pages from its own compressed pool on an LRU basis and write them back to
|
| /linux-6.1.9/Documentation/filesystems/caching/ |
| D | fscache.rst | 184 |LRU |n=N |Number of cookies currently on the LRU |
186 | |exp=N |Number of cookies expired off of the LRU |
188 | |rmv=N |Number of cookies removed from the LRU |
190 | |drp=N |Number of LRU'd cookies relinquished/withdrawn |
192 | |at=N |Time till next LRU cull (jiffies) |
|
| /linux-6.1.9/Documentation/admin-guide/cgroup-v1/ |
| D | memory.rst | 47 - pages are linked to per-memcg LRU exclusively, and there is no global LRU.
185 updated. page_cgroup has its own LRU on cgroup.
192 Some pages which are never reclaimable and will not be on the LRU
212 Note: we just account pages-on-LRU because our purpose is to control amount
213 of used pages; not-on-LRU pages tend to be out-of-control from VM view.
249 The global LRU(kswapd) can swap out arbitrary pages. Swap-out means
252 affecting global LRU, memory+swap limit is better than just limiting swap from
259 caches are dropped. But as mentioned above, global LRU can do swapout memory
266 Each cgroup maintains a per cgroup LRU which has the same structure as
274 pages that are selected for reclaiming come from the per-cgroup LRU
[all …]
|
| D | memcg_test.rst | 134 8. LRU
138 each LRU handled under a single lru_lock for that memcg and node.
|
| /linux-6.1.9/mm/damon/ |
| D | Kconfig | 99 bool "Build DAMON-based LRU-lists sorting (DAMON_LRU_SORT)"
102 This builds the DAMON-based LRU-lists sorting subsystem. It tries to
|
| /linux-6.1.9/Documentation/ABI/testing/ |
| D | sysfs-driver-xen-blkback | 16 max_persistent_grants, the LRU kicks in and starts
|
| /linux-6.1.9/Documentation/gpu/rfc/ |
| D | i915_vm_bind.rst | 133 VM_BIND LRU handling
135 We need to ensure VM_BIND mapped objects are properly LRU tagged to avoid
136 performance degradation. We will also need support for bulk LRU movement of
142 that VM). So, bulk LRU movement of page table pages is also needed.
|
| /linux-6.1.9/tools/testing/selftests/cgroup/ |
| D | memcg_protection.m | 63 r = alpha * c; % assume all memory is in a single LRU list
|
| /linux-6.1.9/include/linux/ |
| D | page-flags.h | 481 PAGEFLAG(LRU, lru, PF_HEAD) __CLEARPAGEFLAG(LRU, lru, PF_HEAD)
482 TESTCLEARFLAG(LRU, lru, PF_HEAD)
|
| /linux-6.1.9/Documentation/trace/ |
| D | events-kmem.rst | 69 Broadly speaking, pages are taken off the LRU lock in bulk and
|
| /linux-6.1.9/arch/sparc/lib/ |
| D | M7memcpy.S | 439 ! Then store last element using the LRU version of BIS.
445 ! followed by STORE_ASI (mark as LRU) for the last store. That
501 ! mark cache line as LRU
|
12