------- Comment #17 from matz at gcc dot gnu dot org 2007-11-22 22:51 ------- We could also save the deletes by using a tick counter, but with that patch the hash tables will be mostly small anyway, so emptying them should be fast enough I hope. And of course we won't get as optimal results as the RPO algorithm from the paper, no idea if that's possible without having this bug.
-- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=34176
