RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-22 02:33:06 +01:00
Code Issues Projects Releases Wiki Activity

[C++11] Remove the use of LLVM_HAS_RVALUE_REFERENCES from the rest of

Browse Source 
the core LLVM libraries.

llvm-svn: 202582
This commit is contained in:
Chandler Carruth 2014-03-01 09:32:03 +00:00
parent 9a36f7b46b
commit 435d84ee45
3 changed files with 0 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -186,13 +186,11 @@ public:
/// graph remains valid for the module. It is also relatively expensive.
LazyCallGraph(const LazyCallGraph &G);
#if LLVM_HAS_RVALUE_REFERENCES
/// \brief Move constructor.
///
/// This is a deep move. It leaves G in an undefined but destroyable state.
/// Any other operation on G is likely to fail.
LazyCallGraph(LazyCallGraph &&G);
#endif
iterator begin() { return iterator(*this, EntryNodes); }
iterator end() { return iterator(*this, EntryNodes, iterator::IsAtEndT()); }
@ -236,10 +234,8 @@ private:
/// \brief Helper to copy a node from another graph into this one.
Node *copyInto(const Node &OtherN);
#if LLVM_HAS_RVALUE_REFERENCES
/// \brief Helper to move a node from another graph into this one.
Node *moveInto(Node &&OtherN);
#endif
};
/// \brief A node in the call graph.
@ -262,10 +258,8 @@ class LazyCallGraph::Node {
/// \brief Constructor used when copying a node from one graph to another.
Node(LazyCallGraph &G, const Node &OtherN);
#if LLVM_HAS_RVALUE_REFERENCES
/// \brief Constructor used when moving a node from one graph to another.
Node(LazyCallGraph &G, Node &&OtherN);
#endif
public:
typedef LazyCallGraph::iterator iterator;

2
include/llvm/IR/PassManager.h
View File

@ -106,7 +106,6 @@ public:
PreservedPassIDs.erase(*I);
}
#if LLVM_HAS_RVALUE_REFERENCES
/// \brief Intersect this set with a temporary other set in place.
///
/// This is a mutating operation on this preserved set, removing all
@ -124,7 +123,6 @@ public:
if (!Arg.PreservedPassIDs.count(*I))
PreservedPassIDs.erase(*I);
}
#endif
/// \brief Query whether a pass is marked as preserved by this set.
template <typename PassT> bool preserved() const {

6
lib/Analysis/LazyCallGraph.cpp
View File

@ -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;