| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-5.10/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
69 #define fourcc_code(a, b, c, d) ((__u32)(a) | ((__u32)(b) << 8) | \ argument
78 #define DRM_FORMAT_C8 fourcc_code('C', '8', ' ', ' ') /* [7:0] C */
80 /* 8 bpp Red */
81 #define DRM_FORMAT_R8 fourcc_code('R', '8', ' ', ' ') /* [7:0] R */
87 #define DRM_FORMAT_RG88 fourcc_code('R', 'G', '8', '8') /* [15:0] R:G 8:8 little endian */
[all …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-6.6/arch/ia64/lib/ |
| D | copy_page_mck.S | 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
32 * the prefetches. The four relevant points in the pipelined are called A, B, C, D:
33 * p[A] is TRUE if a source-line should be prefetched, p[B] is TRUE if a destination-line
35 * into L1D and p[D] is TRUE if a cacheline needs to be copied.
40 * As a secondary optimization, the first 2*PREFETCH_DIST iterations are implemented
67 #define PREFETCH_DIST 8 // McKinley sustains 16 outstanding L2 misses (8 ld, 8 st)
95 #define A 0 macro
[all …]
|
| /kernel/linux/linux-5.10/arch/ia64/lib/ |
| D | copy_page_mck.S | 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
32 * the prefetches. The four relevant points in the pipelined are called A, B, C, D:
33 * p[A] is TRUE if a source-line should be prefetched, p[B] is TRUE if a destination-line
35 * into L1D and p[D] is TRUE if a cacheline needs to be copied.
40 * As a secondary optimization, the first 2*PREFETCH_DIST iterations are implemented
67 #define PREFETCH_DIST 8 // McKinley sustains 16 outstanding L2 misses (8 ld, 8 st)
95 #define A 0 macro
[all …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/patches/linux-4.19/prebuilts/usr/include/drm/ |
| D | drm_fourcc.h | 12 #define fourcc_code(a, b, c, d) ((__u32)(a) | ((__u32)(b) << 8) | \ argument
15 #define DRM_FORMAT_C8 fourcc_code('C', '8', ' ', ' ')
16 #define DRM_FORMAT_R8 fourcc_code('R', '8', ' ', ' ')
18 #define DRM_FORMAT_RG88 fourcc_code('R', 'G', '8', '8')
19 #define DRM_FORMAT_GR88 fourcc_code('G', 'R', '8', '8')
22 #define DRM_FORMAT_RGB332 fourcc_code('R', 'G', 'B', '8')
23 #define DRM_FORMAT_BGR233 fourcc_code('B', 'G', 'R', '8')
28 #define DRM_FORMAT_ARGB4444 fourcc_code('A', 'R', '1', '2')
29 #define DRM_FORMAT_ABGR4444 fourcc_code('A', 'B', '1', '2')
30 #define DRM_FORMAT_RGBA4444 fourcc_code('R', 'A', '1', '2')
[all …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-6.6/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 …]
|