diff options
| author | Richard Biener <rguenther@suse.de> | 2025-02-05 13:17:47 +0100 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2025-02-06 09:03:49 +0100 |
| commit | 677122c9df1b55a791a54426269f7a8ce794f947 (patch) | |
| tree | ca70c8b8523af3bf2189e4efa65987d6a43e314e /libatomic/config/linux | |
| parent | 927e10bfce569947354cdd6b35c29b74e25c7816 (diff) | |
| download | gcc-master.zip gcc-master.tar.gz gcc-master.tar.bz2 | |
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.
Diffstat (limited to 'libatomic/config/linux')
0 files changed, 0 insertions, 0 deletions