| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/misc/ |
| D | intel,ixp4xx-ahb-queue-manager.yaml | 1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause)
4 ---
5 $id: "http://devicetree.org/schemas/misc/intel,ixp4xx-ahb-queue-manager.yaml#"
6 $schema: "http://devicetree.org/meta-schemas/core.yaml#"
8 title: Intel IXP4xx AHB Queue Manager
11 - Linus Walleij <linus.walleij@linaro.org>
14 The IXP4xx AHB Queue Manager maintains queues as circular buffers in
18 queues from the queue manager with foo-queue = <&qmgr N> where the
19 &qmgr is a phandle to the queue manager and N is the queue resource
20 number. The queue resources available and their specific purpose
[all …]
|
| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/misc/ |
| D | intel,ixp4xx-ahb-queue-manager.yaml | 1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause)
4 ---
5 $id: http://devicetree.org/schemas/misc/intel,ixp4xx-ahb-queue-manager.yaml#
6 $schema: http://devicetree.org/meta-schemas/core.yaml#
8 title: Intel IXP4xx AHB Queue Manager
11 - Linus Walleij <linus.walleij@linaro.org>
14 The IXP4xx AHB Queue Manager maintains queues as circular buffers in
18 queues from the queue manager with foo-queue = <&qmgr N> where the
19 &qmgr is a phandle to the queue manager and N is the queue resource
20 number. The queue resources available and their specific purpose
[all …]
|
| /kernel/linux/linux-6.6/rust/macros/ |
| D | lib.rs | 1 // SPDX-License-Identifier: GPL-2.0
43 /// fn init() -> Result<Self> {
59 /// - `type`: type which implements the [`Module`] trait (required).
60 /// - `name`: byte array of the name of the kernel module (required).
61 /// - `author`: byte array of the author of the kernel module.
62 /// - `description`: byte array of the description of the kernel module.
63 /// - `license`: byte array of the license of the kernel module (required).
64 /// - `alias`: byte array of alias name of the kernel module.
66 pub fn module(ts: TokenStream) -> TokenStream { in module()
74 /// default implementation for all non-required methods (and the default
[all …]
|
| /kernel/linux/linux-6.6/tools/bpf/bpftool/Documentation/ |
| D | bpftool-map.rst | 1 .. SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
4 bpftool-map
6 -------------------------------------------------------------------------------
8 -------------------------------------------------------------------------------
19 *OPTIONS* := { |COMMON_OPTIONS| | { **-f** | **--bpffs** } | { **-n** | **--nomount** } }
57 | | **queue** | **stack** | **sk_storage** | **struct_ops** | **ringbuf** | **inode_storage**
84 To create maps of type array-of-maps or hash-of-maps, the
142 Peek next value in the queue or stack.
151 Enqueue *VALUE* into the queue.
154 Dequeue and print value from the queue.
[all …]
|
| /kernel/linux/linux-5.10/tools/bpf/bpftool/Documentation/ |
| D | bpftool-map.rst | 2 bpftool-map
4 -------------------------------------------------------------------------------
6 -------------------------------------------------------------------------------
15 *OPTIONS* := { { **-j** | **--json** } [{ **-p** | **--pretty** }] | { **-f** | **--bpffs** } }
53 | | **queue** | **stack** | **sk_storage** | **struct_ops** | **ringbuf** | **inode_storage** }
79 To create maps of type array-of-maps or hash-of-maps, the
137 Peek next value in the queue or stack.
146 Enqueue *VALUE* into the queue.
149 Dequeue and print value from the queue.
152 Freeze the map as read-only from user space. Entries from a
[all …]
|
| /kernel/linux/linux-5.10/tools/perf/Documentation/ |
| D | perf-config.txt | 1 perf-config(1)
5 ----
6 perf-config - Get and set variables in a configuration file.
9 --------
11 'perf config' [<file-option>] [section.name[=value] ...]
13 'perf config' [<file-option>] -l | --list
16 -----------
20 -------
22 -l::
23 --list::
[all …]
|
| /kernel/linux/linux-6.6/tools/perf/Documentation/ |
| D | perf-config.txt | 1 perf-config(1)
5 ----
6 perf-config - Get and set variables in a configuration file.
9 --------
11 'perf config' [<file-option>] [section.name[=value] ...]
13 'perf config' [<file-option>] -l | --list
16 -----------
20 -------
22 -l::
23 --list::
[all …]
|
| /kernel/linux/linux-6.6/drivers/net/wireless/ath/ |
| D | ath.h | 2 * Copyright (c) 2008-2009 Atheros Communications Inc.
30 * and station state to short-circuit node lookups on rx.
119 * struct ath_ops - Register read/write operations
195 return common->ps_ops; in ath_ps_ops()
234 * enum ath_debug_level - atheros wireless debug level
237 * @ATH_DBG_QUEUE: hardware queue management
252 * used exclusively for WLAN-BT coexistence starting from
262 * modifying debug level states -- but this is typically done through a
298 if ((common)->debug_mask & ATH_DBG_##dbg_mask) \
302 #define ATH_DBG_WARN(foo, arg...) WARN(foo, arg) argument
[all …]
|
| /kernel/linux/linux-5.10/drivers/net/wireless/ath/ |
| D | ath.h | 2 * Copyright (c) 2008-2009 Atheros Communications Inc.
30 * and station state to short-circuit node lookups on rx.
119 * struct ath_ops - Register read/write operations
193 return common->ps_ops; in ath_ps_ops()
232 * enum ath_debug_level - atheros wireless debug level
235 * @ATH_DBG_QUEUE: hardware queue management
250 * used exclusively for WLAN-BT coexistence starting from
260 * modifying debug level states -- but this is typically done through a
296 if ((common)->debug_mask & ATH_DBG_##dbg_mask) \
300 #define ATH_DBG_WARN(foo, arg...) WARN(foo, arg) argument
[all …]
|
| /kernel/linux/linux-6.6/tools/testing/selftests/tc-testing/tc-tests/qdiscs/ |
| D | fifo.json | 5 …"__comment": "When omitted, queue size in bfifo is calculated as: txqueuelen * (MTU + LinkLayerHdr…
16 "matchPattern": "qdisc bfifo 1: root.*limit [0-9]+b",
26 …"__comment": "When omitted, queue size in pfifo is defaulted to the interface's txqueuelen value.",
37 "matchPattern": "qdisc pfifo 1: root.*limit [0-9]+p",
57 "matchPattern": "qdisc bfifo ffff: root.*limit [0-9]+b",
66 "name": "Add bfifo qdisc on egress with queue size of 3000 bytes",
86 "name": "Add pfifo qdisc on egress with queue size of 3000 packets",
117 "matchPattern": "qdisc bfifo 10000: root.*limit [0-9]+b",
163 "name": "Replace bfifo qdisc on egress with new queue size",
185 "name": "Replace pfifo qdisc on egress with new queue size",
[all …]
|
| /kernel/linux/linux-5.10/tools/testing/selftests/tc-testing/tc-tests/qdiscs/ |
| D | fifo.json | 5 …"__comment": "When omitted, queue size in bfifo is calculated as: txqueuelen * (MTU + LinkLayerHdr…
16 "matchPattern": "qdisc bfifo 1: root.*limit [0-9]+b",
26 …"__comment": "When omitted, queue size in pfifo is defaulted to the interface's txqueuelen value.",
37 "matchPattern": "qdisc pfifo 1: root.*limit [0-9]+p",
57 "matchPattern": "qdisc bfifo ffff: root.*limit [0-9]+b",
66 "name": "Add bfifo qdisc on egress with queue size of 3000 bytes",
86 "name": "Add pfifo qdisc on egress with queue size of 3000 packets",
117 "matchPattern": "qdisc bfifo 10000: root.*limit [0-9]+b",
163 "name": "Replace bfifo qdisc on egress with new queue size",
185 "name": "Replace pfifo qdisc on egress with new queue size",
[all …]
|
| /kernel/linux/linux-5.10/Documentation/power/ |
| D | runtime_pm.rst | 5 (C) 2009-2011 Rafael J. Wysocki <rjw@sisk.pl>, Novell Inc.
18 put their PM-related work items. It is strongly recommended that pm_wq be
20 them to be synchronized with system-wide power transitions (suspend to RAM,
53 The ->runtime_suspend(), ->runtime_resume() and ->runtime_idle() callbacks
57 1. PM domain of the device, if the device's PM domain object, dev->pm_domain,
60 2. Device type of the device, if both dev->type and dev->type->pm are present.
62 3. Device class of the device, if both dev->class and dev->class->pm are
65 4. Bus type of the device, if both dev->bus and dev->bus->pm are present.
69 dev->driver->pm directly (if present).
73 and bus type. Moreover, the high-priority one will always take precedence over
[all …]
|
| /kernel/linux/linux-6.6/Documentation/filesystems/ |
| D | inotify.rst | 1 .. SPDX-License-Identifier: GPL-2.0
4 Inotify - A Powerful yet Simple File Change Notification System
13 - Deleted obsoleted interface, just refer to manpages for user interface.
29 What is the design decision behind using an-fd-per-instance as opposed to
30 an fd-per-watch?
33 An fd-per-watch quickly consumes more file descriptors than are allowed,
35 select()-able. Yes, root can bump the per-process fd limit and yes, users
38 spaces is thus sensible. The current design is what user-space developers
41 thousand times is silly. If we can implement user-space's preferences
42 cleanly--and we can, the idr layer makes stuff like this trivial--then we
[all …]
|
| /kernel/linux/linux-5.10/Documentation/filesystems/ |
| D | inotify.rst | 1 .. SPDX-License-Identifier: GPL-2.0
4 Inotify - A Powerful yet Simple File Change Notification System
13 - Deleted obsoleted interface, just refer to manpages for user interface.
29 What is the design decision behind using an-fd-per-instance as opposed to
30 an fd-per-watch?
33 An fd-per-watch quickly consumes more file descriptors than are allowed,
35 select()-able. Yes, root can bump the per-process fd limit and yes, users
38 spaces is thus sensible. The current design is what user-space developers
41 thousand times is silly. If we can implement user-space's preferences
42 cleanly--and we can, the idr layer makes stuff like this trivial--then we
[all …]
|
| /kernel/linux/linux-6.6/Documentation/power/ |
| D | runtime_pm.rst | 5 (C) 2009-2011 Rafael J. Wysocki <rjw@sisk.pl>, Novell Inc.
18 put their PM-related work items. It is strongly recommended that pm_wq be
20 them to be synchronized with system-wide power transitions (suspend to RAM,
53 The ->runtime_suspend(), ->runtime_resume() and ->runtime_idle() callbacks
57 1. PM domain of the device, if the device's PM domain object, dev->pm_domain,
60 2. Device type of the device, if both dev->type and dev->type->pm are present.
62 3. Device class of the device, if both dev->class and dev->class->pm are
65 4. Bus type of the device, if both dev->bus and dev->bus->pm are present.
69 dev->driver->pm directly (if present).
73 and bus type. Moreover, the high-priority one will always take precedence over
[all …]
|
| /kernel/linux/linux-6.6/net/unix/ |
| D | garbage.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
13 * - object w/ a bit
14 * - free list
18 * - explicit stack instead of recursion
19 * - tail recurse on first born instead of immediate push/pop
20 * - we gather the stuff that should not be killed into tree
25 * - don't just push entire root set; process in place
32 * of foo to bar and vice versa. Current code chokes on that.
38 * upon the beginning and unmark non-junk ones.
56 * parents (->gc_tree).
[all …]
|
| /kernel/linux/linux-5.10/net/unix/ |
| D | garbage.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
13 * - object w/ a bit
14 * - free list
18 * - explicit stack instead of recursion
19 * - tail recurse on first born instead of immediate push/pop
20 * - we gather the stuff that should not be killed into tree
25 * - don't just push entire root set; process in place
32 * of foo to bar and vice versa. Current code chokes on that.
38 * upon the beginning and unmark non-junk ones.
56 * parents (->gc_tree).
[all …]
|
| /kernel/linux/linux-6.6/Documentation/bpf/ |
| D | verifier.rst | 32 After kernel function call, R1-R5 are reset to unreadable and
35 Since R6-R9 are callee saved, their state is preserved across the call.
40 bpf_call foo
72 stack bounds, which are [-MAX_BPF_STACK, 0). In this example offset is 8,
78 Classic BPF verifier does similar check with M[0-15] memory slots.
81 bpf_ld R0 = *(u32 *)(R10 - 4)
85 Though R10 is correct read-only register and has type PTR_TO_STACK
86 and R10 - 4 is within stack bounds, there were no stores into that location.
88 Pointer register spill/fill is tracked as well, since four (R6-R9)
91 Allowed function calls are customized with bpf_verifier_ops->get_func_proto()
[all …]
|
| /kernel/linux/linux-6.6/Documentation/mm/ |
| D | physical_memory.rst | 1 .. SPDX-License-Identifier: GPL-2.0
8 architecture-independent abstraction to represent the physical memory. This
13 `Non-Uniform Memory Access (NUMA)
14 <https://en.wikipedia.org/wiki/Non-uniform_memory_access>`_.
15 With multi-core and multi-socket machines, memory may be arranged into banks
42 memory with DMA specific requirements (Documentation/core-api/dma-api.rst),
47 ``CONFIG_ZONE_DMA32`` configuration options. Some 64-bit platforms may need
59 only on some 32-bit architectures and is enabled with ``CONFIG_HIGHMEM``.
69 Documentation/admin-guide/mm/memory-hotplug.rst for additional details.
85 For example, with 32-bit kernel on an x86 UMA machine with 2 Gbytes of RAM the
[all …]
|
| /kernel/linux/linux-6.6/include/net/ |
| D | gro.h | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
16 /* Virtual address of skb_shinfo(skb)->frags[0].page + offset. */
32 /* This indicates where we are processing relative to skb->data. */
35 /* This is non-zero if the packet cannot be merged with the new skb. */
44 /* Used in ipv6_gro_receive() and foo-over-udp */
56 /* This is non-zero if the packet may be of the same flow. */
71 /* Used in foo-over-udp, set in udp[46]_gro_receive */
100 #define NAPI_GRO_CB(skb) ((struct napi_gro_cb *)(skb)->cb)
105 return ++NAPI_GRO_CB(skb)->recursion_counter == GRO_RECURSION_LIMIT; in gro_recursion_inc_test()
114 NAPI_GRO_CB(skb)->flush |= 1; in call_gro_receive()
[all …]
|
| /kernel/linux/linux-5.10/Documentation/networking/ |
| D | snmp_counter.rst | 17 .. _RFC1213 ipInReceives: https://tools.ietf.org/html/rfc1213#page-26
30 .. _RFC1213 ipInDelivers: https://tools.ietf.org/html/rfc1213#page-28
41 .. _RFC1213 ipOutRequests: https://tools.ietf.org/html/rfc1213#page-28
60 .. _Explicit Congestion Notification: https://tools.ietf.org/html/rfc3168#page-6
73 .. _RFC1213 ipInHdrErrors: https://tools.ietf.org/html/rfc1213#page-27
81 .. _RFC1213 ipInAddrErrors: https://tools.ietf.org/html/rfc1213#page-27
98 .. _RFC1213 ipInUnknownProtos: https://tools.ietf.org/html/rfc1213#page-27
111 .. _RFC1213 ipInDiscards: https://tools.ietf.org/html/rfc1213#page-28
118 .. _RFC1213 ipOutDiscards: https://tools.ietf.org/html/rfc1213#page-28
125 .. _RFC1213 ipOutNoRoutes: https://tools.ietf.org/html/rfc1213#page-29
[all …]
|
| /kernel/linux/linux-6.6/Documentation/networking/ |
| D | snmp_counter.rst | 17 .. _RFC1213 ipInReceives: https://tools.ietf.org/html/rfc1213#page-26
30 .. _RFC1213 ipInDelivers: https://tools.ietf.org/html/rfc1213#page-28
41 .. _RFC1213 ipOutRequests: https://tools.ietf.org/html/rfc1213#page-28
60 .. _Explicit Congestion Notification: https://tools.ietf.org/html/rfc3168#page-6
73 .. _RFC1213 ipInHdrErrors: https://tools.ietf.org/html/rfc1213#page-27
81 .. _RFC1213 ipInAddrErrors: https://tools.ietf.org/html/rfc1213#page-27
98 .. _RFC1213 ipInUnknownProtos: https://tools.ietf.org/html/rfc1213#page-27
111 .. _RFC1213 ipInDiscards: https://tools.ietf.org/html/rfc1213#page-28
118 .. _RFC1213 ipOutDiscards: https://tools.ietf.org/html/rfc1213#page-28
125 .. _RFC1213 ipOutNoRoutes: https://tools.ietf.org/html/rfc1213#page-29
[all …]
|
| /kernel/linux/linux-6.6/kernel/locking/ |
| D | rtmutex.c | 1 // SPDX-License-Identifier: GPL-2.0-only
3 * RT-Mutexes: simple blocking mutual exclusion locks with PI support
7 * Copyright (C) 2004-2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
8 * Copyright (C) 2005-2006 Timesys Corp., Thomas Gleixner <tglx@timesys.com>
17 * See Documentation/locking/rt-mutex-design.rst for details.
66 * lock->owner state tracking:
68 * lock->owner holds the task_struct pointer of the owner. Bit 0
79 * possible when bit 0 of lock->owner is 0.
82 * with ->wait_lock is held. To prevent any fast path cmpxchg to the lock,
107 * lock->wait_lock is held but explicit acquire semantics are needed in rt_mutex_set_owner()
[all …]
|
| /kernel/linux/linux-5.10/net/sunrpc/ |
| D | rpc_pipe.c | 1 // SPDX-License-Identifier: GPL-2.0-only
72 msg = list_entry(head->next, struct rpc_pipe_msg, list); in rpc_purge_list()
73 list_del_init(&msg->list); in rpc_purge_list()
74 msg->errno = err; in rpc_purge_list()
91 spin_lock(&pipe->lock); in rpc_timeout_upcall_queue()
92 destroy_msg = pipe->ops->destroy_msg; in rpc_timeout_upcall_queue()
93 if (pipe->nreaders == 0) { in rpc_timeout_upcall_queue()
94 list_splice_init(&pipe->pipe, &free_list); in rpc_timeout_upcall_queue()
95 pipe->pipelen = 0; in rpc_timeout_upcall_queue()
97 dentry = dget(pipe->dentry); in rpc_timeout_upcall_queue()
[all …]
|
| /kernel/linux/linux-6.6/net/sunrpc/ |
| D | rpc_pipe.c | 1 // SPDX-License-Identifier: GPL-2.0-only
72 msg = list_entry(head->next, struct rpc_pipe_msg, list); in rpc_purge_list()
73 list_del_init(&msg->list); in rpc_purge_list()
74 msg->errno = err; in rpc_purge_list()
91 spin_lock(&pipe->lock); in rpc_timeout_upcall_queue()
92 destroy_msg = pipe->ops->destroy_msg; in rpc_timeout_upcall_queue()
93 if (pipe->nreaders == 0) { in rpc_timeout_upcall_queue()
94 list_splice_init(&pipe->pipe, &free_list); in rpc_timeout_upcall_queue()
95 pipe->pipelen = 0; in rpc_timeout_upcall_queue()
97 dentry = dget(pipe->dentry); in rpc_timeout_upcall_queue()
[all …]
|