RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-22 10:42:39 +01:00
Code Issues Projects Releases Wiki Activity

[BPI] Remove unnecessary std::list

Browse Source 
vector is sufficient here. No functionality change intended.

llvm-svn: 334865
This commit is contained in:
Benjamin Kramer 2018-06-15 21:06:43 +00:00
parent 85f719e405
commit a0de3d9bb0
1 changed files with 4 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
lib/Analysis/BranchProbabilityInfo.cpp
View File

@ -500,13 +500,13 @@ computeUnlikelySuccessors(const BasicBlock *BB, Loop *L,
PHINode *CmpPHI = dyn_cast<PHINode>(CmpLHS);
Constant *CmpConst = dyn_cast<Constant>(CI->getOperand(1));
// Collect the instructions until we hit a PHI
std::list<BinaryOperator*> InstChain;
SmallVector<BinaryOperator *, 1> InstChain;
while (!CmpPHI && CmpLHS && isa<BinaryOperator>(CmpLHS) &&
isa<Constant>(CmpLHS->getOperand(1))) {
// Stop if the chain extends outside of the loop
if (!L->contains(CmpLHS))
return;
InstChain.push_front(dyn_cast<BinaryOperator>(CmpLHS));
InstChain.push_back(cast<BinaryOperator>(CmpLHS));
CmpLHS = dyn_cast<Instruction>(CmpLHS->getOperand(0));
if (CmpLHS)
CmpPHI = dyn_cast<PHINode>(CmpLHS);
@ -542,10 +542,9 @@ computeUnlikelySuccessors(const BasicBlock *BB, Loop *L,
std::find(succ_begin(BB), succ_end(BB), B) == succ_end(BB))
continue;
// First collapse InstChain
for (Instruction *I : InstChain) {
for (Instruction *I : llvm::reverse(InstChain)) {
CmpLHSConst = ConstantExpr::get(I->getOpcode(), CmpLHSConst,
dyn_cast<Constant>(I->getOperand(1)),
true);
cast<Constant>(I->getOperand(1)), true);
if (!CmpLHSConst)
break;
}