Searched refs:polynomial (Results 1 – 17 of 17) sorted by relevance
| /linux-4.4.14/lib/ |
| D | crc8.c | 29 void crc8_populate_msb(u8 table[CRC8_TABLE_SIZE], u8 polynomial) in crc8_populate_msb() argument
38 t = (t << 1) ^ (t & msbit ? polynomial : 0); in crc8_populate_msb()
51 void crc8_populate_lsb(u8 table[CRC8_TABLE_SIZE], u8 polynomial) in crc8_populate_lsb() argument
59 t = (t >> 1) ^ (t & 1 ? polynomial : 0); in crc8_populate_lsb()
|
| D | crc32.c | 147 u32 polynomial) argument
154 crc = (crc >> 1) ^ ((crc & 1) ? polynomial : 0);
240 u32 polynomial) argument
242 u32 power = polynomial; /* CRC of x^32 */
247 crc = (crc >> 1) ^ (crc & 1 ? polynomial : 0);
256 crc = gf2_multiply(crc, power, polynomial);
263 power = gf2_multiply(power, power, polynomial);
292 u32 polynomial) argument
300 (crc << 1) ^ ((crc & 0x80000000) ? polynomial :
|
| D | gen_crc32table.c | 35 static void crc32init_le_generic(const uint32_t polynomial, in crc32init_le_generic() argument
44 crc = (crc >> 1) ^ ((crc & 1) ? polynomial : 0); in crc32init_le_generic()
|
| /linux-4.4.14/include/linux/ |
| D | crc8.h | 55 void crc8_populate_lsb(u8 table[CRC8_TABLE_SIZE], u8 polynomial);
73 void crc8_populate_msb(u8 table[CRC8_TABLE_SIZE], u8 polynomial);
|
| /linux-4.4.14/Documentation/ |
| D | crc32.txt | 5 CRC polynomial. To check the CRC, you can either check that the
18 To produce a 32-bit CRC, the divisor is actually a 33-bit CRC polynomial.
40 the polynomial from the remainder and we're back to where we started,
77 The most significant coefficient of the remainder polynomial is stored
117 and the correct multiple of the polynomial to subtract is found using
172 of a polynomial produces a larger multiple of that polynomial. Thus,
|
| /linux-4.4.14/arch/m68k/fpsp040/ |
| D | satan.S | 30 | Step 3. Approximate arctan(u) by a polynomial poly.
37 | Step 6. Approximate arctan(X) by an odd polynomial in X. Exit.
39 | Step 7. Define X' = -1/X. Approximate arctan(X') by an odd polynomial in X'.
|
| D | slogn.S | 27 | Step 1. If |X-1| < 1/16, approximate log(X) by an odd polynomial in
34 | Step 3. Define u = (Y-F)/F. Approximate log(1+u) by a polynomial in u,
42 | Step 1: If |X| < 1/16, approximate log(1+X) by an odd polynomial in
|
| D | ssin.S | 41 | where cos(r) is approximated by an even polynomial in r,
46 | where sin(r) is approximated by an odd polynomial in r
|
| D | setox.S | 127 | Step 4. Approximate exp(R)-1 by a polynomial
799 |--Step 9 exp(X)-1 by a simple polynomial
|
| /linux-4.4.14/arch/arm/crypto/ |
| D | Kconfig | 120 that uses the 64x64 to 128 bit polynomial multiplication (vmull.p64)
|
| /linux-4.4.14/Documentation/networking/ |
| D | generic-hdlc.txt | 67 crc16-itu (CRC16 with ITU-T polynomial) / crc16-itu-pr0 - sets parity
|
| D | baycom.txt | 54 implementation of the HDLC protocol and the scrambler polynomial to
|
| /linux-4.4.14/Documentation/devicetree/bindings/thermal/ |
| D | thermal.txt | 164 is not specified. A simple linear polynomial is used:
|
| /linux-4.4.14/arch/x86/math-emu/ |
| D | README | 71 "optimal" polynomial approximations. My definition of "optimal" was
|
| /linux-4.4.14/arch/m68k/ifpsp060/src/ |
| D | fplsp.S | 4933 # even polynomial in r, 1 + r*r*(B1+s*(B2+ ... + s*B8)), #
4938 # where sin(r) is approximated by an odd polynomial in r #
6784 # Step 4. Approximate exp(R)-1 by a polynomial #
7428 #--Step 9 exp(X)-1 by a simple polynomial
7982 # polynomial in u, where u = 2(X-1)/(X+1). Otherwise, #
7991 # polynomial in u, log(1+u) = poly. #
8000 # polynomial in u where u = 2X/(2+X). Otherwise, move on #
|
| D | fpsp.S | 6168 # Step 3. Approximate arctan(u) by a polynomial poly. #
6175 # Step 6. Approximate arctan(X) by an odd polynomial in X. Exit. #
6178 # polynomial in X'. #
7018 # Step 4. Approximate exp(R)-1 by a polynomial #
7076 # Step 9. Calculate exp(X)-1, |X| < 1/4, by a polynomial #
7086 # c) To fully preserve accuracy, the polynomial is #
|
| /linux-4.4.14/Documentation/x86/ |
| D | boot.txt | 751 the entire file using the characteristic polynomial 0x04C11DB7 and an
|