| /linux-6.12.1/arch/x86/crypto/ |
| D | twofish-x86_64-asm_64.S | 15 #define c_offset 8
24 #define w 4096 /* 8 whitening keys (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
69 movzx a ## B, %edi;\
74 movzx a ## H, %edi;\
75 ror $16, a ## D;\
79 movzx a ## B, %edi;\
[all …]
|
| D | twofish-i586-asm_32.S | 16 #define out_blk 8 /* output byte array address parameter*/
21 #define c_offset 8
30 #define w 4096 /* 8 whitening keys (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
67 #define encrypt_round(a,b,c,d,round)\ argument
71 movzx a ## B, %edi;\
76 movzx a ## H, %edi;\
77 ror $16, a ## D;\
[all …]
|
| D | aes-gcm-aesni-x86_64.S | 14 // Licensed under the Apache License 2.0 (the "License"). You may obtain a copy
39 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
81 // do an 8-register wide loop. Considering that and the fact that we have
96 // As a rough approximation, we can assume that Karatsuba multiplication is
98 // 0.25 pxors are cheaper than a pclmulqdq. (We assume that the 64-bit
114 // An additional 0.25 pclmulqdq per block (2 per 8 blocks) could be
115 // saved by using a multiplication-less reduction method. We don't do that
116 // because it would require a large number of shift and xor instructions,
119 // It does make sense to sometimes use a different reduction optimization
120 // that saves a pclmulqdq, though: precompute the hash key times x^64, and
[all …]
|
| /linux-6.12.1/Documentation/userspace-api/media/v4l/ |
| D | metafmt-generic.rst | 17 .. _v4l2-meta-fmt-generic-8:
22 The V4L2_META_FMT_GENERIC_8 format is a plain 8-bit metadata format. This format
23 is used on CSI-2 for 8 bits per :term:`Data Unit`.
30 Each cell is one byte. "M" denotes a byte of metadata.
37 :widths: 12 8 8 8 8
55 V4L2_META_FMT_GENERIC_CSI2_10 contains 8-bit generic metadata packed in 10-bit
57 format is typically used by CSI-2 receivers with a source that transmits
72 Each cell is one byte. "M" denotes a byte of metadata and "x" a byte of padding.
74 .. tabularcolumns:: |p{2.4cm}|p{1.2cm}|p{1.2cm}|p{1.2cm}|p{1.2cm}|p{.8cm}|
79 :widths: 12 8 8 8 8 8
[all …]
|
| /linux-6.12.1/fs/reiserfs/ |
| D | hashes.c | 3 * Keyed 32-bit hash function using TEA in a Davis-Meyer function
23 /* a, b, c, d - data; h0, h1 - accumulated hash */
36 b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); \
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()
62 (u32) msg[5] << 8 | (u32) msg[6] << 16 | (u32) msg[7] << 24; in keyed_hash()
63 c = (u32) msg[8] | in keyed_hash()
64 (u32) msg[9] << 8 | in keyed_hash()
[all …]
|
| /linux-6.12.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
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
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
64 * a modifier: a buffer may match a 64-pixel aligned modifier and a 32-pixel
69 * a canonical pair needs to be defined and used by all drivers. Preferred
105 #define fourcc_code(a, b, c, d) ((__u32)(a) | ((__u32)(b) << 8) | \ argument
[all …]
|
| /linux-6.12.1/Documentation/gpu/ |
| D | afbc.rst | 7 AFBC is a proprietary lossless image compression protocol and format.
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).
42 * Component 0: R(8)
43 * Component 1: G(8)
44 * Component 2: B(8)
45 * Component 3: A(8)
49 * Component 0: R(8)
50 * Component 1: G(8)
51 * Component 2: B(8)
[all …]
|
| /linux-6.12.1/Documentation/bpf/ |
| D | verifier.rst | 16 At the start of the program the register R1 contains a pointer to context
33 R0 has a return type of the function.
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
69 that offset 8 of size 4 bytes can be accessed for reading, otherwise
72 stack bounds, which are [-MAX_BPF_STACK, 0). In this example offset is 8,
[all …]
|
| /linux-6.12.1/lib/842/ |
| D | 842.h | 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
34 * the end of the output buffer. Essentially, the index points to a position
[all …]
|
| /linux-6.12.1/Documentation/admin-guide/device-mapper/ |
| D | dm-service-time.rst | 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.
30 other paths having a positive value are available.
36 'A' if the path is active, 'F' if the path is failed.
51 Basically, dm-service-time selects a path having minimum service time
82 # echo "0 10 multipath 0 0 1 1 service-time 0 2 2 8:0 128 1 8:16 128 4" \
86 test: 0 10 multipath 0 0 1 1 service-time 0 2 2 8:0 128 1 8:16 128 4
[all …]
|
| /linux-6.12.1/Documentation/admin-guide/media/ |
| D | dvb_intro.rst | 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
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
46 The purpose of a simple budget digital TV card (DVB-T,C or S) is to
49 * Tune the received to receive a broadcast signal. * Extract the encoded
55 digital TV card spits out a compressed encoded digital datastream. As
[all …]
|
| /linux-6.12.1/arch/powerpc/kernel/ |
| D | idle_book3s.S | 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)
63 std r16,-8*4(r1)
64 std r17,-8*5(r1)
65 std r18,-8*6(r1)
66 std r19,-8*7(r1)
[all …]
|
| /linux-6.12.1/drivers/gpu/drm/ci/xfails/ |
| D | vkms-none-skips.txt | 11 …a 01 00 00 8b 42 30 2b 42 28 41 39 c5 0f 8c 6f 01 00 00 49 83 c7 01 49 39 df 74 3b 4b 8b 34 fc 48 …
45 …a 01 00 00 8b 42 30 2b 42 28 41 39 c5 0f 8c 6f 01 00 00 49 83 c7 01 49 39 df 74 3b 4b 8b 34 fc 48 …
62 …a 01 00 00 8b 42 30 2b 42 28 41 39 c5 0f 8c 6f 01 00 00 49 83 c7 01 49 39 df 74 3b 4b 8b 34 fc 48 …
96 …a 01 00 00 8b 42 30 2b 42 28 41 39 c5 0f 8c 6f 01 00 00 49 83 c7 01 49 39 df 74 3b 4b 8b 34 fc 48 …
113 …a 34 0f 8e 91 fe ff ff 44 89 ea 48 8d 7c 24 48 e8 71 f0 ff ff 4b 8b 04 fc 48 8b 4c 24 50 48 8b 7c …
147 …a 34 0f 8e 91 fe ff ff 44 89 ea 48 8d 7c 24 48 e8 71 f0 ff ff 4b 8b 04 fc 48 8b 4c 24 50 48 8b 7c …
164 …a 34 0f 8e 91 fe ff ff 44 89 ea 48 8d 7c 24 48 e8 71 f0 ff ff 4b 8b 04 fc 48 8b 4c 24 50 48 8b 7c …
200 …a 34 0f 8e 91 fe ff ff 44 89 ea 48 8d 7c 24 48 e8 71 f0 ff ff 4b 8b 04 fc 48 8b 4c 24 50 48 8b 7c …
|
| /linux-6.12.1/Documentation/userspace-api/media/rc/ |
| D | rc-protos.rst | 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
32 This IR protocol uses manchester encoding to encode 14 bits. There is a
67 - 8 to 13
77 There is a variant of rc5 called either rc5x or extended rc5
130 This rc-5 extended to encoded 20 bits. The is a 3555 microseconds space
[all …]
|
| /linux-6.12.1/kernel/irq/ |
| D | timings.c | 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.
69 * Suffix array is an array of all the suffixes of a string. It is
70 * widely used as a data structure for compression, text search, ...
72 * 'anana' 'nana' 'ana' 'na' 'a'
77 * search by a max period and min period.
[all …]
|
| /linux-6.12.1/arch/arm64/lib/ |
| D | kasan_sw_tags.S | 10 * Report a tag mismatch detected by tag-based KASAN.
12 * A compiler-generated thunk calls this with a non-AAPCS calling
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
43 stp x2, x3, [sp, #8 * 2]
44 stp x4, x5, [sp, #8 * 4]
45 stp x6, x7, [sp, #8 * 6]
46 stp x8, x9, [sp, #8 * 8]
[all …]
|
| D | strncmp.S | 14 * ARMv8-a, AArch64.
71 (=> (X - 1) & ~(X | 0x7f)) is non-zero iff a byte is zero, and
75 ldr data1, [src1], #8
76 ldr data2, [src2], #8
78 subs limit, limit, #8
91 add limit, limit, 8 /* Rewind limit to before last subs. */
103 perform a signed 32-bit subtraction. */
109 /* Not reached the limit, must have found the end or a diff. */
111 add tmp1, limit, 8
136 /* Re-compute the NUL-byte detection, using a byte-reversed value. */
[all …]
|
| /linux-6.12.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-6.12.1/drivers/ras/amd/atl/ |
| D | reg_fields.h | 17 * a) "x" is the first major revision where the new field appears.
31 * DF2 BlockFabricId [19:8]
32 * DF3 BlockFabricId [19:8]
33 * DF3p5 BlockFabricId [19:8]
34 * DF4 BlockFabricId [19:8]
35 * DF4p5 BlockFabricId [15:8]
37 #define DF2_COH_ST_FABRIC_ID GENMASK(19, 8)
38 #define DF4p5_COH_ST_FABRIC_ID GENMASK(15, 8)
48 * DF2 N/A
97 * DF2 DieIdMask [15:8]
[all …]
|
| /linux-6.12.1/arch/powerpc/crypto/ |
| D | aes-tab-4k.S | 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
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
34 .long R(ee, 77, 77, 99), R(f6, 7b, 7b, 8d)
40 .long R(4d, ab, ab, e6), R(ec, 76, 76, 9a)
41 .long R(8f, ca, ca, 45), R(1f, 82, 82, 9d)
44 .long R(8e, 47, 47, c9), R(fb, f0, f0, 0b)
[all …]
|
| /linux-6.12.1/include/uapi/linux/ |
| D | videodev2.h | 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
36 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
74 #define VIDEO_MAX_PLANES 8
77 * M I S C E L L A N E O U S
81 #define v4l2_fourcc(a, b, c, d)\ argument
82 ((__u32)(a) | ((__u32)(b) << 8) | ((__u32)(c) << 16) | ((__u32)(d) << 24))
83 #define v4l2_fourcc_be(a, b, c, d) (v4l2_fourcc(a, b, c, d) | (1U << 31)) argument
102 V4L2_FIELD_INTERLACED_TB = 8, /* both fields interlaced, top field
149 V4L2_BUF_TYPE_VIDEO_OUTPUT_OVERLAY = 8,
213 * based on a misunderstanding of the bt878 datasheet.
[all …]
|
| /linux-6.12.1/Documentation/driver-api/early-userspace/ |
| D | buffer-format.rst | 14 expanded into a ramfs filesystem; this document details the format of
20 initramfs buffer is thus a single .cpio.gz file.
42 In human terms, the initramfs buffer contains a collection of
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
63 c_nlink 8 bytes Number of links
64 c_mtime 8 bytes Modification time
65 c_filesize 8 bytes Size of data field
[all …]
|
| /linux-6.12.1/tools/testing/selftests/bpf/progs/ |
| D | verifier_array_access.c | 39 __description("valid map access into an array with a constant")
46 *(u64*)(r10 - 8) = r1; \ in an_array_with_a_constant_1()
48 r2 += -8; \ in an_array_with_a_constant_1()
63 __description("valid map access into an array with a register")
70 *(u64*)(r10 - 8) = r1; \ in __flag()
72 r2 += -8; \ in __flag()
90 __description("valid map access into an array with a variable")
97 *(u64*)(r10 - 8) = r1; \ in __flag()
99 r2 += -8; \ in __flag()
119 __description("valid map access into an array with a signed variable")
[all …]
|
| /linux-6.12.1/Documentation/filesystems/ext4/ |
| D | directory.rst | 6 In an ext4 filesystem, a directory is more or less a flat file that maps
12 associated with a directory file for the particular directory entry that
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
24 end of the block; the last entry in the block has a record length that
37 :widths: 8 8 24 40
51 - Length of this directory entry. Must be a multiple of 4.
62 entry format shortens the name_len field and uses the space for a file
69 :widths: 8 8 24 40
[all …]
|
| /linux-6.12.1/arch/arm64/crypto/ |
| D | crct10dif-ce-core.S | 24 // This software is available to you under a choice of one of two
49 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
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
138 ext t6.8b, ad.8b, ad.8b, #3 // A3
140 pmull t4.8h, t4.8b, fold_consts.8b // F = A1*B
141 pmull t8.8h, ad.8b, bd1.8b // E = A*B1
[all …]
|