| /linux-6.3-rc2/Documentation/translations/zh_CN/admin-guide/mm/damon/ |
| A D | lru_sort.rst | 13 基于DAMON的LRU排序
17 为基础的页面优先级处理的LRU链表上，以使得LRU上的数据访问模型更为可信。
19 哪里需要主动的LRU排序
94 尝试LRU链表排序的时间限制，单位是毫秒。
198 被尝试进行LRU排序的热内存区域的数量。
203 被尝试进行LRU排序的热内存区域的大小（字节）。
208 成功进行LRU排序的热内存区域的数量。
213 成功进行LRU排序的热内存区域的大小（字节）。
223 被尝试进行LRU排序的冷内存区域的数量。
233 成功进行LRU排序的冷内存区域的数量。
[all …]
|
| A D | reclaim.rst | 17 量级的回收。它的目的不是取代基于LRU列表的页面回收，而是有选择地用于不同程度的内存压力和要
128 它除了定期检查水位外什么都不做。在这种情况下，系统会退回到基于LRU列表的页面粒度回收逻辑。
215 DAMON_RECLAIM再次什么都不做，这样我们就可以退回到基于LRU列表的页面粒度回收了::
|
| A D | usage.rst | 222 - ``lru_prio``: 在其LRU列表上对区域进行优先排序。
223 - ``lru_deprio``: 对区域的LRU列表进行降低优先处理。
|
| /linux-6.3-rc2/Documentation/translations/zh_CN/mm/ |
| A 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可移动页面。
184 面被隔离后，无论页面是LRU还是非LRU可移动的，调用它开销都很低，因为LRU页面在
186 进行更大开销的检查来选择受害者之前，它也很适合只是瞥一眼来测试非LRU可移动的页面。
[all …]
|
| A D | hmm.rst | 281 ``lock_page()``锁定，与LRU隔离（如果系统内存和设备私有页不在LRU上），从进
|
| A D | hwpoison.rst | 163 复，目前只有LRU页。
|
| /linux-6.3-rc2/Documentation/admin-guide/mm/damon/ |
| A D | lru_sort.rst | 4 DAMON-based LRU-lists Sorting
9 (de)prioritization of pages on their LRU-lists for making LRU-lists a more
12 Where Proactive LRU-lists Sorting is Required?
104 Limit of time for trying the LRU lists sorting in milliseconds.
148 the LRU-lists sorting. 150 (15%) by default.
225 Number of hot memory regions that tried to be LRU-sorted.
230 Total bytes of hot memory regions that tried to be LRU-sorted.
235 Number of hot memory regions that successfully be LRU-sorted.
250 Number of cold memory regions that tried to be LRU-sorted.
276 having >=50% access frequency and LRU-prioritize while LRU-deprioritizing
[all …]
|
| A 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
260 do nothing again, so that we can fall back to the LRU-list based page
|
| /linux-6.3-rc2/Documentation/mm/ |
| A D | unevictable-lru.rst | 2 Unevictable LRU Infrastructure
24 The Unevictable LRU
27 The Unevictable LRU facility adds an additional LRU list to track unevictable
53 The Unevictable LRU Folio List
56 The Unevictable LRU folio list is a lie. It was never an LRU-ordered
60 imagine it as a fifth LRU folio list.
62 The Unevictable LRU infrastructure consists of an additional, per-node, LRU list
71 on an additional LRU list for a few reasons:
383 to the inactive LRU.
450 to the unevictable LRU and the rest can be reclaimed.
[all …]
|
| A 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,
189 Memcg LRU
191 An memcg LRU is a per-node LRU of memcgs. It is also an LRU of LRUs,
192 since each node and memcg combination has an LRU of folios (see
195 data centers. Note that memcg LRU only applies to global reclaim.
198 the active/inactive LRU (of folios):
[all …]
|
| A D | page_migration.rst | 66 1. Remove pages from the LRU.
90 already been removed from the LRU via isolate_lru_page() and the refcount
147 18. The new page is moved to the LRU and can be scanned by the swapper,
150 Non-LRU page migration
156 non-LRU pages, such as zsmalloc and virtio-balloon pages.
|
| /linux-6.3-rc2/tools/testing/selftests/bpf/progs/ |
| A 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.3-rc2/Documentation/bpf/ |
| A 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
137 This example shows how to declare an LRU Hash with a struct key and a
|
| /linux-6.3-rc2/Documentation/admin-guide/mm/ |
| A 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
|
| A D | pagemap.rst | 60 5. LRU
149 LRU related page flags
152 5 - LRU
153 The page is in one of the LRU lists.
155 The page is in the active LRU list.
157 The page is in the unevictable (non-)LRU list It is somehow pinned and
158 not a candidate for LRU page reclaims, e.g. ramfs pages,
161 The page has been referenced since last LRU list enqueue/requeue.
|
| A D | zswap.rst | 26 Zswap evicts pages from compressed cache on an LRU basis to the backing swap
53 evict pages from its own compressed pool on an LRU basis and write them back to
|
| /linux-6.3-rc2/Documentation/filesystems/caching/ |
| A 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.3-rc2/Documentation/admin-guide/cgroup-v1/ |
| A D | memory.rst | 47 - pages are linked to per-memcg LRU exclusively, and there is no global LRU.
188 updated. page_cgroup has its own LRU on cgroup.
195 Some pages which are never reclaimable and will not be on the LRU
254 The global LRU(kswapd) can swap out arbitrary pages. Swap-out means
304 Per-node-per-memcgroup LRU (cgroup's private LRU) is guarded by
306 isolating a page from its LRU under lruvec->lru_lock.
553 LRU list.
555 LRU list.
557 memory (LazyFree pages) on inactive LRU list.
587 recent_rotated means recent frequency of LRU rotation.
[all …]
|
| A D | memcg_test.rst | 134 8. LRU
138 each LRU handled under a single lru_lock for that memcg and node.
|
| /linux-6.3-rc2/mm/damon/ |
| A D | Kconfig | 100 bool "Build DAMON-based LRU-lists sorting (DAMON_LRU_SORT)"
103 This builds the DAMON-based LRU-lists sorting subsystem. It tries to
|
| /linux-6.3-rc2/Documentation/ABI/testing/ |
| A D | sysfs-driver-xen-blkback | 16 max_persistent_grants, the LRU kicks in and starts
|
| /linux-6.3-rc2/Documentation/gpu/rfc/ |
| A 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.3-rc2/tools/testing/selftests/cgroup/ |
| A D | memcg_protection.m | 63 r = alpha * c; % assume all memory is in a single LRU list
|
| /linux-6.3-rc2/include/linux/ |
| A D | page-flags.h | 479 PAGEFLAG(LRU, lru, PF_HEAD) __CLEARPAGEFLAG(LRU, lru, PF_HEAD)
480 TESTCLEARFLAG(LRU, lru, PF_HEAD)
|
| /linux-6.3-rc2/Documentation/trace/ |
| A D | events-kmem.rst | 69 Broadly speaking, pages are taken off the LRU lock in bulk and
|