Searched +full:page +full:- +full:based (Results 1 – 25 of 206) sorted by relevance
123456789
| /Documentation/dev-tools/ |
| D | kasan.rst | 1 .. SPDX-License-Identifier: GPL-2.0
8 --------
11 designed to find out-of-bounds and use-after-free bugs.
16 2. Software Tag-Based KASAN
17 3. Hardware Tag-Based KASAN
23 Software Tag-Based KASAN or SW_TAGS KASAN, enabled with CONFIG_KASAN_SW_TAGS,
26 using it for testing on memory-restricted devices with real workloads.
28 Hardware Tag-Based KASAN or HW_TAGS KASAN, enabled with CONFIG_KASAN_HW_TAGS,
29 is the mode intended to be used as an in-field memory bug detector or as a
37 The Generic and the Software Tag-Based modes are commonly referred to as the
[all …]
|
| D | kfence.rst | 1 .. SPDX-License-Identifier: GPL-2.0
4 Kernel Electric-Fence (KFENCE)
7 Kernel Electric-Fence (KFENCE) is a low-overhead sampling-based memory safety
8 error detector. KFENCE detects heap out-of-bounds access, use-after-free, and
9 invalid-free errors.
15 non-production test workloads. One way to quickly achieve a large enough total
19 -----
26 ``kfence.sample_interval`` to non-zero value), configure the kernel with::
46 causes CPU wake-ups when the system is completely idle. This may be undesirable
47 on power-constrained systems. The boot parameter ``kfence.deferrable=1``
[all …]
|
| /Documentation/mm/ |
| D | multigen_lru.rst | 1 .. SPDX-License-Identifier: GPL-2.0
4 Multi-Gen LRU
6 The multi-gen LRU is an alternative LRU implementation that optimizes
7 page reclaim and improves performance under memory pressure. Page
14 ----------
20 * Simple self-correcting heuristics
23 implementations. In the multi-gen LRU, each generation represents a
25 (time-based) common frame of reference and therefore help make better
30 accessed bit. A rmap walk targets a single page and does not try to
31 profit from discovering a young PTE. A page table walk can sweep all
[all …]
|
| D | hugetlbfs_reserv.rst | 8 Huge pages as described at Documentation/admin-guide/mm/hugetlbpage.rst are
10 in a task's address space at page fault time if the VMA indicates huge pages
11 are to be used. If no huge page exists at page fault time, the task is sent
12 a SIGBUS and often dies an unhappy death. Shortly after huge page support
20 available for page faults in that mapping. The description below attempts to
21 describe how huge page reserve processing is done in the v4.10 kernel.
34 This is a global (per-hstate) count of reserved huge pages. Reserved
37 as (``free_huge_pages - resv_huge_pages``).
50 There is one reserve map for each huge page mapping in the system.
60 The 'from' and 'to' fields of the file region structure are huge page
[all …]
|
| D | balance.rst | 13 overhead of page reclaim. This may happen for opportunistic high-order
14 allocation requests that have order-0 fallback options. In such cases,
20 to be doing balancing. Page reclamation can be kicked off lazily, that
32 In 2.2, memory balancing/page reclamation would kick off only when the
65 for non-sleepable allocations. Second, the HIGHMEM zone is also balanced,
67 HIGHMEM page, as well as to ensure that HIGHMEM allocations do not
69 are not leaked (for example, in situations where a HIGHMEM page is in
80 Page stealing from process memory and shm is done if stealing the page would
81 alleviate memory pressure on any zone in the page's node that has fallen below
85 are per-zone fields, used to determine when a zone needs to be balanced. When
[all …]
|
| D | highmem.rst | 30 +--------+ 0xffffffff
32 +--------+ 0xc0000000
36 +--------+ 0x00000000
39 time, but because we need virtual address space for other things - including
40 temporary maps to access the rest of the physical memory - the actual direct
54 * kmap_local_page(), kmap_local_folio() - These functions are used to create
58 to a struct page and the second taking a pointer to struct folio and the byte
59 offset within the folio which identifies the page.
64 These mappings are thread-local and CPU-local, meaning that the mapping
68 CPU-hotplug until the mapping is disposed.
[all …]
|
| /Documentation/virt/hyperv/ |
| D | clocks.rst | 1 .. SPDX-License-Identifier: GPL-2.0
7 -----
8 On arm64, Hyper-V virtualizes the ARMv8 architectural system counter
12 architectural system counter is functional in guest VMs on Hyper-V.
13 While Hyper-V also provides a synthetic system clock and four synthetic
14 per-CPU timers as described in the TLFS, they are not used by the
15 Linux kernel in a Hyper-V guest on arm64. However, older versions
16 of Hyper-V for arm64 only partially virtualize the ARMv8
19 Linux kernel versions on these older Hyper-V versions requires an
20 out-of-tree patch to use the Hyper-V synthetic clocks/timers instead.
[all …]
|
| D | overview.rst | 1 .. SPDX-License-Identifier: GPL-2.0
6 enlightened guest on Microsoft's Hyper-V hypervisor. Hyper-V
7 consists primarily of a bare-metal hypervisor plus a virtual machine
10 partitions. In this documentation, references to Hyper-V usually
15 Hyper-V runs on x86/x64 and arm64 architectures, and Linux guests
16 are supported on both. The functionality and behavior of Hyper-V is
19 Linux Guest Communication with Hyper-V
20 --------------------------------------
21 Linux guests communicate with Hyper-V in four different ways:
24 some guest actions trap to Hyper-V. Hyper-V emulates the action and
[all …]
|
| /Documentation/admin-guide/mm/ |
| D | numa_memory_policy.rst | 10 supported platforms with Non-Uniform Memory Access architectures since 2.4.?.
16 (``Documentation/admin-guide/cgroup-v1/cpusets.rst``)
19 programming interface that a NUMA-aware application can take advantage of. When
28 ------------------------
35 that governs all page allocations that aren't controlled by
41 not to overload the initial boot node with boot-time
45 this is an optional, per-task policy. When defined for a
46 specific task, this policy controls all page allocations made
49 all page allocations that would have been controlled by the
61 In a multi-threaded task, task policies apply only to the thread
[all …]
|
| D | idle_page_tracking.rst | 2 Idle Page Tracking
8 The idle page tracking feature allows to track which memory pages are being
21 The idle page tracking API is located at ``/sys/kernel/mm/page_idle``.
22 Currently, it consists of the only read-write file,
25 The file implements a bitmap where each bit corresponds to a memory page. The
26 bitmap is represented by an array of 8-byte integers, and the page at PFN #i is
28 set, the corresponding page is idle.
30 A page is considered idle if it has not been accessed since it was marked idle
33 To mark a page idle one has to set the bit corresponding to
34 the page by writing to the file. A value written to the file is OR-ed with the
[all …]
|
| D | ksm.rst | 8 KSM is a memory-saving de-duplication feature, enabled by CONFIG_KSM=y,
19 content which can be replaced by a single write-protected page (which
47 may suddenly require more memory than is available - possibly failing
48 with EAGAIN, but more probably arousing the Out-Of-Memory killer.
60 will exceed ``vm.max_map_count`` (see Documentation/admin-guide/sysctl/vm.rst).
84 been set to scan-time.
123 empty pages are merged with the kernel zero page(s) instead of
130 page. This setting can be changed at any time, it is only
136 Maximum sharing allowed for each KSM page. This enforces a
139 share the KSM page. The minimum value is 2 as a newly created
[all …]
|
| D | zswap.rst | 10 dynamically allocated RAM-based memory pool. zswap basically trades CPU cycles
11 for potentially reduced swap I/O. This trade-off can also result in a
24 drastically reducing life-shortening writes.
68 The zbud type zpool allocates exactly 1 page to store 2 compressed pages, which
69 means the compression ratio will always be 2:1 or worse (because of half-full
70 zbud pages). The zsmalloc type zpool has a more complex compressed page
73 When a swap page is passed from swapout to zswap, zswap maintains a mapping
75 handle that references that compressed swap page. This mapping is achieved
76 with a red-black tree per swap type. The swap offset is the search key for the
79 During a page fault on a PTE that is a swap entry, the swapin code calls the
[all …]
|
| D | multigen_lru.rst | 1 .. SPDX-License-Identifier: GPL-2.0
4 Multi-Gen LRU
6 The multi-gen LRU is an alternative LRU implementation that optimizes
7 page reclaim and improves performance under memory pressure. Page
26 -----------
38 0x0001 The main switch for the multi-gen LRU.
39 0x0002 Clearing the accessed bit in leaf page table entries in large
42 disabled, the multi-gen LRU will suffer a minor performance
46 0x0004 Clearing the accessed bit in non-leaf page table entries as
49 disabled, the multi-gen LRU will suffer a negligible
[all …]
|
| /Documentation/mm/damon/ |
| D | faq.rst | 1 .. SPDX-License-Identifier: GPL-2.0
16 Nonetheless, DAMON provides vma/rmap tracking and PTE Accessed bit check based
21 Can I simply monitor page granularity?
25 working set size divided by the page size. Because the monitoring target
26 regions size is forced to be ``>=page size``, the region split will make no
|
| D | design.rst | 1 .. SPDX-License-Identifier: GPL-2.0
13 The monitoring-related information including the monitoring request
14 specification and DAMON-based operation schemes are stored in a data structure
19 To know how user-space can do the configurations and start/stop DAMON, refer to
28 - :ref:`Operations Set <damon_operations_set>`: Implements fundamental
30 address-space and available set of software/hardware primitives,
31 - :ref:`Core <damon_core_logic>`: Implements core logics including monitoring
32 overhead/accuracy control and access-aware system operations on top of the
34 - :ref:`Modules <damon_modules>`: Implements kernel modules for various
49 monitoring are address-space dependent.
[all …]
|
| /Documentation/driver-api/ |
| D | mtdnand.rst | 10 The generic NAND driver supports almost all NAND and AG-AND based chips
31 --------------------------
37 - [MTD Interface]
43 - [NAND Interface]
48 - [GENERIC]
53 - [DEFAULT]
65 -------------------------------
71 - [INTERN]
77 - [REPLACEABLE]
86 - [BOARDSPECIFIC]
[all …]
|
| /Documentation/virt/kvm/x86/ |
| D | msr.rst | 1 .. SPDX-License-Identifier: GPL-2.0
4 KVM-specific MSRs
16 ---------------
24 4-byte alignment physical address of a memory area which must be
42 An odd version indicates an in-progress update.
53 Note that although MSRs are per-CPU entities, the effect of this
63 4-byte aligned physical address of a memory area which must be in
80 updates of this structure is arbitrary and implementation-dependent.
89 An odd version indicates an in-progress update.
104 tsc-related quantity to nanoseconds
[all …]
|
| D | mmu.rst | 1 .. SPDX-License-Identifier: GPL-2.0
13 - correctness:
18 - security:
21 - performance:
23 - scaling:
25 - hardware:
27 - integration:
29 so that swapping, page migration, page merging, transparent
31 - dirty tracking:
33 and framebuffer-based displays
[all …]
|
| /Documentation/arch/x86/ |
| D | intel_txt.rst | 6 Technology (Intel(R) TXT), defines platform-level enhancements that
13 - Provides dynamic root of trust for measurement (DRTM)
14 - Data protection in case of improper shutdown
15 - Measurement and verification of launched environment
18 non-vPro systems. It is currently available on desktop systems
19 based on the Q35, X38, Q45, and Q43 Express chipsets (e.g. Dell
20 Optiplex 755, HP dc7800, etc.) and mobile systems based on the GM45,
30 - LinuxTAG 2008:
31 http://www.linuxtag.org/2008/en/conf/events/vp-donnerstag.html
33 - TRUST2008:
[all …]
|
| /Documentation/fb/ |
| D | deferred_io.rst | 10 - userspace app like Xfbdev mmaps framebuffer
11 - deferred IO and driver sets up fault and page_mkwrite handlers
12 - userspace app tries to write to mmapped vaddress
13 - we get pagefault and reach fault handler
14 - fault handler finds and returns physical page
15 - we get page_mkwrite where we add this page to a list
16 - schedule a workqueue task to be run after a delay
17 - app continues writing to that page with no additional cost. this is
19 - the workqueue task comes in and mkcleans the pages on the list, then
22 - app tries to write to the address (that has now been mkcleaned)
[all …]
|
| /Documentation/w1/slaves/ |
| D | w1_ds2423.rst | 6 * Maxim DS2423 based counter devices.
17 -----------
21 available in DS2423 pages 12 - 15.
23 Result of each page is provided as an ASCII output where each counter
27 memory page along the crc=YES or NO for indicating whether the read operation
34 - 1 byte from ram page
35 - 4 bytes for the counter value
36 - 4 zero bytes
37 - 2 bytes for crc16 which was calculated from the data read since the previous crc bytes
38 - 31 remaining bytes from the ram page
[all …]
|
| /Documentation/admin-guide/cgroup-v1/ |
| D | memory.rst | 18 we call it "memory cgroup". When you see git-log and source code, you'll
30 Memory-hungry applications can be isolated and limited to a smaller
42 Current Status: linux-2.6.34-mmotm(development version of 2010/April)
46 - accounting anonymous pages, file caches, swap caches usage and limiting them.
47 - pages are linked to per-memcg LRU exclusively, and there is no global LRU.
48 - optionally, memory+swap usage can be accounted and limited.
49 - hierarchical accounting
50 - soft limit
51 - moving (recharging) account at moving a task is selectable.
52 - usage threshold notifier
[all …]
|
| /Documentation/userspace-api/ |
| D | iommufd.rst | 1 .. SPDX-License-Identifier: GPL-2.0+
14 IO page tables from userspace using file descriptors. It intends to be general
20 I/O page tables for all IOMMUs, with room in the design to add non-generic
31 --------------------
35 - IOMMUFD_OBJ_IOAS, representing an I/O address space (IOAS), allowing map/unmap
41 - IOMMUFD_OBJ_DEVICE, representing a device that is bound to iommufd by an
44 - IOMMUFD_OBJ_HW_PAGETABLE, representing an actual hardware I/O page table
50 All user-visible objects are destroyed via the IOMMU_DESTROY uAPI.
52 The diagram below shows relationship between user-visible objects and kernel
68 | | IOAS |<--| |<------| | |
[all …]
|
| /Documentation/hwmon/ |
| D | pmbus-core.rst | 9 power-management protocol with a fully defined command language that facilitates
11 protocol is implemented over the industry-standard SMBus serial interface and
12 enables programming, control, and real-time monitoring of compliant power
14 communication between devices based on both analog and digital technologies, and
18 promoted by the PMBus Implementers Forum (PMBus-IF), comprising 30+ adopters
22 commands, and manufacturers can add as many non-standard commands as they like.
23 Also, different PMBUs devices act differently if non-supported commands are
43 PMBus device capabilities auto-detection
46 For generic PMBus devices, code in pmbus.c attempts to auto-detect all supported
47 PMBus commands. Auto-detection is somewhat limited, since there are simply too
[all …]
|
| /Documentation/admin-guide/mm/damon/ |
| D | reclaim.rst | 1 .. SPDX-License-Identifier: GPL-2.0
4 DAMON-based Reclamation
7 DAMON-based Reclamation (DAMON_RECLAIM) is a static kernel module that aimed to
9 It doesn't aim to replace the LRU-list based page_granularity reclamation, but
15 On general memory over-committed systems, proactively reclaiming cold pages
20 Free Pages Reporting [3]_ based memory over-commit virtualization systems are
24 guests could be not so memory-frugal, mainly because some kernel subsystems and
25 user-space applications are designed to use as much memory as available. Then,
34 duration and page out. To avoid it consuming too much CPU for the paging out
54 -------
[all …]
|
123456789