/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 …]
|
/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 …]
|
/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 …]
|
/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() 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 …]
|
/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 …]
|
/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 …]
|
/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 …]
|
/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 …]
|
/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 …]
|
/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 …]
|
/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 …]
|
/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 …]
|
/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 …]
|
/linux-5.10/net/ipv4/ |
D | Kconfig | 1 # SPDX-License-Identifier: GPL-2.0-only 40 so-called IP spoofing, however it can pose problems if you use 42 than packets from that host to you) or if you operate a non-routing 52 <file:Documentation/networking/ip-sysctl.rst>. 71 address into account. Furthermore, the TOS (Type-Of-Service) field 89 equal "cost" and chooses one of them in a non-deterministic fashion 132 <file:Documentation/admin-guide/nfs/nfsroot.rst> for details. 147 Read <file:Documentation/admin-guide/nfs/nfsroot.rst> for details. 160 <file:Documentation/admin-guide/nfs/nfsroot.rst> for details. 173 mobile-IP facilities (allowing laptops to seamlessly move between [all …]
|
D | ip_output.c | 1 // SPDX-License-Identifier: GPL-2.0-only 39 * silently drop skb instead of failing with -EPERM. 79 #include <linux/bpf-cgroup.h> 94 iph->check = 0; in ip_send_check() 95 iph->check = ip_fast_csum((unsigned char *)iph, iph->ihl); in ip_send_check() 103 iph->tot_len = htons(skb->len); in __ip_local_out() 113 skb->protocol = htons(ETH_P_IP); in __ip_local_out() 116 net, sk, skb, NULL, skb_dst(skb)->dev, in __ip_local_out() 134 int ttl = inet->uc_ttl; in ip_select_ttl() 155 skb_push(skb, sizeof(struct iphdr) + (opt ? opt->opt.optlen : 0)); in ip_build_and_send_pkt() [all …]
|
/linux-5.10/Documentation/core-api/ |
D | atomic_ops.rst | 23 See :ref:`Documentation/process/volatile-considered-harmful.rst 28 :ref:`Documentation/core-api/local_ops.rst <local_ops>` for the semantics of 35 #define atomic_set(v, i) ((v)->counter = (i)) 52 struct foo { atomic_t counter; }; 55 struct foo *k; 59 return -ENOMEM; 60 atomic_set(&k->counter, 0); 70 #define atomic_read(v) ((v)->counter) 179 Don't even -think- about doing this without proper use of memory barriers, 305 Preceding a non-value-returning read-modify-write atomic operation with [all …]
|
D | dma-api-howto.rst | 10 with example pseudo-code. For a concise description of the API, see 11 DMA-API.txt. 39 supports 64-bit addresses for main memory and PCI BARs, it may use an IOMMU 40 so devices only need to use 32-bit DMA addresses. 49 +-------+ +------+ +------+ 52 C +-------+ --------> B +------+ ----------> +------+ A 54 +-----+ | | | | bridge | | +--------+ 55 | | | | +------+ | | | | 58 +-----+ +-------+ +------+ +------+ +--------+ 60 X +-------+ --------> Y +------+ <---------- +------+ Z [all …]
|
/linux-5.10/fs/ |
D | block_dev.c | 1 // SPDX-License-Identifier: GPL-2.0-only 18 #include <linux/backing-dev.h> 53 return &BDEV_I(inode)->bdev; in I_BDEV() 59 struct inode *inode = bdev->bd_inode; in bdev_write_inode() 62 spin_lock(&inode->i_lock); in bdev_write_inode() 63 while (inode->i_state & I_DIRTY) { in bdev_write_inode() 64 spin_unlock(&inode->i_lock); in bdev_write_inode() 72 spin_lock(&inode->i_lock); in bdev_write_inode() 74 spin_unlock(&inode->i_lock); in bdev_write_inode() 80 struct address_space *mapping = bdev->bd_inode->i_mapping; in kill_bdev() [all …]
|
/linux-5.10/include/linux/ |
D | netdevice.h | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */ 13 * Corey Minyard <wf-rch!minyard@relay.EU.net> 87 * - qdisc return codes 88 * - driver transmit return codes 89 * - errno values 93 * the driver transmit return codes though - when qdiscs are used, the actual 100 /* qdisc ->enqueue() return codes. */ 110 #define net_xmit_errno(e) ((e) != NET_XMIT_CN ? -ENOBUFS : 0) 130 * - successful transmission (rc == NETDEV_TX_OK) in dev_xmit_complete() 131 * - error while transmitting (rc < 0) in dev_xmit_complete() [all …]
|
/linux-5.10/drivers/net/ethernet/nvidia/ |
D | forcedeth.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later 6 * engineered documentation written by Carl-Daniel Hailfinger 15 * Copyright (C) 2004 Carl-Daniel Hailfinger (invalid MAC handling, insane 50 #include <linux/dma-mapping.h> 73 #define DEV_HAS_MSI_X 0x0000080 /* device supports MSI-X */ 483 * - DESC_VER_1: Original 484 * - DESC_VER_2: support for jumbo frames. 485 * - DESC_VER_3: 64-bit format. 568 /* MSI/MSI-X defines */ 638 u64 tx_bytes; /* should be ifconfig->tx_bytes + 4*tx_packets */ [all …]
|
/linux-5.10/fs/btrfs/ |
D | inode.c | 1 // SPDX-License-Identifier: GPL-2.0 16 #include <linux/backing-dev.h> 37 #include "disk-io.h" 40 #include "print-tree.h" 41 #include "ordered-data.h" 43 #include "tree-log.h" 47 #include "free-space-cache.h" 48 #include "inode-map.h" 51 #include "delalloc-space.h" 52 #include "block-group.h" [all …]
|
/linux-5.10/Documentation/ |
D | memory-barriers.txt | 19 documentation at tools/memory-model/. Nevertheless, even this memory 37 Note also that it is possible that a barrier may be a no-op for an 48 - Device operations. 49 - Guarantees. 53 - Varieties of memory barrier. 54 - What may not be assumed about memory barriers? 55 - Data dependency barriers (historical). 56 - Control dependencies. 57 - SMP barrier pairing. 58 - Examples of memory barrier sequences. [all …]
|
/linux-5.10/Documentation/translations/ko_KR/ |
D | memory-barriers.txt | 2 This is a version of Documentation/memory-barriers.txt translated into Korean. 15 Documentation/memory-barriers.txt 39 일부 이상한 점들은 공식적인 메모리 일관성 모델과 tools/memory-model/ 에 있는 60 해당 배리어의 명시적 사용이 불필요해서 no-op 이 될수도 있음을 알아두시기 76 - 디바이스 오퍼레이션. 77 - 보장사항. 81 - 메모리 배리어의 종류. 82 - 메모리 배리어에 대해 가정해선 안될 것. 83 - 데이터 의존성 배리어 (역사적). 84 - 컨트롤 의존성. [all …]
|
/linux-5.10/drivers/atm/ |
D | eni.c | 1 // SPDX-License-Identifier: GPL-2.0-only 2 /* drivers/atm/eni.c - Efficient Networks ENI155P device driver */ 4 /* Written 1995-2000 by Werner Almesberger, EPFL LRC/ICA */ 41 * - OAM support 42 * - fix bugs listed below 48 * - may run into JK-JK bug and deadlock 49 * - should allocate UBR channel first 50 * - buffer space allocation algorithm is stupid 53 * - doesn't support OAM cells 54 * - eni_put_free may hang if not putting memory fragments that _complete_ [all …]
|