mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 19:12:56 +02:00
Test commit access
llvm-svn: 360125
This commit is contained in:
parent
1987d2b1c3
commit
87bac3f8d9
@ -2601,7 +2601,7 @@ bool llvm::FoldBranchToCommonDest(BranchInst *BI, unsigned BonusInstThreshold) {
|
||||
// unconditionally. We denote all involved instructions except the condition
|
||||
// as "bonus instructions", and only allow this transformation when the
|
||||
// number of the bonus instructions we'll need to create when cloning into
|
||||
// each predecessor does not exceed a certain threshold.
|
||||
// each predecessor does not exceed a certain threshold.
|
||||
unsigned NumBonusInsts = 0;
|
||||
for (auto I = BB->begin(); Cond != &*I; ++I) {
|
||||
// Ignore dbg intrinsics.
|
||||
@ -2618,7 +2618,7 @@ bool llvm::FoldBranchToCommonDest(BranchInst *BI, unsigned BonusInstThreshold) {
|
||||
// and Cond.
|
||||
|
||||
// Account for the cost of duplicating this instruction into each
|
||||
// predecessor.
|
||||
// predecessor.
|
||||
NumBonusInsts += PredCount;
|
||||
// Early exits once we reach the limit.
|
||||
if (NumBonusInsts > BonusInstThreshold)
|
||||
|
Loading…
Reference in New Issue
Block a user