[llvm-commits] CVS: llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp CompleteBottomUp.cpp DataStructureAA.cpp DataStructureOpt.cpp IPModRef.cpp IPModRef.h Local.cpp MemoryDepAnalysis.cpp MemoryDepAnalysis.h Parallelize.cpp PgmDependenceGraph.h Steensgaard.cpp TopDownClosure.cpp
Chris Lattner
lattner at cs.uiuc.edu
Sun Sep 19 21:45:36 PDT 2004
Changes in directory llvm/lib/Analysis/DataStructure:
BottomUpClosure.cpp updated: 1.81 -> 1.82
CompleteBottomUp.cpp updated: 1.13 -> 1.14
DataStructureAA.cpp updated: 1.19 -> 1.20
DataStructureOpt.cpp updated: 1.7 -> 1.8
IPModRef.cpp updated: 1.26 -> 1.27
IPModRef.h updated: 1.2 -> 1.3
Local.cpp updated: 1.111 -> 1.112
MemoryDepAnalysis.cpp updated: 1.18 -> 1.19
MemoryDepAnalysis.h updated: 1.3 -> 1.4
Parallelize.cpp updated: 1.17 -> 1.18
PgmDependenceGraph.h updated: 1.4 -> 1.5
Steensgaard.cpp updated: 1.42 -> 1.43
TopDownClosure.cpp updated: 1.69 -> 1.70
---
Log message:
'Pass' should now not be derived from by clients. Instead, they should derive
from ModulePass. Instead of implementing Pass::run, then should implement
ModulePass::runOnModule.
---
Diffs of the changes: (+22 -22)
Index: llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp
diff -u llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.81 llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.82
--- llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp:1.81 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/BottomUpClosure.cpp Sun Sep 19 23:45:25 2004
@@ -35,7 +35,7 @@
// run - Calculate the bottom up data structure graphs for each function in the
// program.
//
-bool BUDataStructures::run(Module &M) {
+bool BUDataStructures::runOnModule(Module &M) {
LocalDataStructures &LocalDSA = getAnalysis<LocalDataStructures>();
GlobalsGraph = new DSGraph(LocalDSA.getGlobalsGraph());
GlobalsGraph->setPrintAuxCalls();
Index: llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp
diff -u llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp:1.13 llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp:1.14
--- llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp:1.13 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/CompleteBottomUp.cpp Sun Sep 19 23:45:25 2004
@@ -32,7 +32,7 @@
// run - Calculate the bottom up data structure graphs for each function in the
// program.
//
-bool CompleteBUDataStructures::run(Module &M) {
+bool CompleteBUDataStructures::runOnModule(Module &M) {
BUDataStructures &BU = getAnalysis<BUDataStructures>();
GlobalsGraph = new DSGraph(BU.getGlobalsGraph());
GlobalsGraph->setPrintAuxCalls();
Index: llvm/lib/Analysis/DataStructure/DataStructureAA.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.19 llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.20
--- llvm/lib/Analysis/DataStructure/DataStructureAA.cpp:1.19 Wed Jul 7 01:32:21 2004
+++ llvm/lib/Analysis/DataStructure/DataStructureAA.cpp Sun Sep 19 23:45:25 2004
@@ -19,7 +19,7 @@
using namespace llvm;
namespace {
- class DSAA : public Pass, public AliasAnalysis {
+ class DSAA : public ModulePass, public AliasAnalysis {
TDDataStructures *TD;
BUDataStructures *BU;
public:
@@ -32,7 +32,7 @@
// run - Build up the result graph, representing the pointer graph for the
// program.
//
- bool run(Module &M) {
+ bool runOnModule(Module &M) {
InitializeAliasAnalysis(this);
TD = &getAnalysis<TDDataStructures>();
BU = &getAnalysis<BUDataStructures>();
Index: llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp
diff -u llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp:1.7 llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp:1.8
--- llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp:1.7 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/DataStructureOpt.cpp Sun Sep 19 23:45:25 2004
@@ -25,10 +25,10 @@
Statistic<>
NumGlobalsIsolated("ds-opt", "Number of globals with references dropped");
- class DSOpt : public Pass {
+ class DSOpt : public ModulePass {
TDDataStructures *TD;
public:
- bool run(Module &M) {
+ bool runOnModule(Module &M) {
TD = &getAnalysis<TDDataStructures>();
bool Changed = OptimizeGlobals(M);
return Changed;
Index: llvm/lib/Analysis/DataStructure/IPModRef.cpp
diff -u llvm/lib/Analysis/DataStructure/IPModRef.cpp:1.26 llvm/lib/Analysis/DataStructure/IPModRef.cpp:1.27
--- llvm/lib/Analysis/DataStructure/IPModRef.cpp:1.26 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/IPModRef.cpp Sun Sep 19 23:45:25 2004
@@ -374,7 +374,7 @@
// NO real interprocedural work because all that has been done the
// data structure analysis.
//
-bool IPModRef::run(Module &theModule)
+bool IPModRef::runOnModule(Module &theModule)
{
M = &theModule;
Index: llvm/lib/Analysis/DataStructure/IPModRef.h
diff -u llvm/lib/Analysis/DataStructure/IPModRef.h:1.2 llvm/lib/Analysis/DataStructure/IPModRef.h:1.3
--- llvm/lib/Analysis/DataStructure/IPModRef.h:1.2 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/IPModRef.h Sun Sep 19 23:45:25 2004
@@ -183,7 +183,7 @@
/// from an arbitrary callsite, or during an execution of a single call-site
/// within the function.
///
-class IPModRef : public Pass {
+class IPModRef : public ModulePass {
std::map<const Function*, FunctionModRefInfo*> funcToModRefInfoMap;
Module* M;
@@ -197,7 +197,7 @@
/// This initializes the module reference, and then computes IPModRef
/// results immediately if demand-driven analysis was *not* specified.
///
- virtual bool run(Module &M);
+ virtual bool runOnModule(Module &M);
/// getFunctionModRefInfo - Retrieve the Mod/Ref information for a single
/// function
Index: llvm/lib/Analysis/DataStructure/Local.cpp
diff -u llvm/lib/Analysis/DataStructure/Local.cpp:1.111 llvm/lib/Analysis/DataStructure/Local.cpp:1.112
--- llvm/lib/Analysis/DataStructure/Local.cpp:1.111 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/Local.cpp Sun Sep 19 23:45:25 2004
@@ -1023,7 +1023,7 @@
}
-bool LocalDataStructures::run(Module &M) {
+bool LocalDataStructures::runOnModule(Module &M) {
GlobalsGraph = new DSGraph(getAnalysis<TargetData>());
const TargetData &TD = getAnalysis<TargetData>();
Index: llvm/lib/Analysis/DataStructure/MemoryDepAnalysis.cpp
diff -u llvm/lib/Analysis/DataStructure/MemoryDepAnalysis.cpp:1.18 llvm/lib/Analysis/DataStructure/MemoryDepAnalysis.cpp:1.19
--- llvm/lib/Analysis/DataStructure/MemoryDepAnalysis.cpp:1.18 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/MemoryDepAnalysis.cpp Sun Sep 19 23:45:25 2004
@@ -457,7 +457,7 @@
// Driver function to compute dependence graphs for every function.
// This is temporary and will go away once this is a FunctionPass.
//
-bool MemoryDepAnalysis::run(Module& M)
+bool MemoryDepAnalysis::runOnModule(Module& M)
{
for (Module::iterator FI = M.begin(), FE = M.end(); FI != FE; ++FI)
if (! FI->isExternal())
Index: llvm/lib/Analysis/DataStructure/MemoryDepAnalysis.h
diff -u llvm/lib/Analysis/DataStructure/MemoryDepAnalysis.h:1.3 llvm/lib/Analysis/DataStructure/MemoryDepAnalysis.h:1.4
--- llvm/lib/Analysis/DataStructure/MemoryDepAnalysis.h:1.3 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/MemoryDepAnalysis.h Sun Sep 19 23:45:25 2004
@@ -40,7 +40,7 @@
/// allowed to use a FunctionPass such as this one.
///---------------------------------------------------------------------------
-class MemoryDepAnalysis : public Pass {
+class MemoryDepAnalysis : public ModulePass {
/// The following map and depGraph pointer are temporary until this class
/// becomes a FunctionPass instead of a module Pass.
hash_map<Function*, DependenceGraph*> funcMap;
@@ -63,7 +63,7 @@
/// Driver function to compute dependence graphs for every function.
///
- bool run(Module &M);
+ bool runOnModule(Module &M);
/// getGraph - Retrieve the dependence graph for a function.
/// This is temporary and will go away once this is a FunctionPass.
Index: llvm/lib/Analysis/DataStructure/Parallelize.cpp
diff -u llvm/lib/Analysis/DataStructure/Parallelize.cpp:1.17 llvm/lib/Analysis/DataStructure/Parallelize.cpp:1.18
--- llvm/lib/Analysis/DataStructure/Parallelize.cpp:1.17 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/Parallelize.cpp Sun Sep 19 23:45:25 2004
@@ -388,11 +388,11 @@
//----------------------------------------------------------------------------
namespace {
- class Parallelize: public Pass {
+ class Parallelize : public ModulePass {
public:
/// Driver functions to transform a program
///
- bool run(Module& M);
+ bool runOnModule(Module& M);
/// getAnalysisUsage - Modifies extensively so preserve nothing.
/// Uses the DependenceGraph and the Top-down DS Graph (only to find
@@ -409,7 +409,7 @@
}
-bool Parallelize::run(Module& M) {
+bool Parallelize::runOnModule(Module& M) {
hash_set<Function*> parallelFunctions;
hash_set<Function*> safeParallelFunctions;
hash_set<const GlobalValue*> indirectlyCalled;
Index: llvm/lib/Analysis/DataStructure/PgmDependenceGraph.h
diff -u llvm/lib/Analysis/DataStructure/PgmDependenceGraph.h:1.4 llvm/lib/Analysis/DataStructure/PgmDependenceGraph.h:1.5
--- llvm/lib/Analysis/DataStructure/PgmDependenceGraph.h:1.4 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/PgmDependenceGraph.h Sun Sep 19 23:45:25 2004
@@ -200,7 +200,7 @@
/// allowed to use a FunctionPass such as this one.
///---------------------------------------------------------------------------
-class PgmDependenceGraph: public Pass {
+class PgmDependenceGraph: public ModulePass {
/// Information about the function being analyzed.
///
@@ -253,7 +253,7 @@
/// Driver function to compute dependence graphs for every function.
///
- bool run(Module& M) { return true; }
+ bool runOnModule(Module& M) { return true; }
/// getGraph() -- Retrieve the pgm dependence graph for a function.
/// This is temporary and will go away once this is a FunctionPass.
Index: llvm/lib/Analysis/DataStructure/Steensgaard.cpp
diff -u llvm/lib/Analysis/DataStructure/Steensgaard.cpp:1.42 llvm/lib/Analysis/DataStructure/Steensgaard.cpp:1.43
--- llvm/lib/Analysis/DataStructure/Steensgaard.cpp:1.42 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/Steensgaard.cpp Sun Sep 19 23:45:25 2004
@@ -22,7 +22,7 @@
using namespace llvm;
namespace {
- class Steens : public Pass, public AliasAnalysis {
+ class Steens : public ModulePass, public AliasAnalysis {
DSGraph *ResultGraph;
DSGraph *GlobalsGraph; // FIXME: Eliminate globals graph stuff from DNE
public:
@@ -39,7 +39,7 @@
// run - Build up the result graph, representing the pointer graph for the
// program.
//
- bool run(Module &M);
+ bool runOnModule(Module &M);
virtual void releaseMyMemory() { delete ResultGraph; ResultGraph = 0; }
@@ -103,7 +103,7 @@
/// run - Build up the result graph, representing the pointer graph for the
/// program.
///
-bool Steens::run(Module &M) {
+bool Steens::runOnModule(Module &M) {
InitializeAliasAnalysis(this);
assert(ResultGraph == 0 && "Result graph already allocated!");
LocalDataStructures &LDS = getAnalysis<LocalDataStructures>();
Index: llvm/lib/Analysis/DataStructure/TopDownClosure.cpp
diff -u llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.69 llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.70
--- llvm/lib/Analysis/DataStructure/TopDownClosure.cpp:1.69 Wed Sep 1 17:55:35 2004
+++ llvm/lib/Analysis/DataStructure/TopDownClosure.cpp Sun Sep 19 23:45:25 2004
@@ -51,7 +51,7 @@
// run - Calculate the top down data structure graphs for each function in the
// program.
//
-bool TDDataStructures::run(Module &M) {
+bool TDDataStructures::runOnModule(Module &M) {
BUDataStructures &BU = getAnalysis<BUDataStructures>();
GlobalsGraph = new DSGraph(BU.getGlobalsGraph());
GlobalsGraph->setPrintAuxCalls();
More information about the llvm-commits
mailing list