| /linux/Documentation/admin-guide/ |
| H A D | cgroup-v2.rst | 1 .. _cgroup-v2:
11 conventions of cgroup v2. It describes all userland-visible aspects
14 v1 is available under :ref:`Documentation/admin-guide/cgroup-v1/index.rst <cgroup-v1>`.
19 1-1. Terminology
20 1-2. What is cgroup?
22 2-1. Mounting
23 2-2. Organizing Processes and Threads
24 2-2-1. Processes
25 2-2-2. Threads
26 2-3. [Un]populated Notification
[all …]
|
| H A D | xfs.rst | 1 .. SPDX-License-Identifier: GPL-2.0
8 on the SGI IRIX platform. It is completely multi-threaded, can
15 for further details. This implementation is on-disk compatible
25 Sets the buffered I/O end-of-file preallocation size when
28 through to 1GiB, inclusive, in power-of-2 increments.
30 The default behaviour is for dynamic end-of-file
40 on-disk. When the new form is used for the first time when
42 attributes) the on-disk superblock feature bit field will be
45 The default behaviour is determined by the on-disk feature
116 Set the number of in-memory log buffers. Valid numbers
[all …]
|
| /linux/Documentation/devicetree/bindings/net/ |
| H A D | davicom,dm9051.yaml | 1 # SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
3 ---
5 $schema: http://devicetree.org/meta-schemas/core.yaml#
10 - Joseph CHANG <josright123@gmail.com>
13 The DM9051 is a fully integrated and cost-effective low pin count single
17 - $ref: ethernet-controller.yaml#
26 spi-max-frequency:
32 local-mac-address: true
34 mac-address: true
37 - compatible
[all …]
|
| /linux/Documentation/scheduler/ |
| H A D | sched-util-clamp.rst | 1 .. SPDX-License-Identifier: GPL-2.0
57 foreground, top-app, etc. Util clamp can be used to constrain how much
60 the ones belonging to the currently active app (top-app group). Beside this
65 1. The big cores are free to run top-app tasks immediately. top-app
106 Note that by design RT tasks don't have per-task PELT signal and must always
110 when an RT task wakes up. This cost is unchanged by using uclamp. Uclamp only
114 See :ref:`section 3.4 <uclamp-default-values>` for default values and
115 :ref:`3.4.1 <sched-util-clamp-min-rt-default>` on how to change RT tasks
132 frequency selection as well as task placement to be most effective. Both of
150 task on the rq to only a subset of tasks on the top-most bucket.
[all …]
|
| /linux/Documentation/admin-guide/hw-vuln/ |
| H A D | srso.rst | 1 .. SPDX-License-Identifier: GPL-2.0
8 known scenario of poisoning CPU functional units - the Branch Target
9 Buffer (BTB) and Return Address Predictor (RAP) in this case - and then
14 Return Address Stack/Return Stack Buffer). In some cases, a non-architectural
20 but the concern is that an attacker can mis-train the CPU BTB to predict
21 non-architectural CALL instructions in kernel space and use this to
23 leading to information disclosure via a speculative side-channel.
25 The issue is tracked under CVE-2023-20569.
28 -------------------
30 AMD Zen, generations 1-4. That is, all families 0x17 and 0x19. Older
[all …]
|
| /linux/Documentation/networking/ |
| H A D | msg_zerocopy.rst | 15 -----------------------
23 it replaces per byte copy cost with page accounting and completion
25 effective at writes over around 10 KB.
40 ---------
43 netdev 2.1. For more in-depth information see that paper and talk,
53 [PATCH net-next v4 0/9] socket sendmsg MSG_ZEROCOPY
54 https://lore.kernel.org/netdev/20170803202945.70750-1-willemdebruijn.kernel@gmail.com
64 ------------
77 ------------
86 A zerocopy failure will return -1 with errno ENOBUFS. This happens if
[all …]
|
| /linux/LICENSES/dual/ |
| H A D | CDDL-1.0 | 1 Valid-License-Identifier: CDDL-1.0
2 SPDX-URL: https://spdx.org/licenses/CDDL-1.0.html
3 Usage-Guide:
4 Do NOT use. The CDDL-1.0 is not GPL2 compatible. It may only be used for
5 dual-licensed files where the other license is GPL2 compatible.
11 SPDX-License-Identifier: ($GPL-COMPATIBLE-ID OR CDDL-1.0)
13 License-Text:
90 hereby grants You a world-wide, royalty-free, non-exclusive
106 effective on the date Initial Developer first distributes
121 hereby grants You a world-wide, royalty-free, non-exclusive
[all …]
|
| H A D | MPL-1.1 | 1 Valid-License-Identifier: MPL-1.1
2 SPDX-URL: https://spdx.org/licenses/MPL-1.1.html
3 Usage-Guide:
4 Do NOT use. The MPL-1.1 is not GPL2 compatible. It may only be used for
5 dual-licensed files where the other license is GPL2 compatible.
11 SPDX-License-Identifier: MPL-1.1
12 License-Text:
17 ---------------
81 appropriate decompression or de-archiving software is widely available
98 The Initial Developer hereby grants You a world-wide, royalty-free,
[all …]
|
| /linux/block/ |
| H A D | blk-iocost.c | 1 /* SPDX-License-Identifier: GPL-2.0
3 * IO cost model based controller.
10 * observable cost metric. This is distinguished from CPU and memory where
17 * useless for the purpose of IO capacity distribution. While on-device
19 * non-queued rotational devices, this is no longer viable with modern
22 * While there is no cost metric we can trivially observe, it isn't a
23 * complete mystery. For example, on a rotational device, seek cost
27 * implement a reasonable work-conserving proportional IO resource
30 * 1. IO Cost Model
32 * IO cost model estimates the cost of an IO given its basic parameters and
[all …]
|
| /linux/rust/kernel/ |
| H A D | task.rs | 1 // SPDX-License-Identifier: GPL-2.0
34 // SAFETY: Deref + addr-of below create a temporary `TaskRef` that cannot outlive the
44 // SAFETY: Deref + addr-of below create a temporary `PidNamespaceRef` that cannot outlive
61 /// The following is an example of getting the PID of the current thread with zero additional cost
68 /// Getting the PID of the current process, also zero additional cost:
86 /// fn new() -> Self {
122 pub fn current_raw() -> *mut bindings::task_struct { in current_raw()
135 pub unsafe fn current() -> impl Deref<Target = Task> { in current()
144 fn deref(&self) -> &Self::Target { in current()
169 pub unsafe fn current_pid_ns() -> impl Deref<Target = PidNamespace> { in current_pid_ns()
[all …]
|
| /linux/arch/powerpc/kvm/ |
| H A D | book3s_64_entry.S | 1 /* SPDX-License-Identifier: GPL-2.0-only */
3 #include <asm/asm-offsets.h>
5 #include <asm/code-patching-asm.h>
6 #include <asm/exception-64s.h>
13 #include <asm/ultravisor-api.h>
16 * These are branched to from interrupt handlers in exception-64s.S which set
17 * IKVM_REAL or IKVM_VIRT, if HSTATE_IN_GUEST was found to be non-zero.
24 * This may also be a syscall from PR-KVM userspace that is to be
28 * and CR0, so PR-KVM can not support a guest kernel that preserves
53 * guest R9-R13, CTR, CFAR, PPR saved in PACA EX_xxx save area
[all …]
|
| /linux/init/ |
| H A D | Kconfig | 1 # SPDX-License-Identifier: GPL-2.0-only
8 - Re-run Kconfig when the compiler is updated
13 - Ensure full rebuild when the compiler is updated
14 include/linux/compiler-version.h contains this option in the comment
16 auto-generated dependency. When the compiler is updated, syncconfig
20 def_bool $(success,test "$(cc-name)" = GCC)
24 default $(cc-version) if CC_IS_GCC
28 def_bool $(success,test "$(cc-name)" = Clang)
32 default $(cc-version) if CC_IS_CLANG
36 def_bool $(success,test "$(as-name)" = GNU)
[all …]
|
| /linux/Documentation/admin-guide/sysctl/ |
| H A D | vm.rst | 13 ------------------------------------------------------------------------------
27 - admin_reserve_kbytes
28 - compact_memory
29 - compaction_proactiveness
30 - compact_unevictable_allowed
31 - dirty_background_bytes
32 - dirty_background_ratio
33 - dirty_bytes
34 - dirty_expire_centisecs
35 - dirty_ratio
[all …]
|
| /linux/include/linux/ |
| H A D | gfp_types.h | 1 /* SPDX-License-Identifier: GPL-2.0 */
10 * typedef gfp_t - Memory allocation flags.
23 * include/trace/events/mmflags.h and tools/perf/builtin-kmem.c
108 * Physical address zone modifiers (see linux/mmzone.h - low four bits)
124 * ---------------------------------
159 * Watermark modifiers -- controls access to emergency reserves
160 * ------------------------------------------------------------
162 * %__GFP_HIGH indicates that the caller is high-priority and that granting
170 * be the MM or co-ordinating closely with the VM (e.g. swap over NFS).
174 * Usage of a pre-allocated pool (e.g. mempool) should be always considered
[all …]
|
| H A D | zstd_lib.h | 5 * This source code is licensed under both the BSD-style license (found in the
8 * You may select, at your option, one of the above-listed licenses.
36 real-time compression scenarios at zlib-level and better compression ratios.
37 The zstd compression library provides in-memory compression and decompression
41 which is currently 22. Levels >= 20, labeled `--ultra`, should be used with
44 The lower the level, the faster the speed (at the cost of compression).
47 - a single step (described as Simple API)
48 - a single step, reusing a context (described as Explicit context)
49 - unbounded multiple steps (described as Streaming compression)
53 - a single step (described as Simple dictionary API)
[all …]
|
| H A D | cgroup-defs.h | 1 /* SPDX-License-Identifier: GPL-2.0 */
3 * linux/cgroup-defs.h - basic definitions for cgroup
18 #include <linux/percpu-refcount.h>
19 #include <linux/percpu-rwsem.h>
22 #include <linux/bpf-cgroup-defs.h>
52 CSS_ONLINE = (1 << 1), /* between ->css_online() and ->css_offline() */
76 /* cgroup_root->flags */
127 /* cftype->flags */
146 * be obtained by setting cftype->file_offset.
156 * Per-subsystem/per-cgroup state maintained by the system. This is the
[all …]
|
| /linux/kernel/cgroup/ |
| H A D | cpuset.c | 7 * Copyright (C) 2004-2007 Silicon Graphics, Inc.
11 * sysfs is Copyright (c) 2001-3 Patrick Mochel
13 * 2003-10-10 Written by Simon Derr.
14 * 2003-10-22 Updates by Stephen Hemminger.
15 * 2004 May-July Rework by Paul Jackson.
24 #include "cgroup-internal.h"
25 #include "cpuset-internal.h"
50 * node binding, add this key to provide a quick low-cost judgment
68 * Exclusive CPUs distributed out to sub-partitions of top_cpuset
89 * - update_partition_sd_lb()
[all …]
|
| /linux/tools/perf/bench/ |
| H A D | epoll-wait.c | 1 // SPDX-License-Identifier: GPL-2.0
11 * |---> [worker A]
12 * |---> [worker B]
13 * [combined queue] .-
[all...] |
| /linux/Documentation/userspace-api/ |
| H A D | dma-buf-alloc-exchange.rst | 1 .. SPDX-License-Identifier: GPL-2.0
2 .. Copyright 2021-2023 Collabora Ltd.
9 support for sharing pixel-buffer allocations between processes, devices, and
12 approach this sharing for two-dimensional image data.
25 Conceptually a two-dimensional array of pixels. The pixels may be stored
30 A span along a single y-axis value, e.g. from co-ordinates (0,100) to
37 A span along a single x-axis value, e.g. from co-ordinates (100,0) to
46 A two-dimensional array of some or all of an image's color and alpha
80 A value that denotes the relationship between pixel-location co-ordinates
81 and byte-offset values. Typically used as the byte offset between two
[all …]
|
| /linux/drivers/media/pci/tw5864/ |
| H A D | tw5864-reg.h | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
3 * TW5864 driver - registers description
8 /* According to TW5864_datasheet_0.6d.pdf, tw5864b1-ds.pdf */
10 /* Register Description - Direct Map Space */
11 /* 0x0000 ~ 0x1ffc - H264 Register Map */
76 * 0->3 4 VLC data buffer in DDR (1M each)
77 * 0->7 8 VLC data buffer in DDR (512k each)
147 /* DDR-DPR Burst Read Enable */
157 * 0 Single R/W Access (Host <-> DDR)
158 * 1 Burst R/W Access (Host <-> DPR)
[all …]
|
| /linux/lib/crypto/ |
| H A D | aesgcm.c | 1 // SPDX-License-Identifier: GPL-2.0
22 * In AES-GCM, both the GHASH key derivation and the CTR mode in aesgcm_encrypt_block()
25 * mitigates this risk to some extent by pulling the entire S-box into in aesgcm_encrypt_block()
27 * effective when running with interrupts disabled. in aesgcm_encrypt_block()
35 * aesgcm_expandkey - Expands the AES and GHASH keys for the AES-GCM key
38 * @ctx: The data structure that will hold the AES-GCM key schedule
43 * Returns: 0 on success, or -EINVA
[all...] |
| /linux/Documentation/filesystems/ |
| H A D | fscrypt.rst | 2 Filesystem-level encryption (fscrypt)
11 Note: "fscrypt" in this document refers to the kernel-level portion,
14 covers the kernel-level portion. For command-line examples of how to
20 <https://source.android.com/security/encryption/file-based>`_, over
25 Unlike dm-crypt, fscrypt operates at the filesystem level rather than
28 filesystem. This is useful for multi-user systems where each user's
29 data-at-rest needs to be cryptographically isolated from the others.
34 directly into supported filesystems --- currently ext4, F2FS, UBIFS,
44 fscrypt does not support encrypting files in-place. Instead, it
54 ---------------
[all …]
|
| /linux/Documentation/RCU/ |
| H A D | whatisRCU.rst | 3 What is RCU? -- "Read, Copy, Update"
21 …ries: Fundamentals https://www.linuxfoundation.org/webinars/unraveling-rcu-usage-mysteries
22 …Cases https://www.linuxfoundation.org/webinars/unraveling-rcu-usage-mysteries-additional-use-cases
28 during the 2.5 development effort that is optimized for read-mostly
29 situations. Although RCU is actually quite simple, making effective use
47 :ref:`6. ANALOGY WITH READER-WRITER LOCKING <6_whatisRCU>`
67 everything, feel free to read the whole thing -- but if you are really
69 never need this document anyway. ;-)
74 ----------------
103 b. Wait for all previous readers to complete their RCU read-side
[all …]
|
| /linux/Documentation/core-api/ |
| H A D | workqueue.rst | 33 thread system-wide. A single MT wq needed to keep around the same
60 * Use per-CPU unified worker pools shared by all wq to provide
85 worker-pools.
87 The cmwq design differentiates between the user-facing workqueues that
89 which manages worker-pools and processes the queued work items.
91 There are two worker-pools, one for normal work items and the other
93 worker-pools to serve work items queued on unbound workqueues - the
98 Each per-CPU BH worker pool contains only one pseudo worker which represents
110 When a work item is queued to a workqueue, the target worker-pool is
112 and appended on the shared worklist of the worker-pool. For example,
[all …]
|
| /linux/Documentation/admin-guide/pm/ |
| H A D | cpufreq.rst | 1 .. SPDX-License-Identifier: GPL-2.0
20 Operating Performance Points or P-states (in ACPI terminology). As a rule,
24 time (or the more power is drawn) by the CPU in the given P-state. Therefore
29 as possible and then there is no reason to use any P-states different from the
30 highest one (i.e. the highest-performance frequency/voltage configuration
38 put into different P-states.
41 capacity, so as to decide which P-states to put the CPUs into. Of course, since
64 information on the available P-states (or P-state ranges in some cases) and
65 access platform-specific hardware interfaces to change CPU P-states as requested
70 performance scaling algorithms for P-state selection can be represented in a
[all …]
|