mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-08-05 13:26:55 +00:00
[C++11] Remove the use of LLVM_HAS_RVALUE_REFERENCES from the rest of
the core LLVM libraries. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@202582 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -83,7 +83,6 @@ LazyCallGraph::Node::Node(LazyCallGraph &G, const Node &OtherN)
|
||||
Callees.push_back(G.copyInto(*OI->get<Node *>()));
|
||||
}
|
||||
|
||||
#if LLVM_HAS_RVALUE_REFERENCES
|
||||
LazyCallGraph::Node::Node(LazyCallGraph &G, Node &&OtherN)
|
||||
: G(G), F(OtherN.F), Callees(std::move(OtherN.Callees)),
|
||||
CalleeSet(std::move(OtherN.CalleeSet)) {
|
||||
@@ -94,7 +93,6 @@ LazyCallGraph::Node::Node(LazyCallGraph &G, Node &&OtherN)
|
||||
if (Node *ChildN = CI->dyn_cast<Node *>())
|
||||
*CI = G.moveInto(std::move(*ChildN));
|
||||
}
|
||||
#endif
|
||||
|
||||
LazyCallGraph::LazyCallGraph(Module &M) : M(M) {
|
||||
for (Module::iterator FI = M.begin(), FE = M.end(); FI != FE; ++FI)
|
||||
@@ -125,7 +123,6 @@ LazyCallGraph::LazyCallGraph(const LazyCallGraph &G)
|
||||
EntryNodes.push_back(copyInto(*EI->get<Node *>()));
|
||||
}
|
||||
|
||||
#if LLVM_HAS_RVALUE_REFERENCES
|
||||
// FIXME: This would be crazy simpler if BumpPtrAllocator were movable without
|
||||
// invalidating any of the allocated memory. We should make that be the case at
|
||||
// some point and delete this.
|
||||
@@ -141,7 +138,6 @@ LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)
|
||||
if (Node *EntryN = EI->dyn_cast<Node *>())
|
||||
*EI = moveInto(std::move(*EntryN));
|
||||
}
|
||||
#endif
|
||||
|
||||
LazyCallGraph::Node *LazyCallGraph::insertInto(Function &F, Node *&MappedN) {
|
||||
return new (MappedN = BPA.Allocate()) Node(*this, F);
|
||||
@@ -155,7 +151,6 @@ LazyCallGraph::Node *LazyCallGraph::copyInto(const Node &OtherN) {
|
||||
return new (N = BPA.Allocate()) Node(*this, OtherN);
|
||||
}
|
||||
|
||||
#if LLVM_HAS_RVALUE_REFERENCES
|
||||
LazyCallGraph::Node *LazyCallGraph::moveInto(Node &&OtherN) {
|
||||
Node *&N = NodeMap[&OtherN.F];
|
||||
if (N)
|
||||
@@ -163,7 +158,6 @@ LazyCallGraph::Node *LazyCallGraph::moveInto(Node &&OtherN) {
|
||||
|
||||
return new (N = BPA.Allocate()) Node(*this, std::move(OtherN));
|
||||
}
|
||||
#endif
|
||||
|
||||
char LazyCallGraphAnalysis::PassID;
|
||||
|
||||
|
Reference in New Issue
Block a user