https://gcc.gnu.org/bugzilla/show_bug.cgi?id=65076
--- Comment #21 from Jan Hubicka <hubicka at gcc dot gnu.org> --- Actually, looking at the code, I do not think we want full pure/const pass (that build loops and attmepts to prove finiteness). We only want to run nothrow discovery that is a lot cheaper and perhaps we want to do that already during lowering passes - it does not care much about into_ssa. We also may want to release ssa names after the ssa construction in case it leads to considerable amount of DCE.
