6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-08-03 15:26:18 +00: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.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@202582 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chandler Carruth
2014-03-01 09:32:03 +00:00
parent 9314308db1
commit bc1bddb4c6
3 changed files with 0 additions and 14 deletions
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;