af4e809ca6
This removes old code that has been disabled since several weeks and was hidden behind the flags -disable-polly-intra-scop-scalar-to-array=false and -polly-model-phi-nodes=false. Earlier, Polly used to translate scalars and PHI nodes to single element arrays, as this avoided the need for their special handling in Polly. With Johannes' patches adding native support for such scalar references to Polly, this code is not needed any more. After this commit both -polly-prepare and -polly-independent are now mostly no-ops. Only a couple of simple transformations still remain, but they are scheduled for removal too. Thanks again to Johannes Doerfert for his nice work in making all this code obsolete. llvm-svn: 240766
100 lines
3.0 KiB
C++
100 lines
3.0 KiB
C++
//===---- CodePreparation.cpp - Code preparation for Scop Detection -------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The Polly code preparation pass is executed before SCoP detection. Its
|
|
// currently only splits the entry block of the SCoP to make room for alloc
|
|
// instructions as they are generated during code generation.
|
|
//
|
|
// XXX: In the future, we should remove the need for this pass entirely and
|
|
// instead add this spitting to the code generation pass.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "polly/LinkAllPasses.h"
|
|
#include "polly/CodeGen/BlockGenerators.h"
|
|
#include "polly/ScopDetection.h"
|
|
#include "polly/Support/ScopHelper.h"
|
|
#include "llvm/Analysis/DominanceFrontier.h"
|
|
#include "llvm/Analysis/LoopInfo.h"
|
|
#include "llvm/Analysis/RegionInfo.h"
|
|
#include "llvm/Analysis/ScalarEvolution.h"
|
|
#include "llvm/Transforms/Utils/Local.h"
|
|
|
|
using namespace llvm;
|
|
using namespace polly;
|
|
|
|
namespace {
|
|
|
|
/// @brief Prepare the IR for the scop detection.
|
|
///
|
|
class CodePreparation : public FunctionPass {
|
|
CodePreparation(const CodePreparation &) = delete;
|
|
const CodePreparation &operator=(const CodePreparation &) = delete;
|
|
|
|
LoopInfo *LI;
|
|
ScalarEvolution *SE;
|
|
|
|
void clear();
|
|
|
|
bool eliminatePHINodes(Function &F);
|
|
|
|
public:
|
|
static char ID;
|
|
|
|
explicit CodePreparation() : FunctionPass(ID) {}
|
|
~CodePreparation();
|
|
|
|
/// @name FunctionPass interface.
|
|
//@{
|
|
virtual void getAnalysisUsage(AnalysisUsage &AU) const;
|
|
virtual void releaseMemory();
|
|
virtual bool runOnFunction(Function &F);
|
|
virtual void print(raw_ostream &OS, const Module *) const;
|
|
//@}
|
|
};
|
|
}
|
|
|
|
void CodePreparation::clear() {}
|
|
|
|
CodePreparation::~CodePreparation() { clear(); }
|
|
|
|
void CodePreparation::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
AU.addRequired<LoopInfoWrapperPass>();
|
|
AU.addRequired<ScalarEvolution>();
|
|
|
|
AU.addPreserved<LoopInfoWrapperPass>();
|
|
AU.addPreserved<RegionInfoPass>();
|
|
AU.addPreserved<DominatorTreeWrapperPass>();
|
|
AU.addPreserved<DominanceFrontier>();
|
|
}
|
|
|
|
bool CodePreparation::runOnFunction(Function &F) {
|
|
LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
|
|
SE = &getAnalysis<ScalarEvolution>();
|
|
|
|
splitEntryBlockForAlloca(&F.getEntryBlock(), this);
|
|
|
|
return false;
|
|
}
|
|
|
|
void CodePreparation::releaseMemory() { clear(); }
|
|
|
|
void CodePreparation::print(raw_ostream &OS, const Module *) const {}
|
|
|
|
char CodePreparation::ID = 0;
|
|
char &polly::CodePreparationID = CodePreparation::ID;
|
|
|
|
Pass *polly::createCodePreparationPass() { return new CodePreparation(); }
|
|
|
|
INITIALIZE_PASS_BEGIN(CodePreparation, "polly-prepare",
|
|
"Polly - Prepare code for polly", false, false)
|
|
INITIALIZE_PASS_DEPENDENCY(LoopInfoWrapperPass)
|
|
INITIALIZE_PASS_END(CodePreparation, "polly-prepare",
|
|
"Polly - Prepare code for polly", false, false)
|