https://gcc.gnu.org/bugzilla/show_bug.cgi?id=117922
--- Comment #25 from GCC Commits <cvs-commit at gcc dot gnu.org> --- The master branch has been updated by Richard Biener <rgue...@gcc.gnu.org>: https://gcc.gnu.org/g:677122c9df1b55a791a54426269f7a8ce794f947 commit r15-7384-g677122c9df1b55a791a54426269f7a8ce794f947 Author: Richard Biener <rguent...@suse.de> Date: Wed Feb 5 13:17:47 2025 +0100 rtl-optimization/117922 - disable fold-mem-offsets for highly connected CFG The PR shows fold-mem-offsets taking ages and a lot of memory computing DU/UD chains as that requires the RD problem. The issue is not so much the memory required for the pruned sets but the high CFG connectivity (and that the CFG is cyclic) which makes solving the dataflow problem expensive. The following adds the same limit as the one imposed by GCSE and CPROP. PR rtl-optimization/117922 * fold-mem-offsets.cc (pass_fold_mem_offsets::execute): Do nothing for a highly connected CFG.
