diff options
| author | Andrew Pinski <quic_apinski@quicinc.com> | 2024-05-26 17:59:21 -0700 |
|---|---|---|
| committer | Andrew Pinski <quic_apinski@quicinc.com> | 2024-05-27 12:09:58 -0700 |
| commit | c5a7628470a7fb801ebeea82e16a4549db43bfa5 (patch) | |
| tree | 9de6c90a45db6760d08dd59d3cef09056ca6c98b /gcc/tree-vect-loop.cc | |
| parent | a209f219b862def8fed166b31984b8c6c3bb74a0 (diff) | |
| download | gcc-c5a7628470a7fb801ebeea82e16a4549db43bfa5.zip gcc-c5a7628470a7fb801ebeea82e16a4549db43bfa5.tar.gz gcc-c5a7628470a7fb801ebeea82e16a4549db43bfa5.tar.bz2 | |
match: Use uniform_integer_cst_p in bitwise_inverted_equal_p [PR115238]
I noticed while working on the `a ^ CST` patch, that bitwise_inverted_equal_p
would check INTEGER_CST directly and not handle vector csts that are uniform.
This moves over to using uniform_integer_cst_p instead of checking INTEGER_CST
directly.
Bootstrapped and tested on x86_64-linux-gnu with no regressions.
PR tree-optimization/115238
gcc/ChangeLog:
* generic-match-head.cc (bitwise_inverted_equal_p): Use
uniform_integer_cst_p instead of checking INTEGER_CST.
* gimple-match-head.cc (gimple_bitwise_inverted_equal_p): Likewise.
gcc/testsuite/ChangeLog:
* gcc.dg/tree-ssa/bitops-9.c: New test.
Signed-off-by: Andrew Pinski <quic_apinski@quicinc.com>
Diffstat (limited to 'gcc/tree-vect-loop.cc')
0 files changed, 0 insertions, 0 deletions