| /linux/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/Documentation/translations/zh_TW/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/Documentation/translations/zh_CN/mm/ |
| A D | page_migration.rst | 51 1. 从LRU中移除页面。
115 18. 新的页面被移到LRU中，可以被交换器等再次扫描。
117 非LRU页面迁移
122 目前实现的问题是，它被设计为只迁移*LRU*页。然而，有一些潜在的非LRU页面可以在驱动中
129 为了克服这个问题，VM支持非LRU页面迁移，它为非LRU可移动页面提供了通用函数，而在迁移
160 非LRU可移动页标志
162 有两个页面标志用于支持非LRU可移动页面。
180 对于非LRU可移动页面的测试，VM支持__PageMovable()函数。然而，它并不能保证识别
184 面被隔离后，无论页面是LRU还是非LRU可移动的，调用它开销都很低，因为LRU页面在
186 进行更大开销的检查来选择受害者之前，它也很适合只是瞥一眼来测试非LRU可移动的页面。
[all …]
|
| A D | hmm.rst | 281 ``lock_page()``锁定，与LRU隔离（如果系统内存和设备私有页不在LRU上），从进
|
| A D | hwpoison.rst | 163 复，目前只有LRU页。
|
| /linux/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
178 watermarks. In the case, the system falls back to the LRU-list based page
287 do nothing again, so that we can fall back to the LRU-list based page
|
| /linux/Documentation/bpf/ |
| A D | map_hash.rst | 6 BPF_MAP_TYPE_HASH, with PERCPU and LRU Variants
28 variants add LRU semantics to their respective hash tables. An LRU hash
30 table reaches capacity. An LRU hash maintains an internal LRU list that
31 is used to select elements for eviction. This internal LRU list is
32 shared across CPUs but it is possible to request a per CPU LRU list with
34 following table outlines the properties of LRU maps depending on the a
40 **BPF_F_NO_COMMON_LRU** Per-CPU LRU, global map Per-CPU LRU, per-cpu map
41 **!BPF_F_NO_COMMON_LRU** Global LRU, global map Global LRU, per-cpu map
147 This example shows how to declare an LRU Hash with a struct key and a
245 :alt: Diagram outlining the LRU eviction steps taken during map update.
[all …]
|
| A D | map_lru_hash_update.dot | 11 remote_lock [shape=rectangle,fillcolor=4,label="remote CPU LRU lock"]
13 lru_lock [shape=rectangle,fillcolor=2,label="LRU lock"]
14 local_lock [shape=rectangle,fillcolor=1,label="local CPU LRU lock"]
33 label="Map created with\ncommon LRU?\n(!BPF_F_NO_COMMON_LRU)"];
50 (global LRU -> local)"]
62 label="Map created with\ncommon LRU?\n(!BPF_F_NO_COMMON_LRU)"];
|
| /linux/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
55 The Unevictable LRU Folio List
58 The Unevictable LRU folio list is a lie. It was never an LRU-ordered
62 imagine it as a fifth LRU folio list.
64 The Unevictable LRU infrastructure consists of an additional, per-node, LRU list
73 on an additional LRU list for a few reasons:
385 to the inactive LRU.
452 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,
223 Memcg LRU
225 An memcg LRU is a per-node LRU of memcgs. It is also an LRU of LRUs,
226 since each node and memcg combination has an LRU of folios (see
229 data centers. Note that memcg LRU only applies to global reclaim.
232 the active/inactive LRU (of folios):
[all …]
|
| A D | page_migration.rst | 66 1. Remove folios from the LRU.
89 already been removed from the LRU via folio_isolate_lru() and the refcount
146 18. The new page is moved to the LRU and can be scanned by the swapper,
149 Non-LRU page migration
155 non-LRU pages, such as zsmalloc and virtio-balloon pages.
|
| /linux/tools/testing/selftests/bpf/progs/ |
| A D | timer.c | 70 #define LRU 4 macro
85 int lru_key = LRU; in timer_cb1()
97 } else if (*key == LRU) { in timer_cb1()
100 for (i = LRU + 1; in timer_cb1()
122 if (*key != LRU) in timer_cb1()
139 int lru_key = LRU; in BPF_PROG2()
|
| /linux/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.
|
| /linux/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/Documentation/admin-guide/cgroup-v1/ |
| A D | memory.rst | 47 - pages are linked to per-memcg LRU exclusively, and there is no global LRU.
207 updated. page_cgroup has its own LRU on cgroup.
214 Some pages which are never reclaimable and will not be on the LRU
323 Per-node-per-memcgroup LRU (cgroup's private LRU) is guarded by
324 lruvec->lru_lock; the folio LRU flag is cleared before
325 isolating a page from its LRU under lruvec->lru_lock.
573 LRU list.
575 LRU list.
577 memory (LazyFree pages) on inactive LRU list.
607 recent_rotated means recent frequency of LRU rotation.
[all …]
|
| /linux/mm/damon/ |
| A D | Kconfig | 117 bool "Build DAMON-based LRU-lists sorting (DAMON_LRU_SORT)"
120 This builds the DAMON-based LRU-lists sorting subsystem. It tries to
|
| /linux/Documentation/ABI/testing/ |
| A D | sysfs-driver-xen-blkback | 16 max_persistent_grants, the LRU kicks in and starts
|
| /linux/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/tools/testing/selftests/cgroup/ |
| A D | memcg_protection.m | 63 r = alpha * c; % assume all memory is in a single LRU list
|