diff options
| author | Avinash Jayakar <avinashd@linux.ibm.com> | 2025-11-08 08:23:31 +0530 |
|---|---|---|
| committer | Avinash Jayakar <avinashd@linux.ibm.com> | 2025-11-08 08:44:34 +0530 |
| commit | bc62a2fbabad0402e96640b834d7c8a9f64c11db (patch) | |
| tree | 91c32d220feb0180e47ddd48ea0295a4931d130c /libjava/java/security/Engine.java | |
| parent | a1fe2cfa8965ac298f6541d46b90156b1cb34726 (diff) | |
| download | gcc-bc62a2fbabad0402e96640b834d7c8a9f64c11db.zip gcc-bc62a2fbabad0402e96640b834d7c8a9f64c11db.tar.gz gcc-bc62a2fbabad0402e96640b834d7c8a9f64c11db.tar.bz2 | |
Use sequences of shifts and add/sub if the hardware does not have support for
vector multiplication. In a previous patch, bare bones vector lowering had been
implemented which only worked when the constant value was a power of 2.
In this patch, few more cases have been added, i.e., if a constant is a uniform
vector but not a power of 2 then use the choose_mult_variant, with max cost
estimate as the cost of scalar multiplication operation times the number of
elements in the vector. This is similar to the logic while expanding MULT_EXPR
in expand pass or in the vector pattern recognition in tree-vect-patterns.cc.
2025-11-08 Avinash Jayakar <avinashd@linux.ibm.com>
gcc/ChangeLog:
PR tree-optimization/122065
* tree-vect-generic.cc (target_supports_mult_synth_alg): Add helper to
check mult synth.
(expand_vector_mult): Optimize mult when const is uniform but not
power of 2.
Diffstat (limited to 'libjava/java/security/Engine.java')
0 files changed, 0 insertions, 0 deletions
