Home
last modified time | relevance | path

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

/linux/crypto/
A Dchacha20poly1305.c21 struct crypto_ahash_spawn poly; member
27 struct crypto_ahash *poly; member
65 struct poly_req poly; member
506 struct crypto_ahash *poly; in chachapoly_init() local
509 poly = crypto_spawn_ahash(&ictx->poly); in chachapoly_init()
510 if (IS_ERR(poly)) in chachapoly_init()
511 return PTR_ERR(poly); in chachapoly_init()
515 crypto_free_ahash(poly); in chachapoly_init()
520 ctx->poly = poly; in chachapoly_init()
542 crypto_free_ahash(ctx->poly); in chachapoly_exit()
[all …]
/linux/lib/
A Dbch.c113 struct gf_poly poly; member
409 uint32_t poly; in compute_syndromes() local
422 poly = *ecc++; in compute_syndromes()
424 while (poly) { in compute_syndromes()
425 i = deg(poly); in compute_syndromes()
617 if (poly->c[0]) in find_poly_deg1_roots()
633 if (poly->c[0] && poly->c[1]) { in find_poly_deg2_roots()
675 if (poly->c[0]) { in find_poly_deg3_roots()
677 e3 = poly->c[3]; in find_poly_deg3_roots()
712 e4 = poly->c[4]; in find_poly_deg4_roots()
[all …]
/linux/drivers/crypto/stm32/
A Dstm32-crc32.c65 u32 poly; member
77 mctx->poly = CRC32_POLY_LE; in stm32_crc32_cra_init()
86 mctx->poly = CRC32C_POLY_LE; in stm32_crc32c_cra_init()
132 writel_relaxed(bitrev32(mctx->poly), crc->regs + CRC_POL); in stm32_crc_init()
162 if (mctx->poly == CRC32_POLY_LE) in burst_update()
177 writel_relaxed(bitrev32(mctx->poly), crc->regs + CRC_POL); in burst_update()
248 put_unaligned_le32(mctx->poly == CRC32C_POLY_LE ? in stm32_crc_final()
/linux/lib/xz/
A Dxz_crc32.c32 const uint32_t poly = CRC32_POLY_LE; in xz_crc32_init() local
41 r = (r >> 1) ^ (poly & ~((r & 1) - 1)); in xz_crc32_init()
/linux/arch/x86/crypto/
A Daesni-intel_avx-x86_64.S117 ## poly = x^128 + x^127 + x^126 + x^121 + 1
192 HashKey = 16*6 # store HashKey <<1 mod poly here
193 HashKey_2 = 16*7 # store HashKey^2 <<1 mod poly here
194 HashKey_3 = 16*8 # store HashKey^3 <<1 mod poly here
195 HashKey_4 = 16*9 # store HashKey^4 <<1 mod poly here
881 # Output: C = A*B*x mod poly, (i.e. >>1 )
882 # To compute GH = GH*HashKey mod poly, give HK = HashKey<<1 mod poly as input
883 # GH = GH * HK * x mod poly which is equivalent to GH*HashKey mod poly.
1863 # Output: C = A*B*x mod poly, (i.e. >>1 )
1864 # To compute GH = GH*HashKey mod poly, give HK = HashKey<<1 mod poly as input
[all …]
A Daesni-intel_asm.S201 # precompute HashKey<<1 mod poly from the HashKey (required for GHASH)
225 # TMP5 = HashKey^2<<1 (mod poly)
227 # HashKey_2 = HashKey^2<<1 (mod poly)
233 # TMP5 = HashKey^3<<1 (mod poly)
240 # TMP5 = HashKey^3<<1 (mod poly)
/linux/drivers/mtd/nand/raw/atmel/
A Dpmecc.c186 static inline int deg(unsigned int poly) in deg() argument
189 return fls(poly) - 1; in deg()
192 static int atmel_pmecc_build_gf_tables(int mm, unsigned int poly, in atmel_pmecc_build_gf_tables() argument
196 const unsigned int k = BIT(deg(poly)); in atmel_pmecc_build_gf_tables()
211 x ^= poly; in atmel_pmecc_build_gf_tables()
223 unsigned int poly, degree, table_size; in atmel_pmecc_create_gf_tables() local
228 poly = PMECC_GF_13_PRIMITIVE_POLY; in atmel_pmecc_create_gf_tables()
232 poly = PMECC_GF_14_PRIMITIVE_POLY; in atmel_pmecc_create_gf_tables()
245 ret = atmel_pmecc_build_gf_tables(degree, poly, gf_tables); in atmel_pmecc_create_gf_tables()
/linux/arch/m68k/fpsp040/
A Dslogn.S35 | log(1+u) = poly.
38 | by k*log(2) + (log(F) + poly). The values of log(F) are calculated
47 | k*log(2) + log(F) + poly where poly approximates log(1+u),
A Dsatan.S30 | Step 3. Approximate arctan(u) by a polynomial poly.
32 | Step 4. Return arctan(F) + poly, arctan(F) is fetched from a table of values
/linux/include/linux/
A Dpstore_ram.h38 int poly; member
/linux/drivers/net/dsa/sja1105/
A Dsja1105_dynamic_config.c660 sja1105_packing(buf, &entry->poly, 7, 0, in sja1105et_l2_lookup_params_entry_packing()
1377 static u8 sja1105_crc8_add(u8 crc, u8 byte, u8 poly) in sja1105_crc8_add() argument
1384 crc ^= poly; in sja1105_crc8_add()
1403 u64 input, poly_koopman = l2_lookup_params->poly; in sja1105et_fdb_hash()
1405 u8 poly = (u8)(1 + (poly_koopman << 1)); in sja1105et_fdb_hash() local
1415 crc = sja1105_crc8_add(crc, byte, poly); in sja1105et_fdb_hash()
A Dsja1105_static_config.h288 u64 poly; /* E/T only */ member
A Dsja1105_static_config.c295 sja1105_packing(buf, &entry->poly, 13, 6, size, op); in sja1105et_l2_lookup_params_entry_packing()
A Dsja1105_main.c394 .poly = 0x97, in sja1105_init_l2_lookup_params()
/linux/drivers/scsi/libsas/
A Dsas_init.c73 const u32 poly = 0x00DB2777; in sas_hash_addr() local
84 r ^= poly; in sas_hash_addr()
86 r ^= poly; in sas_hash_addr()
/linux/fs/pstore/
A Dram_core.c202 prz->ecc_info.poly = ecc_info->poly ?: 0x11d; in persistent_ram_init_ecc()
224 prz->rs_decoder = init_rs(prz->ecc_info.symsize, prz->ecc_info.poly, in persistent_ram_init_ecc()
/linux/drivers/hwmon/
A Dbt1-pvt.c125 static long pvt_calc_poly(const struct pvt_poly *poly, long data) in pvt_calc_poly() argument
127 const struct pvt_poly_term *term = poly->terms; in pvt_calc_poly()
138 return ret / poly->total_divider; in pvt_calc_poly()
/linux/drivers/char/hw_random/
A Dn2-drv.c485 static u64 advance_polynomial(u64 poly, u64 val, int count) in advance_polynomial() argument
494 val ^= poly; in advance_polynomial()
/linux/drivers/net/ethernet/amd/
A Dnmclan_cs.c1289 static const int poly[]={ in updateCRC() local
1307 CRC[j] ^= poly[j]; in updateCRC()
/linux/Documentation/hwmon/
A Dltc2978.rst214 - LTC3880, LTC3882, LTC3886, and LTC3887 are dual output poly-phase step-down
/linux/Documentation/ABI/testing/
A Dsysfs-class-power467 "Unknown", "NiMH", "Li-ion", "Li-poly", "LiFe",
/linux/tools/perf/scripts/python/
A Dexported-sql-viewer.py1849 poly = view.mapFromScene(scene_rectf)
1850 self.rubber_band.setGeometry(poly.boundingRect())
/linux/drivers/dma/ppc4xx/
A Dadma.c4400 static DRIVER_ATTR_RW(poly);
/linux/arch/m68k/ifpsp060/src/
A Dfplsp.S7991 # polynomial in u, log(1+u) = poly. #
7995 # by k*log(2) + (log(F) + poly). The values of log(F) are #
8005 # log(1+X) as k*log(2) + log(F) + poly where poly #
A Dfpsp.S6168 # Step 3. Approximate arctan(u) by a polynomial poly. #
6170 # Step 4. Return arctan(F) + poly, arctan(F) is fetched from a #

Completed in 134 milliseconds