[gcc r14-72] Avoid non-unified nodes on the topological sorting for PTA solving

[gcc r14-72] Avoid non-unified nodes on the topological sorting for PTA solving

[Richard Biener]

https://gcc.gnu.org/g:7838574b5aca179e347eb972880ea8376a2cc6b5

commit r14-72-g7838574b5aca179e347eb972880ea8376a2cc6b5
Author: Richard Biener <rguenther@suse.de>
Date:   Tue Mar 14 14:39:32 2023 +0100

    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:
---
 gcc/tree-ssa-structalias.cc | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/gcc/tree-ssa-structalias.cc b/gcc/tree-ssa-structalias.cc
index fa3a2e4e1f9..8976cc9c2f8 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);