Home
last modified time | relevance | path

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

12

/OK3568_Linux_fs/kernel/lib/
H A Dcrc32.c148 u32 polynomial) argument
155 crc = (crc >> 1) ^ ((crc & 1) ? polynomial : 0);
244 u32 polynomial) argument
246 u32 power = polynomial; /* CRC of x^32 */
251 crc = (crc >> 1) ^ (crc & 1 ? polynomial : 0);
260 crc = gf2_multiply(crc, power, polynomial);
267 power = gf2_multiply(power, power, polynomial);
296 u32 polynomial) argument
304 (crc << 1) ^ ((crc & 0x80000000) ? polynomial :
H A Dcrc8.c29 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()
H A Dgen_crc32table.c37 static void crc32init_le_generic(const uint32_t polynomial, in crc32init_le_generic() argument
46 crc = (crc >> 1) ^ ((crc & 1) ? polynomial : 0); in crc32init_le_generic()
/OK3568_Linux_fs/kernel/include/linux/
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);
/OK3568_Linux_fs/kernel/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,
/OK3568_Linux_fs/kernel/Documentation/ABI/testing/
H A Dsysfs-bus-iio-isl2950127 a second order error polynomial.
33 polynomial has to be generated from the data. The
/OK3568_Linux_fs/kernel/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
/OK3568_Linux_fs/kernel/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
/OK3568_Linux_fs/kernel/Documentation/networking/
H A Dgeneric-hdlc.rst90 crc16-itu (CRC16 with ITU-T polynomial) / crc16-itu-pr0 - sets parity
/OK3568_Linux_fs/kernel/arch/arm/crypto/
H A DKconfig136 that uses the 64x64 to 128 bit polynomial multiplication (vmull.p64)
/OK3568_Linux_fs/kernel/Documentation/networking/device_drivers/hamradio/
H A Dbaycom.rst60 implementation of the HDLC protocol and the scrambler polynomial to
/OK3568_Linux_fs/kernel/arch/x86/math-emu/
H A DREADME71 "optimal" polynomial approximations. My definition of "optimal" was
/OK3568_Linux_fs/kernel/crypto/
H A DKconfig643 CRC32c algorithm implemented using vector polynomial multiply-sum
760 CRC10T10DIF algorithm implemented using vector polynomial
/OK3568_Linux_fs/kernel/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 #
/OK3568_Linux_fs/kernel/Documentation/x86/
H A Dboot.rst1034 the entire file using the characteristic polynomial 0x04C11DB7 and an
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ext/
H A Drandom974 * where @f$L_{1/2}(x)@f$ is the Laguerre polynomial of order 1/2.
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ext/
H A Drandom974 * where @f$L_{1/2}(x)@f$ is the Laguerre polynomial of order 1/2.
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/info/
H A Dgccint.info8699 polynomial with two coefficients (and thus one indeterminate), with each
8752 The two main consequences of using polynomial sizes and offsets are
9232 polynomial and constant A, B and QUOTIENT.
16020 operand as a polynomial integer. In an expression of code 'plus', there
16158 A polynomial integer. At present this is used only for
17323 Represents a 'poly_int'-style polynomial integer with coefficients
17715 Note that the byte offset is a polynomial integer; it may not
20558 express values of polynomial induction variables, but it is possible to
20587 and loop (both base and step may contain further polynomial chrecs).
54682 * polynomial integers: poly_int. (line 6)
H A Dgdb.info17998 using the polynomial:
18008 _Note:_ This is the same CRC polynomial as used in handling the
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/info/
H A Dgccint.info8699 polynomial with two coefficients (and thus one indeterminate), with each
8752 The two main consequences of using polynomial sizes and offsets are
9232 polynomial and constant A, B and QUOTIENT.
16020 operand as a polynomial integer. In an expression of code 'plus', there
16158 A polynomial integer. At present this is used only for
17323 Represents a 'poly_int'-style polynomial integer with coefficients
17715 Note that the byte offset is a polynomial integer; it may not
20558 express values of polynomial induction variables, but it is possible to
20587 and loop (both base and step may contain further polynomial chrecs).
54682 * polynomial integers: poly_int. (line 6)
H A Dgdb.info17998 using the polynomial:
18008 _Note:_ This is the same CRC polynomial as used in handling the

12