aboutsummaryrefslogtreecommitdiff
path: root/contrib/unused_functions.py
diff options
context:
space:
mode:
authorAndrew Pinski <apinski@marvell.com>2023-08-28 10:04:00 -0700
committerAndrew Pinski <apinski@marvell.com>2023-08-29 01:05:55 -0700
commit7c04da768c1fc22e0607e3ccad87e2c793499797 (patch)
tree005de07b224318a128668d14d3a2e443ef5a136f /contrib/unused_functions.py
parent97aafa9cbb68ffa23aa9f018cc5cb30648a72427 (diff)
downloadgcc-7c04da768c1fc22e0607e3ccad87e2c793499797.zip
gcc-7c04da768c1fc22e0607e3ccad87e2c793499797.tar.gz
gcc-7c04da768c1fc22e0607e3ccad87e2c793499797.tar.bz2
MATCH: Move `(x | y) & (~x ^ y)` over to use bitwise_inverted_equal_p
This moves the match pattern `(x | y) & (~x ^ y)` over to use bitwise_inverted_equal_p. This now also allows to optmize comparisons and also catches the missed `(~x | y) & (x ^ y)` transformation into `~x & y`. OK? Bootstrapped and tested on x86_64-linux-gnu with no regressions. gcc/ChangeLog: PR tree-optimization/111147 * match.pd (`(x | y) & (~x ^ y)`) Use bitwise_inverted_equal_p instead of matching bit_not. gcc/testsuite/ChangeLog: PR tree-optimization/111147 * gcc.dg/tree-ssa/cmpbit-4.c: New test.
Diffstat (limited to 'contrib/unused_functions.py')
0 files changed, 0 insertions, 0 deletions