\-a\- (full) in projects: linux - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched +full:- +full:a +full:- (Results 1 – 25 of 1189) sorted by relevance

12 3 4 5 6 7 8 9 10 >>...48

/linux/drivers/scsi/esas2r/
H A 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 …]
H A 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 …]
H A 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 …]
H A 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/sound/pci/au88x0/
H A 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/drivers/net/ethernet/marvell/octeontx2/af/
H A 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/tools/testing/selftests/net/
H A 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 ]-- [all...]`
/linux/lib/crypto/mpi/
H A 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 23 #include "mpi-internal.h" 26 * Note: It was a bad idea to use the number of limbs to allocate 27 * because on a alpha the limbs are large but we normally need 28 * integers of n bits - So we should change this to bits (or bytes). 30 * But mpi_alloc is used in a lot of places :-) 34 MPI a; in mpi_alloc() local [all …]
/linux/Documentation/maintainer/
H A 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/net/ceph/crush/
H A 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/lib/crypto/powerpc/
H A 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/Documentation/locking/
H A 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 …]
H A D	lockdep-design.rst	8 Lock-class 9 ---------- 11 The basic object the validator operates upon is a 'class' of locks. 13 A class of locks is a group of locks that are logically the same with 15 tens of thousands of) instantiations. For example a lock in the inode 19 The validator tracks the 'usage state' of lock-classes, and it tracks 20 the dependencies between different lock-classes. Lock usage indicates 21 how a lock is used with regard to its IRQ contexts, while lock 22 dependency can be understood as lock order, where L1 -> L2 suggests that 23 a task is attempting to acquire L2 while holding L1. From lockdep's [all …]
/linux/kernel/bpf/
H A 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) - in tnum_range() 37 tnum_lshift(struct tnum a,u8 shift) tnum_lshift() argument 42 tnum_rshift(struct tnum a,u8 shift) tnum_rshift() argument 47 tnum_arshift(struct tnum a,u8 min_shift,u8 insn_bitness) tnum_arshift() argument 62 tnum_add(struct tnum a,struct tnum b) tnum_add() argument 74 tnum_sub(struct tnum a,struct tnum b) tnum_sub() argument 86 tnum_neg(struct tnum a) tnum_neg() argument 91 tnum_and(struct tnum a,struct tnum b) tnum_and() argument 101 tnum_or(struct tnum a,struct tnum b) tnum_or() argument 110 tnum_xor(struct tnum a,struct tnum b) tnum_xor() argument 127 tnum_mul(struct tnum a,struct tnum b) tnum_mul() argument 149 tnum_intersect(struct tnum a,struct tnum b) tnum_intersect() argument 158 tnum_cast(struct tnum a,u8 size) tnum_cast() argument 165 tnum_is_aligned(struct tnum a,u64 size) tnum_is_aligned() argument 172 tnum_in(struct tnum a,struct tnum b) tnum_in() argument 180 tnum_sbin(char * str,size_t size,struct tnum a) tnum_sbin() argument 200 tnum_subreg(struct tnum a) tnum_subreg() argument 205 tnum_clear_subreg(struct tnum a) tnum_clear_subreg() argument 215 tnum_const_subreg(struct tnum a,u32 value) tnum_const_subreg() argument [all...]
/linux/include/linux/
H A 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 tnu 61 tnum_is_const(struct tnum a) tnum_is_const() argument 67 tnum_equals_const(struct tnum a,u64 b) tnum_equals_const() argument 73 tnum_is_unknown(struct tnum a) tnum_is_unknown() argument 118 tnum_subreg_is_const(struct tnum a) tnum_subreg_is_const() argument [all...]
/linux/Documentation/admin-guide/cgroup-v1/
H A 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/Documentation/filesystems/nfs/
H A 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 …]
/linux/drivers/acpi/acpica/
H A 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 - 2025, 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 …]
/linux/Documentation/driver-api/
H A D	xillybus.rst	`10 - Introduction 11 -- Background 12 -- Xillybus Overview 14 - Usage 15 -- User interface 16 -- Synchronization 17 -- Seekable pipes 19 - Internals 20 -- Source code organization 21 -- Pipe attributes [all …]`
/linux/Documentation/userspace-api/
H A D	iommufd.rst	1 .. SPDX-License-Identifier: GPL-2.0+ 20 I/O page tables for all IOMMUs, with room in the design to add non-generic 31 -------------------- 35 - IOMMUFD_OBJ_IOAS, representing an I/O address space (IOAS), allowing map/unmap 38 The IOAS is a functional replacement for the VFIO container, and like the VFIO 39 container it copies an IOVA map to a list of iommu_domains held within it. 41 - IOMMUFD_OBJ_DEVICE, representing a device that is bound to iommufd by an 44 - IOMMUFD_OBJ_HWPT_PAGING, representing an actual hardware I/O page table 45 (i.e. a single struct iommu_domain) managed by the iommu driver. "PAGING" 48 feature flag. This can be either an UNMANAGED stage-1 domain for a device [all …]
/linux/Documentation/driver-api/dmaengine/
H A D	provider.rst	11 They have a given number of channels to use for the DMA transfers, and 12 a given number of requests lines. 20 DMA-eligible devices to the controller itself. Whenever the device 21 will want to start a transfer, it will assert a DMA request (DRQ) by 24 A very simple DMA controller would only take into account a single 25 parameter: the transfer size. At each clock cycle, it would transfer a 30 require a specific number of bits to be transferred in a single 32 physical bus allows to maximize performances when doing a simple 33 memory copy operation, but our audio device could have a narrower FIFO 34 that requires data to be written exactly 16 or 24 bits at a time. This [all …]
/linux/Documentation/
H A D	memory-barriers.txt	14 This document is not a specification; it is intentionally (for the sake of 16 meant as a guide to using the various memory barriers provided by Linux, but 19 documentation at tools/memory-model/. Nevertheless, even this memory 23 To repeat, this document is not a specification of what Linux expects from 31 (2) to provide a guide as to how to use the barriers that are available. 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? [all …]
/linux/Documentation/admin-guide/LSM/
H A D	Smack.rst	7 - The Elevator, from Dark Star 10 Smack is a kernel based implementation of mandatory access 21 - The kernel 22 - Basic utilities, which are helpful but not required 23 - Configuration data 25 The kernel component of Smack is implemented as a Linux 29 It is safe to run a Smack kernel under a "vanilla" distribution. 41 git://github.com/smack-team/smack.git 53 report if a process with one label has access 79 name space. A process must have ``CAP_MAC_ADMIN`` to change any of these [all …]
/linux/Documentation/admin-guide/
H A D	cgroup-v2.rst	1 .. _cgroup-v2: 11 conventions of cgroup v2. It describes all userland-visible aspects 14 v1 is available under :ref:`Documentation/admin-guide/cgroup-v1/index.rst <cgroup-v1>`. 22 1-1. Terminology 23 1-2. What is cgroup? 25 2-1. Mounting 26 2-2. Organizing Processes and Threads 27 2-2-1. Processes 28 2-2-2. Threads 29 2-3. [Un]populated Notification [all …]
/linux/drivers/net/wireless/intel/iwlwifi/
H A D	iwl-debug.h	1 /* SPDX-License-Identifier: GPL-2.0-only / 4 Copyright(c) 2003 - 2014 Intel Corporation. All rights reserved. 5 * Copyright(c) 2018 - 2021, 2024-2025 Intel Corporation 13 #include "iwl-modparams.h" 40 #define CHECK_FOR_NEWLINE(f) BUILD_BUG_ON(f[sizeof(f) - 2] != '\n') 43 #define __IWL_ERR_DEV(d, mode, f, a...) \ argument 46 __iwl_err((d), mode, f, ## a); \ 48 #define IWL_ERR_DEV(d, f, a...) \ argument 49 __IWL_ERR_DEV(d, IWL_ERR_MODE_REGULAR, f, ## a) 50 #define IWL_ERR(m, f, a...) \ argument [all …]

12 3 4 5 6 7 8 9 10 >>...48