1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 03:33:20 +01:00

Check if in set on insertion instead of separately

llvm-svn: 189179
This commit is contained in:
Matt Arsenault 2013-08-24 19:55:38 +00:00
parent b786cca090
commit c1b8722791

View File

@ -1161,13 +1161,11 @@ Value *BoUpSLP::vectorizeTree(TreeEntry *E) {
ValueList Operands;
BasicBlock *IBB = PH->getIncomingBlock(i);
if (VisitedBBs.count(IBB)) {
if (!VisitedBBs.insert(IBB)) {
NewPhi->addIncoming(NewPhi->getIncomingValueForBlock(IBB), IBB);
continue;
}
VisitedBBs.insert(IBB);
// Prepare the operand vector.
for (unsigned j = 0; j < E->Scalars.size(); ++j)
Operands.push_back(cast<PHINode>(E->Scalars[j])->
@ -1851,9 +1849,8 @@ bool SLPVectorizer::vectorizeChainsInBlock(BasicBlock *BB, BoUpSLP &R) {
break;
// We may go through BB multiple times so skip the one we have checked.
if (VisitedInstrs.count(instr))
if (!VisitedInstrs.insert(instr))
continue;
VisitedInstrs.insert(instr);
// Stop constructing the list when you reach a different type.
if (Incoming.size() && P->getType() != Incoming[0]->getType()) {
@ -1879,9 +1876,8 @@ bool SLPVectorizer::vectorizeChainsInBlock(BasicBlock *BB, BoUpSLP &R) {
for (BasicBlock::iterator it = BB->begin(), e = BB->end(); it != e; it++) {
// We may go through BB multiple times so skip the one we have checked.
if (VisitedInstrs.count(it))
if (!VisitedInstrs.insert(it))
continue;
VisitedInstrs.insert(it);
if (isa<DbgInfoIntrinsic>(it))
continue;