diff options
| author | Richard Sandiford <richard.sandiford@arm.com> | 2024-10-24 14:22:33 +0100 |
|---|---|---|
| committer | Richard Sandiford <richard.sandiford@arm.com> | 2024-10-24 14:22:33 +0100 |
| commit | af19e46c88fd75e31127cde239b8f28d8f9c4040 (patch) | |
| tree | c4d249e8c6d45031aacf92945a07cc5d8501abd8 /gcc/fortran/misc.cc | |
| parent | d6c4badffafa295f6082b7d74de314e131f30a96 (diff) | |
| download | gcc-af19e46c88fd75e31127cde239b8f28d8f9c4040.zip gcc-af19e46c88fd75e31127cde239b8f28d8f9c4040.tar.gz gcc-af19e46c88fd75e31127cde239b8f28d8f9c4040.tar.bz2 | |
Try to simplify (X >> C1) * (C2 << C1) -> X * C2
This patch adds a rule to simplify (X >> C1) * (C2 << C1) -> X * C2
when the low C1 bits of X are known to be zero. As with the earlier
X >> C1 << (C2 + C1) patch, any single conversion is allowed between
the shift and the multiplication.
gcc/
* match.pd: Simplify (X >> C1) * (C2 << C1) -> X * C2 if the
low C1 bits of X are zero.
gcc/testsuite/
* gcc.dg/tree-ssa/shifts-3.c: New test.
* gcc.dg/tree-ssa/shifts-4.c: Likewise.
* gcc.target/aarch64/sve/cnt_fold_5.c: Likewise.
Diffstat (limited to 'gcc/fortran/misc.cc')
0 files changed, 0 insertions, 0 deletions