6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-28 03:25:23 +00:00
Code Issues Projects Releases Wiki Activity

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

Browse Source 
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
This commit is contained in:
Chandler Carruth
2014-04-17 07:22:19 +00:00
parent d7eaf4f325
commit 40f67f5764
2 changed files with 3 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
include/llvm/Analysis/LazyCallGraph.h
View File

@@ -209,8 +209,6 @@ public:
} }
private: private:
Module &M;
/// \brief Allocator that holds all the call graph nodes. /// \brief Allocator that holds all the call graph nodes.
SpecificBumpPtrAllocator<Node> BPA; SpecificBumpPtrAllocator<Node> BPA;

6
lib/Analysis/LazyCallGraph.cpp
View File

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