https://gcc.gnu.org/bugzilla/show_bug.cgi?id=116002
--- Comment #7 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:15d3b2dab9182eff036a604169b5e6f4ab3b2a40 commit r15-2223-g15d3b2dab9182eff036a604169b5e6f4ab3b2a40 Author: Richard Biener <rguent...@suse.de> Date: Tue Jul 23 10:29:58 2024 +0200 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.
