| /Linux-v5.10/include/sound/sof/ |
| D | channel_map.h | 1 /* SPDX-License-Identifier: (GPL-2.0-only OR BSD-3-Clause) */
16 * \brief Channel map, specifies transformation of one-to-many or many-to-one.
18 * In case of one-to-many specifies how the output channels are computed out of
20 * in case of many-to-one specifies how a single target channel is computed
23 * Channel index specifies position of the channel in the stream on the 'one'
29 * Channel mask describes which channels are taken into account on the "many"
30 * side. Bit[i] set to 1 means that i-th channel is used for computation
34 * one per each channel set in the mask (left to right, LS bit set in the
35 * mask corresponds to ch_coeffs[0]).
49 * More than one transformation per a single channel is allowed (in case
|
| /Linux-v5.10/Documentation/i2c/ |
| D | summary.rst | 2 Introduction to I2C and SMBus
6 a protocol developed by Philips. It is a slow two-wire protocol (variable
7 speed, up to 400 kHz), with a high speed extension (3.4 MHz). It provides
8 an inexpensive bus for connecting many types of devices with infrequent or
14 The official I2C specification is the `"I2C-bus specification and user
15 manual" (UM10204) <https://www.nxp.com/docs/en/user-guide/UM10204.pdf>`_
19 a subset of I2C protocols and signaling. Many I2C devices will work on an
20 SMBus, but some SMBus protocols add semantics beyond what is required to
26 use its protocols on many I2C systems. However, there are systems that don't
35 one or more *master* chips and one or more *slave* chips.
[all …]
|
| /Linux-v5.10/drivers/usb/gadget/ |
| D | Kconfig | 1 # SPDX-License-Identifier: GPL-2.0
7 # NOTE: Gadget support ** DOES NOT ** depend on host-side CONFIG_USB !!
9 # - Host systems (like PCs) need CONFIG_USB (with "A" jacks).
10 # - Peripherals (like PDAs) need CONFIG_USB_GADGET (with "B" jacks).
11 # - Some systems have both kinds of controllers.
13 # With help from a special transceiver and a "Mini-AB" jack, systems with
14 # both kinds of controller can also support "USB On-the-Go" (CONFIG_USB_OTG).
22 USB is a host/device protocol, organized with one host (such as a
23 PC) controlling up to 127 peripheral devices.
24 The USB hardware is asymmetric, which makes it easier to set up:
[all …]
|
| /Linux-v5.10/Documentation/userspace-api/media/drivers/ |
| D | imx-uapi.rst | 1 .. SPDX-License-Identifier: GPL-2.0
13 ---------
18 - V4L2_EVENT_IMX_FRAME_INTERVAL_ERROR
20 The user application can subscribe to this event from the ipuX_csiY
30 -----------------------------------
33 NTSC/PAL signal re-sync (too little or too many video lines). When
34 this happens, the IPU triggers a mechanism to re-establish vertical
36 from image to image, and can last a long time before a stable image is
38 permanent split image (one frame contains lines from two consecutive
43 value for the current standard, by about one frame time (60 usec),
[all …]
|
| /Linux-v5.10/tools/testing/selftests/futex/include/ |
| D | futextest.h | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
13 * 2009-Nov-6: Initial version by Darren Hart <dvhart@linux.intel.com>
28 /* Define the newer op codes if the system header file is not up to date. */
51 * futex() - SYS_futex syscall wrapper
59 * @opflags: flags to be bitwise OR'd with op, such as FUTEX_PRIVATE_FLAG
68 * like-named arguments in the following wrappers except where noted below.
74 * futex_wait() - block on uaddr with optional timeout
84 * futex_wake() - wake one or more tasks blocked on uaddr
85 * @nr_wake: wake up to this many tasks
94 * futex_wait_bitset() - block on uaddr with bitset
[all …]
|
| /Linux-v5.10/drivers/mtd/ubi/ |
| D | ubi-media.h | 1 /* SPDX-License-Identifier: (GPL-2.0+ OR BSD-3-Clause) */
10 * This file defines the layout of UBI headers and all the other UBI on-flash
47 * @UBI_VTBL_AUTORESIZE_FLG: auto-resize this volume
51 * check. Main use-case for this flag is
52 * boot-time reduction
54 * %UBI_VTBL_AUTORESIZE_FLG flag can be set only for one volume in the volume
55 * table. UBI automatically re-sizes the volume which has this flag and makes
56 * the volume to be of largest possible size. This means that if after the
58 * present on the device, it automatically appends all of them to the volume
66 * The auto-resize feature is useful for device production purposes. For
[all …]
|
| /Linux-v5.10/Documentation/driver-api/usb/ |
| D | gadget.rst | 11 This document presents a Linux-USB "Gadget" kernel mode API, for use
14 development project. This is the first such API released on Linux to
17 - Supports USB 2.0, for high speed devices which can stream data at
20 - Handles devices with dozens of endpoints just as well as ones with
21 just two fixed-function ones. Gadget drivers can be written so
22 they're easy to port to new hardware.
24 - Flexible enough to expose more complex USB device capabilities such
28 - USB "On-The-Go" (OTG) support, in conjunction with updates to the
29 Linux-USB host side.
31 - Sharing data structures and API models with the Linux-USB host side
[all …]
|
| /Linux-v5.10/Documentation/input/ |
| D | gamepad.rst | 1 ---------------------------
3 ---------------------------
10 Linux provides many different input drivers for gamepad hardware. To avoid
11 having user-space deal with different button-mappings for each gamepad, this
12 document defines how gamepads are supposed to report their data.
25 | <===DP===> |SE| |ST| (W) -|- (E) | |
35 D-Pad Left Right Action Pad
43 - Action-Pad
44 4 buttons in diamonds-shape (on the right side). The buttons are
47 - D-Pad (Direction-pad)
[all …]
|
| /Linux-v5.10/Documentation/admin-guide/mm/ |
| D | transhuge.rst | 18 But in the future it can expand to other filesystems.
28 requiring larger clear-page copy-page in page faults which is a
34 factor will affect all subsequent accesses to the memory for the whole
46 hugepages but a significant speedup already happens if only one of
48 going to run faster.
50 THP can be enabled system wide or restricted to certain tasks or even
59 if compared to the reservation approach of hugetlbfs by allowing all
60 unused memory to be used as cache or other movable (or even unmovable
61 entities). It doesn't require reservation to prevent hugepage
62 allocation failures to be noticeable from userland. It allows paging
[all …]
|
| /Linux-v5.10/drivers/net/ethernet/8390/ |
| D | Kconfig | 1 # SPDX-License-Identifier: GPL-2.0-only
11 If you have a network (Ethernet) card belonging to this class, say Y.
13 Note that the answer to this question doesn't directly affect the
14 kernel: saying N will just cause the configurator to skip all
24 Say Y here if you intend to attach an Asix AX88190-based PCMCIA
25 (PC-card) Fast Ethernet card to your computer. These cards are
26 nearly NE2000 compatible but need a separate driver due to a few
29 To compile this driver as a module, choose M here: the module will be
39 AX88796 driver, using platform bus to provide
55 This driver is for the Individual Computers X-Surf 100 Ethernet
[all …]
|
| /Linux-v5.10/arch/arm/common/ |
| D | vlock.S | 1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * vlock.S - simple voting lock implementation for ARM
5 * Created by: Dave Martin, 2012-08-16
6 * Copyright: (C) 2012-2013 Linaro Limited
18 #define MANY(x...) x macro
21 #define MANY(x...) macro
24 @ voting lock for first-man coordination
41 * The vlock structure must reside in Strongly-Ordered or Device memory.
44 * writes to neighbouring locations within a cacheline do not interfere
45 * with one another.
[all …]
|
| /Linux-v5.10/Documentation/devicetree/bindings/gpio/ |
| D | nvidia,tegra186-gpio.txt | 4 controller. This binding document applies to both controllers. The register
5 layouts for the controllers share many similarities, but also some significant
9 The Tegra186 GPIO controller allows software to set the IO direction of, and
10 read/write the value of, numerous GPIO signals. Routing of GPIO signals to
14 a) Security registers, which allow configuration of allowed access to the GPIO
19 Access to this set of registers is not necessary in all circumstances. Code
20 that wishes to configure access to the GPIO registers needs access to these
21 registers to do so. Code which simply wishes to read or write GPIO data does not
22 need access to these registers.
27 documentation for rationale. Any particular GPIO client is expected to access
[all …]
|
| /Linux-v5.10/Documentation/ABI/testing/ |
| D | sysfs-block | 28 For more details refer Documentation/admin-guide/iostats.rst
37 same as the above-written /sys/block/<disk>/stat
46 E.g. T10-DIF-TYPE1-CRC.
71 integrity metadata. Set if the device is T10 PI-capable.
78 by one integrity tuple. Typically the device's logical
95 with 4KB physical sectors exposing 512-byte logical
96 blocks to the operating system). This parameter
97 indicates how many bytes the beginning of the device is
106 with 4KB physical sectors exposing 512-byte logical
107 blocks to the operating system). This parameter
[all …]
|
| /Linux-v5.10/arch/ia64/lib/ |
| D | memset.S | 1 /* SPDX-License-Identifier: GPL-2.0 */
4 Copyright (c) 2002 Hewlett-Packard Co/CERN
15 we get to a 16B-aligned address, then loop on 128 B chunks using an
18 Since a stf.spill f0 can store 16B in one go, we use this instruction
19 to get peak speed when value = 0. */
42 // This routine uses only scratch predicate registers (p6 - p15)
43 #define p_scr p6 // default register for same-cycle branches
72 and ptr2 = -(MIN1+1), dest // aligned address
73 and tmp = MIN1, dest // prepare to check for correct alignment
78 (p_scr) br.ret.dpnt.many rp // return immediately if count = 0
[all …]
|
| D | do_csum.S | 1 /* SPDX-License-Identifier: GPL-2.0 */
9 * in0: address of buffer to checksum (char *)
12 * Copyright (C) 1999, 2001-2002 Hewlett-Packard Co
17 * More optimization cleanup - remove excessive stop bits.
22 * back-to-back 8-byte words per loop. Clean up the initialization
24 * Set CONFIG_IA64_LOAD_LATENCY to 1 or 2 (default).
31 // The goal is to go as quickly as possible to the point where
37 // allows us to commute operations. So we do the "head" and "tail"
38 // first to finish at full speed in the body. Once we get the head and
42 // into one 8 byte word. In this case we have only one entry in the pipeline.
[all …]
|
| /Linux-v5.10/Documentation/filesystems/nfs/ |
| D | knfsd-stats.rst | 5 :Authors: Greg Banks <gnb@sgi.com> - 26 Mar 2009
8 which the kernel NFS server makes available to userspace. These
12 In most cases you don't need to know these formats, as the nfsstat(8)
13 program from the nfs-utils distribution provides a helpful command-line
30 a sequence of unsigned decimal numeric fields. One line is shown
34 to zero these counters, instead applications should do their own
38 The id number of the NFS thread pool to which this line applies.
48 packets-arrived
49 Counts how many NFS packets have arrived. More precisely, this
58 However this is a more accurate and less workload-dependent measure
[all …]
|
| /Linux-v5.10/tools/testing/selftests/sync/ |
| D | sync_fence.c | 2 * sync fence tests with one timeline
3 * Copyright 2015-2016 Collabora Ltd.
9 * Permission is hereby granted, free of charge, to any person obtaining a
11 * to deal in the Software without restriction, including without limitation
12 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
13 * and/or sell copies of the Software, and to permit persons to whom the
14 * Software is furnished to do so, subject to the following conditions:
20 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
48 /* Advance timeline from 0 -> 1 */ in test_fence_one_timeline_wait()
96 /* confirm all fences have one active point (even d) */ in test_fence_one_timeline_merge()
[all …]
|
| /Linux-v5.10/Documentation/filesystems/ |
| D | hpfs.rst | 1 .. SPDX-License-Identifier: GPL-2.0
7 1998-2004, Mikulas Patocka
10 :homepage: https://artax.karlin.mff.cuni.cz/~mikulas/vyplody/hpfs/index-e.cgi
14 Chris Smith, 1993, original read-only HPFS, some code and hpfs structures file
25 attributes. Mode is inverted umask - for example umask 027 gives owner
27 that for files mode is anded with 0666. If you want files to have 'x'
32 CR/LF -> LF conversion, if auto, decision is made according to extension
33 - there is a list of text extensions (I thing it's better to not convert
34 text file than to damage binary file). If you want to change that list,
36 heuristic algorithm that I removed. I thing it's danger to let the
[all …]
|
| /Linux-v5.10/Documentation/networking/ |
| D | scaling.rst | 1 .. SPDX-License-Identifier: GPL-2.0
12 networking stack to increase parallelism and improve performance for
13 multi-processor systems.
17 - RSS: Receive Side Scaling
18 - RPS: Receive Packet Steering
19 - RFS: Receive Flow Steering
20 - Accelerated Receive Flow Steering
21 - XPS: Transmit Packet Steering
28 (multi-queue). On reception, a NIC can send different packets to different
29 queues to distribute processing among CPUs. The NIC distributes packets by
[all …]
|
| /Linux-v5.10/Documentation/process/ |
| D | 4.Coding.rst | 6 While there is much to be said for a solid and community-oriented design
19 ---------
25 :ref:`Documentation/process/coding-style.rst <codingstyle>`. For much of
29 leads to two independent hazards for kernel developers.
31 The first of these is to believe that the kernel coding standards do not
33 code to the kernel is very difficult if that code is not coded according to
34 the standard; many developers will request that the code be reformatted
36 requires some uniformity of code to make it possible for developers to
38 strangely-formatted code.
41 employer's mandated style. In such cases, the kernel's style will have to
[all …]
|
| /Linux-v5.10/Documentation/userspace-api/media/v4l/ |
| D | pixfmt-yuv411p.rst | 1 .. SPDX-License-Identifier: GFDL-1.1-no-invariants-or-later
3 .. _V4L2-PIX-FMT-YUV411P:
11 Planar layout as opposed to ``V4L2_PIX_FMT_Y41P``
17 This format is not commonly used. This is a planar format similar to the
18 4:2:2 planar format except with half as many chroma. The three
19 components are separated into three sub-images or planes. The Y plane is
20 first. The Y plane has one byte per pixel. The Cb plane immediately
22 plane (and of the image). Each Cb belongs to 4 pixels all on the same
23 row. For example, Cb\ :sub:`0` belongs to Y'\ :sub:`00`, Y'\ :sub:`01`,
28 have ¼ as many pad bytes after their rows. In other words, four C x rows
[all …]
|
| /Linux-v5.10/Documentation/arm/ |
| D | vlocks.rst | 2 vlocks for Bare-Metal Mutual Exclusion
5 Voting Locks, or "vlocks" provide a simple low-level mutual exclusion
9 These are intended to be used to coordinate critical activity among CPUs
10 which are otherwise non-coherent, in situations where the hardware
11 provides no other mechanism to support this and ordinary spinlocks
16 writes to a single memory location. To arbitrate, every CPU "votes for
17 itself", by storing a unique number to a common memory location. The
21 In order to make sure that the election produces an unambiguous result
23 no winner has been chosen and the election does not appear to have
28 ---------
[all …]
|
| /Linux-v5.10/Documentation/core-api/ |
| D | workqueue.rst | 13 There are many cases where an asynchronous process execution context
18 describing which function to execute is put on a queue. An
23 functions associated with the work items one after the other. When
31 In the original wq implementation, a multi threaded (MT) wq had one
32 worker thread per CPU and a single threaded (ST) wq had one worker
33 thread system-wide. A single MT wq needed to keep around the same
40 provided was unsatisfactory. The limitation was common to both ST and
42 worker pool. An MT wq could provide only one execution context per CPU
43 while an ST wq one for the whole system. Work items had to compete for
44 those very limited execution contexts leading to various problems
[all …]
|
| /Linux-v5.10/Documentation/vm/ |
| D | frontswap.rst | 9 swapped pages are saved in RAM (or a RAM-like device) instead of a swap disk.
11 (Note, frontswap -- and :ref:`cleancache` (merged at 3.0) -- are the "frontends"
12 and the only necessary changes to the core kernel for transcendent memory;
13 all other supporting code -- the "backends" -- is implemented as drivers.
20 a "backing" store for a swap device. The storage is assumed to be
21 a synchronous concurrency-safe page-oriented "pseudo-RAM device" conforming
22 to the requirements of transcendent memory (such as Xen's "tmem", or
23 in-kernel compressed memory, aka "zcache", or future RAM-like devices);
24 this pseudo-RAM device is not directly accessible or addressable by the
25 kernel and is of unknown and possibly time-varying size. The driver
[all …]
|
| /Linux-v5.10/Documentation/security/ |
| D | self-protection.rst | 2 Kernel Self-Protection
5 Kernel self-protection is the design and implementation of systems and
6 structures within the Linux kernel to protect against security flaws in
13 In the worst-case scenario, we assume an unprivileged local attacker
14 has arbitrary read and write access to the kernel's memory. In many
17 cover the more limited cases as well. A higher bar, and one that should
19 local attacker, since the root user has access to a vastly increased
20 attack surface. (Especially when they have the ability to load arbitrary
23 The goals for successful self-protection systems would be that they
24 are effective, on by default, require no opt-in by developers, have no
[all …]
|
