https://gcc.gnu.org/bugzilla/show_bug.cgi?id=111554
Sam James <sjames at gcc dot gnu.org> changed: What |Removed |Added ---------------------------------------------------------------------------- CC| |rguenth at gcc dot gnu.org Summary|[12/13/14 regression] |[12/13/14 regression] |Timeout with with "-O3 |Timeout with with "-O3 |-fno-dse -fno-inline |-fno-dse -fno-inline |-fno-store-merging |-fno-store-merging |-fno-toplevel-reorder |-fno-toplevel-reorder |-fno-tree-dce |-fno-tree-dce |-fno-tree-dse" |-fno-tree-dse" since | |r12-2097-g9f34b780b0461e --- Comment #4 from Sam James <sjames at gcc dot gnu.org> --- Bisect says r12-2097-g9f34b780b0461e: 9f34b780b0461ec7b2b2defe96e44ab616ea2aa3 is the first bad commit commit 9f34b780b0461ec7b2b2defe96e44ab616ea2aa3 Author: Richard Biener <rguent...@suse.de> Date: Wed Jul 7 11:41:03 2021 +0200 tree-optimization/99728 - improve LIM for loops with aggregate copies This improves LIM by recording aggregate copies for disambiguation purposes instead of as UNANALYZABLE_MEM which will prevent any invariant or store motion across it. This allows four of the six references in the loop of the testcase to be promoted. 2021-07-07 Richard Biener <rguent...@suse.de> I'm not sure if that's right though. I can rerun it if it sounds dubious.