Home
last modified time | relevance | path

Searched refs:polynomial (Results 1 – 16 of 16) sorted by relevance

/linux/lib/crc/
H A Dcrc8.c30 void crc8_populate_msb(u8 table[CRC8_TABLE_SIZE], u8 polynomial) in crc8_populate_msb() argument
39 t = (t << 1) ^ (t & msbit ? polynomial : 0); in crc8_populate_msb()
52 void crc8_populate_lsb(u8 table[CRC8_TABLE_SIZE], u8 polynomial) in crc8_populate_lsb() argument
60 t = (t >> 1) ^ (t & 1 ? polynomial : 0); in crc8_populate_lsb()
H A Dgen_crc32table.c18 static void crc32init_le_generic(const uint32_t polynomial, uint32_t tab[256]) in crc32init_le_generic() argument
26 crc = (crc >> 1) ^ ((crc & 1) ? polynomial : 0); in crc32init_le_generic()
/linux/include/linux/
H A Dpolynomial.h28 struct polynomial { struct
33 long polynomial_calc(const struct polynomial *poly, long data); argument
H A Dcrc8.h55 void crc8_populate_lsb(u8 table[CRC8_TABLE_SIZE], u8 polynomial);
73 void crc8_populate_msb(u8 table[CRC8_TABLE_SIZE], u8 polynomial);
/linux/Documentation/ABI/testing/
H A Dsysfs-bus-iio-isl2950127 a second order error polynomial.
33 polynomial has to be generated from the data. The
/linux/Documentation/core-api/
H A Dlibrs.rst34 correction with the given polynomial. It either uses an existing
45 * Primitive polynomial is x^10+x^3+1
48 * generator polynomial degree (number of roots) = 6
/linux/arch/m68k/fpsp040/
H A Dsatan.S30 | 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'.
H A Dslogn.S27 | 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
H A Dssin.S41 | where cos(r) is approximated by an even polynomial in r,
46 | where sin(r) is approximated by an odd polynomial in r
H A Dsetox.S127 | Step 4. Approximate exp(R)-1 by a polynomial
799 |--Step 9 exp(X)-1 by a simple polynomial
/linux/drivers/hwmon/
H A Dlan966x-hwmon.c34 static const struct polynomial poly_N_to_temp = {
/linux/Documentation/gpu/
H A Dzynqmp.rst69 Output of the PRBS7 (x^7 + x^6 + 1) polynomial
/linux/Documentation/networking/
H A Dgeneric-hdlc.rst90 crc16-itu (CRC16 with ITU-T polynomial) / crc16-itu-pr0 - sets parity
/linux/crypto/
H A DKconfig1020 CRC32c CRC algorithm with the iSCSI polynomial (RFC 3385 and RFC 3720)
1022 A 32-bit CRC (cyclic redundancy check) with a polynomial defined
/linux/arch/m68k/ifpsp060/src/
H A Dfplsp.S4933 # 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 #
H A Dfpsp.S6168 # 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 #