| /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-4.19/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-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-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.
117 * struct ath_ops - Register read/write operations
191 return common->ps_ops; in ath_ps_ops()
230 * enum ath_debug_level - atheros wireless debug level
233 * @ATH_DBG_QUEUE: hardware queue management
248 * used exclusively for WLAN-BT coexistence starting from
258 * modifying debug level states -- but this is typically done through a
294 if ((common)->debug_mask & ATH_DBG_##dbg_mask) \
298 #define ATH_DBG_WARN(foo, arg...) WARN(foo, arg) argument
[all …]
|
| /kernel/linux/linux-4.19/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.
117 * struct ath_ops - Register read/write operations
191 return common->ps_ops; in ath_ps_ops()
229 * enum ath_debug_level - atheros wireless debug level
232 * @ATH_DBG_QUEUE: hardware queue management
247 * used exclusively for WLAN-BT coexistence starting from
257 * modifying debug level states -- but this is typically done through a
293 if ((common)->debug_mask & ATH_DBG_##dbg_mask) \
297 #define ATH_DBG_WARN(foo, arg...) WARN(foo, arg) argument
[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-4.19/Documentation/filesystems/ |
| D | inotify.txt | 8 --Deleted obsoleted interface, just refer to manpages for user interface.
21 Q: What is the design decision behind using an-fd-per-instance as opposed to
22 an fd-per-watch?
24 A: An fd-per-watch quickly consumes more file descriptors than are allowed,
26 select()-able. Yes, root can bump the per-process fd limit and yes, users
29 spaces is thus sensible. The current design is what user-space developers
32 thousand times is silly. If we can implement user-space's preferences
33 cleanly--and we can, the idr layer makes stuff like this trivial--then we
37 item to block on, which is mapped to a single queue of events. The single
38 fd returns all watch events and also any potential out-of-band data. If
[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-4.19/Documentation/power/ |
| D | runtime_pm.txt | 3 (C) 2009-2011 Rafael J. Wysocki <rjw@sisk.pl>, Novell Inc.
13 put their PM-related work items. It is strongly recommended that pm_wq be
15 them to be synchronized with system-wide power transitions (suspend to RAM,
47 The ->runtime_suspend(), ->runtime_resume() and ->runtime_idle() callbacks
51 1. PM domain of the device, if the device's PM domain object, dev->pm_domain,
54 2. Device type of the device, if both dev->type and dev->type->pm are present.
56 3. Device class of the device, if both dev->class and dev->class->pm are
59 4. Bus type of the device, if both dev->bus and dev->bus->pm are present.
63 dev->driver->pm directly (if present).
67 and bus type. Moreover, the high-priority one will always take precedence over
[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-4.19/arch/ia64/hp/sim/ |
| D | simscsi.c | 1 // SPDX-License-Identifier: GPL-2.0
5 * Copyright (C) 1999, 2001-2003 Hewlett-Packard Co
6 * David Mosberger-Tang <davidm@hpl.hp.com>
28 #define DEFAULT_SIMSCSI_ROOT "/var/ski-disks/sd"
65 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
70 } queue[SIMSCSI_REQ_QUEUE_LEN]; variable
82 * to use /foo/bar/disk[a-z] as disk images
83 * you have to specify simscsi=/foo/bar/disk on the command line
90 printk(KERN_ERR "simscsi_setup: prefix too long---using default %s\n", in simscsi_setup()
104 while ((sc = queue[rd].sc) != NULL) { in simscsi_interrupt()
[all …]
|
| /kernel/linux/linux-4.19/drivers/staging/vc04_services/interface/vchi/ |
| D | vchi_common.h | 2 * Copyright (c) 2010-2012 Broadcom. All rights reserved.
13 * 3. The names of the above-listed copyright holders may not be used
42 …VCHI_FLAGS_BLOCK_UNTIL_QUEUED = 0x4, // return once the transfer is in a queue ready to go
57 VCHI_CRC_NOTHING = -1,
124 * Define vector struct for scatter-gather (vector) operations
125 * Vectors can be nested - if a vector element has negative length, then
127 * '-vec_len' elements. Thus to append a header onto an existing vector,
130 * void foo(const VCHI_MSG_VECTOR_T *v, int n)
136 * nv[1].vec_len = -n;
151 // Iterator structure for reading ahead through received message queue. Allocated by client,
[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 …]
|
| D | filter.rst | 1 .. SPDX-License-Identifier: GPL-2.0
3 .. _networking-filter:
10 ------------
17 BPF allows a user-space program to attach a filter onto any socket and
42 The biggest user of this construct might be libpcap. Issuing a high-level
43 filter command like `tcpdump -i em1 port 22` passes through the libpcap
45 via SO_ATTACH_FILTER to the kernel. `tcpdump -i em1 port 22 -ddd`
50 qdisc layer, SECCOMP-BPF (SECure COMPuting [1]_), and lots of other places
53 .. [1] Documentation/userspace-api/seccomp_filter.rst
58 architecture for user-level packet capture. In Proceedings of the
[all …]
|
| /kernel/linux/linux-4.19/ipc/ |
| D | mqueue.c | 61 struct ext_wait_queue { /* queue of sleeping tasks */
88 unsigned long qsize; /* size of queue in memory (sum of all msgs) */
110 return get_ipc_ns(inode->i_sb->s_fs_info); in __get_ns_from_inode()
129 p = &info->msg_tree.rb_node; in msg_insert()
134 if (likely(leaf->priority == msg->m_type)) in msg_insert()
136 else if (msg->m_type < leaf->priority) in msg_insert()
137 p = &(*p)->rb_left; in msg_insert()
139 p = &(*p)->rb_right; in msg_insert()
141 if (info->node_cache) { in msg_insert()
142 leaf = info->node_cache; in msg_insert()
[all …]
|
| /kernel/linux/linux-4.19/Documentation/networking/ |
| D | filter.txt | 5 ------------
12 BPF allows a user-space program to attach a filter onto any socket and
37 The biggest user of this construct might be libpcap. Issuing a high-level
38 filter command like `tcpdump -i em1 port 22` passes through the libpcap
40 via SO_ATTACH_FILTER to the kernel. `tcpdump -i em1 port 22 -ddd`
45 qdisc layer, SECCOMP-BPF (SECure COMPuting [1]), and lots of other places
48 [1] Documentation/userspace-api/seccomp_filter.rst
53 architecture for user-level packet capture. In Proceedings of the
56 CA, USA, 2-2. [http://www.tcpdump.org/papers/bpf-usenix93.pdf]
59 ---------
[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-4.19/net/sunrpc/ |
| D | rpc_pipe.c | 70 msg = list_entry(head->next, struct rpc_pipe_msg, list); in rpc_purge_list()
71 list_del_init(&msg->list); in rpc_purge_list()
72 msg->errno = err; in rpc_purge_list()
89 spin_lock(&pipe->lock); in rpc_timeout_upcall_queue()
90 destroy_msg = pipe->ops->destroy_msg; in rpc_timeout_upcall_queue()
91 if (pipe->nreaders == 0) { in rpc_timeout_upcall_queue()
92 list_splice_init(&pipe->pipe, &free_list); in rpc_timeout_upcall_queue()
93 pipe->pipelen = 0; in rpc_timeout_upcall_queue()
95 dentry = dget(pipe->dentry); in rpc_timeout_upcall_queue()
96 spin_unlock(&pipe->lock); in rpc_timeout_upcall_queue()
[all …]
|
| /kernel/linux/linux-5.10/ipc/ |
| D | mqueue.c | 69 * Accesses to a message queue are synchronized by acquiring info->lock.
72 * - The actual wakeup of a sleeping task is performed using the wake_q
73 * framework. info->lock is already released when wake_up_q is called.
74 * - The exit codepaths after sleeping check ext_wait_queue->state without
76 * acquiring info->lock.
93 * ->state = STATE_READY (reordered)
101 * the smp_store_release() that does ->state = STATE_READY.
115 * receiver->msg = message; (reordered)
119 * 3) There is intentionally no barrier when setting current->state
120 * to TASK_INTERRUPTIBLE: spin_unlock(&info->lock) provides the
[all …]
|
| /kernel/linux/linux-5.10/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>
12 * See Documentation/locking/rt-mutex-design.rst for details.
26 * lock->owner state tracking:
28 * lock->owner holds the task_struct pointer of the owner. Bit 0
39 * possible when bit 0 of lock->owner is 0.
42 * with ->wait_lock is held. To prevent any fast path cmpxchg to the lock,
60 WRITE_ONCE(lock->owner, (struct task_struct *)val); in rt_mutex_set_owner()
[all …]
|
| /kernel/linux/linux-4.19/kernel/locking/ |
| D | rtmutex.c | 2 * RT-Mutexes: simple blocking mutual exclusion locks with PI support
6 * Copyright (C) 2004-2006 Red Hat, Inc., Ingo Molnar <mingo@redhat.com>
7 * Copyright (C) 2005-2006 Timesys Corp., Thomas Gleixner <tglx@timesys.com>
11 * See Documentation/locking/rt-mutex-design.txt for details.
25 * lock->owner state tracking:
27 * lock->owner holds the task_struct pointer of the owner. Bit 0
38 * possible when bit 0 of lock->owner is 0.
41 * with ->wait_lock is held. To prevent any fast path cmpxchg to the lock,
59 lock->owner = (struct task_struct *)val; in rt_mutex_set_owner()
64 lock->owner = (struct task_struct *) in clear_rt_mutex_waiters()
[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-5.10/include/linux/device/ |
| D | bus.h | 1 // SPDX-License-Identifier: GPL-2.0
3 * bus.h - the bus-specific portions of the driver model
5 * Copyright (c) 2001-2003 Patrick Mochel <mochel@osdl.org>
6 * Copyright (c) 2004-2009 Greg Kroah-Hartman <gregkh@suse.de>
7 * Copyright (c) 2008-2009 Novell Inc.
8 * Copyright (c) 2012-2019 Greg Kroah-Hartman <gregkh@linuxfoundation.org>
9 * Copyright (c) 2012-2019 Linux Foundation
11 * See Documentation/driver-api/driver-model/ for more information.
25 * struct bus_type - The bus type of the device
28 * @dev_name: Used for subsystems to enumerate devices like ("foo%u", dev->id).
[all …]
|
| /kernel/linux/linux-4.19/net/unix/ |
| D | garbage.c | 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
37 * of foo to bar and vice versa. Current code chokes on that.
43 * upon the beginning and unmark non-junk ones.
61 * parents (->gc_tree).
63 * Damn. Added missing check for ->dead in listen queues scanning.
[all …]
|