mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-09-15 06:25:53 +00:00
Update SetVector to rely on the underlying set's insert to return a pair<iterator, bool>
This is to be consistent with StringSet and ultimately with the standard library's associative container insert function. This lead to updating SmallSet::insert to return pair<iterator, bool>, and then to update SmallPtrSet::insert to return pair<iterator, bool>, and then to update all the existing users of those functions... git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@222334 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -1724,7 +1724,7 @@ int BoUpSLP::getTreeCost() {
|
||||
for (UserList::iterator I = ExternalUses.begin(), E = ExternalUses.end();
|
||||
I != E; ++I) {
|
||||
// We only add extract cost once for the same scalar.
|
||||
if (!ExtractCostCalculated.insert(I->Scalar))
|
||||
if (!ExtractCostCalculated.insert(I->Scalar).second)
|
||||
continue;
|
||||
|
||||
// Uses by ephemeral values are free (because the ephemeral value will be
|
||||
@@ -1922,7 +1922,7 @@ Value *BoUpSLP::vectorizeTree(TreeEntry *E) {
|
||||
ValueList Operands;
|
||||
BasicBlock *IBB = PH->getIncomingBlock(i);
|
||||
|
||||
if (!VisitedBBs.insert(IBB)) {
|
||||
if (!VisitedBBs.insert(IBB).second) {
|
||||
NewPhi->addIncoming(NewPhi->getIncomingValueForBlock(IBB), IBB);
|
||||
continue;
|
||||
}
|
||||
@@ -3632,7 +3632,7 @@ 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.insert(it))
|
||||
if (!VisitedInstrs.insert(it).second)
|
||||
continue;
|
||||
|
||||
if (isa<DbgInfoIntrinsic>(it))
|
||||
|
Reference in New Issue
Block a user