From d22d5f9122de2c8527f1d8890ce2802a89e0db0c Mon Sep 17 00:00:00 2001 From: Nadav Rotem Date: Thu, 18 Oct 2012 05:33:02 +0000 Subject: [PATCH] Remove the use of dominators and AA. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@166167 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Transforms/Vectorize/LoopVectorize.cpp | 8 -------- 1 file changed, 8 deletions(-) diff --git a/lib/Transforms/Vectorize/LoopVectorize.cpp b/lib/Transforms/Vectorize/LoopVectorize.cpp index 80fdad30165..6ce303cfb54 100644 --- a/lib/Transforms/Vectorize/LoopVectorize.cpp +++ b/lib/Transforms/Vectorize/LoopVectorize.cpp @@ -28,7 +28,6 @@ #include "llvm/Analysis/LoopPass.h" #include "llvm/Value.h" #include "llvm/Function.h" -#include "llvm/Analysis/Dominators.h" #include "llvm/Analysis/Verifier.h" #include "llvm/Module.h" #include "llvm/Type.h" @@ -143,7 +142,6 @@ private: DenseMap WidenMap; }; - /// Perform the vectorization legality check. This class does not look at the /// profitability of vectorization, only the legality. At the moment the checks /// are very simple and focus on single basic block loops with a constant @@ -184,22 +182,18 @@ struct LoopVectorize : public LoopPass { initializeLoopVectorizePass(*PassRegistry::getPassRegistry()); } - AliasAnalysis *AA; ScalarEvolution *SE; DataLayout *DL; LoopInfo *LI; - DominatorTree *DT; virtual bool runOnLoop(Loop *L, LPPassManager &LPM) { // Only vectorize innermost loops. if (!L->empty()) return false; - AA = &getAnalysis(); SE = &getAnalysis(); DL = getAnalysisIfAvailable(); LI = &getAnalysis(); - DT = &getAnalysis(); DEBUG(dbgs() << "LV: Checking a loop in \"" << L->getHeader()->getParent()->getName() << "\"\n"); @@ -227,10 +221,8 @@ struct LoopVectorize : public LoopPass { virtual void getAnalysisUsage(AnalysisUsage &AU) const { LoopPass::getAnalysisUsage(AU); AU.addRequiredID(LoopSimplifyID); - AU.addRequired(); AU.addRequired(); AU.addRequired(); - AU.addRequired(); } };