Home
last modified time | relevance | path

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

12345678910>>...46

/linux-6.12.1/net/ceph/crush/
Dhash.c1 // 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/arch/powerpc/include/asm/
Dppc-opcode.h1 /* SPDX-License-Identifier: GPL-2.0-or-later */
11 #include <asm/asm-const.h>
120 * 16-bit immediate helper macros: HA() is for use with sign-extending instrs
121 * (e.g. LD, ADDI). If the bottom 16 bits is "-ve", add another bit into the
131 * 18-bit immediate helper for prefix 18-bit upper immediate si0 field.
322 #define ___PPC_RA(a) (((a) & 0x1f) << 16) argument
323 #define ___PPC_RB(b) (((b) & 0x1f) << 11) argument
330 #define __PPC_RA(a) ___PPC_RA(__REG_##a) argument
331 #define __PPC_RA0(a) ___PPC_RA(__REGA0_##a) argument
332 #define __PPC_RB(b) ___PPC_RB(__REG_##b) argument
[all …]
/linux-6.12.1/tools/testing/selftests/bpf/progs/
Dtest_jhash.h1 // SPDX-License-Identifier: GPL-2.0
9 return (word << shift) | (word >> ((-shift) & 31)); in rol32()
12 #define __jhash_mix(a, b, c) \ argument
14 a -= c; a ^= rol32(c, 4); c += b; \
15 b -= a; b ^= rol32(a, 6); a += c; \
16 c -= b; c ^= rol32(b, 8); b += a; \
17 a -= c; a ^= rol32(c, 16); c += b; \
18 b -= a; b ^= rol32(a, 19); a += c; \
19 c -= b; c ^= rol32(b, 4); b += a; \
22 #define __jhash_final(a, b, c) \ argument
[all …]
Dcore_reloc_types.h31 /* we have test_progs[-flavor], so cut flavor part */
40 int a; member
41 int b; member
45 /* this is not a flavor, as it doesn't have triple underscore */
47 int a; member
48 int b; member
57 int a; member
61 int b; member
66 struct core_reloc_nesting_substruct a; member
67 } a; member
[all …]
/linux-6.12.1/net/ceph/
Dceph_hash.c10 #define mix(a, b, c) \ argument
12 a = a - b; a = a - c; a = a ^ (c >> 13); \
13 b = b - c; b = b - a; b = b ^ (a << 8); \
14 c = c - a; c = c - b; c = c ^ (b >> 13); \
15 a = a - b; a = a - c; a = a ^ (c >> 12); \
16 b = b - c; b = b - a; b = b ^ (a << 16); \
17 c = c - a; c = c - b; c = c ^ (b >> 5); \
18 a = a - b; a = a - c; a = a ^ (c >> 3); \
19 b = b - c; b = b - a; b = b ^ (a << 10); \
20 c = c - a; c = c - b; c = c ^ (b >> 15); \
[all …]
/linux-6.12.1/tools/perf/pmu-events/
Dmetric_test.py2 # SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause)
14 a = Event('a')
15 b = Event('b')
16 self.assertEqual((a | b).ToPerfJson(), 'a | b')
17 self.assertEqual((a ^ b).ToPerfJson(), 'a ^ b')
18 self.assertEqual((a & b).ToPerfJson(), 'a & b')
19 self.assertEqual((a < b).ToPerfJson(), 'a < b')
20 self.assertEqual((a > b).ToPerfJson(), 'a > b')
21 self.assertEqual((a + b).ToPerfJson(), 'a + b')
22 self.assertEqual((a - b).ToPerfJson(), 'a - b')
[all …]
/linux-6.12.1/drivers/crypto/cavium/cpt/
Dcpt_common.h1 /* SPDX-License-Identifier: GPL-2.0-only */
24 #define cpt_sriov_enabled(cpt) ((cpt)->flags & CPT_FLAG_SRIOV_ENABLED)
25 #define cpt_vf_driver(cpt) ((cpt)->flags & CPT_FLAG_VF_DRIVER)
26 #define cpt_device_ready(cpt) ((cpt)->flags & CPT_FLAG_DEVICE_READY)
39 #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
[all …]
/linux-6.12.1/tools/include/linux/
Djhash.h14 * These are functions for producing 32-bit hashes for hash table lookup.
20 * Copyright (C) 2009-2010 Jozsef Kadlecsik (kadlec@blackhole.kfki.hu)
32 #define jhash_mask(n) (jhash_size(n)-1)
34 /* __jhash_mix -- mix 3 32-bit values reversibly. */
35 #define __jhash_mix(a, b, c) \ argument
37 a -= c; a ^= rol32(c, 4); c += b; \
38 b -= a; b ^= rol32(a, 6); a += c; \
39 c -= b; c ^= rol32(b, 8); b += a; \
40 a -= c; a ^= rol32(c, 16); c += b; \
41 b -= a; b ^= rol32(a, 19); a += c; \
[all …]
/linux-6.12.1/include/linux/
Djhash.h14 * These are functions for producing 32-bit hashes for hash table lookup.
20 * Copyright (C) 2009-2010 Jozsef Kadlecsik (kadlec@netfilter.org)
32 #define jhash_mask(n) (jhash_size(n)-1)
34 /* __jhash_mix - mix 3 32-bit values reversibly. */
35 #define __jhash_mix(a, b, c) \ argument
37 a -= c; a ^= rol32(c, 4); c += b; \
38 b -= a; b ^= rol32(a, 6); a += c; \
39 c -= b; c ^= rol32(b, 8); b += a; \
40 a -= c; a ^= rol32(c, 16); c += b; \
41 b -= a; b ^= rol32(a, 19); a += c; \
[all …]
/linux-6.12.1/fs/smb/common/
Dcifs_md4.c1 // SPDX-License-Identifier: GPL-2.0
12 * Copyright (c) Andrew Tridgell 1997-1998.
33 return ((x << s) & 0xFFFFFFFF) | (x >> (32 - s)); in lshift()
51 #define ROUND1(a,b,c,d,k,s) (a = lshift(a + F(b,c,d) + k, s)) argument
52 #define ROUND2(a,b,c,d,k,s) (a = lshift(a + G(b,c,d) + k + (u32)0x5A827999,s)) argument
53 #define ROUND3(a,b,c,d,k,s) (a = lshift(a + H(b,c,d) + k + (u32)0x6ED9EBA1,s)) argument
57 u32 a, b, c, d; in md4_transform() local
59 a = hash[0]; in md4_transform()
60 b = hash[1]; in md4_transform()
64 ROUND1(a, b, c, d, in[0], 3); in md4_transform()
[all …]
/linux-6.12.1/crypto/
Dmd4.c11 * Copyright (c) Andrew Tridgell 1997-1998.
45 return ((x << s) & 0xFFFFFFFF) | (x >> (32 - s)); in lshift()
63 #define ROUND1(a,b,c,d,k,s) (a = lshift(a + F(b,c,d) + k, s)) argument
64 #define ROUND2(a,b,c,d,k,s) (a = lshift(a + G(b,c,d) + k + (u32)0x5A827999,s)) argument
65 #define ROUND3(a,b,c,d,k,s) (a = lshift(a + H(b,c,d) + k + (u32)0x6ED9EBA1,s)) argument
69 u32 a, b, c, d; in md4_transform() local
71 a = hash[0]; in md4_transform()
72 b = hash[1]; in md4_transform()
76 ROUND1(a, b, c, d, in[0], 3); in md4_transform()
77 ROUND1(d, a, b, c, in[1], 7); in md4_transform()
[all …]
Dmd5.c38 (w += f(x, y, z) + in, w = (w<<s | w>>(32-s)) + x)
42 u32 a, b, c, d; in md5_transform() local
44 a = hash[0]; in md5_transform()
45 b = hash[1]; in md5_transform()
49 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); in md5_transform()
50 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); in md5_transform()
51 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); in md5_transform()
52 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); in md5_transform()
53 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); in md5_transform()
54 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); in md5_transform()
[all …]
Dsm3.c1 /* SPDX-License-Identifier: GPL-2.0-only */
3 * SM3 secure hash, as specified by OSCCA GM/T 0004-2012 SM3 and described
4 * at https://datatracker.ietf.org/doc/html/draft-sca-cfrg-sm3-02
7 * Copyright (C) 2017 Gilad Ben-Yossef <gilad@benyossef.com>
35 * Transform the message X which consists of 16 32-bit-words. See
36 * GM/T 004-2012 for details.
38 #define R(i, a, b, c, d, e, f, g, h, t, w1, w2) \ argument
40 ss1 = rol32((rol32((a), 12) + (e) + (t)), 7); \
41 ss2 = ss1 ^ rol32((a), 12); \
42 d += FF ## i(a, b, c) + ss2 + ((w1) ^ (w2)); \
[all …]
/linux-6.12.1/drivers/gpu/drm/i915/display/
Dintel_display_reg_defs.h1 /* SPDX-License-Identifier: MIT */
11 #define DISPLAY_MMIO_BASE(dev_priv) (DISPLAY_INFO(dev_priv)->mmio_offset)
18 #define _PIPE(pipe, a, b) _PICK_EVEN(pipe, a, b) argument
19 #define _PLANE(plane, a, b) _PICK_EVEN(plane, a, b) argument
20 #define _TRANS(tran, a, b) _PICK_EVEN(tran, a, b) argument
21 #define _PORT(port, a, b) _PICK_EVEN(port, a, b) argument
22 #define _PLL(pll, a, b) _PICK_EVEN(pll, a, b) argument
23 #define _PHY(phy, a, b) _PICK_EVEN(phy, a, b) argument
25 #define _MMIO_PIPE(pipe, a, b) _MMIO(_PIPE(pipe, a, b)) argument
26 #define _MMIO_PLANE(plane, a, b) _MMIO(_PLANE(plane, a, b)) argument
[all …]
/linux-6.12.1/Documentation/userspace-api/media/v4l/
Dpixfmt-rgb.rst1 .. SPDX-License-Identifier: GFDL-1.1-no-invariants-or-later
3 .. _pixfmt-rgb:
9 These formats encode each pixel as a triplet of RGB values. They are packed
12 bits required to store a pixel is not aligned to a byte boundary, the data is
20 or a permutation thereof, collectively referred to as alpha formats) depend on
22 (including capture queues of mem-to-mem devices) fill the alpha component in
24 a meaningful value. Otherwise, when the device doesn't capture an alpha channel
25 but can set the alpha bit to a user-configurable value, the
26 :ref:`V4L2_CID_ALPHA_COMPONENT <v4l2-alpha-component>` control is used to
28 the value specified by that control. Otherwise a corresponding format without
[all …]
/linux-6.12.1/tools/testing/selftests/drivers/net/mlxsw/
Ddevlink_trap_control.sh2 # SPDX-License-Identifier: GPL-2.0
4 # Test devlink-trap control trap functionality over mlxsw. Each registered
8 # +---------------------------------+
16 # +----|----------------------------+
18 # +----|----------------------------------------------------------------------+
28 # +----|----------------------------------------------------------------------+
30 # +----|----------------------------+
38 # +---------------------------------+
97 ip -4 route add default vrf v$h1 nexthop via 192.0.2.2
98 ip -6 route add default vrf v$h1 nexthop via 2001:db8:1::2
[all …]
/linux-6.12.1/drivers/iommu/intel/
Dcap_audit.c1 // SPDX-License-Identifier: GPL-2.0
3 * cap_audit.c - audit iommu capabilities for boot time and hot plug
19 static inline void check_irq_capabilities(struct intel_iommu *a, in check_irq_capabilities() argument
20 struct intel_iommu *b) in check_irq_capabilities() argument
22 CHECK_FEATURE_MISMATCH(a, b, cap, pi_support, CAP_PI_MASK); in check_irq_capabilities()
23 CHECK_FEATURE_MISMATCH(a, b, ecap, eim_support, ECAP_EIM_MASK); in check_irq_capabilities()
26 static inline void check_dmar_capabilities(struct intel_iommu *a, in check_dmar_capabilities() argument
27 struct intel_iommu *b) in check_dmar_capabilities() argument
29 MINIMAL_FEATURE_IOMMU(b, cap, CAP_MAMV_MASK); in check_dmar_capabilities()
30 MINIMAL_FEATURE_IOMMU(b, cap, CAP_NFR_MASK); in check_dmar_capabilities()
[all …]
/linux-6.12.1/arch/sparc/crypto/
Dopcodes.h1 /* SPDX-License-Identifier: GPL-2.0 */
18 #define CRC32C(a,b,c) \ argument
19 .word (F3F(2,0x36,0x147)|RS1(a)|RS2(b)|RD(c));
30 #define AES_EROUND01(a,b,c,d) \ argument
31 .word (F3F(2, 0x19, 0)|RS1(a)|RS2(b)|RS3(c)|RD(d));
32 #define AES_EROUND23(a,b,c,d) \ argument
33 .word (F3F(2, 0x19, 1)|RS1(a)|RS2(b)|RS3(c)|RD(d));
34 #define AES_DROUND01(a,b,c,d) \ argument
35 .word (F3F(2, 0x19, 2)|RS1(a)|RS2(b)|RS3(c)|RD(d));
36 #define AES_DROUND23(a,b,c,d) \ argument
[all …]
/linux-6.12.1/lib/math/
Dgcd.c1 // SPDX-License-Identifier: GPL-2.0-only
8 * but as Knuth has noted, appears in a first-century Chinese math text.)
10 * This is faster than the division-based algorithm even on x86, which
19 * gcd - calculate and return the greatest common divisor of 2 unsigned longs
20 * @a: first value
21 * @b: second value
23 unsigned long gcd(unsigned long a, unsigned long b) in gcd() argument
25 unsigned long r = a | b; in gcd()
27 if (!a || !b) in gcd()
30 b >>= __ffs(b); in gcd()
[all …]
/linux-6.12.1/arch/x86/crypto/
Dsha1_ssse3_asm.S1 /* SPDX-License-Identifier: GPL-2.0-or-later */
3 * This is a SIMD SHA-1 implementation. It requires the Intel(R) Supplemental
17 …* http://software.intel.com/en-us/articles/improving-the-performance-of-the-secure-hash-algorith…
62 /* we keep window of 64 w[i]+K pre-calculated values in a circular buffer */
67 * This macro implements the SHA-1 function's body for single 64-byte block
109 * This macro implements 80 rounds of SHA-1 for one 64-byte block
114 mov (HASH_PTR), A
115 mov 4(HASH_PTR), B
128 RR F1,A,B,C,D,E,0
129 RR F1,D,E,A,B,C,2
[all …]
/linux-6.12.1/Documentation/filesystems/
Dsharedsubtree.rst1 .. 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
37 b. slave 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::
[all …]
/linux-6.12.1/drivers/gpu/drm/amd/display/dc/hubbub/dcn401/
Ddcn401_hubbub.c4 * Permission is hereby granted, free of charge, to any person obtaining a
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
34 hubbub2->base.ctx
36 hubbub2->base.ctx->logger
38 hubbub2->regs->reg
42 hubbub2->shifts->field_name, hubbub2->masks->field_name
49 &hubbub2->det0_size); in dcn401_init_crb()
52 &hubbub2->det1_size); in dcn401_init_crb()
55 &hubbub2->det2_size); in dcn401_init_crb()
58 &hubbub2->det3_size); in dcn401_init_crb()
[all …]
/linux-6.12.1/kernel/bpf/
Dtnum.c1 // 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/lib/
Dlist-test.c1 // SPDX-License-Identifier: GPL-2.0
3 * KUnit test for the Kernel Linked-list structures.
20 /* Test the different ways of initialising a list. */ in list_test_list_init()
49 struct list_head a, b; in list_test_list_add() local
52 list_add(&a, &list); in list_test_list_add()
53 list_add(&b, &list); in list_test_list_add()
55 /* should be [list] -> b -> a */ in list_test_list_add()
56 KUNIT_EXPECT_PTR_EQ(test, list.next, &b); in list_test_list_add()
57 KUNIT_EXPECT_PTR_EQ(test, b.prev, &list); in list_test_list_add()
58 KUNIT_EXPECT_PTR_EQ(test, b.next, &a); in list_test_list_add()
[all …]
/linux-6.12.1/lib/crypto/
Ddes.c1 // SPDX-License-Identifier: GPL-2.0-or-later
360 /* S-box lookup tables */
582 #define ROUND(L, R, A, B, K, d) \ argument
583 B = K[0]; A = K[1]; K += d; \
584 B ^= R; A ^= R; \
585 B &= 0x3f3f3f3f; ROR(A, 4); \
586 L ^= S8[0xff & B]; A &= 0x3f3f3f3f; \
587 L ^= S6[0xff & (B >> 8)]; B >>= 16; \
588 L ^= S7[0xff & A]; \
589 L ^= S5[0xff & (A >> 8)]; A >>= 16; \
[all …]

12345678910>>...46