From: Nadav Rotem Date: Sat, 20 Apr 2013 07:29:34 +0000 (+0000) Subject: SLPVectorizer: Reduce the compile time by eliminating the search for some of the... X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=cd949714ebfab4b6bc54d964a337c23370aab5b2;p=oota-llvm.git SLPVectorizer: Reduce the compile time by eliminating the search for some of the more expensive patterns. After this change will only check basic arithmetic trees that start at cmpinstr. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@179933 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/lib/Transforms/Vectorize/SLPVectorizer.cpp b/lib/Transforms/Vectorize/SLPVectorizer.cpp index 6f4d69e3424..3a0e9abe578 100644 --- a/lib/Transforms/Vectorize/SLPVectorizer.cpp +++ b/lib/Transforms/Vectorize/SLPVectorizer.cpp @@ -261,7 +261,7 @@ bool SLPVectorizer::vectorizeReductions(BasicBlock *BB, BoUpSLP &R) { } for (int i = 0; i < 2; ++i) if (BinaryOperator *BI = dyn_cast(CI->getOperand(i))) - Changed |= tryToVectorize(BI, R); + Changed |= tryToVectorizePair(BI->getOperand(0), BI->getOperand(1), R); continue; } }