| /linux-6.8/tools/testing/selftests/powerpc/tm/ |
| D | tm-signal-context-chk-vsx.c | 35 #define FPR20 20 /* FPR20 overlaps VSX20 most significant doubleword */
68 * FP registers (f0-31) overlap the most significant 64 bits of VSX in signal_usr1()
81 * registers, but only the least significant 64 bits of vsr0-31. The in signal_usr1()
82 * most significant 64 bits of vsr0-31 (f0-31), as it overlaps the FP in signal_usr1()
90 * part of one VSX half, i.e. v_regs + 1 points to the least significant in signal_usr1()
91 * 64 bits of vsr0-31. The other part of this half (the most significant in signal_usr1()
95 /* Get pointer to least significant doubleword of vsr0-31 */ in signal_usr1()
102 * Copy VSX most significant doubleword from fp_regs and in signal_usr1()
103 * copy VSX least significant one from 64-bit slots below in signal_usr1()
126 * Copy VSX most significant doubleword from fp_regs and in signal_usr1()
[all …]
|
| /linux-6.8/tools/edid/ |
| D | edid.S | 120 /* Red and green least-significant bits
121 Bits 7-6 Red x value least-significant 2 bits
122 Bits 5-4 Red y value least-significant 2 bits
123 Bits 3-2 Green x value lst-significant 2 bits
124 Bits 1-0 Green y value least-significant 2 bits */
127 /* Blue and white least-significant 2 bits */
130 /* Red x value most significant 8 bits.
134 /* Red y value most significant 8 bits */
137 /* Green x and y value most significant 8 bits */
140 /* Blue x and y value most significant 8 bits */
[all …]
|
| /linux-6.8/tools/testing/selftests/powerpc/stringloops/ |
| D | strlen_32.S | 20 * byte changed from 0 to 1. This works because the least significant
22 * significant), so it is 0x00 - 0x01 == 0xff. For all other
28 * match, but possibly false 0x80 matches in the next more significant
30 * of no consequence since the least significant match is the one
40 * which was the most significant bit set and divide by 8 to find how
|
| /linux-6.8/arch/arc/lib/ |
| D | strcmp.S | 33 bic_s r0,r0,r1 ; mask for least significant difference bit
35 xor r0,r5,r1 ; mask for least significant difference byte
50 bic_s r0,r0,r1 ; mask for least significant difference bit
52 xor r0,r5,r1 ; mask for least significant difference byte
61 because of carry-propagateion from a lower significant zero byte.
|
| /linux-6.8/arch/powerpc/lib/ |
| D | strlen_32.S | 20 * byte changed from 0 to 1. This works because the least significant
22 * significant), so it is 0x00 - 0x01 == 0xff. For all other
28 * match, but possibly false 0x80 matches in the next more significant
30 * of no consequence since the least significant match is the one
40 * which was the most significant bit set and divide by 8 to find how
|
| /linux-6.8/Documentation/arch/sparc/oradax/ |
| D | dax-hv-api.txt | 258 … 1); bits are read most significant bit to least significant bit
265 … length encoding 1); bits are read most significant bit to least significant bit
269 … Huffman (CCB version 0) or bits are read most significant bit to least significant bit
273 … Huffman (CCB version 0) or 1); compressed stream bits are read most significant bit to
274 … OZIP (CCB version 1) encoding least significant bit within a byte; pointer to the encoding
277 … Huffman (CCB version 0) or bits are read most significant bit to least significant bit
289 … run length encoding, followed by bits are read most significant bit to least significant bit
295 … Huffman (CCB version 0) or significant bit to least significant bit within a byte; data
310 …s encoded in a fixed width, bit-packed format. The bits are read from most significant bit to least
311 …significant bit within a byte. There are two encoding options for the secondary input stream data …
[all …]
|
| /linux-6.8/drivers/media/radio/ |
| D | radio-tea5777.h | 31 * datasheet being the most significant byte (so byte 5 of the u64),
32 * and byte 6 from the datasheet being the least significant byte.
41 * the datasheet is stored as the most significant byte (so byte 2 of
43 * significant byte (iow byte 0 of the u32).
|
| /linux-6.8/arch/powerpc/math-emu/ |
| D | udivmodti4.c | 55 /* Normalize, i.e. make the most significant bit of the in _fp_udivmodti4()
79 /* From (n1 >= d0) /\ (the most significant bit of d0 is set), in _fp_udivmodti4()
80 conclude (the most significant bit of n1 is set) /\ (the in _fp_udivmodti4()
136 /* From (n1 >= d1) /\ (the most significant bit of d1 is set), in _fp_udivmodti4()
137 conclude (the most significant bit of n1 is set) /\ (the in _fp_udivmodti4()
|
| /linux-6.8/arch/parisc/math-emu/ |
| D | fcnvuf.c | 68 * Check word for most significant bit set. Returns in sgl_to_sgl_fcnvuf()
127 * Check word for most significant bit set. Returns in sgl_to_dbl_fcnvuf()
169 * Check word for most significant bit set. Returns in dbl_to_sgl_fcnvuf()
185 * Check word for most significant bit set. Returns in dbl_to_sgl_fcnvuf()
251 * Check word for most significant bit set. Returns in dbl_to_dbl_fcnvuf()
267 * Check word for most significant bit set. Returns in dbl_to_dbl_fcnvuf()
|
| D | fcnvxf.c | 76 * Check word for most significant bit set. Returns in sgl_to_sgl_fcnvxf()
147 * Check word for most significant bit set. Returns in sgl_to_dbl_fcnvxf()
199 * Check word for most significant bit set. Returns in dbl_to_sgl_fcnvxf()
221 * Check word for most significant bit set. Returns in dbl_to_sgl_fcnvxf()
304 * Check word for most significant bit set. Returns in dbl_to_dbl_fcnvxf()
326 * Check word for most significant bit set. Returns in dbl_to_dbl_fcnvxf()
|
| /linux-6.8/arch/powerpc/include/asm/ |
| D | perf_event_server.h | 134 * N <= 2^(k-1) - 1. The mask has the most significant bit of the field
135 * set (and the other bits 0), and the value has only the least significant
145 * is assigned one bit from the least-significant N bits. The mask has
146 * only the most-significant bit set, and the value has only the bit
147 * for the event_id's class set. The test_adder has the least significant
|
| /linux-6.8/drivers/misc/echo/ |
| D | echo.h | 87 adaption is only performed when we are transmitting a significant signal level,
89 we are sending a significant signal. Telling, if the environment is generating
90 a significant signal, and doing it with sufficient speed that the adaption will
93 The key problem in detecting when the environment is sourcing significant
|
| /linux-6.8/arch/s390/include/asm/ |
| D | bitops.h | 268 * Returns the bit number of the most significant bit set,
269 * where the most significant bit has bit number 0.
342 * __fls - find last (most-significant) set bit in a long word
357 * ffsll, but returns the position of the most significant set bit.
360 * set bit if value is nonzero. The last (most significant) bit is
371 * fls - find last (most-significant) bit set
|
| /linux-6.8/include/linux/ |
| D | ppp_defs.h | 20 * Protocol is valid if the value is odd and the least significant bit of the
21 * most significant octet is 0 (see RFC 1661, section 2).
|
| D | kern_levels.h | 13 #define KERN_NOTICE KERN_SOH "5" /* normal but significant condition */
35 #define LOGLEVEL_NOTICE 5 /* normal but significant condition */
|
| /linux-6.8/lib/crypto/mpi/ |
| D | mpih-div.c | 60 * most significant bit (with weight 2**N) implicit. in mpihelp_mod_1()
96 * most significant bit (with weight 2**N) implicit. in mpihelp_mod_1()
172 * the NSIZE-DSIZE least significant quotient limbs at QP
176 * Return the most significant limb of the quotient, this is always 0 or 1.
180 * 1. The most significant bit of the divisor must be set.
410 * most significant bit (with weight 2**N) implicit. in mpihelp_divmod_1()
445 * most significant bit (with weight 2**N) implicit. in mpihelp_divmod_1()
|
| D | mpi-div.c | 162 /* Normalize the denominator, i.e. make its most significant bit set by in mpi_tdiv_qr()
170 /* Shift up the denominator setting the most significant bit of in mpi_tdiv_qr()
171 * the most significant word. Use temporary storage not to clobber in mpi_tdiv_qr()
179 * significant word. Move the shifted numerator in the remainder in mpi_tdiv_qr()
|
| D | generic_mpih-lshift.c | 19 * and store the USIZE least significant digits of the result at WP.
20 * Return the bits shifted out from the most significant digit.
|
| /linux-6.8/tools/include/asm-generic/bitops/ |
| D | fls64.h | 12 * ffsll, but returns the position of the most significant set bit.
15 * set bit if value is nonzero. The last (most significant) bit is
|
| /linux-6.8/include/asm-generic/bitops/ |
| D | fls64.h | 12 * ffsll, but returns the position of the most significant set bit.
15 * set bit if value is nonzero. The last (most significant) bit is
|
| /linux-6.8/Documentation/devicetree/bindings/dma/ |
| D | atmel-dma.txt | 25 2. The memory interface (16 most significant bits), the peripheral interface
26 (16 less significant bits).
|
| /linux-6.8/Documentation/driver-api/mmc/ |
| D | mmc-async-req.rst | 8 How significant is the cache maintenance overhead?
11 pre-fetch makes the cache overhead relatively significant. If the DMA
31 more significant the prepare request time becomes. Roughly the expected
|
| /linux-6.8/Documentation/userspace-api/media/rc/ |
| D | lirc-set-transmitter-mask.rst | 29 Mask with channels to enable tx. Channel 0 is the least significant bit.
40 encoded by the least significant bit and so on.
|
| /linux-6.8/net/hsr/ |
| D | hsr_main.h | 51 * significant bits of the 16-bit field shared by 'path' and 'LSDU_size' (or
52 * equivalently, the 4 most significant bits of HSR tag byte 14).
55 * indicates the spec is written with the least significant bit first (to the
208 u8 net_id; /* for PRP, it occupies most significant 3 bits
|
| /linux-6.8/Documentation/userspace-api/media/v4l/ |
| D | pixfmt-yuv-luma.rst | 14 - In all the tables that follow, bit 7 is the most significant bit in a byte.
159 leaves the 6 most significant bits of the last byte padded with 0.
163 its padding located in the most significant bits of the 16 bit word.
|