https://gcc.gnu.org/bugzilla/show_bug.cgi?id=125040
Richard Biener <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Attachment #64861|0 |1
is obsolete| |
Attachment #64862|0 |1
is obsolete| |
--- Comment #7 from Richard Biener <rguenth at gcc dot gnu.org> ---
Created attachment 64864
--> https://gcc.gnu.org/bugzilla/attachment.cgi?id=64864&action=edit
debugging patch
Debugging patch that shows we do not have a cycle in values or expressions but
instead the issue is the toplevel iteration in sorted_array_from_bitmap_set:
FOR_EACH_VALUE_ID_IN_SET (set, i, bi)
if (bitmap_set_bit (val_visited, i))
pre_expr_DFS (i, set, exclusions, val_visited, result);
as that can enter the expression graph at random places and thus while
each sub-graph we visit produces a properly sorted set the overall
set isn't appropriately sorted.
