diff options
author | Jin Ma <jinma@linux.alibaba.com> | 2025-04-02 13:37:07 -0600 |
---|---|---|
committer | Jeff Law <jlaw@ventanamicro.com> | 2025-04-02 13:37:07 -0600 |
commit | dd6ebc0a3473a830115995bdcaf8f797ebd085a3 (patch) | |
tree | 09d3616a947cdf2790de1ec753f8d5ccb24883bb /libjava/classpath/lib/java | |
parent | 3b00f8b56c1b92356da81c0d80ab40da2075d536 (diff) | |
download | gcc-dd6ebc0a3473a830115995bdcaf8f797ebd085a3.zip gcc-dd6ebc0a3473a830115995bdcaf8f797ebd085a3.tar.gz gcc-dd6ebc0a3473a830115995bdcaf8f797ebd085a3.tar.bz2 |
[PATCH v2] RISC-V: Fixbug for slli + addw + zext.w into sh[123]add + zext.w
Assuming we have the following variables:
unsigned long long a0, a1;
unsigned int a2;
For the expression:
a0 = (a0 << 50) >> 49; // slli a0, a0, 50 + srli a0, a0, 49
a2 = a1 + a0; // addw a2, a1, a0 + slli a2, a2, 32 + srli a2, a2, 32
In the optimization process of ZBA (combine pass), it would be optimized to:
a2 = a0 << 1 + a1; // sh1add a2, a0, a1 + zext.w a2, a2
This is clearly incorrect, as it overlooks the fact that a0=a0&0x7ffe, meaning
that the bits a0[32:14] are set to zero.
gcc/ChangeLog:
* config/riscv/bitmanip.md: The optimization can only be applied if
the high bit of operands[3] is set to 1.
gcc/testsuite/ChangeLog:
* gcc.target/riscv/zba-shNadd-09.c: New test.
* gcc.target/riscv/zba-shNadd-10.c: New test.
Diffstat (limited to 'libjava/classpath/lib/java')
0 files changed, 0 insertions, 0 deletions