From: Arnold Schwaighofer Date: Sun, 5 May 2013 01:54:44 +0000 (+0000) Subject: LoopVectorizer: Cleanup of miminimum/maximum pattern match code X-Git-Url: http://plrg.eecs.uci.edu/git/?a=commitdiff_plain;h=f852472823fd2182a3ca54bdf4d30ad8a6a6cd57;p=oota-llvm.git LoopVectorizer: Cleanup of miminimum/maximum pattern match code No need for setting the operands. The pointers are going to be bound by the matcher. radar://13723044 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@181142 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/lib/Transforms/Vectorize/LoopVectorize.cpp b/lib/Transforms/Vectorize/LoopVectorize.cpp index 1c7397bfa66..9f905875514 100644 --- a/lib/Transforms/Vectorize/LoopVectorize.cpp +++ b/lib/Transforms/Vectorize/LoopVectorize.cpp @@ -2991,8 +2991,8 @@ LoopVectorizationLegality::isMinMaxSelectCmpPattern(Instruction *I, ReductionIns if (!Cmp->hasOneUse()) return ReductionInstDesc(false, I); - Value *CmpLeft = Cmp->getOperand(0); - Value *CmpRight = Cmp->getOperand(1); + Value *CmpLeft; + Value *CmpRight; // Look for a min/max pattern. if (m_UMin(m_Value(CmpLeft), m_Value(CmpRight)).match(Select))