Artur Pilipenko 3ff0fb0651 [BPI] Apply invoke heuristic before loop branch heuristic ...

Currently the loop branch heuristic is applied before the invoke heuristic which makes us overestimate the probability of the unwind destination of invokes inside loops. This in turn makes us grossly underestimate the frequencies of loops with invokes.

Reviewed By: skatkov, vsk

Differential Revision: https://reviews.llvm.org/D47371


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@334285 91177308-0d34-0410-b5e6-96231b3b80d8

2018-06-08 13:03:21 +00:00

..

basic.ll

[BPI] Reduce the probability of unreachable edge to minimal value greater than 0

2017-05-18 06:11:56 +00:00

deopt-intrinsic.ll

[BPI] Reduce the probability of unreachable edge to minimal value greater than 0

2017-05-18 06:11:56 +00:00

libfunc_call.ll

[BPI] Don't assume that strcmp returning >0 is more likely than <0

2017-06-08 09:44:40 +00:00

loop.ll

[BPI] Apply invoke heuristic before loop branch heuristic

2018-06-08 13:03:21 +00:00

noreturn.ll

[BPI] Reduce the probability of unreachable edge to minimal value greater than 0

2017-05-18 06:11:56 +00:00

pr18705.ll

[PM] Port Branch Probability Analysis pass to the new pass manager.

2016-05-05 02:59:57 +00:00

pr22718.ll

[PM] Port Branch Probability Analysis pass to the new pass manager.

2016-05-05 02:59:57 +00:00