diff options
| author | Richard Biener <rguenther@suse.de> | 2024-07-23 10:29:58 +0200 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2024-07-23 11:51:29 +0200 |
| commit | 15d3b2dab9182eff036a604169b5e6f4ab3b2a40 (patch) | |
| tree | ee916bcc5cd5da098c3d98b0b69b26e5ed104e72 /gcc/dwarf2codeview.h | |
| parent | b40156d69153364315e071dc968227ce1c3bd2a8 (diff) | |
| download | gcc-15d3b2dab9182eff036a604169b5e6f4ab3b2a40.zip gcc-15d3b2dab9182eff036a604169b5e6f4ab3b2a40.tar.gz gcc-15d3b2dab9182eff036a604169b5e6f4ab3b2a40.tar.bz2 | |
tree-optimization/116002 - PTA solving slow with degenerate graph
When the constraint graph consists of N nodes with only complex
constraints and no copy edges we have to be lucky to arrive at
a constraint solving order that requires the optimal number of
iterations. What happens in the testcase is that we bottle-neck
on computing the visitation order but propagate changes only
very slowly. Luckily the testcase complex constraints are
all copy-with-offset and those do provide a way to order
visitation. The following adds this which reduces the iteration
count to one.
PR tree-optimization/116002
* tree-ssa-structalias.cc (topo_visit): Also consider
SCALAR = SCALAR complex constraints as edges.
Diffstat (limited to 'gcc/dwarf2codeview.h')
0 files changed, 0 insertions, 0 deletions