------- Comment #5 from mmitchel at gcc dot gnu dot org 2005-10-31 06:39 ------- Rather than increasing the estimate for loops with unknown bounds or throttling the maximum for loops with known bounds, why not notice, when inlining, that we've mixed the two, and drop all frequency guesses in the resulting function? (This is the usual lattice arithmetic idea.) If we don't know, we just don't know. It's probably better to admit that we have no information than to pretend that we understand what's going on. (I have no evidence that my idea actually helps, though; it could be horrible.)
Leaving as P2. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=24487
