http://gcc.gnu.org/bugzilla/show_bug.cgi?id=60317
--- Comment #4 from Richard Biener <rguenth at gcc dot gnu.org> --- (In reply to Richard Biener from comment #3) > This whole thing updating keys and such should use a proper lattice of > per-cgraph and per-edge node sizes/times which can be updated with a > less ad-hoc algorithm than the current one which easily and completely > explodes ... :/ (and the 'cache' is completely ineffective during the > update process) Err - wrong bug