mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-07-25 13:24:46 +00:00
Do not use ETForest as well as DomiantorTree. DominatorTree is sufficient.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37501 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -45,7 +45,6 @@ namespace {
|
||||
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
|
||||
AU.addRequiredID(BreakCriticalEdgesID);
|
||||
AU.addRequiredID(LoopSimplifyID);
|
||||
AU.addRequired<ETForest>();
|
||||
AU.addRequired<DominatorTree>();
|
||||
AU.addRequired<LoopInfo>();
|
||||
}
|
||||
@@ -78,7 +77,6 @@ bool LoopExtractor::runOnFunction(Function &F) {
|
||||
if (LI.begin() == LI.end())
|
||||
return false;
|
||||
|
||||
ETForest &EF = getAnalysis<ETForest>();
|
||||
DominatorTree &DT = getAnalysis<DominatorTree>();
|
||||
|
||||
// If there is more than one top-level loop in this function, extract all of
|
||||
@@ -88,7 +86,7 @@ bool LoopExtractor::runOnFunction(Function &F) {
|
||||
for (LoopInfo::iterator i = LI.begin(), e = LI.end(); i != e; ++i) {
|
||||
if (NumLoops == 0) return Changed;
|
||||
--NumLoops;
|
||||
Changed |= ExtractLoop(EF, DT, *i) != 0;
|
||||
Changed |= ExtractLoop(DT, *i) != 0;
|
||||
++NumExtracted;
|
||||
}
|
||||
} else {
|
||||
@@ -118,7 +116,7 @@ bool LoopExtractor::runOnFunction(Function &F) {
|
||||
if (ShouldExtractLoop) {
|
||||
if (NumLoops == 0) return Changed;
|
||||
--NumLoops;
|
||||
Changed |= ExtractLoop(EF, DT, TLL) != 0;
|
||||
Changed |= ExtractLoop(DT, TLL) != 0;
|
||||
++NumExtracted;
|
||||
} else {
|
||||
// Okay, this function is a minimal container around the specified loop.
|
||||
@@ -128,7 +126,7 @@ bool LoopExtractor::runOnFunction(Function &F) {
|
||||
for (Loop::iterator i = TLL->begin(), e = TLL->end(); i != e; ++i) {
|
||||
if (NumLoops == 0) return Changed;
|
||||
--NumLoops;
|
||||
Changed |= ExtractLoop(EF, DT, *i) != 0;
|
||||
Changed |= ExtractLoop(DT, *i) != 0;
|
||||
++NumExtracted;
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user