Author: Kazu Hirata Date: 2020-12-11T21:19:31-08:00 New Revision: eb44682d671d66e422b02595a636050582a4d84a
URL: https://github.com/llvm/llvm-project/commit/eb44682d671d66e422b02595a636050582a4d84a DIFF: https://github.com/llvm/llvm-project/commit/eb44682d671d66e422b02595a636050582a4d84a.diff LOG: [Analysis] Use is_contained (NFC) Added: Modified: llvm/lib/Analysis/CFG.cpp llvm/lib/Analysis/InstructionSimplify.cpp llvm/lib/Analysis/LazyValueInfo.cpp llvm/lib/Analysis/ScalarEvolution.cpp Removed: ################################################################################ diff --git a/llvm/lib/Analysis/CFG.cpp b/llvm/lib/Analysis/CFG.cpp index d87da3d8f8a7..33602ed71675 100644 --- a/llvm/lib/Analysis/CFG.cpp +++ b/llvm/lib/Analysis/CFG.cpp @@ -103,7 +103,7 @@ bool llvm::isCriticalEdge(const Instruction *TI, const BasicBlock *Dest, assert(TI->isTerminator() && "Must be a terminator to have successors!"); if (TI->getNumSuccessors() == 1) return false; - assert(find(predecessors(Dest), TI->getParent()) != pred_end(Dest) && + assert(is_contained(predecessors(Dest), TI->getParent()) && "No edge between TI's block and Dest."); const_pred_iterator I = pred_begin(Dest), E = pred_end(Dest); diff --git a/llvm/lib/Analysis/InstructionSimplify.cpp b/llvm/lib/Analysis/InstructionSimplify.cpp index 6b116eb0ed00..35c21a023bae 100644 --- a/llvm/lib/Analysis/InstructionSimplify.cpp +++ b/llvm/lib/Analysis/InstructionSimplify.cpp @@ -4669,7 +4669,7 @@ static Value *SimplifyShuffleVectorInst(Value *Op0, Value *Op1, // Don't fold a shuffle with undef mask elements. This may get folded in a // better way using demanded bits or other analysis. // TODO: Should we allow this? - if (find(Indices, -1) != Indices.end()) + if (is_contained(Indices, -1)) return nullptr; // Check if every element of this shuffle can be mapped back to the diff --git a/llvm/lib/Analysis/LazyValueInfo.cpp b/llvm/lib/Analysis/LazyValueInfo.cpp index 5a4db49a2bcb..a2f0bd872573 100644 --- a/llvm/lib/Analysis/LazyValueInfo.cpp +++ b/llvm/lib/Analysis/LazyValueInfo.cpp @@ -1244,7 +1244,7 @@ ValueLatticeElement getValueFromCondition(Value *Val, Value *Cond, // Return true if Usr has Op as an operand, otherwise false. static bool usesOperand(User *Usr, Value *Op) { - return find(Usr->operands(), Op) != Usr->op_end(); + return is_contained(Usr->operands(), Op); } // Return true if the instruction type of Val is supported by diff --git a/llvm/lib/Analysis/ScalarEvolution.cpp b/llvm/lib/Analysis/ScalarEvolution.cpp index 53fd668be05c..3005a44b44ef 100644 --- a/llvm/lib/Analysis/ScalarEvolution.cpp +++ b/llvm/lib/Analysis/ScalarEvolution.cpp @@ -10639,7 +10639,7 @@ static bool IsMinMaxConsistingOf(const SCEV *MaybeMinMaxExpr, if (!MinMaxExpr) return false; - return find(MinMaxExpr->operands(), Candidate) != MinMaxExpr->op_end(); + return is_contained(MinMaxExpr->operands(), Candidate); } static bool IsKnownPredicateViaAddRecStart(ScalarEvolution &SE, _______________________________________________ llvm-branch-commits mailing list llvm-branch-commits@lists.llvm.org https://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits
