[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

1 files changed, 0 insertions, 6 deletions

diff --git a/include/llvm/Analysis/LazyCallGraph.h b/include/llvm/Analysis/LazyCallGraph.h
index 82dea95e2a..cf686807b8 100644
--- a/include/llvm/Analysis/LazyCallGraph.h
+++ b/include/llvm/Analysis/LazyCallGraph.h
@@ -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;