Home
last modified time | relevance | path

Searched +full:8 +full:a (Results 1 – 25 of 2144) sorted by relevance

12345678910>>...86

/openbmc/openbmc/meta-openembedded/meta-oe/recipes-benchmark/lmbench/lmbench/
H A D0001-doc-Fix-typos-in-manual-pages.patch10 doc/bw_mem.8 | 2 +-
11 doc/lat_fcntl.8 | 2 +-
12 doc/lat_fifo.8 | 2 +-
13 doc/lat_http.8 | 6 +++---
14 doc/lat_select.8 | 2 +-
15 doc/lat_sig.8 | 2 +-
16 6 files changed, 8 insertions(+), 8 deletions(-)
18 diff --git a/doc/bw_mem.8 b/doc/bw_mem.8
20 --- a/doc/bw_mem.8
21 +++ b/doc/bw_mem.8
[all …]
/openbmc/linux/arch/x86/crypto/
H A Dtwofish-x86_64-asm_64.S15 #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 …]
H A Dtwofish-i586-asm_32.S16 #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 …]
/openbmc/u-boot/arch/nios2/lib/
H A Dlibgcc.c32 #define BITS_PER_UNIT 8
43 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
44 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
45 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
46 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8
130 __cmpdi2 (DWtype a, DWtype b) in __cmpdi2() argument
132 const DWunion au = {.ll = a}; in __cmpdi2()
427 __ucmpdi2 (DWtype a, DWtype b) in __ucmpdi2() argument
429 const DWunion au = {.ll = a}; in __ucmpdi2()
485 __divsi3 (SItype a, SItype b) in __divsi3() argument
[all …]
/openbmc/linux/fs/reiserfs/
H A Dhashes.c3 * 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 …]
/openbmc/linux/Documentation/gpu/
H A Dafbc.rst7 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 …]
/openbmc/linux/arch/ia64/lib/
H A Dcopy_page_mck.S17 * - 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 …]
H A Dstrlen.S25 // 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
63 // czx nor cmp instruction raise a NaT consumption fault. We must be
64 // careful not to look too far for a Nat for which we don't care.
65 // For instance we don't need to look at a NaT in val2 if the zero byte
[all …]
/openbmc/qemu/target/arm/tcg/
H A Dneon_helper.c69 /* Copy from a uint32_t to a vector structure type. */ in NEON_TYPE4()
79 /* Copy from a vector structure type to a uint32_t. */
158 /* For 32-bit elements each segment only contains a single element, so
220 (dest = do_sqrshl_bhs(src1, (int8_t)src2, 8, true, NULL))
252 (dest = do_uqrshl_bhs(src1, (int8_t)src2, 8, true, NULL))
284 (dest = do_uqrshl_bhs(src1, (int8_t)src2, 8, false, env->vfp.qc))
320 (dest = do_sqrshl_bhs(src1, (int8_t)src2, 8, false, env->vfp.qc))
356 (dest = do_suqrshl_bhs(src1, (int8_t)src2, 8, false, env->vfp.qc))
388 (dest = do_uqrshl_bhs(src1, (int8_t)src2, 8, true, env->vfp.qc)) in NEON_GVEC_VOP2i_ENV()
420 (dest = do_sqrshl_bhs(src1, (int8_t)src2, 8, true, env->vfp.qc))
[all …]
/openbmc/qemu/include/standard-headers/drm/
H A Ddrm_fourcc.h4 * Permission is hereby granted, free of charge, to any person obtaining a
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
37 * fourcc code, a Format Modifier may optionally be provided, in order to
43 * Format modifiers are used in conjunction with a fourcc code, forming a
55 * vendor-namespaced, and as such the relationship between a fourcc code and a
60 * Modifiers must uniquely encode buffer layout. In other words, a buffer must
61 * match only a single modifier. A modifier must not be a subset of layouts of
63 * a modifier: a buffer may match a 64-pixel aligned modifier and a 32-pixel
68 * a canonical pair needs to be defined and used by all drivers. Preferred
104 #define fourcc_code(a, b, c, d) ((uint32_t)(a) | ((uint32_t)(b) << 8) | \ argument
[all …]
/openbmc/linux/include/uapi/drm/
H A Ddrm_fourcc.h4 * 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 …]
/openbmc/openbmc/meta-openembedded/meta-multimedia/recipes-multimedia/dvb-apps/files/dvb-scan-table/atsc/
H A Dus-PA-Philadelphia3 #A 183000000 8VSB
4 #A 515000000 8VSB
5 #A 545000000 8VSB
6 #A 551000000 8VSB
10 MODULATION = VSB/8
16 MODULATION = VSB/8
22 MODULATION = VSB/8
25 #A 641000000 8VSB
29 MODULATION = VSB/8
35 MODULATION = VSB/8
[all …]
/openbmc/linux/Documentation/admin-guide/device-mapper/
H A Ddm-service-time.rst5 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 …]
/openbmc/linux/lib/842/
H A D842.h12 * 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 …]
/openbmc/linux/Documentation/bpf/
H A Dverifier.rst16 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 …]
/openbmc/linux/arch/powerpc/kernel/
H A Didle_book3s.S26 * 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 …]
/openbmc/linux/Documentation/admin-guide/media/
H A Ddvb_intro.rst17 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 …]
/openbmc/openbmc/meta-openembedded/meta-networking/recipes-protocols/freediameter/files/
H A DReplace-murmurhash-algorithm-with-Robert-Jenkin-s-ha.patch14 diff --git a/libfdproto/ostr.c b/libfdproto/ostr.c
15 index 8f29b48..ce1f4dd 100644
16 --- a/libfdproto/ostr.c
33 +#define mix(a, b, c) \
35 + a = a - b; a = a - c; a = a ^ (c >> 13); \
36 + b = b - c; b = b - a; b = b ^ (a << 8); \
37 + c = c - a; c = c - b; c = c ^ (b >> 13); \
38 + a = a - b; a = a - c; a = a ^ (c >> 12); \
39 + b = b - c; b = b - a; b = b ^ (a << 16); \
40 + c = c - a; c = c - b; c = c ^ (b >> 5); \
[all …]
/openbmc/linux/arch/arm64/lib/
H A Dkasan_sw_tags.S10 * 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 …]
/openbmc/linux/Documentation/userspace-api/media/rc/
H A Drc-protos.rst9 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 …]
/openbmc/linux/kernel/irq/
H A Dtimings.c40 * 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 …]
/openbmc/qemu/include/tcg/
H A Dtcg-cond.h6 * Permission is hereby granted, free of charge, to any person obtaining a copy
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
42 TCG_COND_EQ = 8 | 0 | 0 | 0,
43 TCG_COND_NE = 8 | 0 | 0 | 1,
46 TCG_COND_TSTEQ = 8 | 4 | 0 | 0,
47 TCG_COND_TSTNE = 8 | 4 | 0 | 1,
56 TCG_COND_LTU = 8 | 0 | 2 | 0,
57 TCG_COND_GEU = 8 | 0 | 2 | 1,
58 TCG_COND_GTU = 8 | 4 | 2 | 0,
59 TCG_COND_LEU = 8 | 4 | 2 | 1,
[all …]
/openbmc/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 …]
/openbmc/qemu/tests/decode/
H A Dsucc_pattern_group_nest3.decode6 sub1 00000000 a:8 b:8 c:8
7 sub2 00000001 a:8 b:8 c:8
8 sub3 00000010 a:8 b:8 c:8
10 sub4 000000 d:2 a:8 b:8 c:8
/openbmc/linux/arch/powerpc/crypto/
H A Daes-tab-4k.S10 * 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 …]

12345678910>>...86