From: Richard Biener <rguenther@suse.de>
Date: Tue, 14 Mar 2023 13:39:32 +0000 (+0100)
Subject: Avoid non-unified nodes on the topological sorting for PTA solving
X-Git-Tag: basepoints/gcc-15~10067
X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=7838574b5aca179e347eb972880ea8376a2cc6b5;p=thirdparty%2Fgcc.git

Avoid non-unified nodes on the topological sorting for PTA solving

Since we do not update successor edges when merging nodes we have
to deal with this in the users.  The following avoids putting those
on the topo order vector.

	* tree-ssa-structalias.cc (topo_visit): Look at the real
	destination of edges.
---

diff --git a/gcc/tree-ssa-structalias.cc b/gcc/tree-ssa-structalias.cc
index fa3a2e4e1f91..8976cc9c2f87 100644
--- a/gcc/tree-ssa-structalias.cc
+++ b/gcc/tree-ssa-structalias.cc
@@ -1632,8 +1632,9 @@ topo_visit (constraint_graph_t graph, struct topo_info *ti,
   if (graph->succs[n])
     EXECUTE_IF_SET_IN_BITMAP (graph->succs[n], 0, j, bi)
       {
-	if (!bitmap_bit_p (ti->visited, j))
-	  topo_visit (graph, ti, j);
+	unsigned k = find (j);
+	if (!bitmap_bit_p (ti->visited, k))
+	  topo_visit (graph, ti, k);
       }
 
   ti->topo_order.safe_push (n);