Home
last modified time | relevance | path

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

12345678910>>...42

/linux/net/ceph/crush/
H A 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/arch/powerpc/include/asm/
H A 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/tools/testing/selftests/bpf/progs/
H A 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 …]
H A 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
69 union core_reloc_nesting_subunion b; global() member
70 } b; global() member
78 int a; global() member
79 } a; global() member
80 } a; global() member
83 int b; global() member
84 } b; global() member
85 } b; global() member
95 int a; global() member
96 } a; global() member
97 } a; global() member
103 int b; global() member
104 } b; global() member
105 } b; global() member
116 int a; global() member
117 } a; global() member
120 } a; global() member
127 int b; global() member
129 } b; global() member
131 } b; global() member
143 int a; /* offset 4 */ global() member
144 } a; global() member
145 } a; global() member
149 int b; /* offset 16 */ global() member
150 } b; global() member
151 } b; global() member
160 int a; /* offset 4 */ global() member
161 } a; global() member
162 } a; global() member
168 int b; /* offset 16 */ global() member
169 } b; global() member
172 } b; global() member
180 int a; /* offset 4 */ global() member
181 } a; global() member
182 } a; global() member
186 int b; global() member
187 } b; global() member
188 } b __attribute__((aligned(16))); global() member
195 int a; global() member
196 } a; global() member
197 } a; global() member
201 } b; global() member
202 } b; global() member
209 int a; global() member
210 } a; global() member
211 } a; global() member
214 int b[1]; global() member
215 } b; global() member
216 } b; global() member
223 int a; global() member
224 } a; global() member
225 } a; global() member
228 } b; global() member
235 int a; global() member
236 } a; global() member
237 } a; global() member
240 int b; global() member
241 } *b; global() member
242 } b; global() member
249 int a; global() member
250 } a; global() member
251 } a; global() member
254 int b; global() member
255 } b[1]; global() member
256 } b; global() member
263 int a; /* offset 0 */ global() member
264 } a; global() member
265 } a; global() member
268 int b; /* offset 4 */ global() member
269 } b; global() member
270 } b; global() member
276 int a; /* offset 0 */ global() member
277 } a; global() member
278 } a; global() member
282 int b; /* offset 8 (!) */ global() member
283 } b; global() member
284 } b; global() member
291 int a; global() member
292 } a; global() member
293 } a; global() member
299 int b; global() member
300 } b; global() member
301 } b; global() member
307 int a; global() member
308 } a; global() member
309 } a; global() member
327 int b; global() member
341 } b; global() member
342 } b; global() member
362 int a[5]; global() member
363 char b[2][3][4]; global() member
371 int a[7]; global() member
372 char b[3][4][5]; global() member
380 int a[5]; global() member
381 char b[2][3][4]; global() member
400 int a[5]; global() member
401 char b[2][3][4]; global() member
409 int a[5]; global() member
410 char b[2][3][4]; global() member
418 int a[2]; /* this one is too small */ global() member
419 char b[2][3][4]; global() member
426 int a[5]; global() member
427 char b[2][3]; /* this one lacks one dimension */ global() member
434 int a; /* not an array */ global() member
435 char b[2][3][4]; global() member
442 int a[5]; global() member
443 char b[2][3][4]; global() member
452 int a[5]; global() member
453 char b[2][3][4]; global() member
462 A = 0, global() enumerator
463 B = 1, global() enumerator
467 char a; global() member
468 int b; global() member
475 char a; global() member
476 int b; global() member
489 int b; global() member
490 char a; global() member
496 int b; global() member
502 char a[1]; global() member
503 int b; global() member
510 char a[1]; global() member
518 char a[1]; global() member
519 int b; global() member
529 int a, b, c, d, e, f, g, h; global() member
547 int a; global() member
548 int_t b; global() member
559 int b; global() member
560 int_t a; global() member
594 int3_t a; global() member
601 int a; global() member
607 int a; global() member
651 int a, b, c; global() member
666 int a; global() member
667 int b; global() member
689 int a; global() member
691 int b; global() member
701 int a; global() member
705 void *a; global() member
706 int b[1]; global() member
914 struct a_struct * restrict a; global() member
915 void *b; global() member
930 int a, b, c; global() member
973 int a; global() member
980 struct a_struct___forward *a; global() member
981 void *b; global() member
997 int b; global() member
998 int a; global() member
1099 int a, b, c; global() member
[all...]
/linux/net/ceph/
H A 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/tools/perf/pmu-events/
H A 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/drivers/crypto/cavium/cpt/
H A 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/fs/smb/common/
H A 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/tools/include/linux/
H A 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/include/linux/
H A 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/Documentation/userspace-api/media/v4l/
H A 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/drivers/gpu/drm/i915/display/
H A 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/tools/testing/selftests/drivers/net/mlxsw/
H A 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/lib/crypto/
H A Dmd5.c1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * MD5 and HMAC-MD5 library functions
32 (w += f(x, y, z) + in, w = (w << s | w >> (32 - s)) + x)
38 u32 a, b, c, d; in md5_block_generic() local
43 a = state->h[0]; in md5_block_generic()
44 b = state->h[1]; in md5_block_generic()
45 c = state->h[2]; in md5_block_generic()
46 d = state->h[3]; in md5_block_generic()
48 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); in md5_block_generic()
49 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); in md5_block_generic()
[all …]
H A 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>
38 * Transform the message X which consists of 16 32-bit-words. See
39 * GM/T 004-2012 for details.
41 #define R(i, a, b, c, d, e, f, g, h, t, w1, w2) \ argument
43 ss1 = rol32((rol32((a), 12) + (e) + (t)), 7); \
44 ss2 = ss1 ^ rol32((a), 12); \
45 d += FF ## i(a, b, c) + ss2 + ((w1) ^ (w2)); \
[all …]
H A Ddes.c1 // SPDX-License-Identifier: GPL-2.0-or-later
359 /* S-box lookup tables */
581 #define ROUND(L, R, A, B, K, d) \ argument
582 B = K[0]; A = K[1]; K += d; \
583 B ^= R; A ^= R; \
584 B &= 0x3f3f3f3f; ROR(A, 4); \
585 L ^= S8[0xff & B]; A &= 0x3f3f3f3f; \
586 L ^= S6[0xff & (B >> 8)]; B >>= 16; \
587 L ^= S7[0xff & A]; \
588 L ^= S5[0xff & (A >> 8)]; A >>= 16; \
[all …]
/linux/lib/crypto/x86/
H A Dsha1-ssse3-and-avx.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…
61 /* we keep window of 64 w[i]+K pre-calculated values in a circular buffer */
66 * This macro implements the SHA-1 function's body for single 64-byte block
108 * This macro implements 80 rounds of SHA-1 for one 64-byte block
113 mov (HASH_PTR), A
114 mov 4(HASH_PTR), B
127 RR F1,A,B,C,D,E,0
128 RR F1,D,E,A,B,C,2
[all …]
/linux/lib/math/
H A 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
20 static unsigned long binary_gcd(unsigned long a, unsigned long b) in binary_gcd() argument
22 unsigned long r = a | b; in binary_gcd()
24 b >>= __ffs(b); in binary_gcd()
25 if (b == 1) in binary_gcd()
26 return r & -r; in binary_gcd()
29 a >>= __ffs(a); in binary_gcd()
30 if (a == 1) in binary_gcd()
[all …]
/linux/kernel/bpf/
H A 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) - 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/arch/x86/math-emu/
H A Dreg_add_sub.c1 // SPDX-License-Identifier: GPL-2.0
2 /*---------------------------------------------------------------------------+
5 | Functions to add or subtract two registers and put the result in a third. |
9 | E-mail billm@suburbia.net |
12 +---------------------------------------------------------------------------*/
14 /*---------------------------------------------------------------------------+
17 | Each function returns 0 if the answer is o.k., otherwise a non-zero |
20 +---------------------------------------------------------------------------*/
29 int add_sub_specials(FPU_REG const *a, u_char taga, u_char signa,
30 FPU_REG const *b, u_char tagb, u_char signb,
[all …]
/linux/scripts/mod/
H A Dsumversion.c25 * Copyright (c) Andrew Tridgell 1997-1998.
51 return ((x << s) & 0xFFFFFFFF) | (x >> (32 - s)); in lshift()
69 #define ROUND1(a,b,c,d,k,s) (a = lshift(a + F(b,c,d) + k, s)) argument
70 #define ROUND2(a,b,c,d,k,s) (a argument
71 ROUND3(a,b,c,d,k,s) global() argument
92 uint32_t a, b, c, d; md4_transform() local
[all...]
/linux/tools/lib/
H A Dlist_sort.c1 // SPDX-License-Identifier: GPL-2.0
8 * Returns a list organized in an intermediate format suited
9 * to chaining of merge() calls: null-terminated, no reserved or
14 struct list_head *a, struct list_head *b) in merge() argument
19 /* if equal, take 'a' -- important for sort stability */ in merge()
20 if (cmp(priv, a, b) <= 0) { in merge()
21 *tail = a; in merge()
22 tail = &a->next; in merge()
23 a = a->next; in merge()
24 if (!a) { in merge()
[all …]
/linux/lib/
H A Dsort.c1 // SPDX-License-Identifier: GPL-2.0
3 * A fast, small, non-recursive O(n log n) sort for the Linux kernel
8 * Quicksort manages n*log2(n) - 1.26*n for random inputs (1.63*n
18 * is_aligned - is this pointer & size okay for word-wide copying?
24 * The size must be a multiple of the alignment, and the base address must
27 * For some reason, gcc doesn't know to optimize "if (a & mask || b & mask)"
28 * to "if ((a | b) & mask)", so we do that by hand.
39 return (lsbits & (align - 1)) == 0; in is_aligned()
43 * swap_words_32 - swap two elements in 32-bit chunks
44 * @a: pointer to the first element to swap
[all …]
/linux/drivers/md/bcache/
H A Dbset.h1 /* SPDX-License-Identifier: GPL-2.0 */
14 * A bkey contains a key, a size field, a variable number of pointers, and some
25 * that it also filters out keys of size 0 - these are keys that have been
27 * them on disk, just unnecessary work - so we filter them out when resorting
31 * collection needs to find them to ensure bucket gens don't wrap around -
35 * front or the back of a bkey - this is mainly used for fixing overlapping
40 * A bset is an array of bkeys laid out contiguously in memory in sorted order,
41 * along with a header. A btree node is made up of a number of these, written at
45 * 4 in memory - we lazily resort as needed.
49 * implement a btree iterator.
[all …]
/linux/arch/microblaze/include/asm/
H A Dhash.h1 /* SPDX-License-Identifier: GPL-2.0 */
8 * a supported configuration.
10 * With just a barrel shifter, we can implement an efficient constant
11 * multiply using shifts and adds. GCC can find a 9-step solution, but
12 * this 6-step solution was found by Yevgen Voronenko's implementation
15 * That software is really not designed for a single multiplier this large,
17 * 6-shift, 6-add sequences for computing x * 0x61C88647. They are all
19 * a = (x << 9) + c;
20 * b = (x << 23) + a;
21 * return (a<<11) + (b<<6) + (c<<3) - b;
[all …]

12345678910>>...42