Allow the client of DependenceInfo to obtain dependences at different granularities.
llvm-svn: 262591
diff --git a/polly/lib/Transform/DeadCodeElimination.cpp b/polly/lib/Transform/DeadCodeElimination.cpp
index f8374d6..4fe6317 100644
--- a/polly/lib/Transform/DeadCodeElimination.cpp
+++ b/polly/lib/Transform/DeadCodeElimination.cpp
@@ -115,7 +115,7 @@
/// simplifies the life set with an affine hull.
bool DeadCodeElim::eliminateDeadCode(Scop &S, int PreciseSteps) {
DependenceInfo &DI = getAnalysis<DependenceInfo>();
- const Dependences &D = DI.getDependences();
+ const Dependences &D = DI.getDependences(Dependences::AL_Statement);
if (!D.hasValidDependences())
return false;
@@ -159,7 +159,7 @@
// FIXME: We can probably avoid the recomputation of all dependences by
// updating them explicitly.
if (Changed)
- DI.recomputeDependences();
+ DI.recomputeDependences(Dependences::AL_Statement);
return Changed;
}
diff --git a/polly/lib/Transform/ScheduleOptimizer.cpp b/polly/lib/Transform/ScheduleOptimizer.cpp
index 77c339f..6702c53 100644
--- a/polly/lib/Transform/ScheduleOptimizer.cpp
+++ b/polly/lib/Transform/ScheduleOptimizer.cpp
@@ -462,7 +462,8 @@
return false;
}
- const Dependences &D = getAnalysis<DependenceInfo>().getDependences();
+ const Dependences &D =
+ getAnalysis<DependenceInfo>().getDependences(Dependences::AL_Statement);
if (!D.hasValidDependences())
return false;