Home
last modified time | relevance | path

Searched full:a (Results 1 – 25 of 10518) sorted by relevance

12345678910>>...421

/Linux-v5.4/drivers/net/ethernet/marvell/octeontx2/af/
Drvu_reg.h29 #define RVU_AF_AFPFX_MBOXX(a, b) (0x2000 | (a) << 4 | (b) << 3) argument
53 #define RVU_PRIV_PFX_CFG(a) (0x8000100 | (a) << 16) argument
54 #define RVU_PRIV_PFX_MSIX_CFG(a) (0x8000110 | (a) << 16) argument
55 #define RVU_PRIV_PFX_ID_CFG(a) (0x8000120 | (a) << 16) argument
56 #define RVU_PRIV_PFX_INT_CFG(a) (0x8000200 | (a) << 16) argument
63 #define RVU_PRIV_BLOCK_TYPEX_REV(a) (0x8000400 | (a) << 3) argument
64 #define RVU_PRIV_HWVFX_INT_CFG(a) (0x8001280 | (a) << 16) argument
75 #define RVU_PF_VFX_PFVF_MBOXX(a, b) (0x0 | (a) << 12 | (b) << 3) argument
77 #define RVU_PF_BLOCK_ADDRX_DISC(a) (0x200 | (a) << 3) argument
78 #define RVU_PF_VFME_STATUSX(a) (0x800 | (a) << 3) argument
[all …]
/Linux-v5.4/drivers/scsi/esas2r/
Desas2r_init.c15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is
38 * You should have received a copy of the GNU General Public License
46 static bool esas2r_initmem_alloc(struct esas2r_adapter *a, in esas2r_initmem_alloc() argument
53 mem_desc->esas2r_data = dma_alloc_coherent(&a->pcid->dev, in esas2r_initmem_alloc()
75 static void esas2r_initmem_free(struct esas2r_adapter *a, in esas2r_initmem_free() argument
92 dma_free_coherent(&a->pcid->dev, in esas2r_initmem_free()
103 static bool alloc_vda_req(struct esas2r_adapter *a, in alloc_vda_req() argument
117 if (!esas2r_initmem_alloc(a, memdesc, 256)) { in alloc_vda_req()
123 a->num_vrqs++; in alloc_vda_req()
[all …]
Desas2r_int.c16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
23 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is
39 * You should have received a copy of the GNU General Public License
48 static void esas2r_doorbell_interrupt(struct esas2r_adapter *a, u32 doorbell);
49 static void esas2r_get_outbound_responses(struct esas2r_adapter *a);
50 static void esas2r_process_bus_reset(struct esas2r_adapter *a);
56 void esas2r_polled_interrupt(struct esas2r_adapter *a) in esas2r_polled_interrupt() argument
61 esas2r_disable_chip_interrupts(a); in esas2r_polled_interrupt()
63 intstat = esas2r_read_register_dword(a, MU_INT_STATUS_OUT); in esas2r_polled_interrupt()
68 esas2r_write_register_dword(a, MU_OUT_LIST_INT_STAT, in esas2r_polled_interrupt()
[all …]
Desas2r_ioctl.c15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is
38 * You should have received a copy of the GNU General Public License
47 * Buffered ioctl handlers. A buffered ioctl is one which requires that we
48 * allocate a DMA-able memory area to communicate with the firmware. In
50 * we will allocate a global buffer the first time we need it and re-use
68 struct esas2r_adapter *a; member
82 static void complete_fm_api_req(struct esas2r_adapter *a, in complete_fm_api_req() argument
85 a->fm_api_command_done = 1; in complete_fm_api_req()
86 wake_up_interruptible(&a->fm_api_waiter); in complete_fm_api_req()
[all …]
Desas2r_disc.c16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
23 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Each Recipient is
39 * You should have received a copy of the GNU General Public License
48 static void esas2r_disc_abort(struct esas2r_adapter *a,
50 static bool esas2r_disc_continue(struct esas2r_adapter *a,
52 static void esas2r_disc_fix_curr_requests(struct esas2r_adapter *a);
54 static bool esas2r_disc_start_request(struct esas2r_adapter *a,
58 static bool esas2r_disc_block_dev_scan(struct esas2r_adapter *a,
60 static void esas2r_disc_block_dev_scan_cb(struct esas2r_adapter *a,
62 static bool esas2r_disc_dev_add(struct esas2r_adapter *a,
[all …]
/Linux-v5.4/drivers/crypto/cavium/cpt/
Dcpt_common.h39 #define CPTX_PF_CONSTANTS(a) (0x0ll + ((u64)(a) << 36)) argument
40 #define CPTX_PF_RESET(a) (0x100ll + ((u64)(a) << 36)) argument
41 #define CPTX_PF_DIAG(a) (0x120ll + ((u64)(a) << 36)) argument
42 #define CPTX_PF_BIST_STATUS(a) (0x160ll + ((u64)(a) << 36)) argument
43 #define CPTX_PF_ECC0_CTL(a) (0x200ll + ((u64)(a) << 36)) argument
44 #define CPTX_PF_ECC0_FLIP(a) (0x210ll + ((u64)(a) << 36)) argument
45 #define CPTX_PF_ECC0_INT(a) (0x220ll + ((u64)(a) << 36)) argument
46 #define CPTX_PF_ECC0_INT_W1S(a) (0x230ll + ((u64)(a) << 36)) argument
47 #define CPTX_PF_ECC0_ENA_W1S(a) (0x240ll + ((u64)(a) << 36)) argument
48 #define CPTX_PF_ECC0_ENA_W1C(a) (0x250ll + ((u64)(a) << 36)) argument
[all …]
/Linux-v5.4/tools/testing/selftests/net/
Dfcnal-test.sh16 # ns-A | ns-B
23 # ns-A:
35 # server / client nomenclature relative to ns-A
64 NSA=ns-A
92 read a
93 [ "$a" = "q" ] && exit 1
100 read a
101 [ "$a" = "q" ] && exit 1
181 if [ "$VERBOSE" = "1" -a -n "$out" ]; then
214 read a
[all …]
/Linux-v5.4/sound/pci/au88x0/
Dau88x0_a3d.c21 a3dsrc_SetTimeConsts(a3dsrc_t * a, short HrtfTrack, short ItdTrack, in a3dsrc_SetTimeConsts() argument
24 vortex_t *vortex = (vortex_t *) (a->vortex); in a3dsrc_SetTimeConsts()
26 a3d_addrA(a->slice, a->source, A3D_A_HrtfTrackTC), HrtfTrack); in a3dsrc_SetTimeConsts()
28 a3d_addrA(a->slice, a->source, A3D_A_ITDTrackTC), ItdTrack); in a3dsrc_SetTimeConsts()
30 a3d_addrA(a->slice, a->source, A3D_A_GainTrackTC), GTrack); in a3dsrc_SetTimeConsts()
32 a3d_addrA(a->slice, a->source, A3D_A_CoeffTrackTC), CTrack); in a3dsrc_SetTimeConsts()
37 a3dsrc_GetTimeConsts(a3dsrc_t * a, short *HrtfTrack, short *ItdTrack,
47 a3dsrc_SetAtmosTarget(a3dsrc_t * a, short aa, short b, short c, short d, in a3dsrc_SetAtmosTarget() argument
50 vortex_t *vortex = (vortex_t *) (a->vortex); in a3dsrc_SetAtmosTarget()
52 a3d_addrB(a->slice, a->source, A3D_B_A21Target), in a3dsrc_SetAtmosTarget()
[all …]
/Linux-v5.4/include/linux/
Dtnum.h3 * 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 /* A value that's unknown except that @min <= value <= @max */
28 /* Shift a tnum left (by a fixed shift) */
29 struct tnum tnum_lshift(struct tnum a, u8 shift);
30 /* Shift (rsh) a tnum right (by a fixed shift) */
31 struct tnum tnum_rshift(struct tnum a, u8 shift);
32 /* Shift (arsh) a tnum right (by a fixed min_shift) */
33 struct tnum tnum_arshift(struct tnum a, u8 min_shift);
[all …]
Dskb_array.h13 * 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()
47 static inline int skb_array_produce_irq(struct skb_array *a, struct sk_buff *skb) in skb_array_produce_irq() argument
49 return ptr_ring_produce_irq(&a->ring, skb); in skb_array_produce_irq()
[all …]
Doverflow.h9 * maximum values representable in a given type. These macros may also
26 * a-feature-not-a-bug, since people shouldn't be doing arithmetic on
41 * while using unsigned data types to check a < 0.
43 #define is_non_negative(a) ((a) > 0 || (a) == 0) argument
44 #define is_negative(a) (!(is_non_negative(a))) argument
49 * a, b and *d having the same type (similar to the min() and max()
55 #define check_add_overflow(a, b, d) ({ \ argument
56 typeof(a) __a = (a); \
64 #define check_sub_overflow(a, b, d) ({ \ argument
65 typeof(a) __a = (a); \
[all …]
/Linux-v5.4/Documentation/i2c/
Dsmbus-protocol.rst5 The following is a summary of the SMBus protocol. It applies to
11 which is a subset from the I2C protocol. Fortunately, many devices use
14 If you write a driver for some I2C device, please try to use the SMBus
21 Below is a list of SMBus protocol operations, and the functions executing
23 don't match these function names. For some of the operations which pass a
25 a different protocol operation entirely.
27 Each transaction type corresponds to a functionality flag. Before calling a
28 transaction function, a device driver should always check (just once) for
41 A, NA (1 bit) : Accept and reverse accept bit.
43 get a 10 bit I2C address.
[all …]
/Linux-v5.4/net/ceph/crush/
Dhash.c11 * 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); \
20 a = a-b; a = a-c; a = a^(c>>3); \
21 b = b-c; b = b-a; b = b^(a<<10); \
[all …]
/Linux-v5.4/Documentation/filesystems/
Dsharedsubtree.txt20 A process wants to clone its own namespace, but still wants to access the CD
33 a. shared mount
39 2a) A shared mount can be replicated to as many mountpoints and all the
44 Let's say /mnt has a mount that is shared.
56 a b c
59 a b c
61 Now let's say we mount a device at /tmp/a
62 # mount /dev/sd0 /tmp/a
64 #ls /tmp/a
67 #ls /mnt/a
[all …]
/Linux-v5.4/arch/powerpc/crypto/
Dmd5-asm.S65 #define R_00_15(a, b, c, d, w0, w1, p, q, off, k0h, k0l, k1h, k1l) \ argument
73 add a,a,rT0; /* 1: a = a + f */ \
76 add a,a,w0; /* 1: a = a + wk */ \
78 rotrwi a,a,p; /* 1: a = a rotl x */ \
79 add d,d,w1; /* 2: a = a + wk */ \
80 add a,a,b; /* 1: a = a + b */ \
81 and rT0,a,b; /* 2: f = b and c */ \
82 andc rT1,c,a; /* 2: f' = ~b and d */ \
84 add d,d,rT0; /* 2: a = a + f */ \
86 rotrwi d,d,q; /* 2: a = a rotl x */ \
[all …]
/Linux-v5.4/lib/
Dsha1.c23 * with a 'W(t)=(val);asm("":"+m" (W(t))' there instead, as
32 * On ARM we get the best code generation by forcing a full memory barrier
55 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
57 E += TEMP + rol32(A,5) + (fn) + (constant); \
60 #define T_0_15(t, A, B, C, D, E) SHA_ROUND(t, SHA_SRC, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
61 #define T_16_19(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
62 #define T_20_39(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0x6ed9eba1, A, B, C, D, E ) argument
63 #define T_40_59(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, ((B&C)+(D&(B^C))) , 0x8f1bbcdc, A, B, C, D,… argument
64 #define T_60_79(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0xca62c1d6, A, B, C, D, E ) argument
73 * This function generates a SHA1 digest for a single 512-bit block.
[all …]
/Linux-v5.4/Documentation/devicetree/bindings/i2c/
Drenesas,i2c.txt5 "renesas,i2c-r8a7743" if the device is a part of a R8A7743 SoC.
6 "renesas,i2c-r8a7744" if the device is a part of a R8A7744 SoC.
7 "renesas,i2c-r8a7745" if the device is a part of a R8A7745 SoC.
8 "renesas,i2c-r8a77470" if the device is a part of a R8A77470 SoC.
9 "renesas,i2c-r8a774a1" if the device is a part of a R8A774A1 SoC.
10 "renesas,i2c-r8a774c0" if the device is a part of a R8A774C0 SoC.
11 "renesas,i2c-r8a7778" if the device is a part of a R8A7778 SoC.
12 "renesas,i2c-r8a7779" if the device is a part of a R8A7779 SoC.
13 "renesas,i2c-r8a7790" if the device is a part of a R8A7790 SoC.
14 "renesas,i2c-r8a7791" if the device is a part of a R8A7791 SoC.
[all …]
/Linux-v5.4/drivers/acpi/acpica/
Dacmacros.h14 * Extract data using a pointer. Any more than a byte and we
32 * printf() format helper. This macro is a workaround for the difficulties
41 * Otherwise, we have to move one byte at a time.
124 * data one byte at a time. These macros work whether the source or
169 #define ACPI_DIV_2(a) _ACPI_DIV(a, 1) argument
170 #define ACPI_MUL_2(a) _ACPI_MUL(a, 1) argument
171 #define ACPI_MOD_2(a) _ACPI_MOD(a, 2) argument
173 #define ACPI_DIV_4(a) _ACPI_DIV(a, 2) argument
174 #define ACPI_MUL_4(a) _ACPI_MUL(a, 2) argument
175 #define ACPI_MOD_4(a) _ACPI_MOD(a, 4) argument
[all …]
/Linux-v5.4/drivers/net/wireless/intel/iwlwifi/
Diwl-debug.h41 #define IWL_ERR_DEV(d, f, a...) \ argument
44 __iwl_err((d), false, false, f, ## a); \
46 #define IWL_ERR(m, f, a...) \ argument
47 IWL_ERR_DEV((m)->dev, f, ## a)
48 #define IWL_WARN(m, f, a...) \ argument
51 __iwl_warn((m)->dev, f, ## a); \
53 #define IWL_INFO(m, f, a...) \ argument
56 __iwl_info((m)->dev, f, ## a); \
58 #define IWL_CRIT(m, f, a...) \ argument
61 __iwl_crit((m)->dev, f, ## a); \
[all …]
/Linux-v5.4/kernel/bpf/
Dtnum.c4 * A tnum tracks knowledge about the bits of a value. Each bit can be either
13 /* A completely unknown value */
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
44 return TNUM(a.value >> shift, a.mask >> shift); in tnum_rshift()
47 struct tnum tnum_arshift(struct tnum a, u8 min_shift) in tnum_arshift() argument
49 /* if a.value is negative, arithmetic shifting by minimum shift in tnum_arshift()
51 * If a.value is nonnegative, arithmetic shifting by minimum shift in tnum_arshift()
54 return TNUM((s64)a.value >> min_shift, (s64)a.mask >> min_shift); in tnum_arshift()
[all …]
/Linux-v5.4/lib/mpi/
Dmpiutil.c13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * You should have received a copy of the GNU General Public License
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
28 * But mpi_alloc is used in a lot of places :-)
32 MPI a; in mpi_alloc() local
34 a = kmalloc(sizeof *a, GFP_KERNEL); in mpi_alloc()
35 if (!a) in mpi_alloc()
36 return a; in mpi_alloc()
39 a->d = mpi_alloc_limb_space(nlimbs); in mpi_alloc()
[all …]
/Linux-v5.4/arch/powerpc/net/
Dbpf_jit.h41 #define PPC_ADDI(d, a, i) EMIT(PPC_INST_ADDI | ___PPC_RT(d) | \ argument
42 ___PPC_RA(a) | IMM_L(i))
43 #define PPC_MR(d, a) PPC_OR(d, a, a) argument
45 #define PPC_ADDIS(d, a, i) EMIT(PPC_INST_ADDIS | \ argument
46 ___PPC_RT(d) | ___PPC_RA(a) | IMM_L(i))
78 #define PPC_BPF_LDARX(t, a, b, eh) EMIT(PPC_INST_LDARX | ___PPC_RT(t) | \ argument
79 ___PPC_RA(a) | ___PPC_RB(b) | \
81 #define PPC_BPF_LWARX(t, a, b, eh) EMIT(PPC_INST_LWARX | ___PPC_RT(t) | \ argument
82 ___PPC_RA(a) | ___PPC_RB(b) | \
84 #define PPC_BPF_STWCX(s, a, b) EMIT(PPC_INST_STWCX | ___PPC_RS(s) | \ argument
[all …]
/Linux-v5.4/Documentation/filesystems/nfs/
Dexporting.rst9 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
23 This byte string will be called a "filehandle fragment" as it
26 A filesystem which supports the mapping between filehandle fragments
34 The dcache normally contains a proper prefix of any given filesystem
38 maintained easily (by each object maintaining a reference count on
41 However when objects are included into the dcache by interpreting a
[all …]
/Linux-v5.4/Documentation/maintainer/
Drebasing-and-merging.rst7 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
42 Used properly, rebasing can yield a cleaner and clearer development
[all …]
/Linux-v5.4/tools/testing/selftests/bpf/progs/
Dcore_reloc_types.h8 int a; member
13 /* this is not a flavor, as it doesn't have triple underscore */
15 int a; member
25 int a; member
34 struct core_reloc_nesting_substruct a; member
35 } a; member
46 int a; member
47 } a; member
48 } a; member
63 int a; member
[all …]

12345678910>>...421