Home
last modified time | relevance | path

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

/linux/lib/crc/
H A Dcrc8.c25 * crc8_populate_msb - fill crc table for given polynomial in reverse bit order.
28 * @polynomial: polynomial for which table is to be filled.
30 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()
47 * crc8_populate_lsb - fill crc table for given polynomial in regular bit order.
50 * @polynomial: polynomial for which table is to be filled.
52 void crc8_populate_lsb(u8 table[CRC8_TABLE_SIZE], u8 polynomial) in crc8_populate_lsb() argument
60 t = (t >> 1) ^ (t & 1 ? polynomial in crc8_populate_lsb()
[all...]
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.h10 * struct polynomial_term - one term descriptor of a polynomial
24 * struct polynomial - a polynomial descriptor
26 * @terms: polynomial terms, last term must have degree of 0
28 struct polynomial { struct
33 long polynomial_calc(const struct polynomial *poly, long data); argument
30 termspolynomial global() argument
H A Dcrc8.h40 * crc8_populate_lsb - fill crc table for given polynomial in regular bit order.
43 * @polynomial: polynomial for which table is to be filled.
45 * This function fills the provided table according the polynomial provided for
51 * For lsb first direction x^7 maps to the lsb. So the polynomial is as below.
55 void crc8_populate_lsb(u8 table[CRC8_TABLE_SIZE], u8 polynomial);
58 * crc8_populate_msb - fill crc table for given polynomial in reverse bit order.
61 * @polynomial: polynomial for which table is to be filled.
63 * This function fills the provided table according the polynomial provide
[all...]
/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/staging/
H A Dcrc32.rst7 CRC polynomial. To check the CRC, you can either check that the
21 To produce a 32-bit CRC, the divisor is actually a 33-bit CRC polynomial.
43 the polynomial from the remainder and we're back to where we started,
82 The most significant coefficient of the remainder polynomial is stored
124 and the correct multiple of the polynomial to subtract is found using
179 of a polynomial produces a larger multiple of that polynomial. Thus,
/linux/lib/
H A Dpolynomial.c3 * Generic polynomial calculation using integer coefficients.
15 #include <linux/polynomial.h>
44 * static const struct polynomial poly_temp_to_N = {
55 * static const struct polynomial poly_N_to_temp = {
68 * polynomial_calc - calculate a polynomial using integer arithmetic
70 * @poly: pointer to the descriptor of the polynomial
73 * Calculate the result of a polynomial using only integer arithmetic. For
77 * Returns the result of the polynomial calculation.
79 long polynomial_calc(const struct polynomial *poly, long data) in polynomial_calc()
87 * Here is the polynomial calculatio in polynomial_calc()
[all...]
H A DMakefile248 obj-$(CONFIG_POLYNOMIAL) += polynomial.o
/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
247 | Step 4. Approximate exp(R)-1 by a polynomial
301 | Step 9. Calculate exp(X)-1, |X| < 1/4, by a polynomial
311 | c) To fully preserve accuracy, the polynomial is computed
799 |--Step 9 exp(X)-1 by a simple polynomial
/linux/drivers/hwmon/
H A Dlan966x-hwmon.c10 #include <linux/polynomial.h>
35 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/arch/arm/crypto/
H A DKconfig35 that uses the 64x64 to 128 bit polynomial multiplication (vmull.p64)
/linux/Documentation/networking/
H A Dgeneric-hdlc.rst90 crc16-itu (CRC16 with ITU-T polynomial) / crc16-itu-pr0 - sets parity
/linux/Documentation/networking/device_drivers/hamradio/
H A Dbaycom.rst60 implementation of the HDLC protocol and the scrambler polynomial to
/linux/drivers/net/phy/
H A Dmxl-gpy.c14 #include <linux/polynomial.h>
173 static const struct polynomial poly_N_to_temp = {
/linux/crypto/
H A DKconfig1085 CRC32c CRC algorithm with the iSCSI polynomial (RFC 3385 and RFC 3720)
1087 A 32-bit CRC (cyclic redundancy check) with a polynomial defined
/linux/arch/x86/math-emu/
H A DREADME71 "optimal" polynomial approximations. My definition of "optimal" was
/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 #
6062 # Step 3. Approximate arctan(u) by a polynomial poly. #
6069 # Step 6. Approximate arctan(X) by an odd polynomial in X. Exit. #
6072 # polynomial in X'. #
6784 # Step 4. Approximate exp(R)-1 by a polynomial #
6912 # Step 4. Approximate exp(R)-1 by a polynomial #
6970 # Step 9. Calculate exp(X)-1, |X| < 1/4, by a polynomial #
6980 # c) To fully preserve accuracy, the polynomial is #
7428 #--Step 9 exp(X)-1 by a simple polynomial
[all...]
H A Dfpsp.S5039 # even polynomial in r, 1 + r*r*(B1+s*(B2+ ... + s*B8)), #
5044 # where sin(r) is approximated by an odd polynomial in r #
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'. #
6890 # Step 4. Approximate exp(R)-1 by a polynomial #
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 #
7534 #--Step 9 exp(X)-1 by a simple polynomial
[all...]