| /Linux-v6.1/arch/x86/crypto/ |
| D | twofish-x86_64-asm_64.S | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
7 .file "twofish-x86_64-asm.S"
11 #include <asm/asm-offsets.h>
15 #define c_offset 8
24 #define w 4096 /* 8 whitening keys (word) */
25 #define k 4128 /* key 1-32 ( word ) */
27 /* define a few register aliases to allow macro substitution */
60 * a input register containing a (rotated 16)
64 * operations on a and b are interleaved to increase performance
66 #define encrypt_round(a,b,c,d,round)\ argument
[all …]
|
| D | twofish-i586-asm_32.S | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
7 .file "twofish-i586-asm.S"
11 #include <asm/asm-offsets.h>
16 #define out_blk 8 /* output byte array address parameter*/
21 #define c_offset 8
30 #define w 4096 /* 8 whitening keys (word) */
31 #define k 4128 /* key 1-32 ( word ) */
33 /* define a few register aliases to allow macro substitution */
61 * a input register containing a (rotated 16)
65 * operations on a and b are interleaved to increase performance
[all …]
|
| /Linux-v6.1/Documentation/bpf/ |
| D | verifier.rst | 16 At the start of the program the register R1 contains a pointer to context
32 After kernel function call, R1-R5 are reset to unreadable and
33 R0 has a return type of the function.
35 Since R6-R9 are callee saved, their state is preserved across the call.
44 is a correct program. If there was R1 instead of R6, it would have
56 will be rejected, since R1 doesn't have a valid pointer type at the time of
59 At the start R1 type is PTR_TO_CTX (a pointer to generic ``struct bpf_context``)
60 A callback is used to customize verifier to restrict eBPF program access to only
65 bpf_ld R0 = *(u32 *)(R6 + 8)
67 intends to load a word from address R6 + 8 and store it into R0
[all …]
|
| /Linux-v6.1/include/uapi/drm/ |
| D | drm_fourcc.h | 4 * Permission is hereby granted, free of charge, to any person obtaining a
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
38 * fourcc code, a Format Modifier may optionally be provided, in order to
39 * further describe the buffer's format - for example tiling or compression.
42 * ----------------
44 * Format modifiers are used in conjunction with a fourcc code, forming a
56 * vendor-namespaced, and as such the relationship between a fourcc code and a
58 * may preserve meaning - such as number of planes - from the fourcc code,
61 * Modifiers must uniquely encode buffer layout. In other words, a buffer must
62 * match only a single modifier. A modifier must not be a subset of layouts of
[all …]
|
| /Linux-v6.1/fs/reiserfs/ |
| D | hashes.c | 3 * Keyed 32-bit hash function using TEA in a Davis-Meyer function
5 * Hi = E Mi(Hi-1) + Hi-1
11 * Jeremy has agreed to the contents of reiserfs/README. -Hans
23 /* a, b, c, d - data; h0, h1 - accumulated hash */
36 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); \
38 } while(--n); \
49 u32 a, b, c, d; in keyed_hash() local
55 pad = (u32) len | ((u32) len << 8); in keyed_hash()
59 a = (u32) msg[0] | in keyed_hash()
60 (u32) msg[1] << 8 | (u32) msg[2] << 16 | (u32) msg[3] << 24; in keyed_hash()
[all …]
|
| /Linux-v6.1/arch/ia64/lib/ |
| D | copy_page_mck.S | 1 /* SPDX-License-Identifier: GPL-2.0 */
3 * McKinley-optimized version of copy_page().
5 * Copyright (C) 2002 Hewlett-Packard Co
15 * - use regular loads and stores to prefetch data to avoid consuming M-slot just for
16 * lfetches => good for in-cache performance
17 * - avoid l2 bank-conflicts by not storing into the same 16-byte bank within a single
21 * First, note that L1 has a line-size of 64 bytes and L2 a line-size of 128 bytes.
22 * To avoid secondary misses in L2, we prefetch both source and destination with a line-size
28 * We use a software-pipelined loop to control the overall operation. The pipeline
30 * source cache-lines. The second PREFETCH_DIST stages are used for prefetching destination
[all …]
|
| D | strlen.S | 1 /* SPDX-License-Identifier: GPL-2.0 */
14 * Copyright (C) 1999, 2001 Hewlett-Packard Co
25 // This is an enhanced version of the basic strlen. it includes a combination
30 // The goal is to look at the string in chunks of 8 bytes.
31 // so we need to do a few extra checks at the beginning because the
32 // string may not be 8-byte aligned. In this case we load the 8byte
41 // only normal loads. If we still get a fault then we generate a
46 // a NaT bit will be set if the translation is not present. The normal
55 // - the cmp r0,r0 is used as a fast way to initialize a predicate
59 // - we don't use the epilogue counter to exit the loop but we need to set
[all …]
|
| /Linux-v6.1/Documentation/gpu/ |
| D | afbc.rst | 1 .. SPDX-License-Identifier: GPL-2.0+
7 AFBC is a proprietary lossless image compression protocol and format.
8 It provides fine-grained random access and minimizes the amount of
21 AFBC streams can contain several components - where a component
22 corresponds to a color channel (i.e. R, G, B, X, A, Y, Cb, Cr).
37 reside in the least-significant bits of the corresponding linear
42 * Component 0: R(8)
43 * Component 1: G(8)
44 * Component 2: B(8)
45 * Component 3: A(8)
[all …]
|
| /Linux-v6.1/Documentation/admin-guide/device-mapper/ |
| D | dm-service-time.rst | 2 dm-service-time
5 dm-service-time is a path selector module for device-mapper targets,
6 which selects a path with the shortest estimated service time for
10 of in-flight I/Os on a path with the performance value of the path.
11 The performance value is a relative throughput value among all paths
12 in a path-group, and it can be specified as a table argument.
14 The path selector name is 'service-time'.
26 among all paths in the path-group.
27 The valid range is 0-100.
30 other paths having a positive value are available.
[all …]
|
| /Linux-v6.1/lib/842/ |
| D | 842.h | 1 /* SPDX-License-Identifier: GPL-2.0 */
12 * template operation. For normal operations, each arg is either a specific
14 * to a previously-written number of data bytes to copy to the output buffer.
16 * The template code is a 5-bit value. This code indicates what to do with
20 * an arg following the template code bits. Each action is either a "data"
21 * type action, or a "index" type action, and each action results in 2, 4, or 8
23 * in the table row) will add up to 8 bytes being written to the output buffer.
28 * corresponding arg is 2, 4, or 8 bytes, respectively, in the compressed data
32 * corresponding arg is an index parameter that points to, respectively, a 2,
33 * 4, or 8 byte value already in the output buffer, that should be copied to
[all …]
|
| /Linux-v6.1/arch/powerpc/kernel/ |
| D | idle_book3s.S | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
10 * The platform / CPU caller must ensure SPRs and any other non-GPR
15 #include <asm/asm-offsets.h>
16 #include <asm/ppc-opcode.h>
26 * An EC=0 type wakeup will return with a value of 0. SRESET wakeup (which can
44 * A wakeup without GPR loss may alteratively be handled as in
56 * Use the stack red zone rather than a new frame for saving regs since
60 std r2,-8*1(r1)
61 std r14,-8*2(r1)
62 std r15,-8*3(r1)
[all …]
|
| /Linux-v6.1/Documentation/admin-guide/media/ |
| D | dvb_intro.rst | 1 .. SPDX-License-Identifier: GPL-2.0
12 structure of DVB-T cards are substantially similar to Analogue TV cards,
17 video) is an analogue encoding of a sequence of image frames (25 frames
20 Analogue TV card for a PC has the following purpose:
22 * Tune the receiver to receive a broadcast signal
29 some countries employ a digital audio signal
30 embedded within the modulated composite analogue signal -
37 circuitry on the card and is often presented uncompressed. For a PAL TV
38 signal encoded at a resolution of 768x576 24-bit color pixels over 25
39 frames per second - a fair amount of data is generated and must be
[all …]
|
| /Linux-v6.1/Documentation/userspace-api/media/rc/ |
| D | rc-protos.rst | 1 .. SPDX-License-Identifier: GPL-2.0 OR GFDL-1.1-no-invariants-or-later
9 IR is encoded as a series of pulses and spaces, using a protocol. These
10 protocols can encode e.g. an address (which device should respond) and a
12 across different devices for a given protocol.
14 Therefore out the output of the IR decoder is a scancode; a single u32
17 Other things can be encoded too. Some IR protocols encode a toggle bit; this
22 Some remotes have a pointer-type device which can used to control the
29 rc-5 (RC_PROTO_RC5)
30 -------------------
32 This IR protocol uses manchester encoding to encode 14 bits. There is a
[all …]
|
| /Linux-v6.1/kernel/irq/ |
| D | timings.c | 1 // SPDX-License-Identifier: GPL-2.0
2 // Copyright (C) 2016, Linaro Ltd - Daniel Lezcano <daniel.lezcano@linaro.org>
40 * Currently, the interrupt timings are stored in a circular array
41 * buffer every time there is an interrupt, as a tuple: the interrupt
45 * For every interrupt occurring in a short period of time, we can
47 * interrupt and we end up with a suite of intervals. The experience
48 * showed the interrupts are often coming following a periodic
52 * in a fastest way and use its period to predict the next irq event.
57 * after the previous next-interrupt-event request.
69 * Suffix array is an array of all the suffixes of a string. It is
[all …]
|
| /Linux-v6.1/arch/arm64/lib/ |
| D | kasan_sw_tags.S | 1 /* SPDX-License-Identifier: GPL-2.0-only */
10 * Report a tag mismatch detected by tag-based KASAN.
12 * A compiler-generated thunk calls this with a non-AAPCS calling
17 * x2 to x15: callee-saved
19 * x18 to x30: callee-saved
20 * sp: pre-decremented by 256 bytes (see below for restore)
22 * The caller has decremented the SP by 256 bytes, and created a
30 * Note that this is not a struct pt_regs.
32 * To call a regular AAPCS function we must save x2 to x15 (which we can
33 * store in the gaps), and create a frame record (for which we can use
[all …]
|
| /Linux-v6.1/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 …]
|
| /Linux-v6.1/tools/testing/selftests/bpf/verifier/ |
| D | array_access.c | 2 "valid map access into an array with a constant",
4 BPF_ST_MEM(BPF_DW, BPF_REG_10, -8, 0),
6 BPF_ALU64_IMM(BPF_ADD, BPF_REG_2, -8),
19 "valid map access into an array with a register",
21 BPF_ST_MEM(BPF_DW, BPF_REG_10, -8, 0),
23 BPF_ALU64_IMM(BPF_ADD, BPF_REG_2, -8),
40 "valid map access into an array with a variable",
42 BPF_ST_MEM(BPF_DW, BPF_REG_10, -8, 0),
44 BPF_ALU64_IMM(BPF_ADD, BPF_REG_2, -8),
62 "valid map access into an array with a signed variable",
[all …]
|
| /Linux-v6.1/include/uapi/linux/ |
| D | videodev2.h | 1 /* SPDX-License-Identifier: ((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) */
5 * Copyright (C) 1999-2012 the contributors
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
36 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
47 * All kernel-specific stuff were moved to media/v4l2-dev.h, so
66 #include <linux/v4l2-common.h>
67 #include <linux/v4l2-controls.h>
74 #define VIDEO_MAX_PLANES 8
77 * M I S C E L L A N E O U S
80 /* Four-character-code (FOURCC) */
[all …]
|
| /Linux-v6.1/Documentation/driver-api/early-userspace/ |
| D | buffer-format.rst | 7 Last revision: 2002-01-13
14 expanded into a ramfs filesystem; this document details the format of
20 initramfs buffer is thus a single .cpio.gz file.
29 ALGN(n) means padding with null bytes to an n-byte boundary
42 In human terms, the initramfs buffer contains a collection of
47 The cpio "TRAILER!!!" entry (cpio end-of-archive) is optional, but is
59 c_ino 8 bytes File inode number
60 c_mode 8 bytes File mode and permissions
61 c_uid 8 bytes File uid
62 c_gid 8 bytes File gid
[all …]
|
| /Linux-v6.1/arch/x86/lib/ |
| D | csum-partial_64.c | 1 // SPDX-License-Identifier: GPL-2.0
3 * arch/x86_64/lib/csum-partial.c
6 * in an architecture-specific manner due to speed.
12 #include <asm/word-at-a-time.h>
14 static inline unsigned short from32to16(unsigned a) in from32to16() argument
16 unsigned short b = a >> 16; in from32to16()
20 : "0" (b), "r" (a)); in from32to16()
25 * Do a checksum on an arbitrary memory area.
26 * Returns a 32bit checksum.
33 * it's best to have buff aligned on a 64-bit boundary
[all …]
|
| /Linux-v6.1/Documentation/filesystems/ext4/ |
| D | directory.rst | 1 .. SPDX-License-Identifier: GPL-2.0
4 -----------------
6 In an ext4 filesystem, a directory is more or less a flat file that maps
9 that reference the same inode number--these are known as hard links, and
12 associated with a directory file for the particular directory entry that
18 By default, each directory lists its entries in an “almost-linear”
19 array. I write “almost” because it's not a linear array in the memory
21 Therefore, it is more accurate to say that a directory is a series of
22 data blocks and that each block contains a linear array of directory
23 entries. The end of each per-block array is signified by reaching the
[all …]
|
| /Linux-v6.1/arch/arm64/crypto/ |
| D | crct10dif-ce-core.S | 2 // Accelerated CRC-T10DIF using arm64 NEON and Crypto Extensions instructions
14 // Implement fast CRC-T10DIF computation with SSE and PCLMULQDQ instructions
24 // This software is available to you under a choice of one of two
49 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
62 // /white-papers/fast-crc-computation-generic-polynomials-pclmulqdq-paper.pdf
69 .arch armv8-a+crypto
116 movi perm4.8b, #8
119 ushr perm2.2d, perm1.2d, #8
136 ext t4.8b, ad.8b, ad.8b, #1 // A1
137 ext t5.8b, ad.8b, ad.8b, #2 // A2
[all …]
|
| /Linux-v6.1/arch/powerpc/crypto/ |
| D | aes-tab-4k.S | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
10 * crypto/aes_generic.c and are designed to be simply accessed by a combination
11 * of rlwimi/lwz instructions with a minimum of table registers (usually only
16 * For the safety-conscious it has to be noted that they might be vulnerable
18 * the generic tables they have been reduced from 16KB to 8KB + 256 bytes.
19 * This is a quite good tradeoff for low power devices (e.g. routers) without
25 #define R(a, b, c, d) \ argument
26 0x##a##b##c##d, 0x##d##a##b##c, 0x##c##d##a##b, 0x##b##c##d##a
32 /* encryption table, same as crypto_ft_tab in crypto/aes-generic.c */
34 .long R(ee, 77, 77, 99), R(f6, 7b, 7b, 8d)
[all …]
|
| /Linux-v6.1/tools/testing/selftests/bpf/progs/ |
| D | test_jhash.h | 1 // 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 …]
|
| /Linux-v6.1/drivers/net/fddi/skfp/h/ |
| D | skfbi.h | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
5 * a business unit of Schneider & Koch & Co. Datensysteme GmbH.
15 * FDDI-Fx (x := {I(SA), P(CI)})
19 /*--------------------------------------------------------------------------*/
31 * Note: The temperature and voltage sensors are relocated on a different
40 #define B0_RAP 0x0000 /* 8 bit register address port */
41 /* 0x0001 - 0x0003: reserved */
42 #define B0_CTRL 0x0004 /* 8 bit control register */
43 #define B0_DAS 0x0005 /* 8 Bit control register (DAS) */
44 #define B0_LED 0x0006 /* 8 Bit LED register */
[all …]
|
