| /linux/include/linux/ |
| H A D | crc32.h | 9 * crc32_le() - Compute least-significant-bit-first IEEE CRC-32
20 * - Bit order: Least-significant-bit-first
40 * crc32_be() - Compute most-significant-bit-first IEEE CRC-32
47 * *most-significant-bit-first* variant of the CRC. I.e., within each byte, the
48 * most significant bit is processed first (treated as highest order polynomial
53 * - Bit order: Most-significant-bit-first
73 * - Bit order: Least-significant-bit-first
102 * Ethernet sends the least significant bit of a byte first, thus crc32_le
103 * is used. The output of crc32_le is bit reversed [most significant bit
|
| H A 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).
|
| H A 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/tools/testing/selftests/powerpc/tm/ |
| H A 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/arch/powerpc/lib/ |
| H A 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/arch/arc/lib/ |
| H A 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/tools/testing/selftests/powerpc/stringloops/ |
| H A 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/Documentation/core-api/ |
| H A D | packing.rst | 114 4 bytes correspond to the least significant 4-byte word, next 4 bytes to
115 the more significant 4-byte word.
166 shortening the most significant group of 4 octets to the number of octets
177 31 29 28 | Group 7 (most significant)
184 3 2 1 0 | Group 0 (least significant)
190 3 2 1 0 | Group 0 (least significant)
197 30 29 28 | Group 7 (most significant)
203 30 28 29 | Group 7 (most significant)
210 0 1 2 3 | Group 0 (least significant)
216 0 1 2 3 | Group 0 (least significant)
[all …]
|
| /linux/drivers/media/radio/ |
| H A 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/arch/powerpc/math-emu/ |
| H A 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/lib/crc/riscv/ |
| H A D | crc-clmul-consts.h | 18 * Constants generated for most-significant-bit-first CRC-16 using
36 * Constants generated for most-significant-bit-first CRC-32 using
55 * Constants generated for least-significant-bit-first CRC-32 using
74 * Constants generated for least-significant-bit-first CRC-32 using
93 * Constants generated for most-significant-bit-first CRC-64 using
109 * Constants generated for least-significant-bit-first CRC-64 using
|
| /linux/arch/powerpc/platforms/pseries/ |
| H A D | papr-platform-dump.c | 31 * @dump_tag_hi: In: Most-significant 32 bits of a Dump_Tag representing
33 * @dump_tag_lo: In: Least-significant 32 bits of a Dump_Tag representing
35 * @sequence_hi: In: Sequence number in most-significant 32 bits.
36 * Out: Next sequence number in most-significant 32 bits.
37 * @sequence_lo: In: Sequence number in Least-significant 32 bits
38 * Out: Next sequence number in Least-significant 32 bits.
39 * @bytes_ret_hi: Out: Bytes written in most-significant 32 bits.
40 * @bytes_ret_lo: Out: Bytes written in Least-significant 32 bits.
|
| /linux/arch/parisc/math-emu/ |
| H A 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()
|
| H A 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/arch/s390/include/asm/ |
| H A D | bitops.h | 129 * Returns the bit number of the most significant bit set,
130 * where the most significant bit has bit number 0.
203 * __fls - find last (most-significant) set bit in a long word
218 * ffsll, but returns the position of the most significant set bit.
221 * set bit if value is nonzero. The last (most significant) bit is
232 * fls - find last (most-significant) bit set
|
| /linux/arch/arm64/kernel/pi/ |
| H A D | relocate.c | 40 * The bitmap entries must have 1 in the least significant bit. The in relocate_kernel()
45 * With the exception of the least significant bit, each bit in the in relocate_kernel()
48 * to be applied to it. The second least significant bit represents the in relocate_kernel()
|
| /linux/tools/include/asm-generic/bitops/ |
| H A 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/include/asm-generic/bitops/ |
| H A 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/lib/crypto/mpi/ |
| H A 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()
|
| H A D | mpi-div.c | 148 /* Normalize the denominator, i.e. make its most significant bit set by in mpi_tdiv_qr()
156 /* Shift up the denominator setting the most significant bit of in mpi_tdiv_qr()
157 * the most significant word. Use temporary storage not to clobber in mpi_tdiv_qr()
167 * significant word. Move the shifted numerator in the remainder in mpi_tdiv_qr()
|
| H A 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/Documentation/driver-api/mmc/ |
| H A 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/Documentation/userspace-api/media/rc/ |
| H A 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/net/hsr/ |
| H A D | hsr_main.h | 53 * significant bits of the 16-bit field shared by 'path' and 'LSDU_size' (or
54 * equivalently, the 4 most significant bits of HSR tag byte 14).
57 * indicates the spec is written with the least significant bit first (to the
209 u8 net_id; /* for PRP, it occupies most significant 3 bits
|
| /linux/arch/x86/include/asm/ |
| H A D | bitops.h | 342 * set bit if value is nonzero. The first (least significant) bit
352 * ffs, but returns the position of the most significant set bit.
355 * set bit if value is nonzero. The last (most significant) bit is
396 * ffsll, but returns the position of the most significant set bit.
399 * set bit if value is nonzero. The last (most significant) bit is
|