[llvm-commits] BlockFrequency for BasicBlocks

[Andrew Trick]

On Jun 22, 2011, at 6:16 PM, Jakub Staszak wrote:

> Previously we used getEdgeFreq which is wrong, because sum of them for some BB from all its predecessors might be greater than START_FREQ.

The algorithm assumes that will never happen when BB is the loop head currently being processed. If it does happen (irreducible inner loops?) then I don't know how to calculate cyclic probability. I would just pick a reasonably high value.

BTW: this problem could be solved by converted the irreducible graph to a reducible one, but you shouldn't worry about that for now.

-Andy