| /linux-6.12.1/drivers/scsi/esas2r/ |
| D | esas2r_init.c | 5 * Copyright (c) 2001-2013 ATTO Technology, Inc.
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 * LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT,
22 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is
38 * You should have received a copy of the GNU General Public License
40 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
46 static bool esas2r_initmem_alloc(struct esas2r_adapter *a, in esas2r_initmem_alloc() argument
50 mem_desc->esas2r_param = mem_desc->size + align; in esas2r_initmem_alloc()
51 mem_desc->virt_addr = NULL; in esas2r_initmem_alloc()
52 mem_desc->phys_addr = 0; in esas2r_initmem_alloc()
[all …]
|
| D | esas2r_int.c | 5 * Copyright (c) 2001-2013 ATTO Technology, Inc.
8 /*=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT,
23 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is
39 * You should have received a copy of the GNU General Public License
41 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
43 /*=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/
48 static void esas2r_doorbell_interrupt(struct esas2r_adapter *a, u32 doorbell);
49 static void esas2r_get_outbound_responses(struct esas2r_adapter *a);
[all …]
|
| D | esas2r_ioctl.c | 5 * Copyright (c) 2001-2013 ATTO Technology, Inc.
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 * LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT,
22 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is
38 * You should have received a copy of the GNU General Public License
40 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
49 * Buffered ioctl handlers. A buffered ioctl is one which requires that we
50 * allocate a DMA-able memory area to communicate with the firmware. In
52 * we will allocate a global buffer the first time we need it and re-use
70 struct esas2r_adapter *a; member
[all …]
|
| D | esas2r_disc.c | 5 * Copyright (c) 2001-2013 ATTO Technology, Inc.
8 /*=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * LIMITATION, ANY WARRANTIES OR CONDITIONS OF TITLE, NON-INFRINGEMENT,
23 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is
39 * You should have received a copy of the GNU General Public License
41 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
43 /*=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=*/
48 static void esas2r_disc_abort(struct esas2r_adapter *a,
50 static bool esas2r_disc_continue(struct esas2r_adapter *a,
[all …]
|
| /linux-6.12.1/sound/pci/au88x0/ |
| D | au88x0_a3d.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
21 a3dsrc_SetTimeConsts(a3dsrc_t * a, short HrtfTrack, short ItdTrack, in a3dsrc_SetTimeConsts() argument
24 vortex_t *vortex = (vortex_t *) (a->vortex); in a3dsrc_SetTimeConsts()
25 hwwrite(vortex->mmio, in a3dsrc_SetTimeConsts()
26 a3d_addrA(a->slice, a->source, A3D_A_HrtfTrackTC), HrtfTrack); in a3dsrc_SetTimeConsts()
27 hwwrite(vortex->mmio, in a3dsrc_SetTimeConsts()
28 a3d_addrA(a->slice, a->source, A3D_A_ITDTrackTC), ItdTrack); in a3dsrc_SetTimeConsts()
29 hwwrite(vortex->mmio, in a3dsrc_SetTimeConsts()
30 a3d_addrA(a->slice, a->source, A3D_A_GainTrackTC), GTrack); in a3dsrc_SetTimeConsts()
31 hwwrite(vortex->mmio, in a3dsrc_SetTimeConsts()
[all …]
|
| /linux-6.12.1/drivers/net/ethernet/marvell/octeontx2/af/ |
| D | mcs_reg.h | 1 /* SPDX-License-Identifier: GPL-2.0 */
14 #define MCSX_MCS_TOP_SLAVE_PORT_RESET(a) ({ \ argument
18 if (mcs->hw->mcs_blks > 1) \
20 offset += (a) * 0x8ull; \
24 #define MCSX_MCS_TOP_SLAVE_CHANNEL_CFG(a) ({ \ argument
28 if (mcs->hw->mcs_blks > 1) \
30 offset += (a) * 0x8ull; \
37 if (mcs->hw->mcs_blks > 1) \
41 #define MCSX_MIL_RX_LMACX_CFG(a) ({ \ argument
45 if (mcs->hw->mcs_blks > 1) \
[all …]
|
| /linux-6.12.1/Documentation/filesystems/ |
| D | sharedsubtree.rst | 1 .. SPDX-License-Identifier: GPL-2.0
11 4) Use-case
19 -----------
23 A process wants to clone its own namespace, but still wants to access the CD
27 It provides the necessary building blocks for features like per-user-namespace
31 -----------
36 a. shared mount
42 2a) A shared mount can be replicated to as many mountpoints and all the
47 Let's say /mnt has a mount that is shared::
49 mount --make-shared /mnt
[all …]
|
| D | path-lookup.rst | 5 This write-up is based on three articles published at lwn.net:
7 - <https://lwn.net/Articles/649115/> Pathname lookup in Linux
8 - <https://lwn.net/Articles/649729/> RCU-walk: faster pathname lookup in Linux
9 - <https://lwn.net/Articles/650786/> A walk among the symlinks
15 - per-directory parallel name lookup.
16 - ``openat2()`` resolution restriction flags.
27 the early parts of the analysis we will divide off symlinks - leaving
30 will allow us to review "REF-walk" and "RCU-walk" separately. But we
35 --------------------------
37 .. _openat: http://man7.org/linux/man-pages/man2/openat.2.html
[all …]
|
| /linux-6.12.1/tools/testing/selftests/net/ |
| D | fcnal-test.sh | 2 # SPDX-License-Identifier: GPL-2.0
9 # 2. client, server, no-server
13 # 6. VRF and non-VRF permutations
16 # ns-A | ns-B
18 # [ lo ] [ eth1 ]---|---[ eth1 ] [ lo ]
21 # [ red ]---[ eth1 ]---|---[ eth1 ] [ lo ]
23 # ns-A:
30 # ns-B:
35 # ns-A to ns-C connection - only for VRF and same config
36 # as ns-A to ns-B
[all …]
|
| /linux-6.12.1/Documentation/userspace-api/media/v4l/ |
| D | vidioc-queryctrl.rst | 1 .. SPDX-License-Identifier: GFDL-1.1-no-invariants-or-later
13 VIDIOC_QUERYCTRL - VIDIOC_QUERY_EXT_CTRL - VIDIOC_QUERYMENU - Enumerate controls and menu control i…
41 To query the attributes of a control applications set the ``id`` field
42 of a struct :ref:`v4l2_queryctrl <v4l2-queryctrl>` and call the
43 ``VIDIOC_QUERYCTRL`` ioctl with a pointer to this structure. The driver
49 exclusive ``V4L2_CID_LASTP1``. Drivers may return ``EINVAL`` if a control in
60 driver returns the next supported non-compound control, or ``EINVAL`` if
72 :ref:`v4l2_queryctrl <v4l2-queryctrl>` since that structure is full.
80 fields of struct :ref:`v4l2_querymenu <v4l2-querymenu>` and call the
81 ``VIDIOC_QUERYMENU`` ioctl with a pointer to this structure. The driver
[all …]
|
| /linux-6.12.1/include/linux/ |
| D | skb_array.h | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
10 * Limited-size FIFO of skbs. Can be used more or less whenever
13 * Implemented as a type-safe wrapper around ptr_ring.
30 * this in a loop must use a compiler barrier, for example cpu_relax().
32 static inline bool __skb_array_full(struct skb_array *a) in __skb_array_full() argument
34 return __ptr_ring_full(&a->ring); in __skb_array_full()
37 static inline bool skb_array_full(struct skb_array *a) in skb_array_full() argument
39 return ptr_ring_full(&a->ring); in skb_array_full()
42 static inline int skb_array_produce(struct skb_array *a, struct sk_buff *skb) in skb_array_produce() argument
44 return ptr_ring_produce(&a->ring, skb); in skb_array_produce()
[all …]
|
| D | tnum.h | 3 * A tnum tracks knowledge about the bits of a value. Each bit can be either
20 /* Represent a known constant as a tnum. */
22 /* A completely unknown value */
24 /* An unknown value that is a superset of @min <= value <= @max.
33 /* Shift a tnum left (by a fixed shift) */
34 struct tnum tnum_lshift(struct tnum a, u8 shift);
35 /* Shift (rsh) a tnum right (by a fixed shift) */
36 struct tnum tnum_rshift(struct tnum a, u8 shift);
37 /* Shift (arsh) a tnum right (by a fixed min_shift) */
38 struct tnum tnum_arshift(struct tnum a, u8 min_shift, u8 insn_bitness);
[all …]
|
| /linux-6.12.1/lib/crypto/mpi/ |
| D | mpiutil.c | 1 /* mpiutil.ac - Utility functions for MPI
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * You should have received a copy of the GNU General Public License
18 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
21 #include "mpi-internal.h"
24 * Note: It was a bad idea to use the number of limbs to allocate
25 * because on a alpha the limbs are large but we normally need
26 * integers of n bits - So we should change this to bits (or bytes).
28 * But mpi_alloc is used in a lot of places :-)
32 MPI a; in mpi_alloc() local
[all …]
|
| /linux-6.12.1/net/ceph/crush/ |
| D | hash.c | 1 // SPDX-License-Identifier: GPL-2.0
9 * Robert Jenkins' function for mixing 32-bit values
11 * a, b = random bits, c = input and output
13 #define crush_hashmix(a, b, c) do { \ argument
14 a = a-b; a = a-c; a = a^(c>>13); \
15 b = b-c; b = b-a; b = b^(a<<8); \
16 c = c-a; c = c-b; c = c^(b>>13); \
17 a = a-b; a = a-c; a = a^(c>>12); \
18 b = b-c; b = b-a; b = b^(a<<16); \
19 c = c-a; c = c-b; c = c^(b>>5); \
[all …]
|
| /linux-6.12.1/Documentation/maintainer/ |
| D | rebasing-and-merging.rst | 1 .. SPDX-License-Identifier: GPL-2.0
7 Maintaining a subsystem, as a general rule, requires a familiarity with the
8 Git source-code management system. Git is a powerful tool with a lot of
19 maintainers result from a desire to avoid merges, while others come from
20 merging a little too often.
25 "Rebasing" is the process of changing the history of a series of commits
26 within a repository. There are two different types of operations that are
30 - Changing the parent (starting) commit upon which a series of patches is
31 built. For example, a rebase operation could take a patch set built on
36 - Changing the history of a set of patches by fixing (or deleting) broken
[all …]
|
| /linux-6.12.1/arch/powerpc/crypto/ |
| D | md5-asm.S | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
8 #include <asm/asm-offsets.h>
9 #include <asm/asm-compat.h>
40 PPC_STLU r1,-INT_FRAME_SIZE(r1); \
61 #define R_00_15(a, b, c, d, w0, w1, p, q, off, k0h, k0l, k1h, k1l) \ argument
69 add a,a,rT0; /* 1: a = a + f */ \
72 add a,a,w0; /* 1: a = a + wk */ \
74 rotrwi a,a,p; /* 1: a = a rotl x */ \
75 add d,d,w1; /* 2: a = a + wk */ \
76 add a,a,b; /* 1: a = a + b */ \
[all …]
|
| /linux-6.12.1/Documentation/filesystems/nfs/ |
| D | rpc-cache.rst | 5 This document gives a brief introduction to the caching
13 a wide variety of values to be caches.
15 There are a number of caches that are similar in structure though
16 quite possibly very different in content and use. There is a corpus
21 - mapping from IP address to client name
22 - mapping from client name and filesystem to export options
23 - mapping from UID to list of GIDs, to work around NFS's limitation
25 - mappings between local UID/GID and remote UID/GID for sites that
27 - mapping from network identify to public key for crypto authentication.
31 - general cache lookup with correct locking
[all …]
|
| D | exporting.rst | 7 --------
9 All filesystem operations require a dentry (or two) as a starting
10 point. Local applications have a reference-counted hold on suitable
12 applications that access a filesystem via a remote filesystem protocol
13 such as NFS may not be able to hold such a reference, and so need a
14 different way to refer to a particular dentry. As the alternative
16 server-reboot (among other things, though these tend to be the most
23 This byte string will be called a "filehandle fragment" as it
26 A filesystem which supports the mapping between filehandle fragments
32 -------------
[all …]
|
| /linux-6.12.1/Documentation/locking/ |
| D | rt-mutex-design.rst | 2 RT-mutex implementation design
12 Documentation/locking/rt-mutex.rst. Although this document does explain problems
22 ----------------------------
24 Priority inversion is when a lower priority process executes while a higher
26 most of the time it can't be helped. Anytime a high priority process wants
27 to use a resource that a lower priority process has (a mutex for example),
29 with the resource. This is a priority inversion. What we want to prevent
31 priority process is prevented from running by a lower priority process for
35 processes, let's call them processes A, B, and C, where A is the highest
36 priority process, C is the lowest, and B is in between. A tries to grab a lock
[all …]
|
| /linux-6.12.1/kernel/bpf/ |
| D | tnum.c | 1 // SPDX-License-Identifier: GPL-2.0-only
4 * A tnum tracks knowledge about the bits of a value. Each bit can be either
13 /* A completely unknown value */
14 const struct tnum tnum_unknown = { .value = 0, .mask = -1 };
29 /* e.g. if chi = 4, bits = 3, delta = (1<<3) - 1 = 7. in tnum_range()
30 * if chi = 0, bits = 0, delta = (1<<0) - 1 = 0, so we return in tnum_range()
33 delta = (1ULL << bits) - 1; in tnum_range()
37 struct tnum tnum_lshift(struct tnum a, u8 shift) in tnum_lshift() argument
39 return TNUM(a.value << shift, a.mask << shift); in tnum_lshift()
42 struct tnum tnum_rshift(struct tnum a, u8 shift) in tnum_rshift() argument
[all …]
|
| /linux-6.12.1/Documentation/admin-guide/cgroup-v1/ |
| D | cgroups.rst | 6 Documentation/admin-guide/cgroup-v1/cpusets.rst
12 Portions Copyright (c) 2004-2006 Silicon Graphics, Inc.
42 ----------------------
44 Control Groups provide a mechanism for aggregating/partitioning sets of
50 A *cgroup* associates a set of tasks with a set of parameters for one
53 A *subsystem* is a module that makes use of the task grouping
55 particular ways. A subsystem is typically a "resource controller" that
56 schedules a resource or applies per-cgroup limits, but it may be
57 anything that wants to act on a group of processes, e.g. a
60 A *hierarchy* is a set of cgroups arranged in a tree, such that
[all …]
|
| /linux-6.12.1/Documentation/bpf/ |
| D | kfuncs.rst | 1 .. SPDX-License-Identifier: GPL-2.0
3 .. _kfuncs-header-label:
14 kfuncs do not have a stable interface and can change from one kernel release to
18 2. Defining a kfunc
21 There are two ways to expose a kernel function to BPF programs, either make an
22 existing function in the kernel visible, or add a new wrapper for BPF. In both
23 cases, care must be taken that BPF program can only call such function in a
24 valid context. To enforce this, visibility of a kfunc can be per program type.
26 If you are not creating a BPF wrapper for existing kernel function, skip ahead
29 2.1 Creating a wrapper kfunc
[all …]
|
| /linux-6.12.1/Documentation/process/ |
| D | 5.Posting.rst | 8 kernel. Unsurprisingly, the kernel development community has evolved a set
13 :ref:`Documentation/process/submitting-patches.rst <submittingpatches>`
14 and :ref:`Documentation/process/submit-checklist.rst <submitchecklist>`.
18 ------------
20 There is a constant temptation to avoid posting patches before they are
21 completely "ready." For simple patches, that is not a problem. If the
22 work being done is complex, though, there is a lot to be gained by getting
24 consider posting in-progress work, or even making a git tree available so
27 When posting code which is not yet considered ready for inclusion, it is a
30 patches which are known to be half-baked, but those who do will come in
[all …]
|
| /linux-6.12.1/Documentation/arch/powerpc/ |
| D | cxlflash.rst | 10 on Power 8 systems. CAPI can be thought of as a special tunneling
12 purpose co-processors which can read or write an application's
13 memory and generate page faults. As a result, the host interface to
19 devices as a PCI device by implementing a virtual PCI host bridge.
24 CXL provides a mechanism by which user space applications can
25 directly talk to a device (network or storage) bypassing the typical
26 kernel/device driver stack. The CXL Flash Adapter Driver enables a
29 The CXL Flash Adapter Driver is a kernel module that sits in the
30 SCSI stack as a low level device driver (below the SCSI disk and
40 - Any flash device (LUN) can be configured to be accessed as a
[all …]
|
| /linux-6.12.1/drivers/acpi/acpica/ |
| D | acmacros.h | 1 /* SPDX-License-Identifier: BSD-3-Clause OR GPL-2.0 */
4 * Name: acmacros.h - C macros for the entire subsystem.
6 * Copyright (C) 2000 - 2023, Intel Corp.
14 * Extract data using a pointer. Any more than a byte and we
15 * get into potential alignment issues -- see the STORE macros below.
32 * printf() format helper. This macro is a workaround for the difficulties
33 * with emitting 64-bit integers and 64-bit pointers with the same code
34 * for both 32-bit and 64-bit hosts.
41 * Otherwise, we have to move one byte at a time.
45 * Macros for big-endian machines
[all …]
|