diff options
| author | Andrew Pinski <apinski@marvell.com> | 2023-09-17 11:20:36 -0700 |
|---|---|---|
| committer | Andrew Pinski <apinski@marvell.com> | 2023-09-18 13:45:35 -0700 |
| commit | 7ea501d3ea698e1c845fb61e3487f4cd949e6253 (patch) | |
| tree | 5abc352ce405662ffebe81270253815ffb8a889c /libobjc | |
| parent | 951d3c191d01440ad54415f683437770b0c957e4 (diff) | |
| download | gcc-7ea501d3ea698e1c845fb61e3487f4cd949e6253.zip gcc-7ea501d3ea698e1c845fb61e3487f4cd949e6253.tar.gz gcc-7ea501d3ea698e1c845fb61e3487f4cd949e6253.tar.bz2 | |
MATCH: Make zero_one_valued_p non-recursive fully
So it turns out VN can't handle any kind of recursion for match. In this
case we have `b = a & -1` and we try to match a as being zero_one_valued_p
and VN returns b as being the value and we just go into an infinite loop at
this point.
OK? Bootstrapped and tested on x86_64-linux-gnu with no regressions.
Note genmatch should warn (or error out) if this gets detected so I filed PR 111446
which I will be looking into next week or the week after so we don't run into
this issue again.
PR tree-optimization/111442
gcc/ChangeLog:
* match.pd (zero_one_valued_p): Have the bit_and match not be
recursive.
gcc/testsuite/ChangeLog:
* gcc.c-torture/compile/pr111442-1.c: New test.
Diffstat (limited to 'libobjc')
0 files changed, 0 insertions, 0 deletions