| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-5.10/net/ceph/ |
| D | ceph_hash.c | 10 #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 …]
|
| /kernel/linux/linux-5.10/tools/testing/selftests/bpf/progs/ |
| D | test_jhash.h | 1 // SPDX-License-Identifier: GPL-2.0
2 // Copyright (c) 2019 Facebook
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; \
[all …]
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | jhash.h | 6 * Copyright (C) 2006. Bob Jenkins (bob_jenkins@burtleburtle.net)
12 * lookup3.c, by Bob Jenkins, May 2006, Public Domain.
14 * 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; \
[all …]
|
| /kernel/linux/linux-5.10/tools/include/linux/ |
| D | jhash.h | 6 * Copyright (C) 2006. Bob Jenkins (bob_jenkins@burtleburtle.net)
12 * lookup3.c, by Bob Jenkins, May 2006, Public Domain.
14 * 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; \
[all …]
|
| /kernel/linux/linux-5.10/crypto/ |
| D | md4.c | 11 * Copyright (c) Andrew Tridgell 1997-1998.
13 * Copyright (c) Cryptoapi developers.
14 * Copyright (c) 2002 David S. Miller (davem@redhat.com)
15 * Copyright (c) 2002 James Morris <jmorris@intercode.com.au>
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()
[all …]
|
| D | md5.c | 9 * Copyright (c) Cryptoapi developers.
10 * Copyright (c) 2002 James Morris <jmorris@intercode.com.au>
38 (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()
46 c = hash[2]; 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()
[all …]
|
| /kernel/linux/linux-5.10/fs/ubifs/ |
| D | auth.c | 1 // SPDX-License-Identifier: GPL-2.0
5 * Copyright (C) 2018 Pengutronix, Sascha Hauer <s.hauer@pengutronix.de>
17 #include <keys/user-type.h>
18 #include <keys/asymmetric-type.h>
23 * ubifs_node_calc_hash - calculate the hash of a UBIFS node
24 * @c: UBIFS file-system description object
25 * @node: the node to calculate a hash for
28 * Returns 0 for success or a negative error code otherwise.
30 int __ubifs_node_calc_hash(const struct ubifs_info *c, const void *node, in __ubifs_node_calc_hash() argument
35 return crypto_shash_tfm_digest(c->hash_tfm, node, le32_to_cpu(ch->len), in __ubifs_node_calc_hash()
[all …]
|
| /kernel/liteos_m/testsuites/unittest/posix/src/ctype/ |
| D | isxdigit_test.c | 2 * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3 * Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
21 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
41 …* @tc.desc : register a test suite, this suite is used to test basic flow and interface depen…
63 LOG("+-------------------------------------------+\n"); in PosixCTypeIsxdigitTestTearDown()
69 * @tc.name : Checks whether a parameter is a hexadecimal digit
70 * @tc.desc : [C- SOFTWARE -0200]
74 int a = '0'; variable
75 int ret = isxdigit(a);
77 LOG("[DEMO] posix ctype test case 1:isxdigit(%c) ok.\n", a);
[all …]
|
| D | toupper_test.c | 2 * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3 * Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
21 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
41 …* @tc.desc : register a test suite, this suite is used to test basic flow and interface depen…
63 LOG("+-------------------------------------------+\n"); in PosixCTypeToupperTestTearDown()
69 * @tc.name : Converts a lowercase letter to uppercase equivalent
70 * @tc.desc : [C- SOFTWARE -0200]
74 int a = 'a'; variable
75 int ret = toupper(a);
76 if (ret == 'A') {
[all …]
|
| D | tolower_test.c | 2 * Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
3 * Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
21 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
41 …* @tc.desc : register a test suite, this suite is used to test basic flow and interface depen…
63 LOG("+-------------------------------------------+\n"); in PosixCTypeTolowerTestTearDown()
69 * @tc.name : Converts an uppercase letter specified by c to its lowercase equivalent
70 * @tc.desc : [C- SOFTWARE -0200]
74 int a = 'a'; variable
75 int ret = tolower(a);
76 if (ret == 'a') {
[all …]
|
| /kernel/linux/linux-5.10/lib/crypto/ |
| D | sha256.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * SHA-256, as specified in
4 * http://csrc.nist.gov/groups/STM/cavp/documents/shs/sha256-384-512.pdf
6 * SHA-256 code by Jean-Luc Cooke <jlcooke@certainkey.com>.
8 * Copyright (c) Jean-Luc Cooke <jlcooke@certainkey.com>
9 * Copyright (c) Andrew McDonald <andrew@mcdonald.org.uk>
10 * Copyright (c) 2002 James Morris <jmorris@intercode.com.au>
11 * Copyright (c) 2014 Red Hat Inc.
43 W[I] = s1(W[I-2]) + W[I-7] + s0(W[I-15]) + W[I-16]; in BLEND_OP()
48 u32 a, b, c, d, e, f, g, h, t1, t2; in sha256_transform() local
[all …]
|
| D | des.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
7 * Copyright (c) 2005 Dag Arne Osvik <da@osvik.no>
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; \
588 L ^= S7[0xff & A]; \
589 L ^= S5[0xff & (A >> 8)]; A >>= 16; \
[all …]
|
| /kernel/linux/linux-5.10/arch/x86/crypto/ |
| D | sha1_ssse3_asm.S | 1 /* 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…
19 * Copyright (C) 2010, Intel Corp.
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
115 mov 8(HASH_PTR), C
127 RR F1,A,B,C,D,E,0
[all …]
|
| /kernel/linux/linux-5.10/Documentation/driver-api/ |
| D | vme.rst | 5 -------------------
9 achieved via a call to :c:func:`vme_register_driver`.
11 A pointer to a structure of type :c:type:`struct vme_driver <vme_driver>` must
16 :c:type:`struct vme_driver <vme_driver>` should be correctly set. The '.name'
17 element is a pointer to a string holding the device driver's name.
20 with the driver. The match function should return 1 if a device should be
21 probed and 0 otherwise. This example match function (from vme_user.c) limits
24 .. code-block:: c
30 if (vdev->id.num >= USER_BUS_MAX)
35 The '.probe' element should contain a pointer to the probe routine. The
[all …]
|
| D | device_link.rst | 8 that are borne out of a parent/child relationship within the device
13 Sometimes there is a need to represent device dependencies beyond the
18 dependencies, i.e. that one device must be bound to a driver before
21 Often these two dependency types come together, so a device depends on
27 In its standard or *managed* form, a device link combines *both* dependency
28 types: It guarantees correct suspend/resume and shutdown ordering between a
31 supplier is bound to a driver, and they're unbound before the supplier
48 :c:func:`device_add()` has been called for the supplier and
49 :c:func:`device_initialize()` has been called for the consumer.
52 remains in a consistent state: E.g. a device link cannot be added in
[all …]
|
| /kernel/linux/linux-5.10/scripts/mod/ |
| D | sumversion.c | 23 * Copyright (c) Andrew Tridgell 1997-1998.
25 * Copyright (c) Cryptoapi developers.
26 * Copyright (c) 2002 David S. Miller (davem@redhat.com)
27 * Copyright (c) 2002 James Morris <jmorris@intercode.com.au>
49 return ((x << s) & 0xFFFFFFFF) | (x >> (32 - s)); in lshift()
67 #define ROUND1(a,b,c,d,k,s) (a = lshift(a + F(b,c,d) + k, s)) argument
68 #define ROUND2(a,b,c,d,k,s) (a = lshift(a + G(b,c,d) + k + (uint32_t)0x5A827999,s)) argument
69 #define ROUND3(a,b,c,d,k,s) (a = lshift(a + H(b,c,d) + k + (uint32_t)0x6ED9EBA1,s)) argument
74 while (words--) { in le32_to_cpu_array()
82 while (words--) { in cpu_to_le32_array()
[all …]
|
| /kernel/linux/linux-5.10/Documentation/admin-guide/cgroup-v1/ |
| D | devices.rst | 8 Implement a cgroup to track and enforce open and mknod restrictions
9 on device files. A device cgroup associates a device access
10 whitelist with each cgroup. A whitelist entry has 4 fields.
11 'type' is a (all), c (char), or b (block). 'all' means it applies
13 either an integer or * for all. Access is a composition of r
16 The root device cgroup starts with rwm to 'all'. A child device
17 cgroup gets a copy of the parent. Administrators can then remove
18 devices from the whitelist or add new entries. A child cgroup can
19 never receive a device access which is denied by its parent.
27 echo 'c 1:3 mr' > /sys/fs/cgroup/1/devices.allow
[all …]
|
| /kernel/linux/linux-5.10/Documentation/driver-api/media/ |
| D | v4l2-subdev.rst | 1 .. SPDX-License-Identifier: GPL-2.0
3 V4L2 sub-devices
4 ----------------
6 Many drivers need to communicate with sub-devices. These devices can do all
8 encoding or decoding. For webcams common sub-devices are sensors and camera
12 driver with a consistent interface to these sub-devices the
13 :c:type:`v4l2_subdev` struct (v4l2-subdev.h) was created.
15 Each sub-device driver must have a :c:type:`v4l2_subdev` struct. This struct
16 can be stand-alone for simple sub-devices or it might be embedded in a larger
17 struct if more state information needs to be stored. Usually there is a
[all …]
|
| /kernel/linux/linux-5.10/Documentation/kernel-hacking/ |
| D | hacking.rst | 14 requirements for kernel code: its goal is to serve as a primer for Linux
15 kernel development for experienced C programmers. I avoid implementation
20 this document, being grossly under-qualified, but I always wanted to
21 read it, and this was the only way. I hope it will grow into a
28 At any time each of the CPUs in a system can be:
30 - not associated with any process, serving a hardware interrupt;
32 - not associated with any process, serving a softirq or tasklet;
34 - running in kernel space, associated with a process (user context);
36 - running a process in user space.
39 other, but above that is a strict hierarchy: each can only be preempted
[all …]
|
| /kernel/linux/linux-5.10/arch/sparc/crypto/ |
| D | opcodes.h | 1 /* 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 …]
|
| /kernel/linux/linux-5.10/drivers/net/wan/ |
| D | z85230.c | 1 // SPDX-License-Identifier: GPL-2.0-or-later
4 * (c) Copyright 1998 Alan Cox <alan@lxorguk.ukuu.org.uk>
5 * (c) Copyright 2000, 2001 Red Hat Inc
15 * DMA now uses get_free_page as kmalloc buffers may span a 64K
24 * Non DMA you want a 486DX50 or better to do 64Kbits. 9600 baud
27 * 512Kbit->1Mbit depending on motherboard.
60 * z8530_read_port - Architecture specific interface function
64 * between accesses and uses PC I/O. Some drivers may need a 5uS delay
67 * section so that this can become a generic driver interface for all
84 * z8530_write_port - Architecture specific interface function
[all …]
|
| /kernel/linux/linux-5.10/arch/microblaze/include/asm/ |
| D | hash.h | 1 /* 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
18 * c = (x << 19) + x;
19 * a = (x << 9) + c;
20 * b = (x << 23) + a;
[all …]
|
| /kernel/linux/linux-5.10/tools/testing/selftests/drivers/net/mlxsw/ |
| D | devlink_trap_control.sh | 2 # SPDX-License-Identifier: GPL-2.0
4 # Test devlink-trap control trap functionality over mlxsw. Each registered
8 # +---------------------------------+
16 # +----|----------------------------+
18 # +----|----------------------------------------------------------------------+
28 # +----|----------------------------------------------------------------------+
30 # +----|----------------------------+
38 # +---------------------------------+
95 ip -4 route add default vrf v$h1 nexthop via 192.0.2.2
96 ip -6 route add default vrf v$h1 nexthop via 2001:db8:1::2
[all …]
|
| /kernel/linux/linux-5.10/tools/lib/bpf/ |
| D | bpf_core_read.h | 1 /* SPDX-License-Identifier: (LGPL-2.1 OR BSD-2-Clause) */
6 * enum bpf_field_info_kind is passed as a second argument into
7 * __builtin_preserve_field_info() built-in to get a specific aspect of
8 * a field, captured as a first argument. __builtin_preserve_field_info(field,
22 /* second argument to __builtin_btf_type_id() built-in */
28 /* second argument to __builtin_preserve_type_info() built-in */
34 /* second argument to __builtin_preserve_enum_value() built-in */
41 __builtin_preserve_field_info((src)->field, BPF_FIELD_##info)
50 /* semantics of LSHIFT_64 assumes loading values into low-ordered bytes, so
51 * for big-endian we need to adjust destination pointer accordingly, based on
[all …]
|