| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/ |
| H A D | expmed.h | 38 /* Indicates the type of fixup needed after a constant multiplication.
49 synthetic multiplication sequence, hence cost(a op b) is defined
59 short cost; /* Total rtx_cost of the multiplication sequence. */
60 short latency; /* The latency of the multiplication sequence. */
109 /* The entry for our multiplication cache/hash table. */
117 /* The best multiplication algorithm for t. */
120 /* The cost of multiplication if ALG_CODE is not alg_impossible.
121 Otherwise, the cost within which multiplication by T is
517 /* Set the COST of doing a multiplication in MODE when optimizing for
526 /* Return the cost of doing a multiplication in MODE when optimizing
[all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/ |
| H A D | expmed.h | 38 /* Indicates the type of fixup needed after a constant multiplication.
49 synthetic multiplication sequence, hence cost(a op b) is defined
59 short cost; /* Total rtx_cost of the multiplication sequence. */
60 short latency; /* The latency of the multiplication sequence. */
109 /* The entry for our multiplication cache/hash table. */
117 /* The best multiplication algorithm for t. */
120 /* The cost of multiplication if ALG_CODE is not alg_impossible.
121 Otherwise, the cost within which multiplication by T is
517 /* Set the COST of doing a multiplication in MODE when optimizing for
526 /* Return the cost of doing a multiplication in MODE when optimizing
[all …]
|
| /OK3568_Linux_fs/kernel/drivers/net/wireless/broadcom/b43/ |
| H A 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 …]
|
| /OK3568_Linux_fs/kernel/drivers/net/wireless/broadcom/brcm80211/brcmsmac/phy/ |
| H A 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.
|
| /OK3568_Linux_fs/external/security/librkcrypto/test/include/c_mode/ |
| H A D | ecp.h | 204 * Maximum "window" size used for point multiplication.
209 * points used for point multiplication. This value is directly tied to EC
228 * Trade memory for speed on fixed-point multiplication.
230 * This speeds up repeated multiplication of the generator (that is, the
231 * multiplication in ECDSA signatures, and half of the multiplications in
516 * \brief Multiplication by an integer: R = m * P
546 * \brief Multiplication and addition of two points by integers:
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/host_include/mbedtls/ |
| H A D | ecp.h | 229 * Maximum "window" size used for point multiplication.
234 * points used for point multiplication. This value is directly tied to EC
252 * Trade memory for speed on fixed-point multiplication.
254 * This speeds up repeated multiplication of the generator (that is, the
255 * multiplication in ECDSA signatures, and half of the multiplications in
274 * \brief Internal restart context for multiplication
399 * multiplication in GF(p) for the NIST P-256 curve.
401 * multiplication (full run of \c mbedtls_ecp_mul()) is:
836 * \brief This function performs a scalar multiplication of a point
873 * \brief This function performs multiplication of a point by
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/include/mbedtls/ |
| H A D | ecp.h | 229 * Maximum "window" size used for point multiplication.
234 * points used for point multiplication. This value is directly tied to EC
252 * Trade memory for speed on fixed-point multiplication.
254 * This speeds up repeated multiplication of the generator (that is, the
255 * multiplication in ECDSA signatures, and half of the multiplications in
274 * \brief Internal restart context for multiplication
399 * multiplication in GF(p) for the NIST P-256 curve.
401 * multiplication (full run of \c mbedtls_ecp_mul()) is:
836 * \brief This function performs a scalar multiplication of a point
873 * \brief This function performs multiplication of a point by
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/mbedtls/ |
| H A D | ecp.h | 229 * Maximum "window" size used for point multiplication.
234 * points used for point multiplication. This value is directly tied to EC
252 * Trade memory for speed on fixed-point multiplication.
254 * This speeds up repeated multiplication of the generator (that is, the
255 * multiplication in ECDSA signatures, and half of the multiplications in
274 * \brief Internal restart context for multiplication
399 * multiplication in GF(p) for the NIST P-256 curve.
401 * multiplication (full run of \c mbedtls_ecp_mul()) is:
836 * \brief This function performs a scalar multiplication of a point
873 * \brief This function performs multiplication of a point by
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/host_include/mbedtls/ |
| H A D | ecp.h | 229 * Maximum "window" size used for point multiplication.
234 * points used for point multiplication. This value is directly tied to EC
252 * Trade memory for speed on fixed-point multiplication.
254 * This speeds up repeated multiplication of the generator (that is, the
255 * multiplication in ECDSA signatures, and half of the multiplications in
274 * \brief Internal restart context for multiplication
399 * multiplication in GF(p) for the NIST P-256 curve.
401 * multiplication (full run of \c mbedtls_ecp_mul()) is:
836 * \brief This function performs a scalar multiplication of a point
873 * \brief This function performs multiplication of a point by
[all …]
|
| /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/ |
| H A D | ratio | 83 // The multiplication of N and M becomes,
85 // Multiplication is safe if each term and the sum of the terms
99 "overflow in multiplication");
101 "overflow in multiplication");
103 "overflow in multiplication");
106 "overflow in multiplication");
|
| /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/ |
| H A D | ratio | 83 // The multiplication of N and M becomes,
85 // Multiplication is safe if each term and the sum of the terms
99 "overflow in multiplication");
101 "overflow in multiplication");
103 "overflow in multiplication");
106 "overflow in multiplication");
|
| /OK3568_Linux_fs/kernel/include/math-emu/ |
| H A 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.
|
| /OK3568_Linux_fs/kernel/arch/arm/include/asm/ |
| H A 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
|
| /OK3568_Linux_fs/kernel/drivers/gpu/drm/sun4i/ |
| H A D | sun8i_csc.c | 18 * First tree values in each line are multiplication factor and last
78 * First three factors in a row are multiplication factors which have 17 bits
81 * value before multiplication and lower 16 bits represents constant, which
|
| /OK3568_Linux_fs/kernel/arch/x86/crypto/ |
| H A D | ghash-clmulni-intel_asm.S | 7 …* http://software.intel.com/en-us/articles/carry-less-multiplication-and-its-usage-for-computing-t…
64 # carry-less multiplication
|
| /OK3568_Linux_fs/kernel/arch/nios2/kernel/ |
| H A 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. */
|
| /OK3568_Linux_fs/kernel/include/linux/ |
| H A 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
|
| /OK3568_Linux_fs/kernel/arch/arm/crypto/ |
| H A D | Kconfig | 136 that uses the 64x64 to 128 bit polynomial multiplication (vmull.p64)
168 tristate "NEON accelerated Curve25519 scalar multiplication library"
|
| /OK3568_Linux_fs/yocto/poky/meta/recipes-extended/sysstat/sysstat/ |
| H A D | CVE-2022-39377.patch | 7 checks bounds before arithmetic multiplication allowing for an
37 + * Check if the multiplication of the 3 values may be greater than UINT_MAX.
|
| /OK3568_Linux_fs/buildroot/boot/grub2/ |
| H A D | 0080-video-fb-fbfill-Fix-potential-integer-overflow.patch | 6 The multiplication of 2 unsigned 32-bit integers may overflow before
7 promotion to unsigned 64-bit. We should ensure that the multiplication
|
| /OK3568_Linux_fs/u-boot/include/ |
| H A D | mpc8xx.h | 128 #define PLPRCR_MFN_MSK 0xF8000000 /* Multiplication factor numerator bits */
129 #define PLPRCR_MFN_SHIFT 27 /* Multiplication factor numerator shift*/
130 #define PLPRCR_MFD_MSK 0x07C00000 /* Multiplication factor denominator bits */
131 #define PLPRCR_MFD_SHIFT 22 /* Multiplication factor denominator shift*/
132 #define PLPRCR_S_MSK 0x00300000 /* Multiplication factor integer bits */
133 #define PLPRCR_S_SHIFT 20 /* Multiplication factor integer shift */
134 #define PLPRCR_MFI_MSK 0x000F0000 /* Multiplication factor integer bits */
135 #define PLPRCR_MFI_SHIFT 16 /* Multiplication factor integer shift */
141 /* Multiplication factor + PDF bits */
|
| /OK3568_Linux_fs/external/rkwifibt/drivers/rtl8852be/core/crypto/ |
| H A D | aes-gcm.c | 63 /* Multiplication in GF(2^128) */
116 * multiplication operation for binary Galois (finite) field of in ghash()
132 * multiplication operation for binary Galois (finite) field of in ghash()
|
| /OK3568_Linux_fs/external/rkwifibt/drivers/rtl8188fu/core/crypto/ |
| H A D | aes-gcm.c | 63 /* Multiplication in GF(2^128) */
116 * multiplication operation for binary Galois (finite) field of in ghash()
132 * multiplication operation for binary Galois (finite) field of in ghash()
|
| /OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8723ds/core/crypto/ |
| H A D | aes-gcm.c | 64 /* Multiplication in GF(2^128) */
117 * multiplication operation for binary Galois (finite) field of in ghash()
133 * multiplication operation for binary Galois (finite) field of in ghash()
|
| /OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8821cs/core/crypto/ |
| H A D | aes-gcm.c | 64 /* Multiplication in GF(2^128) */
117 * multiplication operation for binary Galois (finite) field of in ghash()
133 * multiplication operation for binary Galois (finite) field of in ghash()
|