diff options
| author | Jeff Law <law@redhat.com> | 2017-10-13 13:12:05 -0600 |
|---|---|---|
| committer | Jeff Law <law@gcc.gnu.org> | 2017-10-13 13:12:05 -0600 |
| commit | a1c47ade7761bc745630a916b957164630721150 (patch) | |
| tree | bc84b9084ae4ca651fb299dc986625f5afac1185 /gcc/tree-ssa-reassoc.c | |
| parent | 5c9c546b9d321b34fd02d2cab8d020297dd7686a (diff) | |
| download | gcc-a1c47ade7761bc745630a916b957164630721150.zip gcc-a1c47ade7761bc745630a916b957164630721150.tar.gz gcc-a1c47ade7761bc745630a916b957164630721150.tar.bz2 | |
* tree-ssa-reassoc.c (reassociate_bb): Clarify code slighly.
From-SVN: r253740
Diffstat (limited to 'gcc/tree-ssa-reassoc.c')
| -rw-r--r-- | gcc/tree-ssa-reassoc.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/tree-ssa-reassoc.c b/gcc/tree-ssa-reassoc.c index cc57ae3..e0e64e1 100644 --- a/gcc/tree-ssa-reassoc.c +++ b/gcc/tree-ssa-reassoc.c @@ -5910,7 +5910,7 @@ reassociate_bb (basic_block bb) move it to the front. This helps ensure that we generate (X & Y) & C rather than (X & C) & Y. The former will often match a canonical bit test when we get to RTL. */ - if (ops.length () != 2 + if (ops.length () > 2 && (rhs_code == BIT_AND_EXPR || rhs_code == BIT_IOR_EXPR || rhs_code == BIT_XOR_EXPR) |