From de2815a5f705d0b4dc86a4af992e2a10b772ef71 Mon Sep 17 00:00:00 2001 From: Nadav Rotem Date: Thu, 18 Jul 2013 18:20:45 +0000 Subject: SLPVectorizer: Speedup isConsecutive by manually checking GEPs with multiple indices. This brings the compile time of the SLP-Vectorizer to about 2.5% of OPT for my testcase. llvm-svn: 186592 --- llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp | 16 ++++++++++++---- 1 file changed, 12 insertions(+), 4 deletions(-) (limited to 'llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp') diff --git a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp index 64987840353..3629eeec173 100644 --- a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp +++ b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp @@ -1006,12 +1006,20 @@ bool BoUpSLP::isConsecutiveAccess(Value *A, Value *B) { GepB->accumulateConstantOffset(*DL, OffsetB)) return ((OffsetB.getSExtValue() - OffsetA.getSExtValue()) == Sz); + if (GepA->getNumIndices() != GepB->getNumIndices()) + return false; + // Try to strip the geps. This makes SCEV faster. - if (GepA->getNumIndices() == 1 && GepB->getNumIndices() == 1) { - PtrA = GepA->getOperand(1); - PtrB = GepB->getOperand(1); - Sz = 1; + // Make sure that all of the indices except for the last are identical. + int LastIdx = GepA->getNumIndices(); + for (int i = 0; i < LastIdx - 1; i++) { + if (GepA->getOperand(i+1) != GepB->getOperand(i+1)) + return false; } + + PtrA = GepA->getOperand(LastIdx); + PtrB = GepB->getOperand(LastIdx); + Sz = 1; } // Check if PtrA is the base and PtrB is a constant offset. -- cgit v1.2.3