Searched full:multiplication (Results 1 – 25 of 210) sorted by relevance
123456789
| /linux-6.8/crypto/ |
| D | polyval-generic.c | 15 * modulus for finite field multiplication which makes hardware accelerated
30 * fields. This trick allows multiplication in the POLYVAL field to be
31 * implemented by using multiplication in the GHASH field as a subroutine. An
80 * Performs multiplication in the POLYVAL field using the GHASH field as a
85 * lookup table implementation for finite field multiplication.
101 * Perform a POLYVAL update using non4k multiplication. This function is used
106 * lookup table implementation of finite field multiplication.
|
| /linux-6.8/arch/x86/crypto/ |
| D | polyval-clmulni_asm.S | 9 * allows us to split finite field multiplication into two steps.
12 * than 128. We then compute p(x) = h^8m_0 + ... + h^1m_7 where multiplication
13 * is simply polynomial multiplication.
19 * multiplication is finite field multiplication. The advantage is that the
85 * extra multiplication of SUM and h^8.
175 * Compute schoolbook multiplication for 8 blocks
181 * I.e., the first multiplication uses m_0 + REDUCE(PL, PH) instead of m_0.
264 * Perform montgomery multiplication in GF(2^128) and store result in op1.
|
| D | Kconfig | 412 - CLMUL-NI (carry-less multiplication new instructions)
488 - CLMUL-NI (carry-less multiplication new instructions)
499 - PCLMULQDQ (carry-less multiplication)
510 - PCLMULQDQ (carry-less multiplication)
520 - PCLMULQDQ (carry-less multiplication)
|
| /linux-6.8/arch/arm64/crypto/ |
| D | polyval-ce-core.S | 11 * finite field multiplication into two steps.
14 * than 128. We then compute p(x) = h^8m_0 + ... + h^1m_7 where multiplication
15 * is simply polynomial multiplication.
21 * multiplication is finite field multiplication. The advantage is that the
89 * Karatsuba multiplication is used instead of Schoolbook multiplication because
214 * I.e., the first multiplication uses m_0 + REDUCE(PL, PH) instead of m_0.
303 * Perform montgomery multiplication in GF(2^128) and store result in op1.
|
| /linux-6.8/drivers/net/wireless/broadcom/brcm80211/brcmsmac/phy/ |
| D | phy_qmath.c | 9 * Description: This function make 16 bit unsigned multiplication.
10 * To fit the output into 16 bits the 32 bit multiplication result is right
19 * Description: This function make 16 bit multiplication and return the result
20 * in 16 bits. To fit the multiplication result into 16 bits the multiplication
22 * is done to remove the extra sign bit formed due to the multiplication.
|
| /linux-6.8/drivers/net/wireless/broadcom/b43/ |
| D | phy_n.h | 574 #define B43_NPHY_RSSIMC_0I_RSSI_X B43_PHY_N(0x1A4) /* RSSI multiplication coefficient 0 I RSSI X */
575 #define B43_NPHY_RSSIMC_0I_RSSI_Y B43_PHY_N(0x1A5) /* RSSI multiplication coefficient 0 I RSSI Y */
576 #define B43_NPHY_RSSIMC_0I_RSSI_Z B43_PHY_N(0x1A6) /* RSSI multiplication coefficient 0 I RSSI Z */
577 #define B43_NPHY_RSSIMC_0I_TBD B43_PHY_N(0x1A7) /* RSSI multiplication coefficient 0 I TBD */
578 #define B43_NPHY_RSSIMC_0I_PWRDET B43_PHY_N(0x1A8) /* RSSI multiplication coefficient 0 I power de…
579 #define B43_NPHY_RSSIMC_0I_TSSI B43_PHY_N(0x1A9) /* RSSI multiplication coefficient 0 I TSSI */
580 #define B43_NPHY_RSSIMC_0Q_RSSI_X B43_PHY_N(0x1AA) /* RSSI multiplication coefficient 0 Q RSSI X */
581 #define B43_NPHY_RSSIMC_0Q_RSSI_Y B43_PHY_N(0x1AB) /* RSSI multiplication coefficient 0 Q RSSI Y */
582 #define B43_NPHY_RSSIMC_0Q_RSSI_Z B43_PHY_N(0x1AC) /* RSSI multiplication coefficient 0 Q RSSI Z */
583 #define B43_NPHY_RSSIMC_0Q_TBD B43_PHY_N(0x1AD) /* RSSI multiplication coefficient 0 Q TBD */
[all …]
|
| /linux-6.8/tools/perf/pmu-events/arch/riscv/sifive/u74/ |
| D | instructions.json | 50 "BriefDescription": "Integer multiplication instruction retired"
75 "BriefDescription": "Floating-point multiplication retired"
|
| D | microarch.json | 50 "BriefDescription": "Integer multiplication interlock"
|
| /linux-6.8/include/linux/iio/ |
| D | iio-gts-helper.h | 21 * @gain: Gain (multiplication) value. Gain must be positive, negative
41 * respective multiplication values could be 50 mS => 1, 100 mS => 2,
50 * @mul: Multiplication to the values caused by this time.
|
| /linux-6.8/arch/arm/include/asm/ |
| D | delay.h | 25 * scale up this constant by 2^31, perform the actual multiplication,
70 * division by multiplication: you don't have to worry about
|
| /linux-6.8/drivers/gpu/drm/sun4i/ |
| D | sun8i_csc.c | 19 * First tree values in each line are multiplication factor and last
52 * First three factors in a row are multiplication factors which have 17 bits
55 * value before multiplication and lower 16 bits represents constant, which
|
| /linux-6.8/include/linux/ |
| D | reciprocal_div.h | 9 * Integers Using Multiplication" by Torbjörn Granlund and Peter
19 * a much faster multiplication operation with a variable dividend A
|
| D | math64.h | 222 * multiplication, the high 32-bits are carried into the next step. in mul_u64_u64_shr()
229 * The 128-bit result of the multiplication is in rl.ll and rh.ll, in mul_u64_u64_shr()
248 * Extract the sign before the multiplication and put it back in mul_s64_u64_shr()
|
| D | polynomial.h | 12 * @coef: multiplication factor of the term.
|
| /linux-6.8/include/math-emu/ |
| D | op-2.h | 231 * Multiplication algorithms:
234 /* Given a 1W * 1W => 2W primitive, do the extended multiplication. */
262 /* Given a 1W * 1W => 2W primitive, do the extended multiplication.
264 where multiplication is much more expensive than subtraction. */
323 /* Do at most 120x120=240 bits multiplication using double floating
324 point multiplication. This is useful if floating point
325 multiplication has much bigger throughput than integer multiply.
|
| D | op-1.h | 121 * Multiplication algorithms:
125 multiplication immediately. */
136 /* Given a 1W * 1W => 2W primitive, do the extended multiplication. */
|
| /linux-6.8/arch/nios2/kernel/ |
| D | insnemu.S | 95 * remaining multiplication opcodes.
180 * Prepare for either multiplication or division loop.
355 /* MULTIPLICATION
361 * Actual multiplication algorithms don't use repeated addition, however.
407 /* Initialize the multiplication loop. */
|
| /linux-6.8/arch/x86/math-emu/ |
| D | reg_u_mul.S | 6 | Core multiplication routine |
16 | Basic multiplication routine. |
|
| /linux-6.8/Documentation/devicetree/bindings/riscv/ |
| D | extensions.yaml | 80 The standard M extension for integer multiplication and division, as
196 multiplication as ratified at commit 6d33919 ("Merge pull request
380 The standard Zvbc extension for vectored carryless multiplication
453 carryless multiplication instructions, as ratified in commit 56ed795
|
| /linux-6.8/arch/x86/kernel/cpu/mtrr/ |
| D | cyrix.c | 20 arr = CX86_ARR_BASE + (reg << 1) + reg; /* avoid multiplication by 3 */ in cyrix_get_arr()
184 arr = CX86_ARR_BASE + (reg << 1) + reg; /* avoid multiplication by 3 */ in cyrix_set_arr()
|
| /linux-6.8/lib/crypto/ |
| D | curve25519-generic.c | 23 MODULE_DESCRIPTION("Curve25519 scalar multiplication");
|
| D | curve25519.c | 32 MODULE_DESCRIPTION("Curve25519 scalar multiplication");
|
| /linux-6.8/drivers/clk/renesas/ |
| D | rcar-gen4-cpg.c | 50 #define CPG_PLLxCR0_SSMODE_FM BIT(18) /* Fractional Multiplication */
56 #define SSMODE_FM BIT(2) /* Fractional Multiplication */
167 /* Disable Fractional Multiplication and Frequency Dithering */ in cpg_pll_clk_register()
|
| /linux-6.8/drivers/clk/ |
| D | clk-plldig.c | 44 /* Best value of multiplication factor divider */
49 * loop multiplication factor.
|
| /linux-6.8/lib/raid6/ |
| D | mktables.c | 64 /* Compute multiplication table */ in main()
83 /* Compute vector multiplication table */ in main()
|
123456789