[LCG] Remove the Module reference member which we weren't using for

anything and doesn't make sense if assigning.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@206449 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/include/llvm/Analysis/LazyCallGraph.h b/include/llvm/Analysis/LazyCallGraph.h
index d5785e740aebc54915bf663e54f4ad198990cb83..0215cfc11c461948b7b6f1df558a8f90211565b5 100644 (file)
--- a/include/llvm/Analysis/LazyCallGraph.h
+++ b/include/llvm/Analysis/LazyCallGraph.h
@@ -209,8 +209,6 @@ public:
   }
 
 private:
-  Module &M;
-
   /// \brief Allocator that holds all the call graph nodes.
   SpecificBumpPtrAllocator<Node> BPA;
 

diff --git a/lib/Analysis/LazyCallGraph.cpp b/lib/Analysis/LazyCallGraph.cpp
index ea213f27acbb413462eba9b3cbf24fef72180436..17d7d894ce499e3f0eaf3fcf2da0159ca130f3ce 100644 (file)
--- a/lib/Analysis/LazyCallGraph.cpp
+++ b/lib/Analysis/LazyCallGraph.cpp
@@ -86,7 +86,7 @@ LazyCallGraph::Node::Node(LazyCallGraph &G, Node &&OtherN)
       Callee = G.moveInto(std::move(*ChildN));
 }
 
-LazyCallGraph::LazyCallGraph(Module &M) : M(M) {
+LazyCallGraph::LazyCallGraph(Module &M) {
   for (Function &F : M)
     if (!F.isDeclaration() && !F.hasLocalLinkage())
       if (EntryNodeSet.insert(&F))
@@ -104,7 +104,7 @@ LazyCallGraph::LazyCallGraph(Module &M) : M(M) {
 }
 
 LazyCallGraph::LazyCallGraph(const LazyCallGraph &G)
-    : M(G.M), EntryNodeSet(G.EntryNodeSet) {
+    : EntryNodeSet(G.EntryNodeSet) {
   EntryNodes.reserve(G.EntryNodes.size());
   for (const auto &EntryNode : G.EntryNodes)
     if (Function *Callee = EntryNode.dyn_cast<Function *>())
@@ -117,7 +117,7 @@ LazyCallGraph::LazyCallGraph(const LazyCallGraph &G)
 // invalidating any of the allocated memory. We should make that be the case at
 // some point and delete this.
 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)
-    : M(G.M), EntryNodes(std::move(G.EntryNodes)),
+    : EntryNodes(std::move(G.EntryNodes)),
       EntryNodeSet(std::move(G.EntryNodeSet)) {
   // Loop over our EntryNodes. They've been moved from another graph, so we
   // need to move the Node*s to live under our bump ptr allocator. We can just