https://gcc.gnu.org/bugzilla/show_bug.cgi?id=114855
--- Comment #36 from Aldy Hernandez <aldyh at gcc dot gnu.org> --- (In reply to Richard Biener from comment #33) > Can we just sort m_paths after the path entry BB and fix the lookup that way? This seemed promising, especially because the adjust_paths_after_duplication() gets called from the backwards threader in order, and always starting at position 0, so searching for the first item would be super fast. However, this function will rewire the edges in the path (rewire_first_differing_edge), thus messing up the sort.
