diff options
author | Chris Lattner <sabre@nondot.org> | 2004-09-20 04:35:27 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2004-09-20 04:35:27 +0000 |
commit | d55c9bf318ceb5c1f3a0a31b2e5e2bf1ad5db2b7 (patch) | |
tree | f7af08497f2241bd9a73741eb693c203ae9f0961 | |
parent | d232438f542fa8b2e6a0fa237ac39d6475eb153f (diff) |
Adjust to API changes
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@16429 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r-- | include/llvm/Analysis/DataStructure/EquivClassGraphs.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/include/llvm/Analysis/DataStructure/EquivClassGraphs.h b/include/llvm/Analysis/DataStructure/EquivClassGraphs.h index 79e2a51a95..81b9ac8a81 100644 --- a/include/llvm/Analysis/DataStructure/EquivClassGraphs.h +++ b/include/llvm/Analysis/DataStructure/EquivClassGraphs.h @@ -46,7 +46,7 @@ namespace PA { /// DS graph for all functions in an equivalence class. After this merging, /// graphs are inlined bottom-up on the SCCs of the final (CBU) call graph. /// - struct EquivClassGraphs : public Pass { + struct EquivClassGraphs : public ModulePass { CompleteBUDataStructures *CBU; // FoldedGraphsMap, one graph for each function @@ -69,7 +69,7 @@ namespace PA { /// EquivClassGraphs - Computes the equivalence classes and then the /// folded DS graphs for each class. /// - virtual bool run(Module &M) { computeFoldedGraphs(M); return true; } + virtual bool runOnModule(Module &M) { computeFoldedGraphs(M); return true; } /// getCBUDataStructures - Get the CompleteBUDataStructures object /// |