/openbmc/linux/Documentation/translations/zh_CN/admin-guide/mm/damon/ |
H A D | lru_sort.rst | 13 基于DAMON的LRU排序 16 基于DAMON的LRU排序是一个静态的内核模块,旨在用于以主动的、轻量级的数据访问模型 17 为基础的页面优先级处理的LRU链表上,以使得LRU上的数据访问模型更为可信。 19 哪里需要主动的LRU排序 22 在一个大型系统中,以页为粒度的访问检测会有比较显著的开销,LRU通常不会主动去排序, 24 内存压力。这导致,在有些场景下,LRU不能够完美的作为一个可信的数据访问模型,比如 28 执行DAMON_LRU_SORT让LRU变得更为可信是有益的,而且这只需要较少和可控的开销。 34 (范围内的页面在超过用户指定的时间无访问),并提高热页和降低冷页在LRU中的优先级。 63 监测或者做LRU排序。对这种情况,参考下方关于水位的描述。 80 在LRU上把这个区域标记为已访问,因些在内存压力下这部分内存不会被回收。默认为50%。 [all …]
|
H A D | reclaim.rst | 17 量级的回收。它的目的不是取代基于LRU列表的页面回收,而是有选择地用于不同程度的内存压力和要 128 它除了定期检查水位外什么都不做。在这种情况下,系统会退回到基于LRU列表的页面粒度回收逻辑。 215 DAMON_RECLAIM再次什么都不做,这样我们就可以退回到基于LRU列表的页面粒度回收了::
|
H A D | usage.rst | 222 - ``lru_prio``: 在其LRU列表上对区域进行优先排序。 223 - ``lru_deprio``: 对区域的LRU列表进行降低优先处理。
|
/openbmc/linux/Documentation/translations/zh_CN/mm/ |
H 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可移动页面。 180 对于非LRU可移动页面的测试,VM支持__PageMovable()函数。然而,它并不能保证识别 181 非LRU可移动页面,因为page->mapping字段与struct page中的其他变量是统一的。如 [all …]
|
H A D | hmm.rst | 281 ``lock_page()``锁定,与LRU隔离(如果系统内存和设备私有页不在LRU上),从进
|
H A D | hwpoison.rst | 163 复,目前只有LRU页。
|
/openbmc/linux/Documentation/admin-guide/mm/damon/ |
H A 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 …]
|
H 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
|
/openbmc/linux/Documentation/bpf/ |
H 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 230 Updating elements in LRU maps may trigger eviction behaviour when the capacity [all …]
|
H 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)"];
|
/openbmc/linux/Documentation/mm/ |
H A D | unevictable-lru.rst | 2 Unevictable LRU Infrastructure 11 This document describes the Linux memory manager's "Unevictable LRU" 24 The Unevictable LRU 27 The Unevictable LRU facility adds an additional LRU list to track unevictable 36 will spend a lot of time scanning the LRU lists looking for the small fraction 55 The Unevictable LRU Folio List 58 The Unevictable LRU folio list is a lie. It was never an LRU-ordered 59 list, but a companion to the LRU-ordered anonymous and file, active and 62 imagine it as a fifth LRU folio list. 64 The Unevictable LRU infrastructure consists of an additional, per-node, LRU list [all …]
|
H 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, 183 Searching the rmap for PTEs mapping each page on an LRU list (to test 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. [all …]
|
H A D | page_migration.rst | 66 1. Remove pages from the LRU. 89 already been removed from the LRU via isolate_lru_page() 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.
|
/openbmc/linux/tools/testing/selftests/bpf/progs/ |
H A D | timer.c | 66 #define LRU 4 macro 81 int lru_key = LRU; in timer_cb1() 93 } else if (*key == LRU) { in timer_cb1() 96 for (i = LRU + 1; in timer_cb1() 118 if (*key != LRU) in timer_cb1() 135 int lru_key = LRU; in BPF_PROG2()
|
/openbmc/linux/Documentation/admin-guide/mm/ |
H 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
|
H 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.
|
/openbmc/linux/Documentation/filesystems/caching/ |
H 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) |
|
/openbmc/openbmc/meta-openembedded/meta-python/recipes-devtools/python/ |
H A D | python3-lru-dict_1.3.0.bb | 1 DESCRIPTION = "A fixed size dict like container which evicts Least Recently Used (LRU) items once s…
|
/openbmc/linux/Documentation/admin-guide/cgroup-v1/ |
H A D | memory.rst | 47 - pages are linked to per-memcg LRU exclusively, and there is no global LRU. 193 updated. page_cgroup has its own LRU on cgroup. 200 Some pages which are never reclaimable and will not be on the LRU 220 Note: we just account pages-on-LRU because our purpose is to control amount 221 of used pages; not-on-LRU pages tend to be out-of-control from VM view. 259 The global LRU(kswapd) can swap out arbitrary pages. Swap-out means 262 affecting global LRU, memory+swap limit is better than just limiting swap from 270 caches are dropped. But as mentioned above, global LRU can do swapout memory 277 Each cgroup maintains a per cgroup LRU which has the same structure as 285 pages that are selected for reclaiming come from the per-cgroup LRU [all …]
|
/openbmc/qemu/contrib/plugins/ |
H A D | cache.c | 29 LRU, enumerator 321 case LRU: in get_replaced_block() 725 case LRU: in policy_init() 768 policy = LRU; in qemu_plugin_install() 810 policy = LRU; in qemu_plugin_install()
|
/openbmc/linux/mm/damon/ |
H 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
|
/openbmc/linux/Documentation/ABI/testing/ |
H A D | sysfs-driver-xen-blkback | 16 max_persistent_grants, the LRU kicks in and starts
|
/openbmc/linux/Documentation/gpu/rfc/ |
H 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.
|
/openbmc/linux/tools/testing/selftests/cgroup/ |
H A D | memcg_protection.m | 63 r = alpha * c; % assume all memory is in a single LRU list
|
/openbmc/linux/include/linux/ |
H A D | page-flags.h | 495 PAGEFLAG(LRU, lru, PF_HEAD) __CLEARPAGEFLAG(LRU, lru, PF_HEAD) 496 TESTCLEARFLAG(LRU, lru, PF_HEAD)
|